◀ THE FOLD0ROOT.AI // WORLD II · BOSS · THE FINAL BOSS◆ .dlw.fold
THE FOLD / BOSS / THE FINAL BOSS / TWO NUMBERS THAT ARE NOT ONE

TWO NUMBERS THAT ARE NOT ONE

0.05 apart, and asserted distinct
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Two quantities in one project, 3.5850 and 3.6337 bits, derived from entirely different things and sitting 0.0487 apart. Close enough that a later build would merge them into one finding without noticing. An assertion in the test suite now forbids it.

LIT verified live. A = log₂(24) − log₂(2) = 3.5850, the labelling shortfall of an unequal partition. B = 12 − log₂(C(11,4)) = 3.6337, the bit loss of a symmetric fold. Their derivations share exactly one term — the logarithm itself. They are not the same number.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) caught the near-collision and moved it out of prose: “3.5850 and 3.6337 are NOT the same number… 0.05 apart, derived differently, unrelated quantities, and close enough to invite being merged into one finding. verify.js asserts they are distinct so a later build cannot quietly collapse them.” His scoreboard counts it as a fault found by a control.

AVAN (AI) would name the mechanism, because it is not carelessness. Two numbers that agree to one decimal place in the same document acquire a gravitational pull toward each other: the mind offers “so it’s the same effect seen twice” for free, and that reading is more satisfying than two unrelated findings. A prose caveat weakens as a document is edited. An assertion does not, and converting the observation into one is the whole move.
3 ONE DIMENSION
Two derivations that meet by accident.
4 TWO DIMENSIONS · INTERACTIVE
Zoom in until the two separate.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: two paths arriving near the same place.
AVAN’s addition (the inverse-companion): the forward reading is “assert that they are distinct.” The inverse is that an assertion of distinctness is unfalsifiable in the direction that matters. It will hold forever, because two differently-derived constants will never become equal — so the test can never fail and never earns its keep. What it actually does is leave a note in executable form, read by whoever next touches the numbers. Read backwards, it is documentation that cannot be edited away, which is worth having and is not the same as a check.
LIT A = log2(24) - log2(2) = 3.5850, the labelling shortfall of an unequal partition, while B = 12 - log2(C(11,4)) = 3.6337, the bit loss of a symmetric fold; their derivations share exactly one term - the logarithm itself - and they sit 0.0487 apart, so they are not the same number

FIG David caught the near-collision and moved it out of prose: '3.5850 and 3.6337 are NOT the same number... 0.05 apart, derived differently, unrelated quantities, and close enough to invite being merged into one finding. verify.js asserts they are distinct so a later build cannot quietly collapse them.' AVAN names the mechanism, because it is not carelessness: two numbers agreeing to one decimal place in the same document acquire a pull toward each other, since the mind offers 'so it is the same effect seen twice' for free and that reading is more satisfying than two unrelated findings. A prose caveat weakens as a document is edited; an assertion does not.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE FINAL BOSS · David Lee Wise (ROOT0), with AVAN