64 ⰋⰐ ⰅⰂⰅⰓⰉ ⰃⰓⰑⰖⰒⰋⰐⰃ

64 = 2⁶, ⰀⰐⰄ ⰕⰘⰅ ⰄⰋⰂⰋⰔⰑⰓⰔ ⰑⰗ 6 ⰃⰋⰂⰅ ⰕⰘⰅ ⰑⰐⰎⰉ ⰗⰑⰖⰓ ⰃⰓⰑⰖⰒⰋⰐⰃⰔ: ⰔⰋⰘ ⰁⰋⰕⰔ, ⰕⰘⰓⰅⰅ ⰁⰀⰔⰅ-4 ⰄⰋⰃⰋⰕⰔ (ⰜⰑⰄⰑⰐ/ⰒⰀⰖⰎⰋ/ⰓⰃⰁ), ⰕⰂⰑ ⰕⰓⰋⰃⰓⰀⰏⰔ (8²), ⰑⰐⰅ ⰁⰀⰔⰅ-64 ⰂⰑⰓⰄ. ⰕⰘⰅ ⰔⰀⰏⰅ ⰑⰁⰉⰅⰜⰕ, ⰗⰑⰖⰓ ⰂⰀⰉⰔ.

proof · 64 in every grouping of 6 bits · 2⁶ = 4³ = 8²

64 = 2⁶ has one binary exponent, 6, whose divisors {1,2,3,6} give the only four ways to group its 6 bits into 6/d digits of base 2^d, each totalling exactly 64: six base-2 lines (the hexagram), three base-4 digits (the codon, the 3-qubit Pauli string, the RGB channels — 4³), two base-8 digits (the upper and lower trigram — the I Ching's own 8×8 construction, 8²), and one base-64 word (2×32, the double-torus command word). Because 6 = 2·3, 64 is a trinity of dualities (4³) and equally a duality of trinities (8²) — the genus-2 double torus's own 2×3. The same number 0–63 is all four groupings at once.

checks — recomputed live in your browser

• ✓ All Sixty Four
• ✓ Six Is Duality Times Trinity
• ✓ Holds

✓ all checks hold · recompute recipe — a pure function of the model seed, run client-side with zero tokens; the same seed always folds to the content-address 9a6e18da-e0f1-87f9-87f2-473722f2a138. Recompute and you get the same address — that determinism is the proof.

Pure arithmetic — the factor lattice of 64 read as the divisors of its binary exponent 6, each grouping an independently-attested system (codon, Pauli basis, I Ching trigrams/hexagrams, the project's word vocabulary). NOT a claim the systems are causally linked or interchangeable; they share the combinatorics 2⁶ = 4³ = 8² = 64, nothing more. sealCube already names the factors; this computes them as groupings of one object.