Part II · Interactive
Carve the odds into primes, then rebuild the even number.
Drag through 6 → 100. The numbers run down the left; on the right each is drawn as blocks with its factor check. Walk the multiples of the primes found so far — if one lands on the number it's composite and eaten; if the number falls between multiples of every prime up to √n, nothing divides it and it survives. The survivors are the primes, and the first two of them rebuild E.
Read it top to bottom. For each odd number, we walk the multiples of every prime found before it. If a multiple lands exactly on it, that prime divides it — composite, eaten. If the number falls between two multiples of every prime up to √n, nothing divides it — it's prime and survives.
two survivors rebuild 30 — the first such pair
This picture makes Goldbach feel inevitable: there are always plenty of uncarvable gold rows, and two of them line up to E. Proving “two always line up” for every even number is the part that resists — see the folded-strip write-up for exactly where and why.