Want to see something cooler?
I’ve been down this number-grid rabbit hole for years.
Build a 100 × 100 grid.
Start with column 1 as:
1
2
3
…
100
Then generate each next value using a Fibonacci-like rule:
next = current previous
But here’s the twist:
Before carrying the value forward, compress it with splitwise mod-10 digit math.
So:
13 → 1 3 = 4
22 → 2 2 = 4
100 → 0
108 → 0 8 = 8
In cleaner form:
Let each row start with:
a₁ = n
a₂ = n n
Then:
aₖ₊₁ = S₁₀(aₖ aₖ₋₁)
where S₁₀(x) means:
take the last two digits of x, split them, add them, and reduce the result into a base-10 digit cycle.
Examples:
1, 2, 3, 5, 8, 13 → 4, 7, 11 → 2, 3, 5, 8, 13 → 4…
So the visible loop becomes:
2, 3, 5, 8, 13, 4, 7, 11, 2, 3, 5…
And 100 collapses into the zero sink:
100 → 0 → 0 → 0…
What’s interesting is not just that it repeats.
It’s that when you scale this across a 100 × 100 grid, the whole field starts producing stable repeating paths, sinks, loops, and residue-like structures from a very simple local rule.
So where your prime-gap machine maps primes through modular states, this grid maps number growth through splitwise compression.
Different object, same kind of question:
Digital DNA, cellular automata, compression, dcre communication protocols and so much more
Base grid
snazzy-pithivier-1643cd.netl…