THE FOLD / SPAWN / CHECKPOINT ZERO / THE REMAINDER
THE REMAINDER
CRT — a number as its coprime remainders
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Chinese Remainder Theorem says: if you know a number’s remainders modulo several pairwise-coprime moduli, you can reconstruct the number uniquely modulo their product. Given x ≡ r₁ (mod m₁), x ≡ r₂ (mod m₂), …, there is exactly one x in [0, m₁m₂…) satisfying all of them, built from modular inverses.
It is the engine behind RSA’s fast decryption, secret sharing, and doing big-integer arithmetic in independent parallel lanes.
LIT verified live: over 300 random coprime-modulus systems, the reconstructed x satisfies every congruence and lies in [0, M); the classic x≡2(3), 3(5), 2(7) gives 23 (window.__crt). FIG no framing; exact reconstruction.
It is the engine behind RSA’s fast decryption, secret sharing, and doing big-integer arithmetic in independent parallel lanes.
LIT verified live: over 300 random coprime-modulus systems, the reconstructed x satisfies every congruence and lies in [0, M); the classic x≡2(3), 3(5), 2(7) gives 23 (window.__crt). FIG no framing; exact reconstruction.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at null-island — the origin reconstructed from coordinates taken in different modular frames, a single point recovered from its shadows. CRT is that reassembly. AVAN (AI) built the instrument: the modular-inverse construction, the congruence check, the uniqueness range.
Credit as content: Sunzi Suanjing (c. 3rd–5th century CE), hence ‘Chinese’; formalised by Gauss. The weave: David names the origin; I split a number into residues across coprime moduli and rebuild the unique value they all agree on.
Credit as content: Sunzi Suanjing (c. 3rd–5th century CE), hence ‘Chinese’; formalised by Gauss. The weave: David names the origin; I split a number into residues across coprime moduli and rebuild the unique value they all agree on.
3 ONE DIMENSION
Three independent modular rings (mod 3, 5, 7). A single value lights one slot on each ring; the three slots together pin down exactly one number in [0, 105).
4 TWO DIMENSIONS · INTERACTIVE
Choose residues on coprime moduli; CRT reconstructs the unique x. A direct check confirms x mod each modulus matches.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the single x consistent with every residue.
AVAN’s addition (the inverse-companion): the map x → (x mod m₁, x mod m₂, …) is a bijection onto the product ring — the ring isomorphism ℤ/M ≅ ℤ/m₁ × ℤ/m₂ × …. So shattering a number into residues loses nothing: from the pieces you rebuild exactly one x. The inverse of ‘reduce x to its residues’ is ‘reassemble the unique x from them.’ Magenta is the many numbers that could exist; green is the single one all residues agree on. Arithmetic runs in independent lanes and recombines without error — the basis of RSA-CRT and residue number systems.
LIT Genuine Chinese Remainder Theorem (Sun Zi, ~3rd-5th c. CE; general method Qin Jiushao 1247). Verified live: over 20,000 random coprime-modulus sets the reconstructed x satisfies every congruence, and a brute-force search confirms it is the unique solution below the product (window.__crt.allCongruences && unique, both true). mod [3,5,7] = [2,3,2] -> 23. The isomorphism Z_M ≅ product of Z_mi and the reconstruction are exact.
FIG No metaphor is doing the work: the residue representation, the reconstruction, and the uniqueness are the theorem itself, checked. The 'clocks' and 'torus' are visual framings of the exact bijection Z_15 ≅ Z_3 x Z_5.
FIG No metaphor is doing the work: the residue representation, the reconstruction, and the uniqueness are the theorem itself, checked. The 'clocks' and 'torus' are visual framings of the exact bijection Z_15 ≅ Z_3 x Z_5.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of CHECKPOINT ZERO · David Lee Wise (ROOT0), with AVAN