Every number here is written in signed digits and laid into a grid along its anti-diagonals. The grid then splits in three, and the three parts add back to the number exactly. Everything else on this site is that one idea, drawn differently.
Write an integer in signed digits — red −1, green 0, blue +1 — and lay them along the anti-diagonals of a square grid, smallest place value first. Negating a number just recolours it. The three regions sum back to the integer exactly. And what comes out is a sphere, with an equator that decides which way it turns.
A square grid splits into three parts along its main anti-diagonal, where r + c = n − 1.
Every cell above it has a partner below, and the fold sends each to the other. Cells fill in
Hankel order — anti-diagonal by anti-diagonal, each read from the bottom-left corner upward — so
the grid is indexed the way a Hankel matrix is, constant along the diagonals the fold cares about.
A1 is reserved. It is always green, never a digit. The number’s bits begin at B1 and run in that same order, written exactly as they are — most significant first, no reordering. Whatever is left over at the end is padded green. Negating a number flips every colour and nothing else.
The map (r,c) ↦ (n−1−c, n−1−r) is the anti-transpose
J Aᵀ J. It fixes the Fold, swaps Inner with Outer, and undoes itself — which are
precisely the three defining properties of inversion in a circle.
The bit string, as written, poured into the grid from B1 onward. Blue is 1, green is 0, and the greens at the end are padding — the grid grows to the next square that fits. The brass outline marks the Fold; the dashed cell is the reserved A1.
Drag poured to lay the bits down one at a time, or press play. The regions keep their running sums as it fills, and the three always add back to the integer.
A trailing zero and a padding green land in the same cell, so 1, 2 and 4 draw identically, as do 3 and 6. Across 1…1023 that merges 379 integers into 644 distinct grids. It is a picture of the bit pattern, not an address.
Every other view on this site runs one way: a number goes in, a picture comes out. This one runs backwards. Click a cell to cycle it green → blue → red and read the value off as you go. You learn a convention fastest by trying to break it.
Nine pages, and the navigation bar gives no hint which comes first. This is the order they were meant to be read in — each one assumes only what the ones above it showed.
One integer, in full. Its stalk, its surreal value, the Inner / Fold / Outer split, the Fold read as a signed radius, its Hankel matrix and spectrum, and the sphere it wraps onto.
Open →All 1023 integers from −511 to 511 at once. Negatives red, positives blue, exact colour-inverses across the divider — plus the square wave that decides which way each one spins.
Open →Several integers at once, each a phasor spaced evenly round the ring and summed tip to tail. Fold is the equator, Inner reaches north, Outer south, so one integer already leaves the plane.
Open →Multiplication drawn as the rectangle it is: every cell of A against every cell of B, no carries. The rack is an ordered sequence — the product never moves, but reordering it redraws every grid.
Open →Division that refuses to round. A quotient grid, a multiplier on the boundary, and the remainder drawn as the part that did not fit — widen the grid and watch it walk home.
Open →The wub laid out like a graphing calculator: a pinned gallery of controls and composite waves, then one numbered card per integer, each paged through its facts, its waves and its helix.
Open →A card is a black body. What you type in it becomes phasors spaced evenly around it — two at 180°, three at 120° — and the bodies are packed apart on a Fibonacci lattice.
Open →base(chroma-utf): a string is a number written with Chroma UTF digits. One card per line, each holding its bodies, its polynomial and its integer — the same integers a Wub ± rack would hold.
Open →Everything below was checked by computation, not assumed. Where a guess failed, it is not listed.
grid(−k) = −grid(k), exactly, at every size.n²−n others, and is an involution — at n = 2, 3, 4, 5, 8, 12.n² exactly.Inner + Fold + Outer = k exactly — verified for
every integer from −20,000 to 20,000. The three regions carve the number, they don't summarise it.