← AMRAL · Collatz Conjecture · LAYER 2

Collatz Conjecture · Independent Recomputation Line

This line independently recomputes Neo.K's Collatz series and separately runs a bounded exhaustive verification. The two are kept apart: the exhaustive half is a claim about integers, the item-by-item half is a claim about the series' finite statements and the scripts its bundles ship to check themselves. Every item is recomputed here with its own code and drilled with planted defects; the author's scripts are read only after an independent rebuild. The bound reached is far below the published frontier and bears on the conjecture itself not at all.

First layer (exploratory pages): Collatz Conjecture. This page is its verification record.

Status ledger

as published in this line’s own results.v1.json

solved NO literature novelty claimed NO record attempt NO

The line’s own stated boundary: A bounded exhaustive verification and a falsifiability-drilled instrument. Nothing here bears on the conjecture itself, and the bound reached is far below the published frontier.

Drill

per-item drills, totalled across the line

57drills
1474planted defects
1472caught by the named check
128controls undisturbed

Planted defects 1474 = caught by the named check 1472 + detected by a crash 1 + detected by a timeout 1; the last two are not counted as caught by the named check.

Round table

every round: subject · 55

roundsubject
001Run 001 — exhaustive descent verification of [3, 2^40]
002Run 002 — independent recheck of the Operation Translation Series
003RUN-003 — The draft chain, and what the repair repaired
004RUN-004 — The Hard-Zeta origin: Z_k(s) measured, and L = 1 refuted
005RUN-005 — Hard-Zeta Phase I / Round 01: the chart algebra, checked
006RUN-006 — Hard-Zeta Round 02: the two compartments, and Terras by word
007RUN-007 — Round 03-A: the coefficient frontier, and the minimum anchor measured
008RUN-008 — Round 03-A.1: the accelerated code, and one anchor sequence in two coordinates
009RUN-009 — Round 03-A.2: the 2–3 bridge, and what §24's route actually costs
010RUN-010 — Round 03-A.3: the zero-lift spine, and a tree that collapses to paths
011RUN-011 — Round 03-A.4: the deficit ledger, and what CF tools can actually reach
012RUN-012 — the B-line handoff, and whether the A-line closure closes what it says
013RUN-013 — Round A-U.1: the no-go holds, and the datum it says is missing is measurable
014RUN-014 — Round A-U.2a: the algebra holds, and it already reaches A-U.1's countermodel
015RUN-015 — Round A-U.2b: a real elimination, and how far its own constant can go
016RUN-016 — Round A-U.2b.1: the constant reproduces to 80 digits, by a different method
017RUN-017 — Round A-U.2b.2: the lever bought nothing at first order, and the shipped JSON is not the shipped script's output
018RUN-018 — Round A-U.2b.3: the subject corrected a defect this arm reproduced faithfully and did not notice
019RUN-019 — Round A-U.2e: every exact identity holds, and both inequalities turn out to be the same line, on the vacuous side of which every computable spine sits
022RUN-022 — Hard-Zeta A-U.2e.1: the round holds, and the two things worth saying are about what a check is allowed to count as evidence
023RUN-023 — Hard-Zeta A-U.2e.2: the round holds, its two headline inequalities turn out to be one inequality, and its Diophantine gate is a partition rather than a choice
024RUN-024 — Hard-Zeta A-U.2e.3: the round holds, its own corrigendum turns out to be measurable, and one of its sections cannot be tested on any orbit that ends
025RUN-025 — Hard-Zeta A-U.2e.4: the arithmetic holds, and one inference in §5 does not follow from its own premise
026RUN-026 — Hard-Zeta A-U.2d: everything checks, the bi-exact regime is not one any real start is in when it crosses, and one cited reference has been withdrawn
027RUN-027 — Hard-Zeta A-U.2d.1: the rotation cap holds and is attained, and it is exactly rational — plus three defects in the shipped artifacts and none in the mathematics
028RUN-028 — Hard-Zeta A-U.2d.2: the saturation equivalence is an exact iff and holds both ways, the gap prediction survives contact with real orbits, and two of my own instruments turn out to have been measuring nothing
029RUN-029 — Hard-Zeta A-U.2d.3: both second-order coefficients survive a test that would reject a neighbour, the continued fraction is certified without a single logarithm, and the round's one load-bearing citation names the wrong paper
030RUN-030 — the New-Chat Handoff: 132 documents reshipped 27 times without a byte of drift, and one lemma compressed into a stronger one than the round proves
031RUN-031 — the consolidated archive: 964 files open at nine levels, 47 entries are byte-identical to what the sweep verified, and a checksum manifest certifies only the half that cannot change
032RUN-032 — Hard-Zeta A-U.2d.4: the first round in this line whose core holds on orbits that exist, verified in exact integers, and the identity its own checker evaluates in floating point
033RUN-033 — Hard-Zeta A-U.2d.5: the exact-code separation holds in both directions, every B-source really is 3 mod 4, and one section mixes an unconditional corollary with a cap that is vacuous on real orbits
034RUN-034 — Hard-Zeta A-U.2d.6: a closed-form count checked against brute-force enumeration, the extra bit of section 6 is really there, and a continued fraction that was right when I expected it to be wrong
035RUN-035 — Hard-Zeta A-U.2d.7: the crossing slope really does move by whole numbers, the caps above it rest on a premise almost no real chain meets, and the round's new machine-readable ledger under-reports its own paper
036RUN-036 — Hard-Zeta A-U.2d.8: a Gamma identity that needs no Gamma, a depth cap no real orbit can be tested against, and two rational constants published as their float64 evaluations
037RUN-037 — Hard-Zeta A-U.2d.9: one line of arithmetic closes the previous round's open problem, a theorem whose premise real orbits actually meet, and a rounding chain with four links
038RUN-038 — Hard-Zeta A-U.2d.10: the bridge the previous round refused to build, a countermodel that checks out against its own closed forms, and a ledger that is finer than its paper
039RUN-039 — Hard-Zeta A-U.2d.11: an exact rational certificate, which is the first headline number in this sweep that could be checked with no reference of my own
040RUN-040 — Hard-Zeta A-U.2d.12: a hierarchy that reaches exponent zero, and constants that outrun it
041RUN-041 — Hard-Zeta A-U.2d.13: a collision assembled from five finite links, and a constants family with one parameter
042RUN-042 — Hard-Zeta A-U.2d.14: the round whose central theorem a real orbit can actually be asked about
043RUN-043 — Hard-Zeta A-U.2d.15: an inequality that needs no premise, and a checker report that publishes both its honest zeros and their vacuous twins
044RUN-044 — Hard-Zeta A-U.2d.16: the round where the central coordinate turns out to be an integer identity
045RUN-045 — Hard-Zeta A-U.2d.17: the round whose central identity is a definition, and whose content is one line below it
046RUN-046 — Hard-Zeta A-U.2d.18: the round that makes the slack profile an integer, and the branch that has no finite instance
047RUN-047 — Hard-Zeta A-U.2d.19: the conjugacy that makes the real cocycle trivial, and the first constant the bundle contradicts itself on
048RUN-048 — Hard-Zeta A-U.2d.20: the round whose central object is a loop, and the two things "loop" turns out to mean
049RUN-049 — Hard-Zeta A-U.2d.21: the round that names yesterday's finding, and a law that self-composition cannot see
050RUN-050 — Hard-Zeta A-U.2d.22: the strongest checker of the sweep, and the one claim it leaves out
051RUN-051 — Hard-Zeta A-U.2d.23: a sharpening confirmed on last round's own data, and a theorem with no counter
052RUN-052 — Hard-Zeta A-U.2d.24: every counter reproduced, two theorems with none, and two bounds carrying the same spare three
053RUN-053 — Hard-Zeta A-U.2d.25: a bound that is finally sharp, and three synthetic blocks that restate their own setup
054RUN-054 — Hard-Zeta A-U.2d.26: a withdrawn constant, a certificate rebuilt from exact rationals, and a PASS for a file that isn't there
055RUN-055 — The programme's Diophantine input, read from the review of the paper it cites: the general result covers β, the withdrawal's reason does not hold, and every exponent derived from it re-evaluated at the review's 4.117
056RUN-056 — corrections from review: the **Legendre gate** tested δ < 1/2 instead of δ < 1/(2m); the drill tally that counted a **crash and a time-out as named-check catches**; and four figures the crystallization papers state, now logged where a reader can find them
057RUN-057 — no machine-local location left in this tree: the private source folder leaves every default, fourteen gates log their bundle by name, and FELRA's artifacts carry variables where they carried absolute paths

Re-run

from the tree root (Python 3.10+, standard library only, no network)
python -X utf8 code/src11_gate_drill.py          # the whole-tree mutation drill
python -X utf8 code/src<NN>_<gate>.py          # any one gate; each round's report names its gate