Math Mapgenerated 2026-10-25 · a354234
PUBLIC BUILD

Lab

The open questions and the work that tests them. Cases are the questions; runs are numerical tests with the prediction written before the result; panels are Differential session records. Probes are frictions recorded before they are sharp; notes are claims and theorems.

33 cases · 122 runs · 9 panels · 14 exemplars · 49 probes · 40 notes

Indexes are under Reference: concepts, tags, glossary, A–Z of ids.

Boards

programmes, the running board, waiting, frontier, arcs, audits, Grokking

Programmes4 programmes: PG-01 · PG-02 · PG-03 · PG-04
Running1 sealed run on the board
Waitingwhat waits on a ruling, a draw or a reading
Frontierwhere each thread stops
Arcs3 arcs: 049 · 037 · 112 · print variants 049 · 037 · 112
Audits11 audits: A-001 · A-002 · A-003 · A-004 · A-005 · A-006 · A-007 · A-008 · A-009 · A-010 · A-011

Cases

33 total · 24 open · 4 running · 5 settled

Open24
CASE-01Is there a fractional quantum Hall liquid on a thin Sierpinski carpet?existence
CASE-02Which "3" is the number of particle families?identity
CASE-03Is the global form of the Standard Model gauge group a fact or a convention?identity
CASE-04Why does depth fail to be preserved under the local Langlands correspondence for wildly ramified groups, and what is the right definition of depth?identity
CASE-06Why does the weak force act only on left-handed particles?identity
CASE-08What geometry supplies the polarization?existence
CASE-09Is a spectral symmetry class literally a reality type?identity
CASE-10Is a continuous Frobenius structure or artifact?identity
CASE-11Does the Chowla–Selberg formula break the sum-rule criterion?identity
CASE-12Do the short lists have one generator or two?identity
CASE-14Is "every invariant here is linear" a real limitation or a definitional one?identity
CASE-16Is Mostow rigidity an instance of the trace identity or independent of it?identity
CASE-21What sets the magnitude of the annular Reynolds stress relative to the collapse requirement?quantity
CASE-22What conserved quantity does the signature flip at |a| = 2√q saturate?existence
CASE-23When does a spectral gap control mixing?behaviour
CASE-25A one-block polynomial ranks eight lattices' percolation exponents exactly and misses every value — what sets the size of the miss?quantity
CASE-26A slowly converging sequence of block estimates ranks exponents exactly at every block size — why does the order survive when the values do not?quantity
CASE-27Stacking two carpets averages their exponents when their cut classes match and falls below the average when they do not — why?quantity
CASE-28The skewness of the crossing threshold turns back on some carpets between L = 729 and 6561, while the exact one-block recursion's keeps rising — where does the turn come from?quantity
CASE-29Carpets that share a block polynomial share its rate but not always their threshold — what in the pattern, invisible to the polynomial, sets the threshold?quantity
CASE-30Every lowest-cut bisection found on a self-similar graph carries exactly the same number of independently flippable vertices — what fixes that number, and is there a ground state without it?quantity
CASE-31The crossing threshold is the weakest link of the strongest wall — does the number of near-strongest walls set the lean of the threshold pile, and its turn with size?quantity
CASE-32Does the sign of the Li–Yorke slack on the core separate period three exactly, and why?identity
CASE-33Why is M₁₂ the one happy-family group read both as a piece of the Golay object and as a centraliser factor in the Monster, and is that one fact or two?identity
Running4
CASE-05Is "time is a property of the vacuum" defensible?identity
CASE-07Completion and algebraic closure don't commute at p; is there a number that measures it?existence
CASE-17Is the walk-run transition number kinematic or biological?quantity
CASE-18Is there a space on which a turbulent transfer operator is quasi-compact?existence
Settled5
CASE-13Is reversibility load-bearing, or incidental?identity
CASE-15If gauge symmetry is redundancy, why does it have physical consequences?identity
CASE-19Is a critical exponent a derived quantity or a measured one?identity
CASE-20Is "compute one quantity two ways" a single theorem or several?identity
CASE-24Does an operator's spectrum determine it, and what repairs the failure?identity

Runs

110 total · 4 held · 1 open · 35 falsified · 70 settled · +12 retired

Held4
run 017Is the walk-run transition Froude number the kinematic ceiling, or a biological constant?CASE-17

Blocked onliterature assembly — per species at the transition, speed, leg length under one consistent definition, and stride length

run 026Does the triple-correlation bias in the Liouville sums survive to 10⁹, and does per-scale information stay flat?

Blocked ona programme that claims it — held by the owner's decision, 2026-10-07, after the console's first alarm (RUN.AGE, 24 days open with no draw); no programme owns the Liouville thread, and a run nobody is chasing is not drawn

run 027Does the swirl component grow without bound in the axisymmetric run, or saturate?CASE-21

Blocked ona prediction and a falsifier, and the dt defect below — recompute dt inside the loop

run 028Does "completion and algebraic closure don't commute at p" have a rate?CASE-07

