to be clear, i absolutely have not figured it out yet. to me it's quite clear there are two flaws that have stalled progress:
gauss just asserted uniqueness of prime factorization despite multiplication of integers being an inherently commutative operation. he then decided 1 doesn't count. that's the single thing we need!!! yes 1 divides everything arbitrarily often!!!! euclid didn't have a problem with that!!!
i don't think goldbach's conjecture is true (or at least i don't care). the even integers already have this beautiful ring structure!!!! stop fucking up my beautiful numbers doing their job perfectly!!!!
the primes without 1 and 2 are their own little thing! they all start from one spot then have these cute little directed edges into composites. but each multiplication operation forms a hypergraph edge.
and i think to model it correctly we need a distinct hypergraph edge for every distinct combination of 3+ prime factors to their products. so an edge for 32 => 9, but a separate edge for 33 => 27. we can calculate transitivity later, i just want to model this!
then add infinite edges from 22 => 4, 23 => 8, etc, and keep those edges separate. then add a copy of every 3+ compositional edge for each of the infinite powers of 2 added as a new factor.
then add a loop edge 1 => 1, then 1 x n => n forall n