Blocked onthe sequence-independence clause — the same element through a second approximating sequence (CASE-07's follow-up); until then the run is held, not scored

Open1
run 138(T) On fresh full-side draws of H8 at L = 6561, does the 3/2 tooth (k = 3) survive every member of the declared set of backgrounds when both steps are modelled? (D1) Does the top-end step move with the system, into the moving window U6? (D2) If it moves, is its shift factor between L = 2187 and L = 6561 nearer the comb's period P than 8? (D3) Is there, beside the moving step, a second step that stays at a fixed burst mass near 8^5?
Falsified35
run 024Does any non-reversible feature kill product form, as the Markov audit claims?CASE-13

PredictionBlocking, finite buffers and state-dependent service each destroy product form

Falsifiera non-reversible feature that leaves the product-form error at baseline

VerdictHALF WRONG - state-dependent service kills it, blocking does not

Confidence0.75

run 029Is the quantum Mixmaster (Artin) billiard spectrum Poisson, despite the classical dynamics being chaotic?

Predictionthe level-spacing ratio ⟨r⟩ ≈ 0.39 (Poisson) for odd Maass eigenvalues with R in [9, 150]

Falsifier⟨r⟩ near 0.53 (GOE) — the arithmetic-quantum-chaos anomaly does not hold on this object, and the spectrum is that of a generic chaotic billiard after all

VerdictFALSIFIED — ⟨r⟩ = 0.527 ± 0.033 on the 72 odd level-1 levels in R ∈ [9, 49.98]: 4.3σ from Poisson 0.38629 and within 1σ of GOE 0.5307 (large-N) and 0.53590 (3×3 surmise). The falsifier fired. Completeness 72/72 against LMFDB, none missed or mislocated, Weyl predicting 72.7. Not an artefact of the method: LMFDB's own levels over the same window give the same 0.527, and the estimator reproduces both ensemble controls. SCOPE, not a hedge on the token: the arithmetic Poisson anomaly is an asymptotic claim, and the sealed prediction names R ∈ [9, 150] while this scores R ∈ [9, 49.98] — the bottom third of the sealed range, ~72 of ~818 odd levels (8.9%), where the Weyl log term is 43% of the count against 15% at R = 150. A GOE-like bottom window does not settle the anomaly at large R.

run 032Run 030 found two metastable families of near-minimal cuts on Cay(G/St(4)) (≤ 224 edges from METIS, 270 from disorder). N-026 correction 3 says the quotient is a path of 16 fibres and guesses the families differ in how they thread through a fibre. Do they?

PredictionL_min ≥ 0.60 and Δpos ≤ 1 — both families are crosswise cuts, localised at the same place on the Schreier path, and differ in how they partition the few fibres they thread

FalsifierL_min ≤ 0.35 (a family is spread along the path — lengthwise — and the fibre picture is wrong) or Δpos ≥ 3 (the families sit at different places on the path — positional metastability, not fibre-internal)

VerdictFALSIFIED on both clauses — L_min = 0.128, Δpos = 10. Neither family is crosswise. All six run-030 partitions (176–270 edges) cut a-edges only — zero b/c/d edges, zero within-fibre edges — spread evenly over all eight a-steps of the Schreier path (18–46 per step), and every one of the 16 fibres is split 47–53% / 53–47%. The two families agree on only 55–67% of vertices per fibre: uncorrelated partitions. The cut is lengthwise, orthogonal to the path, invisible to the Schreier projection. What it is: a balanced ±1 labelling constant on the ⟨b,c,d⟩-cosets (each a K₄ of four elements) that minimises the a-edges it frustrates — i.e. a minimum bisection of the coset graph (N/4 vertices, 4-regular via a-edges). Bisecting that graph directly with METIS gives 176 at level 4, below every cut found on the full graph (run 030's 198 becomes ≤ 176; c₄ = 0.69 of a fibre). The coset graph has normalised gap 0.076 against 0.0128 for the full graph and bisects at 8.6% of its edges against 15% for a random 4-regular graph of the same size: a sparse, frustrated-under-balance graph. That is what explains the glassy walls, and it is a known landscape — minimum bisection of a sparse graph is a spin glass (Fu–Anderson 1986): exponentially many near-optimal bisections, mutually uncorrelated, separated by extensive barriers. Run 030's families 25% apart in cut, uncorrelated, unreachable from each other at T = 1, with the wall's energy drifting for 10⁵ sweeps, are that landscape seen through the Ising model. The fibre-threading guess is withdrawn.

run 035Expanders are globally synchronising (the Kuramoto flow has no stable equilibrium but synchrony — no twisted states, no U(1) loop-closing sectors). The intermediate-growth host is spectrally a path, far outside that theorem. Does it synchronise anyway, from every random start?

Predictionf ∈ [0, 0.01] — every start synchronises: the Schreier path carries no winding, and every cycle of the graph is a relator, short relative to its embedding, so no twisted state is stable

Falsifierf ≥ 0.05 — the host has stable non-synchronised equilibria, U(1) sectors that a lattice has and an expander lacks

VerdictFALSIFIED — f = 1.000: all 200 random starts on Cay(G/St(4)) end in non-synchronised equilibria (199 converged to max|θ̇| < 10⁻⁶, one still moving at t = 2000), with r from 0.02 to 0.9 (histogram over [0,.2,.4,.6,.8,.9,.99,.999]: 61, 94, 34, 10, 0, 1, 0, 0). Controls: 64×64 torus 200/200 non-synchronised (validation passed), random 4-regular graph on 4096 vertices 0/200, and the host's own ⟨b,c,d⟩-coset graph (N = 1024) 2/200. Anatomy of twelve host equilibria: smooth states — no edge with |Δθ| > π/2 on any generator — 230–360 J above synchrony, carrying integer windings on the group's relators: ±1 around 0.4–2.3% of the (ad)⁴ octagons, ±1 around (ac)⁸ sixteen-cycles, ±1 and ±2 around (ab)¹⁶ thirty-two-cycles; never around the bcd triangles. The sealed reasoning had the sign backwards: "every cycle is a relator, short relative to its embedding" is exactly why they are stable — a winding-1 twisted state on an 8-cycle has phase step π/4, well inside stability, and the host's path-like spectrum (gap ~1/log²N) supplies no mixing to unwind it. The coset graph, which contracts d-steps and turns the octagon into a 4-cycle (step π/2, marginal), synchronises. The host has both the loops and the slowness that N-025's new clause requires, so it has U(1) sectors — local ones, on relators, a vortex glass rather than a global winding — like a torus and unlike an expander.

run 038At level 4 the sign of the 176-cut's projection onto the λ₂ irreducible (the sibling-odd representation, dimension 8) is a balanced cut of exactly 192 = (3/4)·256, and the bands up to dimension 72 reproduce 176, so 11/16 = 3/4 − 1/16. Is that an identity — does the same rounding at level 5 give (3/4)·131,072 exactly — or a small-level accident, like N/log N and like run 031's fibre count?

Prediction(verbatim from N-028, dated 2026-09-27, before the level-5 eigenvectors were computed) the sign-rounding of the 90,112 partition's projection onto its 16-dimensional λ₂ irrep is a balanced cut of 98,304 = (3/4)·131,072, agreeing with the minimum on ≈ 99% of cosets, and 90,112 = 98,304 − 8,192 is the same 3/4 − 1/16

Falsifiernot written separately in N-028 — the prediction is an exact constant, so any other cut size falsifies it. The "≈ 99%" clause is an open constant and would not pass the seal validator; it is recorded as an observation, not scored.

VerdictFALSIFIED as an identity. The λ₂ eigenspace has dimension 16 with eigenvalue 0.0768589 (= 4 − 4cos(π/16)) to seven digits, and the next band is 0.1362967 = 4 − 4cos(π/12), the second irrep on the same ladder — the representation-theoretic picture from N-028 §1 holds exactly at level 5. But the sign-rounded cut is 98,288 (98,284 at tolerance 1e-6), sixteen edges short of 98,304; the 66 cosets whose projection lies within 1e-5 of zero are the only ambiguity, and flipping all of them together in either direction gives 98,302 — two edges short, and only by resolving every tie the same way. The rounding is balanced exactly (Σ sign = 0 without rebalancing, at both tolerances), which is a structural hit. Agreement with the minimum is 97.3%, not ≈ 99%. So 3/4 is the leading term (0.74988 of the unit) and the bands take 0.06238 rather than 1/16 = 0.0625; the two-term identity 11/16 = 3/4 − 1/16 is a level-4 accident. The constant 11/16 itself is untouched — it is exact at both levels because it is measured. What the host has now done three times in one day: hand over a clean identity at the small level (N/log N, the fibre count of run 031, 3/4 − 1/16) that fails by a part in 10³–10⁴ at the next.

run 039At level 4 the 176 minimum bisection of the ⟨b,c,d⟩-coset graph is exactly the sign of its projection onto the lowest 73 Laplacian eigenvectors — the constant, the λ₂ = 4−4cos(π/8) irrep (multiplicity 8, share 0.697), two bands it is orthogonal to (4−4cos(π/6), multiplicity 8, and 2−√2, multiplicity 16; together +0.0002), and the 4−4cos(π/5) band (multiplicity 40, +0.189) — with agreement 1.000 and the cut 176 on the nose. Run 038 showed that the first step of this at level 5 (λ₂ alone) gives 98,288 rather than the ¾-exact 98,304. Is the level-5 minimum still the sign of its projection onto two weighted bands, and is that exact or leading-order?

Predictioncontrol passes as stated (m = 40, s ∈ [0.885, 0.887], c = 176, a = 1.000). At level 5 — m ∈ [64, 96]; the bands strictly between λ₂ and the π/10 band add at most 0.01 to the share; s at the π/10 boundary ∈ [0.84, 0.92]; c ∈ [90,112, 90,600] and a ∈ [0.995, 0.99999] — two bands still determine the minimum to leading order, and the level-4 exactness fails at level 5 the way ¾ failed in run 038

Falsifierany of — no eigenvalue within 1e-4 of 0.381966 (the π/10 band does not exist at level 5); s at the π/10 boundary ≤ 0.78 (the minimum's weight is spread beyond two bands); c ≥ 91,000 or a ≤ 0.99 (the two-band skeleton does not determine the minimum even to leading order). Exactness — c = 90,112 and a = 1.000 — misses the prediction's last clause and is scored unanticipated, not falsified — it would mean the level-4 identity survives and 038's failure is specific to the first band alone. Control failing withdraws the run.

VerdictFALSIFIED as written — the falsifier's clause "a ≤ 0.99" fires (agreement 0.97715) — with four of five prediction clauses hit and the cut exact. Control passed (level 4 reproduced). Level 5, 208 eigenvectors through the π/10 band: the band exists at 4 − 4cos(π/10) = 0.195774 with multiplicity 79 (+1 straggler at 0.1996; 80 by the doubling), inside [64, 96]; the two bands between λ₂ and π/10 — 4 − 4cos(π/12), mult 16, and 0.149230, mult 96 — add 0.0000 to the share; the share at the π/10 boundary is 0.8575 ∈ [0.84, 0.92]; and the sign of the projection is a balanced cut of exactly 90,112, the minimum, at the bottom of [90,112, 90,600]. The fired clause measured agreement with the one representative χ; 2a − 1 = 0.954 is the twin overlap of run 042 (0.953), so the rounding landed on a twin of χ — the same minimum cut, a different balanced half of the ~45,500 free spins — and the seal, written before runs 040 and 042 showed the minimum is a degenerate valley, took agreement with χ for determination of the minimum. Scored as written; the codifier's error is recorded. What the run found is stronger than what it predicted: the minimum bisection of the level-5 coset graph is the sign of its own projection onto two irreducible bands — the sibling-odd irrep (16) and the π/10 band (80) — exactly, as it was at level 4 from 73 eigenvectors. The first identity on this host to survive a level-up, and it survived in the form the level-up rule allows: exact in the cut, exact in the partition up to the free spins.

run 043Five self-similar groups on the binary tree — odometer (nucleus 3, polynomial growth), Grigorchuk (5, intermediate), IMG(z² + i) (4, intermediate), Basilica (7, exponential, amenable), Aleshin (not contracting, free, non-amenable) — measured by the instruments of runs 033–042 at matched vertex count. Does the growth class order the growth-driven numbers (expansion ratio, cut fraction, barrier fraction, synchronisation), and is the square obstruction of N-034 specific to the one group that has a Klein-four coset contraction?

PredictionRelator-driven — u(N/8)/u_random ≥ 0.5 for IMG, Basilica and Aleshin alike: no group but Grigorchuk has the square obstruction, because no other has a Klein-four subgroup to contract, and (σβ)⁴ = 1 in IMG yields 8-cycles, not squares. Growth-driven, on the Cayley graphs — expansion ratio ρ_Φ: IMG ∈ [0.25, 0.60], Basilica ∈ [0.40, 0.90], Aleshin ∈ [0.85, 1.05], ordered IMG < Basilica < Aleshin with Grigorchuk's 0.374 at or below Basilica; cut-fraction ratio: IMG ≤ 0.50, Basilica ∈ [0.40, 0.90], Aleshin ≥ 0.85; barrier as % of cut: IMG ≥ 20%, Basilica ∈ [8%, 25%], Aleshin within a factor of 1.5 of its control's; Kuramoto f: IMG ≥ 0.90, Basilica ∈ [0.20, 0.95], Aleshin ≤ 0.10. The two intermediate groups agree in class — both at least a factor of two from their controls on ρ_Φ and the cut fraction, both above 20% on the barrier — while their numbers differ; the two exponential groups separate by amenability, Basilica between the intermediate pair and Aleshin on every growth-driven quantity.

Falsifierany of — Aleshin's ρ_Φ ≤ 0.60 (the free group's level-5 quotient is not expander-like at N = 1024, and the growth axis is not visible at this size); IMG's barrier ≤ 10% of its cut (intermediate growth without the glass — the barrier is a Grigorchuk fact, not a growth fact); Basilica's ρ_Φ ≤ 0.374 (exponential growth with worse expansion than the intermediate host — the axis reversed); Aleshin's f ≥ 0.50 (an expander that does not synchronise; either the graph is not an expander or Abdalla et al. do not apply at this size); or u/u_random ≤ 0.10 for any of IMG, Basilica, Aleshin (the square obstruction is not specific to the Klein-four contraction). Between prediction and falsifier is unanticipated. Control: the Grigorchuk row's reproduction at 432c51e is the control and passed before sealing; the random d-regular controls must be connected or the row is withdrawn.

VerdictFALSIFIED — the relator clause's falsifier fires: Basilica's unique-neighbour minimum at N/8 is 1 of its control's 101 at best-of-20 and 0 of 94 at best-of-40, u/u_random ≤ 0.10, so the square obstruction of N-034 is not specific to the Klein-four contraction; a torsion-free exponential-growth group with no squares has zero unique-neighbour expansion by another route. IMG (0.38) and Aleshin (0.19) also miss the ≥ 0.5 prediction without firing it. Growth-driven clauses: ρ_Φ inside every band — IMG 0.508, Basilica 0.474, Aleshin 0.853 — but not in the predicted order: Grigorchuk 0.374 < Basilica 0.474 < IMG 0.508 < Aleshin 0.853, the three contracting groups clustered and the free group apart, which is the nucleus coordinate ordering (amenable vs not), not the growth class; cut-fraction ratios 0.506 / 0.46 / 0.83 (IMG and Aleshin miss their edges by 0.006 and 0.02); barriers 53% / 40% / 24% of the cut against controls of 42% (random 3-regular is itself glassy) / 8.0% / 8.4% — IMG's clause hit, Basilica's and Aleshin's missed high, and every Cayley graph including the free group's has walls three to five times its control's, so barriers separate Cayley graphs from random graphs rather than growth classes; Kuramoto — IMG 1.000 (hit), Basilica 0.020 (miss: it synchronises like an expander), Aleshin invalid because kuramoto.py's fixed dt = 0.2 is unstable at degree 6 (dt·λ_max = 2.4 > 2), so that falsifier clause is unmeasured. Controls connected; calibration passed. Basilica is amenable-like in geometry (expansion, cut, barrier) and expander-like in dynamics (synchronisation) — the split the run did not predict and the one worth a probe. IMG's cogrowth κ = 0.797 against Grigorchuk's 0.665, shortest prime (ac)⁴ at length 8, confirming the relator.

run 044The quantum reading of the intermediate cell (P-045) — the boundary as a quasicrystal, the bulk as a flat-band localizer — is either a transport signature or a decoration. A continuous-time quantum walk decides which: does the boundary walk spread anomalously, strictly between ballistic and localized, and does the bulk walk stay partly localized where an expander's delocalizes?

PredictionPath — β ∈ [0.95, 1.05], PR/N ≥ 0.5, P̄_∞ ≤ 5/N. Fibonacci chain — β ∈ [0.30, 0.95] (anomalous, the positive control). Grigorchuk Schreier graph — β ∈ [0.30, 0.90], strictly anomalous like the Fibonacci chain and unlike the path, with γ ∈ [0.20, 0.95]. Random 4-regular — saturated (t_c < 4), PR/N ≥ 0.6, P̄_∞ ≤ 5/N. Coset graph — PR/N ≤ 0.30 and P̄_∞ ≥ 0.02: the flat bands hold the walker near its origin at long times, against an expander's PR/N ≥ 0.6.

FalsifierSchreier graph β ≥ 0.95 (the boundary walk is ballistic — a decorated path, and the quasicrystal reading is decorative) or β ≤ 0.10 (localized outright, which the Cantor spectrum does not predict either); coset graph PR/N ≥ 0.60 (the flat bands do not localize the walk and the bulk transport is expander-like); or the positive control failing — Fibonacci β outside [0.30, 0.95] — which withdraws the run, since the instrument then cannot see anomalous spreading at N = 1024. Between prediction and falsifier is unanticipated.

VerdictFALSIFIED on the boundary clause — the Grigorchuk level-10 Schreier graph walk is ballistic under the sealed Laplacian, β = 0.973 ≥ 0.95, with the return floor (1.5/N), decay (γ = 0.82) and participation (0.999) of the path control. Controls all pass — path β = 1.000, PR/N = 1.000, floor 1.5/N; random 4-regular saturated at t_c = 1.7, PR/N = 0.992, floor 2.9/N; Fibonacci chain β = 0.763, the positive control for anomalous spreading, inside [0.30, 0.95]. The bulk clause is CONFIRMED and strong: on the coset graph the long-time participation ratio is PR/N = 0.096 (≤ 0.30) and the exact return floor 0.0746 = 76.4/N (≥ 0.02) — the walker occupies a tenth of the graph where the expander's occupies all of it; the flat bands localize. The reason the boundary clause failed is the codifier's operator, not the host: the seal named the graph Laplacian, and in the Laplacian every loop cancels — a loop adds to the diagonal and to the degree equally — while the Schreier graph's aperiodicity lives entirely in its loops (which of b, c, d fixes a leaf follows the substitution). Bartholdi–Grigorchuk's Hecke operator and Grigorchuk–Lenz–Nagnibeda's Schrödinger operator are the adjacency operator with loops on the diagonal. The seal measured a path with alternating hoppings 1 and 2 and found a path. Scored as written; the corrected operator is sealed as run 045 with the same predictions, before any Hecke walk was run.

run 045Run 044 sealed the graph Laplacian as the walk Hamiltonian, and on the Schreier graph the Laplacian cancels every loop — which is exactly where the graph's aperiodicity lives (which of b, c, d fixes a leaf follows the substitution). Bartholdi–Grigorchuk's Hecke-type operator and Grigorchuk–Lenz–Nagnibeda's Schrödinger operator are the adjacency operator with loops counted on the diagonal. Same question as 044 with the right operator: does the boundary walk spread anomalously under the Hecke operator?

PredictionPath — β ∈ [0.95, 1.05], PR/N ≥ 0.5, P̄_∞ ≤ 5/N. Fibonacci chain — β ∈ [0.30, 0.95] (anomalous, the positive control). Grigorchuk Schreier graph — β ∈ [0.30, 0.90], strictly anomalous like the Fibonacci chain and unlike the path, with γ ∈ [0.20, 0.95]. Random 4-regular — saturated (t_c < 4), PR/N ≥ 0.6, P̄_∞ ≤ 5/N. Coset graph — PR/N ≤ 0.30 and P̄_∞ ≥ 0.02: the flat bands hold the walker near its origin at long times, against an expander's PR/N ≥ 0.6.

FalsifierSchreier graph β ≥ 0.95 (the boundary walk is ballistic — a decorated path, and the quasicrystal reading is decorative) or β ≤ 0.10 (localized outright, which the Cantor spectrum does not predict either); coset graph PR/N ≥ 0.60 (the flat bands do not localize the walk and the bulk transport is expander-like); or the positive control failing — Fibonacci β outside [0.30, 0.95] — which withdraws the run, since the instrument then cannot see anomalous spreading at N = 1024. Between prediction and falsifier is unanticipated.

VerdictFALSIFIED on the boundary clause, identically to run 044 — β = 0.973 under the equal-weight Hecke operator, floor 1.5/N, γ = 0.816, PR/N = 0.999, the path's numbers — and the reason is structural, found by counting: every one of the 1,024 leaves carries exactly one loop (1,022 with one, the two path ends with three), so with equal weights the loop potential is a constant and the Hecke operator is the loop-free adjacency plus the identity, a period-2 chain. The aperiodicity of the Schreier graph is which generator loops at each leaf, invisible to any isotropic operator. Grigorchuk–Lenz–Nagnibeda (arXiv:1412.6822, abstract) prove the Cantor spectrum for the anisotropic Laplacians — unequal generator weights — which is the operator run 046 seals. Controls unchanged: path β = 1.000; Fibonacci β = 0.688 (positive control inside [0.30, 0.95]; adjacency instead of Laplacian shifts it from 0.763); random saturated, PR/N 0.992; coset graph PR/N 0.096, floor 76/N (the bulk clause, not re-tested, identical since the coset graph is regular and loop-free). Scored as written.

run 048Run 040 produced seventeen level-5 minimum bisections at exactly 90,112 and run 042 sorted them into ten classes (twins at |q| ≈ 0.953 are one class — a balanced random half of the free cosets flipped), with the overlaps between classes on a ladder 0, 0.33, 0.48, 0.64, 0.80. P-044 reads the ladder as the symmetry orbit of one seam — left multiplication by G/St(5) is an automorphism of the coset graph Q₅ and carries minima to minima — and the memory of run 040 as a register whose states are that orbit. Is it? What is the orbit's size (the capacity), its overlap spectrum (the ladder, exactly), the stabiliser of the seam, and the barrier between the seam and its generator images (the write cost)?

Prediction(1) One orbit — every one of the ten classes has maximum |q| ≥ 0.95 against the first seed's orbit, and the seeds fall into one orbit up to twin flips (the exact-match count may be less than ten; twins are free-spin choices, not symmetry images). (2) |O| ∈ [2⁴, 2⁸] — the stabiliser has order between 2¹⁴ and 2¹⁸ — and the seam is aligned with the tree: k* ≤ 4, the stabiliser contains everything that fixes the first four levels. (3) The orbit's overlap spectrum is exactly the ladder — the distinct values are 0, 0.33, 0.48, 0.64, 0.80 each within ±0.02, and nothing else below 0.95; 0.953 does not appear as an orbit overlap (twins are not images). (4) The generator image with the largest |q| is at |q| = 0.80 ± 0.02 and its barrier is 39,235 within 10 %; barriers are non-increasing in |q| down the ladder.

Falsifierany of — the ten classes span two or more orbits with some class at maximum |q| ≤ 0.85 against the first seed's orbit (the minima are not one crystal and "register" is the wrong word); |O| > 4,096 (the cap: reported as "> 2¹²"; the seam has no tree-aligned stabiliser); an orbit overlap value in (0.85, 0.95) or above 0.95 other than 1 (symmetry images at twin distance — the ladder and the free spins are not separate structures); the barrier to the largest-|q| generator image below 20,000 or above 60,000 (the symmetry path is not the quench path's cost — the write costs half, or more than 1.5 times, what run 040 measured). Any control failing in (i) withdraws the run. Between prediction and falsifier is unanticipated.

VerdictFALSIFIED on every clause, controls all passing (L_h label-preserving involutions; orders of ab, ac, ad = 16, 8, 4 by both constructions; every π_h an automorphism of Q₅; every image recounts to 90,112). (1) Not one orbit: the 16 seeds are 16 distinct orbits within the cap; four classes (s31, s34, s39, s43) reach only max |q| = 0.80 against the first seed's orbit. (2) |O| ≥ 4,096 (cap hit); the BFS depth profile is the Grigorchuk sphere series through radius 12, so no two elements of length ≤ 12 give the same state, and all 9,655 Schreier words are the identity — no stabiliser within reach, k* undetermined. (3) Twin-level overlaps appear inside the orbit (0.952–0.955, 446 pairs) and the spectrum has twelve clusters, two wider than ±0.02. (4) π_d(seed) is the seed's twin — |q| = 0.954, barrier 0 — and the generator images at 0.80 (π_b, π_c) cost 5,720, a seventh of run 040's 39,235. What holds: the barrier falls monotonically with |q| down the ladder (38,038 at q ≈ 0 to 5,720 at 0.80 to 0 at 0.954).

run 050Run 048 found the level-5 minimum bisections are not one small orbit — 16 seeds, 16 orbits, ≥ 4,096 states each, no stabiliser within reach — and that the generator d carries the seam to its twin at zero barrier, so part of the free-spin layer is symmetry. P-044's crystal picture could still be true of the part of a minimum that is not free. Quotient out the free spins: what is the orbit of the frozen core?

Prediction(1) d is exactly the free-spin symmetry: π_d(core(S)) = core(S) for all 16 seeds, while π_a, π_b, π_c each change ≥ 5 % of the core. (2) The quotient does not rescue the crystal: |O_c| still hits the 4,096 cap for the first seed, and the 16 seeds give ≥ 8 distinct core orbits — the seam's symmetry breaking is in the core, not in the free layer. (3) The core stabiliser within the cap is non-trivial (it contains at least d), with leaf-group order ≥ 2 and m₁ = 1 (it fixes the first level — d acts trivially on the first letter).

Falsifierany of — π_d changes more than 1 % of the core on any seed (the twin map is not a free-spin symmetry and run 048's zero barrier is a coincidence of the interpolator); |O_c| ≤ 256 for the first seed (the crystal picture holds on the core — P-044 was right about the core and wrong only about the free layer); the core stabiliser within the cap is trivial (then d does not fix the core and clause 1 is already false). Controls as in run 048 (all must pass, or withdrawn). Between prediction and falsifier is unanticipated.

VerdictFALSIFIED on clauses 1 and 3, clause 2 confirmed; controls and equivariance pass (64/64). d is not exactly the free-spin symmetry: π_d changes 0.31–0.36 % of the core on 14 seeds and 18 % on the twin pair s24/s17 (falsifier: > 1 % on any seed). The core stabiliser within the cap is trivial — all 9,655 Schreier words are the identity, m_k = 1 at every level (falsifier: trivial stabiliser). Clause 2 holds: every seed's core orbit hits the 4,096 cap with the Grigorchuk sphere series, and the 16 seeds give 16 distinct core orbits — the symmetry breaking is in the core. Six of ten classes sit at core overlap 0.9987 against the first seed's core orbit; the other four at 0.849.

run 059Run 058's one-block polynomial ordered all eight lattices' exponents but not their values (y reads carpets high by 0.009–0.065, the square low by 0.020), and put the thresholds p* 0.03–0.06 above the measured ones. Run 056 found the three-size estimator reads the square 0.009 low. Two questions, one run. (A) The composition defect — the failure of "cross each block, then the arrangement" to commute with "cross the whole" — has a zeroth-order part at the fixed point, D₂(p*), and a first-order part, D₂′(p*). Does the zeroth-order part account for the threshold shift and the first-order part for the exponent offset? (B) Does the square's estimator bias shrink when the fit uses larger sizes?

Prediction(A1) D₂(p*) tracks the threshold gap: Spearman ρ(D₂(p*), p* − p∞) ≥ 0.7 over the eight lattices. (A2) It does not track the exponent offset: |ρ(D₂(p*), y − measured 1/ν)| < 0.5. (A3) The first-order correction moves the exponent toward the measurement: |y_c − measured| < |y − measured| on at least six of eight. (B) The square's (243, 729, 2187) fit is closer to 0.75 than its (81, 243, 729) fit, and within 0.008 of 0.75.

Falsifierany of — ρ(D₂(p*), p* − p∞) ≤ 0.3 (the zeroth-order commutator is not what shifts the threshold); y_c closer than y on three or fewer of eight (the first-order commutator does not carry the exponent's error); the square's (243, 729, 2187) fit more than 0.0175 from 0.75 (larger sizes make the bias no better, 2S beyond 056's gap). A failed Monte Carlo sanity check (P₂ at p = 0.5 on the square within 0.01 of 0.5) withdraws the run. Clause A2 has no falsifier. Between prediction and falsifier on any clause is unanticipated.

VerdictFALSIFIED 2026-09-29, on clause A3. The sanity check passed (P₂(0.5) on the 81×81 square 0.5064 ± 0.0004). A3: y_c = ln P₂′(p*) / ln 81 is further from the measured 1/ν than y on all eight lattices (0 of 8 closer; y_c runs 0.05–0.63 against measured 0.28–0.74), so the falsifier (three or fewer) fired. A1 unanticipated: ρ(D₂(p*), p* − p∞) = 0.48, between the 0.7 prediction and the 0.3 falsifier (0.21 on the seven carpets alone). A2 held: ρ(D₂(p*), y − measured) = −0.12. B unanticipated: the (243, 729, 2187) fit is 0.7335 ± 0.0073, closer to 0.75 than the (81, 243, 729) fit's 0.7313 but 0.0165 away — outside the predicted 0.008, inside the 0.0175 falsifier. The body records that A3 failed on its own construction, and a post-hoc lead the data show.

run 060Run 058's crossing polynomials R(p) are exact. Writing R(p) = c·p^ℓ·∏(p − p_j), with ℓ the shortest crossing path and p_j the remaining zeros, the log derivative at the fixed point gives an identity, λ = R′(p*) = ℓ + p*·Σ_j 1/(p* − p_j), so the exponent y = ln λ / ln 9 is a statistic of where the zeros sit. Is it controlled by the few zeros nearest the fixed point, as the Fisher-zero picture says, or spread over all of them? And do the zeros stay within the disc |p − 1| ≤ 1?

Prediction(1) The nearest zeros dominate: f₄ ≥ 0.5 on at least six of the eight generators. (2) The disc holds: every zero of every generator satisfies |p_j − 1| ≤ 1.

Falsifierany of — f₄ ≤ 0.2 on at least six of eight (the exponent is a property of the whole zero set, not of the zeros near the fixed point); any zero with |p_j − 1| > 1.05 on any generator (the disc fails). A failed control withdraws the run. Between prediction and falsifier on either clause is unanticipated.

VerdictFALSIFIED 2026-09-29, on clause 2. Both controls passed on the second pass (the zeros rebuild the coefficients to 1e-257; λ from λ = ℓ + p*·Σ 1/(p* − p_j) equals run 058's to every printed digit); the first pass failed on the harness's precision, not the data's, and was discarded. Clause 2 falsified outright: every generator has zeros outside |p − 1| ≤ 1, from 15 of 28 (U′) to 48 of 120 (square), reaching |p_j − 1| = 1.41 (square) to 2.42 (B), far past the 1.05 falsifier. Clause 1 held as written — f₄ ≥ 0.5 on seven of eight (square 0.165; H 1.04, U 1.46, U′ 1.43–2.29, T 0.95, V 0.96, A 1.08, B 1.31) — but the body records that the picture it was meant to test does not: the nearest zeros overshoot the whole sum and farther zeros cancel them.

run 061Run 059's corrected exponent failed because it read the 81×81 lattice's slope at the one-block fixed point p*, where that lattice is already on the shoulder of its crossing curve. Two questions follow. (A) Read at the 81×81 lattice's own fixed point, does its slope give an exponent closer to the measured 1/ν than the one-block y — does the renormalization improve with block size? (B) After the fact, the first-order commutator D₂′(p*) ranked with the one-block exponent's error y − measured (ρ = 0.88 over eight lattices). Does that ranking hold on rooms it has never seen?

Prediction(A) |y₂ − measured| < |y − measured| on at least six of the eight lattices, and y₂ orders the eight as the measured 1/ν does on at least 26 of the 28 pairs. (B) Among the three new rooms, the offset y − measured 1/ν orders exactly as D₂′(p*) does (larger D₂′, larger offset), and over all eleven lattices the Spearman correlation of D₂′(p*) with y − measured is at least 0.7.

Falsifierany of — y₂ closer than y on three or fewer of eight (a bigger block does not improve the renormalization at this size); over all eleven lattices, Spearman ρ(D₂′(p*), y − measured) ≤ 0.3 (the post-hoc ranking of run 059 does not survive new rooms). A failed Monte Carlo sanity check (P₂(0.5) on the square within 0.01 of run 059's 0.5064) withdraws the run. Between prediction and falsifier on any clause is unanticipated.

run 062On all seven carpets counted so far, the number of minimum left–right cuts obeys an exact recursion across generations, N(g+1) = c·N(g)^C₁, with C₁ the one-step cut size and c a constant (H 1, U 3, V 4, T 8, U′ 4, A 36, B 81/2500), checked as exact integers at g = 1→2→3 and in logarithm to g = 4. Within the cut-4 class, the one-block renormalization's miss y − measured 1/ν orders exactly as c on all five known lattices (B .009 < H .017 < U .023 < V .041 < A .051; c = 0.0324 < 1 < 3 < 4 < 36), with no inversion. Cut entropy s, which the Differential panel on CASE-25 adopted, has one inversion (H/B). (A) Is the recursion a property of every generator in the pool, or of the seven looked at? (B) Out of sample: does c order the misses of run 061's three new rooms?

Prediction(A) c₁ = c₂ = c₃ on all 19 generators (as exact rationals where the counts fit in 128 bits; to 10⁻⁹ in the logarithm only past overflow). (B) The misses order as c: miss(X) < miss(Y) < miss(Z); and over the eight cut-4 lattices (H, U, V, A, B, X, Y, Z) the Spearman correlation of ln c with the miss, average ranks for ties (Y ties U in c), is at least 0.85. Noise band: two misses closer than 0.008 (twice the estimator's run-to-run spread, √2 for a difference, rounded up) are undetermined in order, neither confirming nor falsifying.

Falsifier(A) any generator whose c_g differ as exact rationals, or, past overflow, by more than 10⁻⁹ in the logarithm; or whose minimum cut does not scale as C₁^g. A generator the counter cannot count is reported as not applicable. (B) miss(Z) < miss(X) − 0.008, or the eight-lattice Spearman correlation at most 0.5. Between prediction and falsifier on either clause is unanticipated. If run 061 withdraws its Part B, or if clause A fails on X, Y or Z (whose c values assume the recursion), clause B is withdrawn.

run 064Probe P-048 argues that block renormalization fails to converge on the Sierpiński-type carpets because they are infinitely ramified (blocks share whole edges). The Grigorchuk ⟨b,c,d⟩-coset graphs are self-similar hosts on the other side of that line. Is their Laplacian spectrum an exact renormalization — every eigenvalue new at level n a preimage, under the one fixed map φ(μ) = μ(8 − μ)/2, of an eigenvalue at level n − 1 (the half-angle rule 4 − 4cos θ ↦ 4 − 4cos(θ/2))? Eigenvalues inherited from level n − 1 are excluded from the test: the level-n graph covers the level-(n − 1) graph, so their presence is automatic.

PredictionNo orphans: at level 4 every distinct eigenvalue is inherited or decimated from level 3, and at level 5 every converged distinct eigenvalue among those on disk is inherited or decimated from level 4. In each control, at least half of the non-inherited distinct eigenvalues are orphans.

Falsifiermore than 5% of the non-inherited distinct eigenvalues at level 4, or at level 5, are orphans — the spectrum is not a decimation of the level below, and "finitely ramified ⇒ exact renormalization" fails on this host. If a denominator is below 20, a single orphan counts as more than 5%; this is accepted and stated. If in either control 10% or fewer of the non-inherited distinct eigenvalues are orphans, the classification cannot tell a self-similar tower from that cover and the run is withdrawn (C2 passing the half-angle rule would mean the rule belongs to 2-power covers, not to self-similarity). Between prediction and falsifier (a few orphans, up to 5%) is unanticipated.

run 068The construction (a 9×9 pattern keeping 64 cells, outer ring kept, symmetric under the eight symmetries of the square, centre removed) admits exactly 63 patterns. By minimum cut they fall into classes of cut 2, 3, 4 and 5; only one cut-2 pattern (U′), one cut-3 (T) and none of cut 5 have been measured. The "ceiling" 1/ν ≤ 0.874·ln C₁/ln 9 (P-048) rests on X and U′, and run 067 showed it is not preserved by stacking. Across the whole family, do the classes order by cut, and does any member break its class ceiling?

Prediction(A) The classes order by cut: among the measured members (a sample, so a statement about sample maxima; cut 4 already has 11 measured members, cut 2 will have 6, cut 3 and cut 5 all), the maximum measured 1/ν rises strictly with c, max(c = 2) < max(3) < max(4) < max(5). (B) The ceiling holds: no measured member exceeds its class ceiling by more than 0.012. Overall: confirmed if (A) and (B) are both confirmed.

Falsifier(A) is falsified if any adjacent pair of classes has the lower-cut maximum above the higher-cut maximum by more than 0.012; confirmed if every adjacent pair is strictly ordered; otherwise (an adjacent pair within 0.012 either way) unanticipated. (B) is falsified if any member exceeds its class ceiling by more than 0.016 (about 3.5 errors, so that about 30 members tested give an expected false break well under 0.1); confirmed if none exceeds it by more than 0.012; a member between 0.012 and 0.016 above makes (B) unanticipated. The run is falsified if either clause is, else unanticipated unless both are confirmed. Withdrawn as underpowered if the median bootstrap error on the new exponents exceeds 0.006, or if stage 1's pivotal control fails on more than 3 patterns.

run 069Feigenbaum's universality lives in a function, not only in δ: the fixed point of the doubling operator. The carpet analogue is the shape of the limiting crossing curve. If each carpet's class is carried by its curve shape, the rescaled curve should stop changing with size on one carpet and should differ between twins whose exponents differ. Does it?

PredictionThe shape is a fingerprint: for all 3 scored twin pairs, the scaled D_twin exceeds both members' scaled D_self and the largest scaled reseed D.

FalsifierAt most 1 of the 3 scored pairs separates — the curve shape does not separate twins beyond size and sampling noise. Exactly 2 separating pairs is unanticipated. Checked first: if the scaled D_self exceeds twice the largest scaled reseed D on more than 7 of the 14 carpets, shapes are still changing with size and the run is withdrawn as uninformative (nothing is read from shape at these sizes).

run 071Run 068 measured 14 of the 63 patterns and left a hierarchy, post hoc: the minimum cut C₁ sets a band of exponents (cut 2: 0.260–0.349; cut 3: 0.372–0.427; cut 4: 0.429–0.551; cut 5: 0.588–0.613), and within a band the number of minimum cuts N₁ sets a sub-band, more minimum cuts lower (cut 2: N₁ = 4 at 0.303–0.349, N₁ = 16 at 0.260–0.276; cut 3 monotone in N₁). The exact one-block y₉ of all 63 shows the same layering. Does the hierarchy hold on patterns chosen before their exponents exist?

Prediction(A) Bands hold: every new cut-2 pattern measures below 0.3718 (the lowest cut-3 exponent) and every new cut-4 pattern above 0.4270 (the highest cut-3 exponent). (B) Cut-2 sub-bands hold: the lowest N₁ = 4 exponent (all) exceeds the highest N₁ = 16 exponent (all). (C) Within cut 4, the exponent falls with N₁: Spearman(N₁, 1/ν) over all measured cut-4 patterns is at most −0.5. Confirmed if A, B and C all hold.

Falsifier(A) any new cut-2 above 0.3718 + 0.012, or any new cut-4 below 0.4270 − 0.012; a member within 0.012 on the wrong side makes A unanticipated. (B) the highest N₁ = 16 exponent above the lowest N₁ = 4 exponent by more than 0.012; within 0.012 either way, unanticipated. (C) Spearman at or above 0; between −0.5 and 0, unanticipated. The run is falsified if any clause is falsified, confirmed if all three hold, and unanticipated otherwise. Withdrawn as underpowered if the median bootstrap error on the new exponents exceeds 0.006. Reported, not scored: Spearman(y₉, 1/ν) within each cell and each class; whether the cut-5 reversal (N₁ = 54 above N₁ = 36) has any counterpart in cut 4.

run 073Run 072 found the skewness g₁ of the threshold distribution reproducible across reseeds but still moving between L = 729 and 6561 on four carpets (g₁(6561) − g₁(729): T −5.2 combined errors, X +3.2, Z +2.8, X1 −2.5). Under single-parameter scaling every cumulant scales as κₙ ∝ L^(−n/ν), so every standardized cumulant (g₁ = κ₃/κ₂^(3/2), g₂ = κ₄/κ₂²) tends to an L-independent limit, and a drift is a correction to scaling that should shrink as L grows. Is the drift converging, i.e. is the step from 81 to 729 in the same direction as, and larger than, the step from 729 to 6561?

PredictionThe drift is a converging correction to scaling: at least 3 of T, X, Z, X1 have D > 0 (equivalently r ∈ (0, 1)), and at least 2 of those have the 5th percentile of D above 0. Illustratively, with run 072's values the boundary D = 0 is g₁(81) = 2g₁(729) − g₁(6561): T above 0.5544, X below 0.1211, Z below 0.2334, X1 above 0.4478; the scored value uses the recomputed k-statistic g₁.

Falsifier2 or more of the 4 have the 95th percentile of D below 0: the drift reverses direction or grows with L, and the approach to the limit is not a single shrinking correction. Between prediction and falsifier, unanticipated.

run 076Stacking two carpet patterns A and B gives, at the one-block level, the 2-cycle of their crossing polynomials, with y_AB = ln(R_A′(r)·R_B′(q))/ln 81 at q = R_A(r), r = R_B(q). Its deviation from the parents' mean, D = y_AB − (y₉(A) + y₉(B))/2, was +0.0115 (X,U′), +0.0022 (X,T), +0.0052 (U′,T) and −0.0011 (X,Y). Panel PN-004 read D as governed by the separation of the fixed points δ = p*_B − p*_A rather than by cut class, and its House final stated as forced that D is second order in δ. Expanding the 2-cycle gives a first-order term instead, D₁ = δ(λ_A − 1)(λ_B − 1)(s_A − s_B) / [ln 81 · (λ_Aλ_B − 1)], with λ = R′(p*), a = R″(p*) and s = a/(λ(λ − 1)) one number per pattern; D₁ vanishes only when δ = 0 or s_A = s_B. Over every pair of distinct census polynomials: is D first order in δ, what sign does it take, and does cut class matter once δ is known?

Prediction(A) First order. The interquartile range of s over the 49 distinct functions is at least 0.2 × the median |s|; and on pairs with 0 < |δ| ≤ 0.01 and |s_A − s_B| ≥ 0.1 × median |s| (count reported), the median of |D/D₁ − 1| is at most 0.1. (B) Both signs. D < 0 on at least 5% of the pairs with |δ| > 0.02 (976 pairs at sealing). (C) Cut class does not protect. Bin all pairs by |δ| into quintiles; within each bin take the median |D| of equal-C₁ pairs over the median |D| of unequal-C₁ pairs, dropping bins with fewer than 5 pairs on either side; the median of the bin ratios is at least 0.5. (D) Separation beats class. The partial Spearman correlation of |D| with |ΔC₁| controlling for |δ| (average ranks for ties) is below 0.15 in absolute value. Confirmed if all four hold.

Falsifier(A) IQR(s) below 0.05 × median |s| (s effectively constant, D₁ ≡ 0, and the House's second-order statement stands), or on the filtered set the median of |D/D₁ − 1| exceeds 0.5. (B) D < 0 on fewer than 1% of the pairs with |δ| > 0.02: the surplus is effectively forced. (C) the median bin ratio is below 0.2: at equal separation, equal cut class keeps the map close to averaging. (D) the partial Spearman exceeds 0.3 in absolute value. Each clause is scored on its own: the run is falsified if any clause is falsified, confirmed if all four hold, unanticipated otherwise. A clause whose set has fewer than 10 pairs (or, for C, fewer than 3 usable bins) is unscorable; with any clause unscorable the run cannot be confirmed, and with fewer than three scorable it is unanticipated unless a scored clause is falsified.

run 079Run 074 read H, the standard 3×3 carpet, at five sizes a factor of 3 apart (L = 81, 243, 729, 2187, 6561; generations 4–8) and found, post hoc, that the skewness steps alternate — small, large, small, large — with the large steps ending at even generations. The width's pair slopes from run 051 (0.539, 0.580, 0.529, 0.539) alternate in the same phase through the middle three, with equal end slopes. Both rest on one set of 8,000 samples per size and are about two errors. Drawn again with fresh seeds and six times the samples, does a period-two term in generation come back, in the same phase, in both the skewness and the width?

Prediction(A) The skewness alternation replicates. The fresh H contrast Δ⁴g₁ (samples079 only) is above +2 errors. Positive is the phase run 074 saw: g₁ high at even generations, so the steps ending at an even generation are the large ones. (B) The width alternates in the same phase. The fresh H contrast Δ⁴ln w is below −2 errors: ln w low (the width narrowed further) at even generations, so the pair slopes ending at an even generation are the large ones. Confirmed if both clauses are confirmed.

Falsifier(A) Δ⁴g₁ below +1 error: the skewness alternation of run 074 does not replicate. (B) Δ⁴ln w above −1 error: the width does not alternate in that phase. Between +1 and +2 errors (A), or between −2 and −1 (B), a clause is neither confirmed nor falsified. The run is falsified if A is falsified, whatever B shows; a confirmed B beside a falsified A reopens only the width line and does not rescue the run. Δ⁴g₁ below −2 errors is falsified as written but reported as a reverse-phase or trend-curvature signal, not as noise. A confirmed with B falsified is unanticipated: the alternation lives in the shape of the threshold distribution, not in its scale. A confirmed with Δ⁴ln w above +2 errors (both alternating, opposite phase) is unanticipated. Confirmed if both are confirmed; otherwise unanticipated.

run 084Run 082 was withdrawn on a mis-written control, but what its lab saw before stopping reshapes the ladder: rung 1 is wall-bound at the carpet's sizes (the threshold within 2.8 widths of 1 at L = 729), its slopes sit below both the carpet and the one-bit map and in the wrong order (X below T), and the one-bit map sits above the carpet. So the rung-k family approaches the carpet from below as k grows. At the first rung whose threshold is clear of the wall, does the ladder recover the carpet's order of T and X, and does T's skewness turn there while X's does not?

Prediction(A) The ladder recovers the carpet's order at the first clear rung, on the guarded sizes: s₃₄(X) − s₃₄(T), the local slope over 729→6561 by the recursion, exceeds +0.05 (the carpet's gap there is 0.18, 0.545 against 0.365; rung 1's three-size slopes were 0.30 against 0.33). (B) The turn is at the first clear rung: on T, g₁(level 4) − g₁(level 3) is below −0.03; on X it is at or above 0. Confirmed if both hold.

Falsifier(A) the difference at or below 0: the rung still has X at or below T, as rung 1 did. Between 0 and +0.05, unanticipated. (B) T's step at or above +0.03: the first clear rung rises like the one-bit map. Between −0.03 and +0.03, or X's step below −0.03, unanticipated. The run is falsified if either clause is falsified, confirmed if both hold, otherwise unanticipated. A falsified A with a confirmed B says the shape is recovered before the slope; a falsified B with a confirmed A says the slope is recovered before the shape; either is a statement about which the boundary state buys first.

run 085Run 083 found, on two carpets, that the route the one-block recursion cannot represent is the majority route at every size, that the lag Δ = t − t_coarse between the lattice crossing and the coarse block crossing is about −0.8 of the threshold width on both patterns at both sizes, and that the share of exact ties (Δ = 0) is the one per-sample quantity that separates T from X (10% against 5%). Across the whole census at L = 729, is the lag in width units a lattice-generic number, and is the tie share set by the cut class?

Prediction(A) The lag in width units is lattice-generic. ρ = ⟨Δ⟩/w lies in [−1.0, −0.6] on at least 45 of the 49 members. (B) The tie share is a class quantity. Over the 49, Spearman(s₀, C₁) is at or below −0.5. Confirmed if both hold.

Falsifier(A) fewer than 40 members inside [−1.0, −0.6]: the lag is pattern-specific. 40 to 44 inside, unanticipated. (B) Spearman(s₀, C₁) above −0.2: the tie share is not a class quantity, falsified; from −0.2 down to but not including −0.5, unanticipated (boundaries inclusive on the unanticipated side). The run is falsified if either clause is falsified, confirmed if both hold, otherwise unanticipated. A lone surviving A says the lag is a property of the lattice at threshold and the tie share is the pattern's; a lone surviving B says the reverse — the ties sort by class while the lag does not, and the lag is then the quantity to carry to the ladder.

run 086The census has 63 patterns and 49 crossing polynomials; the 14 extra patterns share a polynomial with another, in eight groups of two to four, and the completed census measured one member of each. Within a group the one-block map, λ, y₉, the pivotal sum and the ring share are identical. Each pair below differs by moving four or eight removed cells among D4-symmetric positions: in two pairs (#33/#37, #58/#60) both members stay connected with the same bond count; in two (#23/#24, #62/#63) one member's move cuts cells off from everything — islands, dead at every generation — where the other keeps them attached but off every level-1 crossing, so the polynomial cannot tell the two apart while at generation 2 the attached cells are blocks a crossing can enter and leave through one shared edge. Inside a polynomial fibre, is the lattice exponent the same number; and are attached-but-crossing-dead cells live on the lattice?

Prediction(A) The boundary datum is real and small. Over the two no-island pairs, Q ≥ 6 (the two differences are jointly inconsistent with zero at the 5% level), and each |1/ν(new) − 1/ν(twin)| is below 0.020. (B) Attached cells are live. On both island pairs the attached member crosses earlier: δ < 0 by more than 3 combined errors, at L = 729. Confirmed if both hold.

Falsifier(A) Q ≤ 2: the two pairs are consistent with equal exponents (the median of Q under equality is 1.4) — the polynomial, with its pivotal structure, fixes the lattice exponent at these sizes and the boundary datum is below the census's resolution; falsified. Either |difference| at or above 0.020: the datum is not small; falsified in the other direction, and the twin pairing is re-read before anything is concluded. Q between 2 and 6 with both differences below 0.020: unanticipated. (B) either island pair within 3 combined errors, or either with the attached member crossing later (δ > 0 by more than 3 errors): falsified — the attached cells are as dead on the lattice as on the block, or they hinder. Both the right sign, one of them between 2 and 3 errors: unanticipated. The run is falsified if either clause is falsified, confirmed if both hold, otherwise unanticipated. A falsified A (equal) with a confirmed B says the one-block structure fixes the exponent at L ≤ 6561 while the threshold still moves with cells the block cannot see — the datum is in the threshold, not the exponent; a confirmed A with a falsified B says the exponent moves inside a fibre by something other than attached cells, and the no-island rearrangement is where to look.

run 089The one-block map f = R_P carries the depth-k threshold law to the depth-(k+1) law by one fixed function, h = f⁻¹: Q_{k+1} = h ∘ Q_k, so the step map Q_{k+1} ∘ Q_k⁻¹ is h at every depth and, by Koenigs, the map is linear in a coordinate φ with φ ∘ h = λ⁻¹·φ. The lattice has a step map too — g_L = Q_{9L} ∘ Q_L⁻¹, the function that carries the threshold law at L to the law at 9L, read off the stored samples — and nobody has asked whether it is one function. Is the carpet an iterated map at reachable sizes: is g₈₁ the same function as g₇₂₉?

Prediction(A) X is an iterated map at these sizes: g₈₁ and g₇₂₉ agree on the 19 nodes — rms z within [0.7, 1.3] and no |z_j| above 3.5 — after the half-file null is checked to lie in the same band. Confirmed if it holds.

Falsifier(A) rms z above 2.0, or any |z_j| above 4.5: the function that carries X's law from 81 to 729 is not the function that carries it from 729 to 6561 — the lattice's recursion changes with level, and no one-dimensional coordinate, Koenigs or other, makes it linear; falsified. rms z in (1.3, 2.0] with no node above 4.5: unanticipated. If the half-file null itself falls outside [0.7, 1.3], the rms is read against the null's value instead (confirmed within 0.3 of it, falsified beyond twice it), and the substitution is stated. One clause; the run takes its outcome.

run 097Run 083 found that the lattice crosses before the graph of its 64 top-level blocks does in 85% of samples on T and X at L = 729, a block counting as open once it is crossed left to right on its own bonds; run 085 that the mean lead is 0.46 to 1.92 widths over the census. P-053 says the lead is a coupling with the square's shape: a block can be passed between any two of its sides, and the pairs of sides fall into classes (opposite, adjacent). The recorder perc_blocks.c keeps, per sample and per block, the bond count at which each pair of sides is first joined inside the block. If a block is passed between two sides once those two sides are joined inside it, does the block graph cross when the lattice does, sample by sample, and is it the adjacent pairs (the corners) that make it? And PN-006's House named a statistic of several blocks for T's fall in skewness between 729 and 6561, the laggard gap; this run records what scores it.

PredictionAt L = 729, on T and on X. (A) The table's rule tracks the lattice: −0.30 ≤ Λ_t ≤ +0.30 and S_t ≤ 0.50. (B) The corners do it: C ≥ 0.30. Confirmed if both hold on both patterns.

Falsifier(A) Λ_t ≤ −0.55 on either pattern: pairs of sides do not carry the coupling, and it sits in where on a side a route enters (the ladder's question) or in several blocks at once. Λ_t ≥ +0.55 on either: a side is not a terminal — joined sides do not line up across a seam — and the table over-passes. S_t ≥ 0.66 on T or ≥ 0.79 on X (run 083's S_s): the rule does no better than the site rule sample by sample, whatever its mean; a mean inside the band is then two opposite biases cancelling (free seams early, middle thirds late). Between a bound of A and its falsifier, unanticipated. (B) C ≤ 0.10 on either pattern: the corner events add nothing beyond what along and across force, and the table has one entry. Between, unanticipated. The run is falsified if either clause is falsified, confirmed if both hold on both patterns, otherwise unanticipated. Readings fixed now: A falsified above with B confirmed — the corner entry is real and sides need splitting; the next rule uses the thirds, on which the recorder's same-side events bear. Λ_a ≥ 0 on either pattern (reported): the free seams over-pass even without the corners, and the lead that R_s showed was the full sides', not the corners' — read as against P-053's lead 1 whatever C is.

run 106Bond percolation on the b = 2 diamond hierarchical lattice (each bond replaced at every level by two parallel paths of two bonds; level n has 4^n bonds and "size" L = 2^n). The spanning probability at level n for bond probability p is exactly R^n(p) with R(p) = 1 − (1 − p²)² = 2p² − p⁴, so the distribution of the spanning threshold x over random bond orderings has CDF F_n(p) = R^n(p) exactly. Computing F_n to high precision for n = 1 … 24 and its moments — mean m_n, ln S_n (S the standard deviation), skewness g₁,n — do the corrections to scaling of the moments obey the tied form exactly?

PredictionOn this rung the tied form is exact: ω = 1/ν for all three moments, with the ratio of successive corrections equal to 1/λ to within 10⁻⁶ by n = 16. One clause. Reported, not scored, and written down now: the limiting skewness g₁,∞ is negative (R is concave at p*, R″(p*) = 4 − 12p*² ≈ −0.58, so the map compresses the upper side of the threshold distribution more than the lower), with |g₁,∞| between 0.1 and 0.6; the limiting ln S_n + n ln λ converges to a constant with corrections in powers of λ^{−n} only; and no term in the moments' expansion is log-periodic in n (the moments are analytic functions of λ^{−n} through the Koenigs linearisation of R at p*), so the comb of 2026-10-15 has zero harmonics on this rung for moments-versus-size, and the place to look for it is the free-energy-like sums over levels, not the threshold moments.

Falsifierthe ratio of successive corrections for any moment differs from 1/λ by more than 10⁻³ at n = 16 with the fit converged (the tie is not exact even here), or the corrections are not a power series in λ^{−n} (a second exponent appears that is not a multiple of 1/ν). Unanticipated: the ratio approaches 1/λ but more slowly than λ^{−n} (a marginal operator). Withdrawn if the quadrature does not converge to 12 digits by n = 24 (control (i)).

run 110On the diamond hierarchical lattices (b, s) with recursion F_{n+1} = 1 − (1 − F_n^s)^b, does the sign of the lean g₁ of the threshold distribution at level n = 24 follow the rule "positive iff b < s" on the three rungs the House named?

Prediction(The House's, PN-009 TEST 1 and FORCED 4.) g₁,24 > +0.02 on (2,4) and on (3,4), and g₁,24 < −0.02 on (4,3). Three clauses; confirmed only if all three hold.

Falsifierany one of the three with the opposite sign and |g₁,24| > 0.02. Unanticipated: any |g₁,24| ≤ 0.02, or a sign that differs between n = 18 and n = 24 on a scored rung. Withdrawn if control (i) or (ii) fails.

run 114For a hierarchical lattice whose rule is a Boolean function f on k independent children, the RG map is R(p) = Σ_j c_j p^j (1 − p)^{k−j} with c_j the number of accepted inputs of weight j, 0 ≤ c_j ≤ C(k, j). At which k does the not-all-equal rule R_k(p) = 1 − p^k − (1 − p)^k first have a period-3 orbit in (0, 1), and do narrower band rules get there earlier?

Prediction(A) the smallest k with a period-3 orbit under NAE is 6. (B) some band rule other than NAE has a period-3 orbit at a k smaller than NAE's smallest k. (C) at k ≤ 4 no rule of any kind has a period-3 orbit (the count is 0 at k = 2, 3, 4).

Falsifier(A) the smallest k is not 6 (any value in 2 … 12, or none up to 12). (B) no band rule other than NAE has a period-3 orbit at any k below NAE's smallest. (C) a nonzero count at k ≤ 4. Each clause scored separately; the run is confirmed only if all three hold. Unanticipated: a NAE period-3 orbit detected by the grid scan that mpmath fails to confirm to 1e-30 (a tangency; recorded, recomputed at 80 digits before scoring). Withdrawn if control (i) fails.

run 117On the exclusive hierarchical rules of run 114 (not-all-equal and the band rules [a, b], k = 2 … 12), does the distance to period three O(R) increase with k along NAE, and is the stretch |λ| at the interior fixed point above 1.8 on every rule that has a period-3 orbit?

Prediction(A) O(NAE_k) is strictly increasing in k for k = 2 … 12 and changes sign between k = 7 and k = 8 (O(NAE_7) < 0 ≤ O(NAE_8)). (B) every rule with a period-3 orbit in RESULTS114 has |λ|max > 1.8. (C) for each k = 7 … 12, Spearman's ρ between O and |λ|max over the band rules at that k is ≥ 0.7. Each scored separately; the run is confirmed if (A) and (B) hold; (C) is reported as held or not at each k.

Falsifier(A) O(NAE_k) not strictly increasing on k = 2 … 12, or O(NAE_7) ≥ 0, or O(NAE_8) < 0. (B) any period-3 rule with |λ|max ≤ 1.8. Unanticipated: a rule with a period-3 orbit in RESULTS114 for which O < 0 (Li–Yorke's ordering absent while period three is present — possible when the orbit runs high-to-low; recorded with its orbit, and the definition of O is the seal's fault). Withdrawn if control (i) or (ii) fails.

run 119On the 19 cut-2 census patterns, does flipping one cell of the 15-cell wedge break boundary isotropy visibly — the left–right and top–bottom transfer operators acquiring different singular values — for every flip that removes the pattern's D4 symmetry, and does the size of the break order by the flipped cell's symmetry class?

Prediction(A) every one of the 266 non-centre flips has g > 1e−12 (the broken symmetry is visible in the singular values). (B) the median g over off-axis flips exceeds the median over diagonal flips and the median over midline flips. Each scored separately; confirmed if (A) holds; (B) reported as held or not.

Falsifier(A) any non-centre flip with g ≤ 1e−12. Unanticipated: a class whose every flip has g ≤ 1e−12 (a residual symmetry the codifier did not foresee makes the two operators isospectral — recorded, and the class becomes the theme's instance of a hidden symmetry). Withdrawn if control (i) fails.

run 123Off the entropy plateaus, does the Li–Yorke slack O₂ rank the period-3 band rules at each k as their topological entropy does?

Prediction(A) ρ(O₂, h) ≥ 0.9 at every k with |P_k| ≥ 10. Confirmed if (A) holds.

Falsifier(A) any eligible k with ρ < 0.9. Unanticipated, recorded and not scored: a period-3 rule with h < log φ − 1e−10 (it would contradict Štefan's bound, so it is an instrument fault), or a rule with a critical-point count other than 1. Withdrawn if any control fails.

run 124Is the Li–Yorke slack O₂ a reading of the period-3 saddle-node's unfolding, ranking the period-3 band rules at each k as the split between their two 3-cycles' multipliers does?

Prediction(A) ρ(O₂, Δμ) ≥ 0.95 at every eligible k. Confirmed if (A) holds.

Falsifier(A) any eligible k with ρ < 0.95. Unanticipated, recorded and not scored: a period-3 rule with fewer than two 3-cycles found (a detector miss, since a period-3 rule has at least one cycle and a saddle-node pair), or with more than two. Withdrawn if any control fails.

run 127On the census generators other than generator 1, does the number of one-way pairs of the block transfer operator equal |U|·(511 − |U|), with U fixed by the right-column holes alone?

Prediction(A) the observed count equals the predicted count on all 62 scored generators: 0 on the 7 the rule clears, and the stated count on each of the other 55. Confirmed if (A) holds.

Falsifier(A) any generator whose count differs from the prediction. Unanticipated, recorded and not scored: a one-way pair in which neither subset is in U. Withdrawn if a control fails.

Settled70
run 018Does a dissipative chaotic PDE have discrete Ruelle resonances?CASE-18
run 019What survives of the lattice hypothesis when the lattice is replaced by a quasicrystal?the graded weakening of the trace identity's precondition
run 020Is a number that recurs across unrelated systems a count or a well-measured magnitude?CASE-19
run 021Can this framework compute a positivity bound rather than cite one?validates the bounding-mechanism table one revision after it was written
run 022Is the Ulam eigenvalue independent of where the cell boundaries fall?CASE-18
run 023Does the Ruelle resonance survive as the attractor dimension grows?CASE-18
run 025Does positivity give only bounds, or does it sometimes give values?resolves a tension in the bounding-mechanism table
run 030On the intermediate-growth host Cay(G/St(4)) (n = 4096), is the domain-wall free-energy barrier controlled by the host's local, low-dimensional structure — or does the entropy of near-minimal cuts eat it? First test of the scale-dependent-dimension speculation (N-026, P-025).
run 031Does the minimum bisection of Cay(G/St(n)) track the Schreier-fibre count |G_n|/2^n — a separator of order n/log n whose exponent climbs toward 1 — or does the exponent 0.76 measured between n = 128 and n = 4096 (run 030) hold? Decides whether the intermediate-growth host beats a 3D lattice as a classical memory beyond n ~ 10^5–10^6.
run 033The Ihara primes of the host are its relators. Kesten–Grigorchuk say their density is the free density (cogrowth maximal) iff the group is amenable, with the deficit a sub-exponential "error term". Is that error term visibly sub-exponential at word length ≤ 48 on the Grigorchuk group?
run 036Expander codes (Sipser–Spielman, Tanner) need unique-neighbour expansion of small sets; amenability kills expansion only asymptotically. Does the ⟨b,c,d⟩-coset graph of G/St(4) still expand small sets at a rate comparable to a random regular graph, so that the code guarantees degrade gracefully — distance ~ expansion × N ~ N/log N — rather than collapsing?
run 037Trained to grokking on multiplication mod p, which characters does a small network learn — the additive characters of Z/p, or the multiplicative (Dirichlet) characters, i.e. Fourier modes in discrete-log coordinates on (Z/p)^x?
run 040Run 034's instrument (Franz–Parisi at T = 1) failed its control and was withdrawn, but its second look stood unsealed — at T = 0, greedy pair-swap paths between minimum bisections of the level-4 ⟨b,c,d⟩-coset graph climb ~50 edges above the endpoints (28% of the 176 cut), against ~2 on a random 4-regular graph of the same size and ~0 on the level-3 coset graph. Is that barrier extensive — does it stay a fixed fraction of the cut at level 5, a thousand times larger — and does it stay separated from the random graph's?
run 041Run 036 measured edge expansion of the ⟨b,c,d⟩-coset graph at 0.78 of a random 4-regular graph's at s = N/8, and P-026 read the intermediate cell's code ceiling from it. But the quantity every expander-code decoder actually consumes — Sipser–Spielman's bit-flipping guarantee, Tanner's — is unique-neighbour expansion — the number of vertices outside S with exactly one neighbour in S — and a Tanner code on a 4-regular graph is degenerate anyway (rate-positive local codes on four bits have distance 2). So the sealable code question is the theorem's hypothesis, not the code: does the host have unique-neighbour expansion at all, at any level, and does the random control keep it?
run 042Two "two-flavor" splits have appeared on the intermediate-growth host. Run 036 — the geometric one — expander-like below a crossover scale, amenable above it. Run 040 — the energetic one — the 90,112 minimum is a flat valley of twins (|q| = 0.953, differing on 2.35% of cosets, barrier zero between them) with extensive walls (43.5% of the cut) between valleys. Are these the same split? Concretely — is a twin difference a collection of small, independent, cut-neutral patches (the local flavor), and a valley-to-valley difference one macroscopic front (the global flavor)?
run 046Runs 044 and 045 walked the Grigorchuk Schreier graph under isotropic operators (the Laplacian, then the equal-weight Hecke operator) and found a ballistic path both times — every leaf carries exactly one loop, so equal weights make the loop potential constant and the operator periodic. Grigorchuk–Lenz–Nagnibeda (arXiv:1412.6822) prove the Cantor spectrum for the anisotropic Laplacians, with different weights on the generators, because the aperiodicity of the Schreier graph is which of b, c, d fixes each leaf. Last operator this thread will try: does the boundary walk spread anomalously under an anisotropic Hecke operator?
run 047Run 046 found the Grigorchuk boundary walks like a quasicrystal under the anisotropic Hecke operator (β = 0.800) and run 044 found a random expander's walk saturates by t ≈ 2 and a path's is ballistic. Does the same walk on the boundaries of the other four groups of run 043 — odometer, IMG(z² + i), Basilica, Aleshin — sort them by growth class the way the bulk instruments are predicted to? The transport column of the growth axis on one tree.
run 051Run 049 was withdrawn on its control (the sealed p-grid could not resolve the square lattice at L = 2187). Unsealed, its grid-free numbers put two equal-dimension carpets, H and U, in one class (1/ν ≈ 0.55, 0.53), while an all-singleton carpet of the same dimension, U′, gave 1/ν ≈ 0.28 with a threshold still rising (0.866, 0.877, 0.881). Reseal with the estimator that passes the control, all three carpets at three common sizes: does the arrangement of holes change the class at fixed dimension, or only the threshold?
run 052Run 051 found the all-singleton carpet U′ in a different percolation class from carpets H and U at the same dimension (1/ν = 0.276 against 0.547 and 0.524), but its exponent sits beside the gasket's (0.263), and the gasket is finitely ramified. Is U′ effectively finitely ramified — a gasket crossover — or does it carry a cut set that grows with size, as an infinitely ramified carpet must?
run 053Runs 051 and 052 found three carpets of identical Hausdorff dimension whose percolation exponents 1/ν (0.547, 0.524, 0.276) sit at a near-constant fraction of their left–right cut exponents x (0.631, 0.631, 0.316): 1/ν ÷ x = 0.867, 0.830, 0.873. Is the class of a carpet at fixed dimension set by its cut exponent alone? Two new rooms decide it: one with a cut exponent the three do not have, and one with H's cut exponent in an arrangement unlike U's.
run 054Run 053 found carpets V and H sharing a cut exponent (0.631) and a bond count at every size, yet differing in 1/ν by 0.070 (0.477 against 0.547), with U between them (0.524). The size of the minimum left–right cut does not set the class. Does the NUMBER of distinct minimum cuts — how many ways the room can be cut at that size — order the three carpets that share a cut exponent?
run 055Run 054 found that the minimum-cut entropy per cut bond, s = ln N / C, orders carpets H, U and V (one cut exponent, 0.631) exactly as their percolation exponents do, s 0.693 < 1.058 < 1.153 against 1/ν 0.547 > 0.524 > 0.477. Is that an ordering of three rooms, or does s set the class? Choose two new rooms at the same cut exponent by s alone — one beyond V, one between H and U — and bracket each one's 1/ν from its neighbours in s before any percolation sample is drawn.
run 056The square lattice, measured with run 051's estimator at the same sizes, gave 1/ν = 0.7516 ± 0.0049 in run 053 and 0.7372 ± 0.0049 in run 055 — a shift of 0.014, about twice the standard error of a difference between two independent runs. Is the bootstrap error an honest measure of how far this estimator moves between independent runs, or does it understate it? The answer sets how narrow a sealed bracket can be.
run 057Birch and Swinnerton-Dyer read the rank of an elliptic curve as a growth exponent — the slope of log ∏_{p≤X} N_p/p against log log X. That is the same instrument runs 051–056 use on carpets: a global exponent fitted from local counts across a few decades of scale, where pair slopes drift. On curves whose ranks are known, over four decades of X, does the slope read the rank, and does the drift behave like a finite-size correction that shrinks with scale?
run 058Runs 054–055 found that the number of distinct minimum cuts orders the carpets' percolation exponents. That count is the leading coefficient of the generator's reliability polynomial, R(p) = the probability that one 9×9 generator is crossed left to right under bond percolation, since 1 − R(p) ≈ N_min · (1 − p)^C₁ near p = 1. Iterating p ↦ R(p) is a renormalization whose fixed point and slope give an approximate exponent, y = ln R′(p*) / ln 9, with R′(p*) the expected number of pivotal bonds at the fixed point (Russo). Does y, from one generator's polynomial and no sampling at all, order the measured exponents of all seven carpets and the square?
run 063Run 062's pool contains cut twins — distinct D4-symmetric 9×9 generators with identical minimum-cut counts N(g) at every generation (entries 5 and 12 twin X; 10 twins Y; 11 twins Z). If the one-block renormalization's miss y − 1/ν is set by the cut counts alone, twins have equal misses. Probe P-048 argues from run 061's first two-step value that it cannot be. (A) Do cut twins have different misses? (B) Does the weak version survive — do the two-step misses y₂ − 1/ν still order as c on the five known cut-4 lattices?
run 065Run 064 found that the ⟨b,c,d⟩-coset tower is not an exact renormalization under φ(μ) = μ(8 − μ)/2 (18 of 24 new level-4 eigenvalues orphans). Two things were never checked. (A) Does the classifier return zero orphans where exact decimation is a theorem — the level-n Schreier graphs Γₙ of the Grigorchuk group on the 2ⁿ vertices of level n, under their published map? (B) Since b, c, d all fix the vertex 1ⁿ, each coset graph covers Γₙ; is 064's negative an artifact of using φ rather than the Schreier map — does the coset tower decimate under the Schreier map?
run 066The block exponents y_g = ln P_g′(p_g*)/ln 9^g rose from g = 1 to g = 2 on every lattice (run 061). The panel's final House (PN-002) read the rise as a convergent sequence approaching the true exponent from below, as on the square, and concluded that the carpets' true 1/ν lie above y and that every carpet "miss" is a Monte Carlo deficit. The alternative: y_g = 1/ν + (ln A)/ln L carries a 1/ln L offset that can rise at small L while the local exponent falls, as the carpets' pair slopes do (runs 051–056, 061), so the carpet sequence should turn over. At g = 3 (L = 729), does y₃ fall below y₂ on the carpets while the square keeps climbing toward 0.75?
run 067A carpet may use a different 9×9 pattern at each level. Stacking X over U′ (X at the coarsest level, U′ in every kept cell, X again inside, and so on) gives a carpet whose dimension and minimum-cut exponent are exact averages of its parents' (ln(C_X·C_U′)/ln 81 = (3/4)·log₃2 = 0.4732). X and U′ both sit at 1/ν ≈ 0.874 × their cut exponent, so if exponents average under stacking, 1/ν(X∘U′) lands at 0.414, and the "ceiling" 1/ν ≤ 0.874·ln C₁/ln n (P-048) is also 0.414. Does the exponent of a stacked carpet average its parents' exponents — and is it at, below, or above that ceiling?
run 070Run 067 found that stacking two carpets of the same cut class (X over Y, both cut 4) averages their exponents, while stacking a cut-2 pattern with a cut-4 one (X over U′) lands 3.5σ below the average. If the rule is "mixing cut classes pulls the stacked exponent below the parents' mean", it must hold for other cross-class pairs. Does it hold for X over T (cut 4 with cut 3) and U′ over T (cut 2 with cut 3)?
run 072Run 069 found the width-standardized crossing curve indistinguishable across carpets by a Kolmogorov–Smirnov distance, but reported a moment that is not flat: the skewness of the standardized threshold distribution at L = 6561 is positive on every carpet (+0.11 to +0.55) and near zero on the square (+0.011), and in the three twin pairs whose exponents separate, the lower-exponent member has the lower skewness. On the carpets where it can be tested, is skewness reproducible across reseeds (X, Y, Z) and stable across sizes (fourteen carpets)? Only if it is does the twin separation mean anything.
run 074Run 073 read the skewness g₁ of the threshold distribution at three sizes a factor of 9 apart and found it built between 81 and 729 on thirteen of fourteen carpets, then turning back, levelling off or still climbing. The inkling filed with it is that every carpet traces one hump whose depth depends on the carpet. H, the standard 3×3 carpet, was sampled at five sizes a factor of 3 apart (81, 243, 729, 2187, 6561), and its values at 243 and 2187 have never been read. Seen at twice the resolution in scale, is H's curve one rise without a dip, concave from its start?
run 075Each 9×9 pattern has an exact one-block map, the crossing polynomial f(p) of run 058 (rg058.poly). Iterating it, R₀(p) = p and Rₖ = f ∘ Rₖ₋₁, gives at every depth k a cumulative distribution on [0, 1] (R₀ is the uniform threshold of a single site, R₁ = f is the exact L = 9 lattice, and depth k matches L = 9ᵏ). With Ψ the map's Poincaré function (Ψ(λx) = f(Ψ(x)), Ψ(0) = p*, Ψ′(0) = 1) and φ = Ψ⁻¹, the depth-k threshold is exactly Tₖ = Ψ(λ⁻ᵏ φ(U)) with U uniform, so its skewness is g₁ₖ = g(λ⁻ᵏ) for one analytic function g with g(1) = 0 and g(0) = g∞, approaching g∞ geometrically at rate 1/λ without oscillation. On the lattice, run 073 found g₁ turning back between 729 and 6561 on T and X1 and still climbing on X and Z. Is that turnover in the one-block map, which would need g(ε) to peak between λ⁻⁴ and λ⁻², or does it live in what the one-block map leaves out?
run 077Feigenbaum's universality sorts one-hump maps by the order z of their maximum; the amplitude of the maximum drops out. The carpets' crossing polynomials have no hump, but they have a fixed order of contact at the wall p = 1, 1 − R(1 − q) ≈ N₁ q^{C₁}, with the order equal to the minimum cut C₁ and the amplitude equal to the number of minimum cuts N₁ (checked on all 49 distinct functions at sealing). Run 076 found that the one-block composition deviation D depends on cut class beyond the fixed-point separation δ. If C₁ plays the part of the order and N₁ of the amplitude, then at fixed separation D should depend on C₁ and not on N₁. Does it?
run 078Runs 076–077 found that, at fixed fixed-point separation δ, the one-block composition deviation |D| depends on cut class C₁ (partial +0.60 over all pairs; +0.72 over unequal-class pairs with the amplitude (ln N₁)/C₁ also held) and not on the amplitude. PN-004's continuation House set two readings against each other. Order: C₁ is the order of vanishing of the crossing map at the wall, and a mismatch in it obstructs composition directly. Curvature: equal-C₁ patterns have similar curvature s = R″/(λ(λ − 1)) at matched p*, so the first-order term, proportional to s_A − s_B, cancels by arithmetic and C₁ only proxies the curvature mismatch. Which is it?
run 08043 census patterns have a measured 1/ν (14 measured by run 068, 15 by run 071, 14 carried as record values from earlier runs without errors). They cover 43 of the 49 distinct crossing polynomials, and every measured exponent sits close to the one-block y₉ of its polynomial, shifted by an amount that depends on the cut class C₁ and, within a class, on the number of minimum cuts N₁. Six distinct polynomials have never been measured: #9 and #10 (connected, cut 4) and #14, #15, #19 and #35 (multi-component at generation 2; one cut-4, three cut-2). A rule fitted to the 43 and frozen here predicts each of their exponents from y₉, C₁ and N₁. Does it hold on the six, and does the N₁ correction order the cut-4 exponents beyond what y₉ alone does, where nothing has yet been measured?
run 081Run 073 found the skewness g₁ of the crossing threshold falling between L = 729 and 6561 on two carpets, T (−0.191 ± 0.038) and X1 (−0.116 ± 0.045), while the exact one-block recursion rises at every depth on all 63 patterns. Each fall rests on one set of 8,000 samples per size, read alongside twelve other carpets, and run 079 has just shown a two-error pattern on H failing to replicate. Panel PN-005's House made replication the first question. Drawn again with fresh seeds and twice the samples, do the two falls come back?
run 083PN-005's House named the route the one-block recursion cannot represent: a lattice crossing that passes through a top-level block without crossing it left to right. Its test records, beside each sample's threshold t, the time t_coarse at which the coarse graph of top-level blocks first crosses, a block counting as open once it is internally crossed, and splits the samples on the sign of Δ = t − t_coarse. On T, whose skewness turns back between L = 729 and 6561, and X, whose does not: is the Δ < 0 subpopulation larger on T, and does it carry the lower skewness?
run 087P-050 read the census's local slopes and found the cut-4 exponents reading as a fan around y₉ — the spread of the local slope wider over 729→6561 than over 81→729 — carried by five patterns whose stored drift reads positive while thirty of thirty-five fall, only one of them beyond two drift errors: #60 (+0.043), #63 (+0.010), #10 (+0.012), #3 (+0.007), #33 (+0.001). Each rests on one set of 8,000 samples per size, and run 079 has shown a two-error pattern on H failing to replicate. Drawn again with fresh seeds, do the risers rise?
run 088Run 044's bulk clause was confirmed — on the Grigorchuk level-4 coset graph the quantum walker stays near its origin at long times (PR/N = 0.096, return floor 76/N) against a random 4-regular graph's PR/N = 0.99 — and P-045 reads it as a transport signature of the intermediate-growth cell. N-038's reductio audit pointed out that the only control is a random graph, so the instrument separates "Cayley-like with degenerate spectrum" from "random", not "intermediate growth" from "abelian". Does an abelian group with a flat-band spectrum show the same signature, and does an abelian group whose spectrum is not flat-banded (beyond one accidental band) not?
run 091Each sample's threshold is a minimax — the lowest level at which some crossing path is fully open — and its two tails are set by two different optimizations: crossing far below threshold needs the cheapest path, the ring, of length ∝ L; failing to cross far above it needs the cheapest blocking cut, of size ∝ C₁^g = L^(ln C₁/ln 9). With ξ ∝ |p − p_c|^(−ν) and the width w ∝ L^(−1/ν), both tails in the standardized variable y = (t − p_med)/w are predicted (a heuristic, not a theorem) to be stretched exponentials far out, ln S ≈ −c·y^α, with α₋ = ν below and α₊ = ν·ln C₁/ln 9 above. The predicted ratio α₊/α₋ = ln C₁/ln 9 < 1 says the upper tail is the heavier one on every carpet, more so the smaller the cut — which is the sign and the ordering of the map's limiting skewness (g∞ against C₁ at −0.81, run 075), and the square's zero skewness by self-duality (run 072). Across the census, does the tail asymmetry order with ln C₁/ln 9?
run 092The calibration note on run 081 found the bootstrap error of the skewness g₁ right within a file (pooled block-to-bootstrap ratio 1.00 over ten files) while files of one graph differ beyond their block errors at L = 6561 — T4: 0.172 ± 0.026 on samples053/T4.txt (the file run 073 read), run 070's 0.282 ± 0.028, run 081's 0.248 ± 0.020 (one-way F over blocks, p = 0.008); X1's F4: 0.216 against 0.348 (Welch on blocks, p = 0.005) — and not at 729. The two low files were drawn on the M5 (runs 053, 063), the three high ones in the cloud (runs 070, 081). perc.c's sample path is unsigned 64-bit integer arithmetic, so one (seed, index) gives one k on any machine unless a build is defective, and nobody has checked that. Is it one sampler on both machines, and on one graph with fresh seeds does the skewness at 6561 spread as the bootstrap says?
run 093The crossing polynomials of the 49 census fibres carry squares and a composition that nothing in the record explains. On all 13 cut-2 representatives 1 − R_P = c·(1 − p)²·S² exactly (deg R = 2 + 2·deg S), which is the crossing probability of two identical independent events in parallel, R = T(2 − T); and on #8 and #9 R_P is an even polynomial, R(p) = A(p²), a composition in Ritt's sense. A square in a probability polynomial is two independent identical events; an even one is a graph whose bonds come in series pairs. Are the two events the block's two mirror channels — disjoint sets of bonds exchanged by the top–bottom reflection — and are #8's and #9's pivotal bonds all in chains of even length?
run 094Run 084 scored rung 3 of the ladder on S₃ = {1, 4, 7}: X's local slope over 729→6561 is below T's by 0.131 ± 0.007 where the carpet has it above by 0.18. The score's caveat blamed the rows: S₃ designates neither of the two interior rows X keeps whole (2 and 6). The masks do not bear that out at level 1. The shortest path from a W terminal to the nearest E terminal is 10, 10, 10 bonds on T and 10, 11, 10 on X at S₃ — the set does not place X's terminals visibly worse — and the one position where the two patterns differ is the midpoint: on T the cell (4,0) opens onto the spoke (4,1); on X (4,1) is removed and (4,0) is a corridor cell. The midpoint is in every rung whose state closes, and above level 1 every join lands on the midpoint terminal of a sub-block whatever the set is. S₃′ = {2, 4, 6} keeps the midpoint and moves the two outer terminals onto X's whole rows and onto T's corridor cells ((2,0) and (6,0) have degree 2 on T and 3 on X; the level-1 path lengths become 12, 10, 12 on T and 8, 10, 8 on X). Does the carpet's order of T and X return when the outer rows favour X, or does the reversal survive the move?
run 095P-054's look found that on T and X at L = 729 the sizes of invasion bursts — the runs of accepted links from one forced link to the next, growth from the whole left side — follow a power law with a ripple about it whose period is a factor of about 55–64 in size, T's twice X's and none on the square. Is the period the hierarchy's cell factor, and does the ripple survive a point source? H (#17, the Sierpinski carpet's second generation; gen.py's H6 has L = 729) is self-similar at every factor of 3 in side, so its cell factor per level is 8 where T's and X's is 64. On H, with the full-side source, is the ripple's period 8 rather than 64? And on T, does a point source keep the peak at the 1,400 bin and the trough at the 200 bin?
run 096Scaffold S2 (single-exponent scaling, w ∝ L^(−1/ν)) has its first data against it in a reading, not a result: run 079's five ln w values for H (#17, the Sierpinski carpet's second generation; the only census pattern with sizes at every power of 3), 48,000 samples each at L = 81, 243, 729, 2187, 6561, lie on a straight line in ln L with χ² = 8.28 on 3 degrees of freedom; the weighted quadratic coefficient is +0.00319 ± 0.00112 (+2.85 errors); the pair slopes fall 0.553, 0.550, 0.541, 0.533; in the census's unit the drift is −0.0147 ± 0.0058. Run 079 scored a different question (a period-two term; falsified) and this curvature was found afterwards in its record. Drawn again with fresh seeds at the same five sizes and the same 48,000 samples, is the curvature there?
run 098Within a group of patterns that share one core, how much does a pendant part lower the lattice threshold at L = 729? The sign is fixed by containment; the size is not. Is the size a property of the part and of the cell it hangs on, about the same on three different cores, and does it carry over to the cut-2 groups?
run 100On H's two stored sets, with the mean, ln S and g₁ fitted jointly under PG-03's three one-term forms, tying the correction exponent ω to 1/ν costs Δχ² = 11.28 (each file's covariance; 8.54 with diagonal errors) on all five sizes and 1.47 (0.59) with L = 81 left out. Is that a property of H or a fluctuation at the smallest size? Drawn afresh with the errors at 81 and 243 cut to about a seventh of the pooled stored errors and at 729 to four tenths, does the tied one-term form fail on the new files alone?
run 101On the sixteen stored minimum bisections of the level-5 ⟨b,c,d⟩-coset graph (cut 90,112), read on 2026-10-04, exactly 40,960 free cosets are independently flippable on every one, and they lie over the map to level 4 the same way on every one. Is that true of every minimum this route reaches, or were the sixteen one kind among several, as level 4 has two? 183 stored METIS partitions left the 131,072 basin and were never projected onto the coset graph or quenched there. Quench all of them and read the same counts on every minimum that results.
run 102The free one-term form (ω its own parameter; the forms are run 100's), fitted on run 100's six files at L = 81 (H4a, H4b), 243 (H5a, H5b), 729 (H6) and 6561 (H8), predicts H's three moments at L = 2187 — ln S = −5.4449911 ± 0.0012293, mean = 0.6843628 ± 0.0000088, g₁ = 0.3634693 ± 0.0042900 (profile errors, χ² ≤ min + 1 in all nine parameters). Run 100's H7 (samples100/H7.txt, 144,000 samples, perc seed 7936) sits within one combined error of that prediction in every moment (−0.97, −0.09, −0.57). Drawn again at 2187 with ten times the samples, so that the file's error falls to 0.4 to 0.6 of the prediction's, does the prediction still hold?
run 105The free one-term form (ω its own parameter; the forms are run 100's), fitted on run 100's seven new files at L = 81 (H4a, H4b), 243 (H5a, H5b), 729 (H6), 2187 (H7) and 6561 (H8), predicts H's three moments at L = 19,683 — ln S = −6.6218285 ± 0.0032965, mean = 0.6833995 ± 0.0000125, g₁ = +0.4230883 ± 0.0074911 (profile errors, χ² ≤ min + 1 in all nine parameters; the fit is χ² = 12.406 on 12, 1/ν = 0.5260, ω = 0.3009). Drawn at 19,683 with 48,000 samples, does the prediction hold?
run 107Does the orbit through which the cut-2 wall enters the second ring order the lattice exponent? Thirteen of the nineteen cut-2 patterns have a lattice 1/ν (runs 068, 071, 080); every midline-entry pattern is above every corner- or off-axis-entry pattern (0.303 at the lowest midline, 0.276 at the highest other). Six are unmeasured: midline entry #49, #54, #55; off-axis entry #42, #43, #46. Do the six fall on the sides the orbit assigns them?
run 108Does the algebraic connectivity λ₂ of a generator's kept-cell graph (the second-smallest eigenvalue of its graph Laplacian at generation 1) order the lattice exponent 1/ν across the census as well as the cut readings do?
run 109For each stored sample, the second crossing t₂ — the fraction of bonds open when left and right are first joined after the single bond that completed the first crossing is deleted and the same bond order continues — and the gap (t₂ − t)/w in widths of the first crossing's pile. Does the gap order H, U, V as their minimum-wall counts do; is it anti-correlated with t within a file; and is the lean of t₂'s pile on T at 6561 above the lean of t's?
run 111On the diamond hierarchical lattice with recursion R_{b,s}(p) = 1 − (1 − p^s)^b, is λ(b, s) = R′_{b,s}(p*) equal to λ(s, b) on the pairs (2,5)/(5,2), (3,5)/(5,3), (2,6)/(6,2)?
run 112Does the object-side predicate "G owns an object in the 24-component" reproduce the symmetry-side split of the 26 sporadic groups into the happy family (20) and the pariahs (6) exactly, group for group?
run 113Does the inherited predicate — "G is the stabiliser, in Co₀ or the Monster, of a named substructure of a 24-object, or sits in a chain of such stabilisers" — reproduce the happy/pariah split of the 26 sporadic groups exactly, on the readers' reports of run 112, with no new reader?
run 116Under four kinds — W (the whole Golay code, Leech lattice or V♮), V (a piece of Λ or the Golay code), R (a coordinatisation of Λ), F (the fixed set of a non-identity element or subgroup of M on V♮) — does every happy-family group have at least one kind, with the roots exactly {M₂₄, Co₁, M}?
run 118For which conjugacy classes pX of elements of prime order p in the Monster is the centraliser C_M(pX) a direct product p × S with S a sporadic simple group, and is p = 11 the only such prime whose S is a Mathieu group?
run 122On census generators run 119 did not build, does a single-cell flip change the block transfer operator T exactly when the cell lies on a simple path between two distinct cells of the left and right columns?
run 125On the continuous band family, is the stable-born 3-cycle's multiplier at or below −8 at every point where the map reaches the log 2 ceiling, the crisis R²(c) = q?
run 128Past k = 30, does the band family's closest approach to −8 at the crisis keep approaching from below at the rate k⁻², while the other cycle approaches +8 at the slower rate k⁻¹?
run 129At k = 72 to 128, do the closest approach's four scaled quantities extrapolate to the derived limits, d₋k² → 27.2532, d₊k → 8.28684, (b − a)/√k + k^{−1/2} → 0.931582 and (a + b)/(2k) → 0.683325?
run 130A host that keeps the dilations by 3 (H) may carry comb teeth only at the frequencies those dilations allow, the even teeth of the base-64 comb in ln(burst size). A host that keeps every dilation (the square) may carry none. At L = 2187, with fresh seeds, are H's odd teeth absent, and are all of the square's teeth absent, while H's even teeth are present?
run 131On sixteen fresh 9 × 9 blocks, none in the census and half with a kept column-7 cell cut off from the left, does the number of one-way pairs of the block transfer operator equal |U′|·(511 − |U′|), with U′ from the corrected flood-fill rule?
run 132On five census blocks no operator run has built (20, 35, 36, 39, 44), does the graph-only core rule say exactly which single-cell toggles give the same block operator? Two things are asked. Which off-diagonal wedge toggles c give T_c = T_{cᵀ} under the main-diagonal mirror? Which pairs of visible wedge toggles give T_c = T_d?
run 133On fresh draws of H at L = 2187, if the comb's even-tooth period P is fitted instead of fixed at 8, do the odd teeth vanish at the fitted period?
run 134Does the forbidden k = 3 tooth on H come from the full-side source? On H7 grown from one point, at its own fitted period, is the tooth absent? And beside it, reported and not scored: does the period drift between the lower and upper halves of the window?
run 135On the nine blocks with no one-way pairs, is the block operator reversible in the detailed-balance sense in some diagonal metric? Equivalently, does the log-ratio ln(Q[S,S′]/Q[S′,S]) carry zero curvature on every face of a cycle basis of Q's support?
run 136On one row of nine blocks (a 9 × 81 strip) of each of H, U, U′, T and X, how far does chaining the block's left-to-right operator T fall short of the strip's exact crossing? T misses only clusters that cross a seam and come back, so this measures the back-flow. How far short does truncating T to rank k fall?
Retired12
run 034Run 032 identified the glassy walls of run 030 with the minimum-bisection landscape of the ⟨b,c,d⟩-coset graph, a spin glass by Fu–Anderson. Identification is not measurement. Is there a free-energy barrier around a minimum bisection that a torus does not have, and does it grow with the graph?
run 049The dictionary's §45 claim that phase transitions need infinite ramification is a literature theorem (Gefen–Mandelbrot–Aharony 1980–84), retrodicted, not found. The part that is not settled is §43's reading of it — that on a fractal the universality class is set by the room (lacunarity, how the holes are arranged) and not by the Hausdorff dimension. Two Sierpinski carpets of identical dimension log 8/log 3 but opposite lacunarity: do they percolate in the same class?
run 082Probe P-049 builds, for any census pattern, the rung-k lattice F_k: the carpet with its block-crossing bonds thinned to k per shared edge at every level, so that adjacent blocks of any level are joined by exactly k bonds. F_k is finitely ramified and its crossing recursion closes on the connectivity partition of 4k terminals; rung 0 is the one-bit iterated map of run 075, which never turns. On the lattice, T's skewness turns back between L = 729 and 6561 and X's does not (run 073). Does the turn appear already at rung 1, the first object with a route through a block that does not cross it, and does rung 1's exponent for T lie between the one-bit value and the measured one?
run 090Each sample's threshold is a minimax — the lowest level at which some crossing path is fully open — and its two tails are set by two different optimizations: crossing far below threshold needs the cheapest path, the ring, of length ∝ L; failing to cross far above it needs the cheapest blocking cut, of size ∝ C₁^g = L^(ln C₁/ln 9). With ξ ∝ |p − p_c|^(−ν) and the width w ∝ L^(−1/ν), both tails in the standardized variable y = (t − p_med)/w are predicted (a heuristic, not a theorem) to be stretched exponentials far out, ln S ≈ −c·y^α, with α₋ = ν below and α₊ = ν·ln C₁/ln 9 above. The predicted ratio α₊/α₋ = ln C₁/ln 9 < 1 says the upper tail is the heavier one on every carpet, more so the smaller the cut — which is the sign and the ordering of the map's limiting skewness (g∞ against C₁ at −0.81, run 075), and the square's zero skewness by self-duality (run 072). Across the census, does the tail asymmetry order with ln C₁/ln 9?
run 099On H's two stored sets, with the mean, ln S and g₁ fitted jointly under PG-03's three one-term forms, tying the correction exponent ω to 1/ν costs Δχ² = 11.28 (each file's covariance; 8.54 with diagonal errors) on all five sizes and 1.47 (0.59) with L = 81 left out. Is that a property of H or a fluctuation at the smallest size? Drawn afresh with the errors at 81 and 243 cut to about a seventh of the pooled stored errors and at 729 to four tenths, does the tied one-term form fail on the new files alone?
run 103For each census pattern with stored widths at 81, 729 and 6561, the stored drift is d = s(81, 729) − s(729, 6561), where s(L₁, L₂) = −[ln w(L₂) − ln w(L₁)] / ln(L₂/L₁) is the local slope of the 20th–80th percentile width w of the per-sample crossing threshold. A new width at 2187 gives the curvature c = s(729, 2187) − s(2187, 6561) = [ln w(729) + ln w(6561) − 2 ln w(2187)] / ln 3, which needs no exponent. If the drift is a single power-law correction with exponent ω, then c/d = 2·9^(−ω)/(1 + 3^(−ω))², which is 0.50 as ω → 0, 0.42 at ω = 0.15, 0.35 at 0.3, 0.27 at 0.5, 0.20 at 0.7 and 0.125 at 1 — no single power law gives more than 0.5. If the drift has died out above 729, c is zero whatever d was. Over the census, does c follow d at a power-law rate, and is its aggregate sign the drift's?
run 104For each census pattern with stored widths at 81, 729 and 6561, the stored drift is d = s(81, 729) − s(729, 6561), where s(L₁, L₂) = −[ln w(L₂) − ln w(L₁)] / ln(L₂/L₁) is the local slope of the 20th–80th percentile width w of the per-sample crossing threshold. A new width at 2187 gives the curvature c = s(729, 2187) − s(2187, 6561) = [ln w(729) + ln w(6561) − 2 ln w(2187)] / ln 3, which needs no exponent. If the drift is a single power-law correction with exponent ω, then c/d = 2·9^(−ω)/(1 + 3^(−ω))², which is 0.50 as ω → 0, 0.42 at ω = 0.15, 0.35 at 0.3, 0.27 at 0.5, 0.20 at 0.7 and 0.125 at 1 — no single power law gives more than 0.5. If the drift has died out above 729, c is zero whatever d was. Over the census, does c follow d at a power-law rate, and is its aggregate sign the drift's?
run 115On the twenty happy-family sporadic groups, do the three kinds of substructure they stabilise — V (a piece of the Leech lattice or Golay code), R (a ring or coordinate structure on the Leech lattice), F (the fixed points of an element or small subgroup of the Monster on V♮) — nest as R ⊂ V ⊂ F, group for group?
run 120With the distance to period three measured on the map's core in both orientations (O₂), is O₂'s sign exactly the period-3 test on run 114's 286 exclusive rules, and does O₂ increase along the not-all-equal rules?
run 121Does O₂'s sign — the Li–Yorke slack on a hump map's core, in either orientation — separate period three exactly on hierarchical rules no run has computed: the NAE and band rules at k = 13 … 16, and random rules from the full box at k = 7 and 8?
run 126On the 63 census generators, does the number of one-way pairs of the block transfer operator equal |U|·(511 − |U|), with U fixed by the right-column holes alone?
run 137(T) On fresh full-side draws of H8 at L = 6561, does the 3/2 tooth (k = 3) survive every member of the declared set of backgrounds? (D1) Does the top-end drop, a sharp step in burst size at L = 2187, stay at a fixed burst mass or move with the system? (D2) If it moves, is its shift factor between L = 2187 and L = 6561 nearer the comb's period P or nearer 8?

Panels

9 total · 9 settled

PN-001case CASE-08house ASettled

Unmet precondition, not missing geometry — OS positivity needs a named half-space (only conjugation is in hand), and the finite-field flip suggests positivity is a parameter-indexed threshold, not an attribute of the space; the four accounts stay unrankable and the fourth smuggles in the case's own verdict.

PN-001 — what geometry supplies the positivity for a Lefschetz-trace argument · run 2026-09-14, derivation roster (physics) · two rounds, one lab step · resolved: open

Seatsledger, framing, hypothesis, lateral

Bound firedfalse

PN-002case CASE-25house ASettled

Weight moves off mechanism: cut counts (s, c) are dead by the Y/G2 cut twins and the uniform bias floor by X's zero miss; the square lattice (y below the exact exponent, y2 climbing toward it) suggests the carpet 'miss' is a Monte Carlo deficit, and the estimator's scaling-regime failure on Y outranks the mechanism debate.

PN-002 — A one-block polynomial ranks exponents exactly and misses every value: what sets the miss? · run 2026-09-29, lab roster (physics) · two rounds, one lab step · resolved: open

Seatsledger, framing, hypothesis, legitimacy, lateral

Bound firedfalse

PN-003case CASE-26house ASettled

The case's premise is gone — 5 of 45 original pairs misordered and three of four twins invert against y9, all four twins measuring below their originals; the House reads the uniform sign as either geometric loading of the correction amplitude (Lateral) or a still-falling-slope estimator confound (Hypothesis, Legitimacy), unseparated; Z/Z1 (both flat, order preserved, magnification 2.5) is the clean template.

PN-003 — A slowly converging sequence of block estimates ranks exponents exactly at every block size — why does the order survive when the values do not? · run 2026-09-29, lab roster (physics) + Reductio (one-off, round 2) · two rounds, one lab step · resolved: open

Seatsledger, framing, hypothesis, legitimacy, lateral, reductio

Bound firedfalse

PN-004case CASE-27house ASettled

Both new stacks came in above their parents' mean, killing the panel's round-1 deficit forecasts; the House moves the weight to the exact one-block object, whose deviation from the parental mean rises with the fixed-point separation |Δp*| across all four pairs, reads cut class as a confounded proxy, and treats the Monte Carlo signs as unconverged (the U′,T build orders differ by 4.1 SE).

PN-004 — Stacking two carpets averages their exponents when their cut classes match and falls below the average when they do not — why? · run 2026-09-30, lab roster (physics) + Reductio (one-off, round 2) · two rounds, one lab step · resolved: open

Seatsledger, framing, hypothesis, legitimacy, lateral, bound, reductio

Bound firedtrue

PN-005case CASE-28house ASettled

The House puts significance before mechanism: T's and X1's falls are single 8,000-sample sets read from fourteen carpets at once, so it declines to explain the turn before a fresh-seed rerun, and names its diagnostic for after: a coarse block-graph crossing time t_coarse, split on the sign of Δ = t − t_coarse (a lattice crossing the one-block recursion cannot represent).

PN-005 — The skewness of the crossing threshold turns back on some carpets between L = 729 and 6561, while the exact one-block recursion's keeps rising — where does the turn come from? · run 2026-10-01, lab roster (physics) · one round, closed after House 1, no lab step · resolved: open

Seatsledger, framing, hypothesis, lateral, bound

Bound firedtrue

PN-006case CASE-28house ASettled

T's fall is real at −0.091 ± 0.022 on eleven files and X1 is not a second instance; the recursion-illegal early-crossing part grows with L yet carries no fall, so the turn sits in the coarse-respecting minority and the ledger's premise that it originates in what the recursion omits is refuted as stated. Statistic for the next run: the laggard gap, the largest minus the second-largest block crossing time on the first completing block path, in width units.

Continuation of PN-005 (docs/v5-plan.md §12.7): the same five seats, cold to the framework, given the case, their own round 1 and House 1, and the lab report of runs 081, 083, 089 and 092 (numbers only), plus a one-off Reductio seat; one round and a House final. Body below is the tool's export, unedited beyond the id.

Seatsledger, framing, hypothesis, lateral, bound, reductio

Bound firedtrue

PN-007case CASE-29Settled

Weight on Lateral's object: R is one marginal of the block's four-side boundary-partition polynomial, and the gluing of blocks consumes the rest. Asserted discriminator: P_X(p), the probability that the block is crossed left to right and top to bottom at once, at the group's p*, with the member of larger P_X crossing later on the lattice. Framing's diverging-rates reading is refuted on the table's own absolute gaps; Hypothesis's run confound is refuted on corrected provenance (#63 is run 071's, and the agreeing pair #37, #33 has the same run pairing). Next: enumerate P_X on the twenty-two members of the eight groups before sampling the ten.

One round and a House, closed after House 1 (docs/v5-plan.md §12.2, S2). Body below is the tool's export of 2026-10-03, 20:40 Phoenix, unedited beyond the id; the heading's title is the one typed in the tool's form. History of this file: it was first filed on 2026-10-03 from the page's on-screen text with no House, because the House call returned no text three times (twice as loaded, once with the record packet off); that filing is in git. The tool was then fixed (differential/README.md: retry, paste, export without a House), the open run was lost on a reload and restored from the Differential chat's copy of the saved state as of about 18:42, and the House call returned at the first attempt on Version 19. The export carries no origin line, so the House is a returned one on the tool's usual tier. Round 1 and its checker are the same draw as in the first filing. Settings: in round 1 the record packet was sent per axis (packet-full.txt, 22 facts; the seats cite F01 to F22); the export's "Record packet: mode off" and "Seat record: off" describe the House call, which ran with the packet off as the restored state had it. The export has no "Checker — House 1" table, although its contract-check line names H1 rows.

Seatsledger, framing, hypothesis, lateral, bound

Bound firedtrue

PN-008case CASE-30Settled

The count is a function on the set of ground states, not an invariant of the graph (level 4 has 8 and 0 at one cut), and sixteen draws from one route do not license 'always 40,960'. Fitted on three levels: count = (k/32)·W_n with k in {0, 1, 10}; a second level-5 kind, if one exists, most plausibly at 4,096.

One round and a House, closed after House 1 (docs/v5-plan.md §12.2, S2). Body below is the tool's export of 2026-10-04, 18:20 Phoenix, unedited beyond the id; the heading's date is the tool's UTC stamp. Record loaded (S3; PN-007 ran without): the seat record as a generated view of every seat row (82 rows; panels/SEAT-RECORD.md itself is read by the tool only as far as its first table, OPS 2026-10-04), the record packet shared. Two tool faults were worked around before the round and are in MANUAL: the audit's refusal of the words "the map", and the frozen roster that kept Consult disabled until a placeholder row was written to the artifact's database. The House's FORCED 3 and forecast F4 rest on a misreading of one sentence of the case, which the case's note of the same day corrects: 12,759 is the count on the off-basin state, not the cut edges without such an end (105,554), and the identity holds there.

Seatsledger, framing, hypothesis, lateral, bound

Bound firedtrue

PN-009case CASE-31Settled

Identity (2) does not by itself predict a sign. N(g) does not set the lean: at 729 H (N1 = 16), U (48), V (64) lean +0.349, +0.146, +0.277, not monotone in N1; on the diamond (3,3) has 27 minimum walls against 3 paths and leans −0.162. The sign tracks minimum-wall size C against shortest-path length l: C < l positive, C ≥ l negative. The wall count orders sharpening (1/ν) but not the lean.

One round and a House, closed after House 1 (docs/v5-plan.md §12.2, S2). Run by the runner across two Claude Code sessions: the first was ended by a safeguard flag on the House prompt after checker.r1 had returned; a second session resumed from the inbox and returns/ and dispatched house1, checker.house1, backprop and the matcher. Record NOT loaded (S3 alternation after PN-008). Live roster not compared (--no-live-roster). Body below is the runner's export of 2026-10-20, unedited beyond the id. The blindness caveat above is the dispatcher's own statement and is part of this record. The codifier's post-panel reading is in cases/CASE-31-best-wall-weakest-link.md; the codifier's sealed predictions were stripped from the inbox (0 occurrences in the inbox copy).

Seatsledger, framing, hypothesis, lateral

Bound firedfalse

Exemplars

14 total

EX-02algebraobject

the model compact group — U(1); Fourier analysis and Pontryagin duality at their self-dual, rank-one base case

The circle is the minimal compact group and the home for everything periodic: its representation theory is Fourier series, and it is its own Pontryagin dual. When a problem carries a compact symmetry, the circle is the case understood completely — the one to specialize to for what "compact" buys, before noncommutativity or higher rank arrive.

EX-05algebrashape

a quantity determined only up to the action of a group G — no calculation fixes it; you perform a G-element and observe, or find independent structure that breaks G

The shape: a quantity fixed only up to a group action is not computable — it is resolved only by physically performing a group element (the antineutrino beam is U → U*) or by finding structure that breaks the group. Calibration question: when the Synthesist says "X is undetermined," is X undetermined up to a group action (this shape — resolve by performing) or genuinely open? It recurred across the Hall carrier sign, matter/antimatter, chirality and cosmic topology before it was named — the recurrence is its reach.

EX-09geometry-topologyshape

the structure is unique, so any invariant at all determines it — a second-order "the moduli space is a point" that licenses a determination without performing one

The shape: when a structure is rigid — a closed hyperbolic manifold of dimension ≥ 3 has a unique hyperbolic structure, its deformation space a point — any invariant determines it, because there is only one thing it could be. Rigidity licenses a determination and never performs one (the volume is computed by a separate dilogarithm machine); its no-geometry form is multiplicity-one in R ⊗ R̄ (Wigner–Eckart). Calibration question: is "X pins down Y" really "Y is rigid, so anything pins it down"?

EX-12geometry-topologyshape

a method that recovers the correct quantity but is blind to its place — the value is right, the location or global form unexhibitable

The recurring signature failure of the hardest cases: a method gets the quantity right and is blind to its place. Curvature fixes the local metric datum but not the global form — SL₂ and PGL₂ share the hyperbolic plane, and which cover you inhabit lives in the lattice, not the metric. The spectrum fixes the eigenvalues but not the operator's placement — isospectrality, until the minor spectra are added back. The anonymous obstruction has local data at every place and no global witness; the residue of a group action gives a value you can produce by performing the group element but never exhibit as a certificate. In each, the magnitude is correct and the localization is lost.

EX-14geometry-topologyobject

the right coordinate makes a structure obvious — a change of chart that trivializes what looked hard and reveals the invariant that was always there

The Mercator projection is the complex logarithm of stereographic projection. Stereographic projection sends the sphere to the complex plane conformally; the complex logarithm sends ℂ* to a horizontal strip, turning multiplication into addition and rotation into vertical translation. Composed, they are Mercator — which is why Mercator is conformal, and why a loxodrome (a path of constant compass bearing) becomes a straight line: a constant bearing is a constant argument increment, and log turns that into a constant slope. None of this is visible in the sphere's own coordinates; the right chart makes the conformal structure and the straight-line rhumb both immediate.

EX-06logic-computabilityshape

a determined quantity certifiable from one side only — which end of an interval is open is fixed by which direction admits a finite certificate (Σ₁ vs Π₁)

The shape: a magnitude with no bridge is known as an interval open at one end, and which end is fixed by which direction of its defining statement admits a finite certificate — Σ₁ (exhibit a witness) versus Π₁ (rule out all). Busy beaver is lower-certifiable, circuit lower bounds upper-certifiable, cosmic topology Σ₁ for "nontrivial." Calibration question: is this one-endedness a fact about the quantity, or about which quantifier its definition puts first? The latter is the match.

EX-10logic-computabilityshape

an independent axiom is a residue — undetermined by the rest, certifiable only by exhibiting a model, resolved not by proof but by choosing among consistent completions (Euclidean / hyperbolic / spherical = flat / negative / positive curvature, the three constant-curvature homogeneous geometries)

The founding case of the residue shape, two millennia before the modern ones. Euclid's fifth is neither derivable from the other four nor refutable from them: it is a residue, undetermined by the rest, and its certificate is a model — Beltrami's disk, the sphere — never a derivation. Σ₁ from below (exhibit a geometry where it holds or fails), Π₁-blocked from above (no proof settles it): an existence-form residue on the certificate-direction axis (the EX-06 shape). The three consistent completions are the three constant-curvature homogeneous geometries, so the residue is a group-action residue in the EX-05 sense — fixed only by choosing which homogeneous space, which isometry group, you inhabit. This is the residue-of-a-group-action at its founding.

EX-03number-theoryobject

the model reciprocity law — local symbols at every place multiplying to one

Quadratic reciprocity is the reciprocity law understood in the hand, and the template for the rest: a global constraint that is really the places conspiring — local symbols multiplying to one. Every deeper reciprocity (Artin, Hilbert, higher) reads as this, for a larger group or higher degree. The home for "a global fact that is the local data agreeing."

EX-04number-theoryobject

the sign is a homomorphism" — one ℤ/2 invariant realized identically as permutation parity, a determinant sign, and a Legendre symbol

Zolotarev's lemma identifies the Legendre symbol with the sign of a permutation — reciprocity falling out of the fact that sign is a homomorphism to ℤ/2 that several structures share. The home for the move "this ℤ/2 invariant is one homomorphism in three costumes," and exactly the small case the group-action-residue shape ([[EX-05]]) generalizes: a residue that is a single sign because sign is a homomorphism.

EX-11number-theoryshape

the abelian-to-nonabelian transition read through commutativity-as-flatness — an abelian reciprocity is a flat symmetry-action of a group of characters, and turning the symmetry side nonabelian (curved) is the general step

Quadratic reciprocity reads two ways, and they are two layers of one answer, not competitors. Surface: flat-with-defects commutativity for primes — the Hilbert symbols multiply to one over all places, ∏_v (p,q)_v = 1, a symmetric form whose only defects sit at 2 and ∞; reciprocity as a fact about how local signs must agree. Depth: distributivity — Artin reciprocity makes one arithmetic structure (residues mod q, the ray class group) the symmetry group of another (the Galois group of an abelian number field), which is exactly "one structure acts as the symmetries of another." QR is the quadratic, abelian instance of that symmetry-action, and the product formula is what that instance looks like from the surface. The general step: Langlands is what the shape becomes when the symmetry side goes nonabelian — the Galois group is no longer captured by characters that form a group, and one-dimensional representations give way to higher ones. The shape is the abelian-to-nonabelian transition read through commutativity-as-flatness: a flat (abelian) reciprocity as the base case, curvature (nonabelianity) as the general step.

EX-13number-theoryobject

local-to-global reciprocity as one object: the invariants at all places, combined, cancel to the identity

The product formula is one object that keeps arriving under different names. As absolute values: ∏_v |x|_v = 1 over all places of ℚ — and Ostrowski's theorem, the census of those places, is exactly its index set. As Hilbert symbols: ∏_v (a,b)_v = 1, Hilbert reciprocity, the product of the local quadratic symbols is trivial. As the Brauer exact sequence: 0 → Br(K) → ⊕_v Br(K_v) → ℚ/ℤ → 0, the sum of local invariants is zero. These are not three analogies but one theorem read at three degrees — the reciprocity of class field theory, of which the |x|-formula is the degree-one (norm) shadow and Hilbert reciprocity the degree-two (ℤ/2) shadow. The single fact: local invariants at every place, combined, cancel.

EX-01probabilityobject

a free / quadratic theory — every moment reducible to the two-point function; solvable because nothing interacts

The Gaussian is the model of a free theory: a quadratic action, Wick's theorem reducing every moment to the covariance, no interaction to spoil solvability. It is the home for "this is the exactly-solvable part"; whatever is left after subtracting it is, by definition, the interaction. Reaching for it is reaching for the question what is the free piece here, and what does the remainder cost?

EX-07spectralshape

a spectrum forgets the shape (isospectrality); minor spectra remember the eigenvector moduli (the eigenvalue–eigenvector identity) — rigidity recovered up to a residue

The shape: an invariant that looks complete forgets something (a spectrum forgets the eigenvectors — isospectral drums, A vs QAQᵀ), and the repair is not a different tool but more of the same invariant (minor spectra recover the moduli), restoring rigidity up to a residue that is a group action ([[EX-05]]). Calibration question: when an invariant fails to determine its object, is the fix a richer version of the same invariant — and what residue is left?

EX-08spectralshape

compute one quantity two ways — Σλ = ∫K(x,x) — a spectral sum equal to a geometric integral, because the trace is conjugation-invariant

The shape: a single quantity evaluated once spectrally and once geometrically, forced equal because the trace does not see the choice of basis. Poisson summation, Selberg, Gutzwiller, Grothendieck–Lefschetz, the heat-kernel index theorems and Weil's explicit formula are one theorem; dimension-counting is it at its most trivial. Calibration question the Synthesist's "X is like Y" is checked against: is this two evaluations of one conjugation-invariant quantity, or only a resemblance?

Probes

49 total · 45 open · 4 settled

Open45
P-001Chain decay of Ω-class correlations in blocksderivation
P-002Ω-parity organisation of block fluctuations vs. the sieve parity problemlead
P-003Does the index theorem straddle two licence mechanisms, or reduce to one?derivation
P-004Positivity's two roles: does it produce data or remove a hypothesis?derivation
P-005Do the two singular limits commute — c → ∞ and ν → 0?derivation
P-006Does the chromatic/anonymous discriminator turn the false-friends list into a decision procedure?structural
P-007Does the Differential roster have a seat for the friction itself, or only for its explanation?structural
P-008Is there no exceptional scale for dyadic Chowla sums?lead
P-009Are the two live twin-prime bets two halves of one statement?structural
P-010Determined but uncomputable — a fifth magnitude slot, or a different axis?structural
P-011Is rediscovery count correlated with namelessness?lead
P-012Interferometric access gives shape without magnitudeprediction
P-013Does the T/G/P/M family split have a stated domain?structural
P-015Are dimensionless constants special values of L-functions?speculative
P-016Are cooling and a clock one mechanism?speculative
P-017Does Collatz need all primes (an adelic obstruction)?speculative
P-018Is causal bracketing an instance of non-associativity, or an interpretive gloss?speculative
P-019Does every computable magnitude come through a convex dual?speculative
P-020Is the Brauer–Manin obstruction an instance of the anonymous fixed-point obstruction?speculative
P-021R1's recorded prior: a sealed bet on a run never executedprediction
P-022Are the topological-existence and constructive-arithmetic halves one phenomenon or two tools?
P-023Gap-spacing prediction — 2/5, with the diagnosed fix never built
P-024Codimension c is classified by π_{c−1} — settled as a coordinate, held pending a novel absence
P-025Topological protection conserves non-locality — the measure is the distance exponent, and the frontier has an open corner
P-026Primes upstairs, zeros downstairs — the growth trichotomy as a prime-number-theorem / Riemann-hypothesis dichotomy on the host graphclaim
P-027Can the staircase of a deep linear network's loss be read backwards, as a measurement of a chosen spectrum?lead
P-028Is the period-doubling past the edge of stability Feigenbaum's cascade, and in what dimension does that stop holding?lead
P-029Is the double-descent spike at p = n quantitatively the Marchenko–Pastur edge?lead
P-030Do a primality classifier's residual errors fingerprint its algorithm — Fermat pseudoprimes for a Fermat-like test, no-small-factor composites for a sieve?lead
P-031Grokking multiplication on the units of Z/561 — which characters appear when the group is not cyclic and no discrete log exists?lead
P-032Do a learned Franklin involution's errors concentrate exactly on the pentagonal-number shapes where the map is undefined?lead
P-033Under weight decay, does a partition-recurrence readout become sparse exactly on the generalized pentagonal lags, with alternating-pair signs?lead
P-034Eta's coefficients indexed by n versus by m — is one coordinate trivial and the other near-impossible?lead
P-035Are learning-curve shapes exactly two kinds — spectral readouts and competitions between coexisting solutions?structural
P-043A growth axis on one tree — five self-similar groups on the binary tree, the nucleus as the coordinate, and the claim that nucleus size predicts which instruments move
P-045A quantum walk on the intermediate-growth cell — is the boundary a quasicrystal and the bulk a flat-band localizer, or is the analogy decorative?
P-047How far is each carpet from a pure composition — is the drift in its pair slopes, and the misplacement of carpet B, a measurement of the commutator between crossing a block and crossing the arrangement of blocks?
P-048Taken as true, "the cut constant c sets the one-block miss" contradicts itself across block sizes — so is the block renormalization of an infinitely ramified carpet converging to its percolation exponent at all?
P-049The ramification ladder — between the one-bit recursion and the carpet lie finitely ramified relatives on which the crossing recursion is exact; climb them and see where the carpet's turn, and its exponent, first appearlead
P-050The census read without a question — the one-block fixed point overshoots every lattice threshold by a fixed amount set by the ring share of the pivotal set; the exponents fan around y₉ and are still falling everywherelead
P-051The ladder made continuous — give the links across block seams their own chance; the contact set between blocks then has a dimension between 0 (a rung) and 1 (the carpet), and ramification becomes a diallead
P-052The dial that varies across the sample — gradient percolation on a carpet; one configuration locates the threshold and its sharpness, and the front should carry the holes' imprint at every factor of ninelead
P-053A dial for every block — each block has its own crossing point and its neighbours shift it; the shift is a small table with one entry per pair of sides, and how fast the table settles is the correction the one-exponent scaling lackslead
P-054Invasion — grow the crossing from the left side by always opening the easiest link; it finds each draw's crossing point without a dial, its forced links and bursts are a second exponent, and the burst sizes on a carpet carry a ripple with the period of the hierarchylead
P-055Bits left in the table — compress the census with the one-block polynomial as the codebook and count what stays; PG-01's "finite number of boundary bits" becomes a number read from stored data, and columns that compress together are one objectlead
Settled4
P-014Is QR's two-sidedness a distributive law both ways, or a reciprocity phenomenon in disguise? — RESOLVED: edge, via Artin reciprocitystructural
P-036A Tanner code on the squared coset graph — the empirical code ceiling of the intermediate-growth host, now that N-034 rules out an expander code on the graph itself
P-044The seam orbit as a register — capacity and write cost of the host's memory, from the group action instead of quenches
P-046Is "accidental symmetries are the wildly ramified ones" more than a reading — does ramification theory predict an integrality relation between the charge an operator violates and its dimension?

Notes

34 total · +6 retired

N-002What the logarithmic derivative can and cannot extract
N-006The logarithmic weight is the Haar measure of the scaling flow, not an entropy-step artifact
N-007Accidental symmetries are wildly ramifiedp-adic-adelic
N-008Two kinds of local-to-global impossibility: chromatic and anonymouslogic-computability
N-009Characteristic p is rational flux: a Hofstadter reading of geometric Langlandsp-adic-adelic
N-011Spectral rigidity of a mixing matrix, and its one-bit residue (CP)spectral
N-012Residues of group actions — resolved by performing them, not by computingalgebra
N-013Stokes in two signatures — a holonomy equals an enclosed areageometry-topology
N-014Resurgence — a perturbatively invisible effect and its instanton are one factanalysis
N-015BSD as reciprocity, written as a product with one term per rungnumber-theory
N-016The braid group is π₁ of configuration space — commutativity as a dimensiongeometry-topology
N-017Spacetime 3, 4, 6, 10 from the division-algebra determinantmathematical-physics
N-018Three different threes — the ℤ₃'s in the Standard Model are distinctmathematical-physics
N-019Large partial quotients are rare with a clean tail -- P(a_n >= k) = log2(1 + 1/k)number-theory
N-020A float continued fraction is reliable only while q_n < 2^26 -- pi diverges at term 13number-theory
N-021The selection-effect probe -- cross-chat evidence ledger for pattern-vs-mechanismmathematical-physics
N-022Sixth mining pass — the necklace/greedy chat's own rediscovery and correction inventorygeometry-topology
N-023Rank discretization destroys continuum spacing informationspectral
N-024The achievable set's automatic V/2 symmetryalgebra
N-025A non-orientable surface sees only the 2-torsion — and loop-closing is what "quantized" meansgeometry-topology
N-026The intermediate-growth cell is real — effective dimension grows without bound, computed on the Grigorchuk groupmathematical-physics
N-028N/log N three ways — one shape, two breaks. The host's separator, the function-field prime number theorem, and the logarithmic Chowla weight
N-029The PCA section's orientation is arbitrary, and it moves |lam2| by thirteen times run 022's quoted floor
N-030Evidence for N-029 — which section each filed basis was fitted on, and how fragile the svd_flip convention is on it
N-031MPS and CPU training diverge for the same seed in R26_training_dynamics — so a retrain meant to reproduce 037's W_E must run on the same device, and be checked
N-034The coset graph is a union of squares, and squares kill unique-neighbour expansion — no expander code on the intermediate-growth host at any levelmathematical-physics
N-035The sequential-circuit reading of self-similar groups — latch, register, carry, counter — and why "which types exist" is a 3×3 grid, not a linemathematical-physics
N-036Two routes to zero unique-neighbour expansion on a Cayley graph, both through g² — the Klein-four squares of N-034 and the cosets of ⟨g²⟩ found on Basilica and Aleshinmathematical-physics
N-037What runs 048–060 say together — order holds, magnitude misses; first-order models rank and correlations set values; the seal is the weakest linkmathematical-physics
N-038A reductio pass over the whole record outside the carpet thread — stale back-links, controls that do not control, agreements built in by construction, two-level laws, and misquoted theoremsmathematical-physics
N-039Loop-in from the grokking chat, 2026-10-03 — "define the geometry by what the shapes optimise" is a duality bridge run backwards plus the rigidity question, not a new term; candidate §67 entries; two candidate probes on merging grokked seeds; a speculative physics chain with every attribution unverifiedmathematical-physics
N-040Returns — what the lattice does that the block map does not, and in which directionsmathematical-physics
askedAsked ledger — one row per question sent out, and what came back
N-001Localization on sparse sets — three case studies
N-003Harvest record — the Navier–Stokes blowup-formalization chat
N-004Harvest record — the genesis chat (why complex numbers form a plane geometry)
N-005Harvest record — the twin-prime residue-patterns chat
N-010Harvest — project-file sweep (2026-09-12)
N-027Harvest record — the anyon-statistics chase (2026-09-27, one sitting)

generated 2026-10-25nothing on this page is maintained by hand