diff --git a/docs/site/README.md b/docs/site/README.md index d6264b820..b19a9c3ac 100644 --- a/docs/site/README.md +++ b/docs/site/README.md @@ -50,15 +50,15 @@ The 18:00 UTC refresh ([PR248](https://github.com/d6g8k5htny-coder/main/pull/248 added the conditional actual-bar cards `#actual-bars` and `#strict-bar-coefficient` to this cut. Later dated cuts were added above it: `#reading-addendum` (3 October 2026, 20:01 UTC), `#pair-endpoint-rate` (4 October, 00:18 UTC), `#shrinking-bin-sampling` -(4 October, 06:20 UTC, [PR266](https://github.com/d6g8k5htny-coder/main/pull/266)) and -`#reading-cut-20261007` (7 October, 18:37 UTC). Home, the Research hero and the Library +(4 October, 06:20 UTC, [PR266](https://github.com/d6g8k5htny-coder/main/pull/266)), +`#reading-cut-20261007` (7 October, 18:37 UTC) and `#reading-cut-20261009` (9 October, 00:05 UTC; the landed finite Gaussian H0 lifetime source and its program, read at main `0be54aa2`). Home, the Research hero and the Library link the newest cut. `#latest-work` keeps its 18:00 UTC heading, wording and pins; its later additions are a forward pointer to the 20:01 addendum and two labeled reviewer-lineage notes beside its 3 October review links, which the 7 October cut discloses. Two further labeled source-identity notes close the 20:01 and 00:18 cuts with the SHA-256 identities their pinned links lacked, and one dated `

` inside the 7 October cap card records that Math #193 was -reopened eight minutes after that cut. The next dated cut restates all five, so none +reopened eight minutes after that cut. The 9 October 2026 cut (`#reading-cut-20261009`) restates all five in its source disclosure, so none is the only record. Exact-commit citations preserve the reading cut. The **Check newer work** section @@ -80,13 +80,13 @@ check, not something established by a screenshot or link. Insert the new `

` with its own `
+
+

Landed 8 October · main #314–#326 · fixed finite Gaussian scope

How common are short-lived bars in a fixed finite Gaussian field?

Reading cut

+

On 8 October six merges into main landed a research program and ten proof sources in its suite. The program describes itself as “a research design and execution route, not a new scientific-status register or an acceptance vote”. Its target is “a reusable theorem connecting a local singularity, the probability law transverse to its discriminant, and the intensity of actual persistence bars”. Its first statement of that target is conditional: “a precisely stated transfer target” that “does not verify those five hypotheses for any new field”. The program document landed before all ten proof sources, and no later merge changed it. This cut explains one of them, the finite H0 lifetime proof from main #326, which counts actual finite H0 bars for fixed ideal finite Gaussian laws; it is not a universality theorem. Main #329, merged at 23:58 UTC, landed three later sources, which the suite guide calls the regular-fold structural theorem, the exact periodized Gaussian H0 adapter and the marked short-bar process theorem. The suite guide linked below links them. This cut does not summarize them, and the H0 proof and its review record kept the same bytes through that merge. This curated cut covers only this line. Other main work that landed after the 7 October cut, including the pinned graph exporter (main #318) and its source-isolation guard (main #324), is not summarized here.

+
+
+

Landed conventional analytic source · main #326

Every finite H0 bar counted once, for fixed finite Gaussian laws

+

The proof fixes one ideal real Gaussian field on a flat square two-dimensional torus of side L. The field is a finite Fourier sum with independent standard Gaussian coefficients and strictly positive, symmetric weights on every frequency in the square grid {−K,…,K}², for an integer cutoff K ≥ 2. A finite superlevel H0 bar is born at a local maximum and dies at the saddle where its component merges into an older one; its lifetime ℓ is the height difference. The one essential class is excluded.

+

In the suite guide’s words, the proof “constructs a Borel selector and counts every actual finite superlevel H0 bar exactly once”. For each such fixed law it proves two statements. The first is for a specified density ν_bar of the expected bar-lifetime measure per unit area. The second is for the expected number E N_bar((0, t]) of finite bars with lifetime at most t, per unit area (V = L² is the torus area):

+

ν_bar(ℓ) ~ C_loc ℓ^(−1/3), as ℓ decreases to zero

+

E N_bar((0, t]) / V ~ (3/2) C_loc t^(2/3), as t decreases to zero

+

The density exponent is −1/3; the cumulative exponent is 2/3. C_loc is the same local coefficient as in this line’s candidate-lifetime theorem. The review record says “The coefficient is positive and field-dependent”, and this page gives no value. The proof says its pointwise law concerns “the particular finite Borel representative constructed in Section 5”, and “no O(1) near-term remainder is claimed”. In the suite guide’s words, “The selected density is not asserted continuous”. Missed near pairs contribute only o(ℓ^(−1/3)), and the far contribution is bounded.

+

The ten catalogue spectra with ideal Gaussian coefficients, at L = 24 and K = 2 or 3, give twenty fixed cases of this kind. The review record says “Finite-family uniformity is not twenty empirical confirmations.” The proof says “No finite-word or quantized sampler is identified with the continuous ideal Gaussian coefficient law.” In the review record’s words, “Positivity-boundary spectra, K1, non-Gaussian coefficients, infinite-field laws, numerical coupling, quantitative usable windows, higher homology, factorial moments, process limits, formal source alignment, blind fifty-law validation and external uptake remain outside the result.”

+

Who read it: the record says “All contributors/readers are source and route exposed OpenAI/Codex.” The proof’s mathematical author is /root/universality_review. Two agents that did not write it, /root/benchmark_formal_audit and /root/final_contract_review, each freshly read all 526 lines of the landed proof and returned PASS without a mathematical must-fix. The first of them wrote the elder-transfer proof that this one consumes. Organizational-independence credit is zero, so “nonauthor” here does not mean independent, and none is an owner reading. “No human, blind reconstruction or provider-distinct acceptance is claimed.”

+

Read the finite H0 lifetime proof

+
+
Landed?
Landed at main 2c841707 (main #326, merged 8 October 2026, 22:42 UTC). The program landed in main #314. The six other proof sources that landed with it or before it came in main #319, #321, #323 and #326.
+
Read by
OpenAI/Codex · “PASS”, quoted from the linked review record · the landed proof’s exact 27,064 bytes; organizational-independence credit zero.
+
Scientific effect
The proof’s own declaration: “No human, blind or provider-distinct acceptance, formal Lean proof, sampler execution, seed consumption or scientific promotion is claimed.”
+
+
+
+

Scope: this cut presents landed sources only. The review record calls the proof “a conventional analytic theorem with explicit imports”. It concerns fixed ideal finite Gaussian laws on a flat square two-dimensional torus and is not a universality theorem for a wider class of fields. The program says to “Keep the full objective open until its explicit proof, computation, publication and uptake requirements have their actual evidence.” In the suite guide’s words, “The sampler and catalogue admissibility labels retain their original meaning.” A merge, a passing check or a named review is not scientific acceptance, and no status, register, graph, catalogue or acceptance record changes here. The Library, Source records and claim-dependency snapshots keep their own dates and do not list this work.

+
Exact sources, review record and the program +

These links use main commit 0be54aa227d7015b0abda00feb5e847a3fbdbcdb (main #329, merged 8 October 23:58 UTC), where this cut was checked. The program, the H0 proof and its review record have the same bytes there as at main 2c84170712c59d9de580c172815bd30bac5d93cd (main #326, 8 October 22:42 UTC), where the proof and record landed. The program document has not changed since main #314. The suite guide was changed again in main #329. The version pinned here also links that merge’s three sources, which this cut does not summarize. The review record names the earlier 10,559-byte suite guide its readers read (SHA-256 c44553c00c86fad5045ac8c9e6c90f70b1e347173d2bad6f59804b35c888e5a7); that is the version at main #326, not the one pinned here.

+ +

Its record states “H0 consumes C/CG/ET/FG”. In that order, these are the candidate-lifetime theorem (main #321), contact genericity (#323), elder transfer (#326) and the Gaussian contact inputs (#319), and the record lists their exact identities. The fold-chart (#321) and weighted fold-window (#323) proofs of the same line are not among them, and the three main #329 sources landed after it. The record also describes two later reads of its own metadata; each requested an amendment to one sentence about which sources were consumed. Both sentences are corrected. After the first correction the record says “Both actual-source mathematical verdicts and proof bytes are unchanged.”

+

In the suite guide’s words, its exploratory runner “generates explicitly exploratory fields” and “does not estimate a slope or compare against reference coefficient digits”, and “No held-out seeds have been consumed by this suite.”

+

Notes added after earlier cuts, restated here so that none is the only record; nothing in those cuts changes.

+

3 October 18:00 UTC cut, “Count each actual bar once”: an OpenAI/Codex agent that wrote none of the candidate files reconstructed the argument after reading its exact source interfaces. Its PASS_TECHNICAL is conditional on the retained interfaces. The authors use the same provider, and the author published the report. It recorded Dylan’s personal reading as pending and gives zero organizational-independence credit, so “nonauthor” there does not mean independent.

+

Same cut, “Two candidates can describe one bar”: an OpenAI/Codex agent that did not write this comparison passed it with no required findings. It discloses substantial prior exposure, including authorship of C107 and coauthorship of a successor witness checker. The author uses the same provider. It records no human review and zero organizational-independence credit, so “nonauthor” there does not mean independent.

+

3 October 20:01 UTC cut, source identities recomputed 8 October 2026: the replacement-bar occurrence PROOF.md at Math c2836c2a has SHA-256 b49f2ea5975dc05270f51fea4a3574093f726258cdab94888742507c2caa275f. At Math e0bed3ed, the planar soft-layer chain packet has:

+
    +
  • C99 PROOF.md: 55eb6c33105190da4194e63d90ceeb40f3434b14b92803700ab840df67e9295e
    • +
  • C99 REVIEW.md: 3f1d0e1f1af51a20aa49681d0255d09d728e5d62c5f00cbca90e0671798265ed
    • +
  • C103 PROOF.md: 652e66f8645eb1a34c28a85900b05405d424bb0e282b86a7d5597f10b8f9c8e3
    • +
  • C103 REVIEW.md: 52dc91e3bc68b8f023f11e9ec37b1423853d721dc9188046246e96b4131e205f
    • +
+

4 October 00:18 UTC cut, source identity recomputed 8 October 2026: the packet SOURCES.json at Math bbe85e27 has SHA-256 a6fb3d0397e622d8a1061ff6e83d05f66e99d53fbc2dd35c1b8ee82d076a4458.

+

7 October 18:37 UTC cut, cap card (pointer read 8 October 2026, 00:58 UTC): GitHub reopened Math #193 at 18:45 UTC on 7 October, eight minutes after that cut. The first comment after the reopening, at 18:46 UTC, is headed “Tracking correction verified — issue reopened; scientific records unchanged”. The 4 October closure is historical, and an issue state is still not a proof status.

+

The source identities above were checked for this dated reading cut. This page does not fetch, execute or verify those sources in your browser. The earlier cuts keep their original wording.

+
+

Continue to the 7 October 18:37 UTC reading cut below, or follow current branches and discussions through the mutable upstream routes.

+

LANDED 4–7 OCTOBER · SCOPED SOURCES

What else landed by 7 October?

Reading cut

Three landed additions are explained below: one more term for short lifetimes, a cap formalization that now reaches the torus, and a protocol for showing how far a result has been checked. Each keeps the hypotheses, reviewer lineage and limits of its own sources. This curated cut is not a complete list of what landed.

diff --git a/docs/site/workspace.html b/docs/site/workspace.html index 4e4e31d70..7c6788e5a 100644 --- a/docs/site/workspace.html +++ b/docs/site/workspace.html @@ -5,9 +5,9 @@ Library and research workspace · Universal Law - - - + + + @@ -16,7 +16,7 @@

SOURCES · METHODS · REPRODUCTION

Look beneath the surface.

This is the Library: read the proof texts, inspect exact values, or follow a result back to its sources. It is the technical companion to the interactive introduction.

Search the libraryExact coefficientsRecorded status

03 / THE LIBRARY · EXISTING CATALOG

Find the full argument.

Reading guide ↗
-

The existing 2,138-file inventory includes proofs, partial arguments, reviews, and historical reading copies. It counts files, not accepted theorems. For packets landed up to the 7 October 2026, 18:37 UTC reading cut, use Latest public work; for current source routes, use Check newer work. This inventory retains its 2026-09-26 source cut.

+

The existing 2,138-file inventory includes proofs, partial arguments, reviews, and historical reading copies. It counts files, not accepted theorems. For packets landed up to the 9 October 2026, 00:05 UTC reading cut, use Latest public work; for current source routes, use Check newer work. This inventory retains its 2026-09-26 source cut.

Link to this search

Search links become available after catalog verification.

The original inventory and its shards are verified by script before search opens.

Hash-verified source inventory (filtered rows shown)
Repository / full textCommitSHA-256
diff --git a/tests/test_reader_links.py b/tests/test_reader_links.py index 253f0d024..f3b9f2aa9 100644 --- a/tests/test_reader_links.py +++ b/tests/test_reader_links.py @@ -476,12 +476,12 @@ def section(self): return text.split('id="latest-work"',1)[1].split('
Latest public work',text) + self.assertIn('href="#reading-cut-20261009">Latest public work',text) self.assertIn('href="#shrinking-bin-sampling">06:20 UTC grid-sampling reading cut below',text) self.assertIn('tabindex="-1" aria-labelledby="sampling-heading"',section) self.assertIn('datetime="2026-10-04T06:20:32Z"',section) @@ -768,6 +782,10 @@ def test_limits_and_full_sources_remain_available_without_status_promotion(self) def test_preceding_reading_cuts_remain_byte_identical(self): text=(SITE/'research.html').read_text() + # The 7 October cut stopped being newest on 9 October; it is pinned whole, its cut-pointer included. + october=text[text.index('
=2','d≥2','iid','independent copies', + 'expanding-domain','cluster avoidance','counterexample','r dr', + 'fold_structural_universality','periodized_gaussian_h0','iid_short_bar_process', + 'Regular cubic folds and the structural H0 lifetime exponent', + 'Actual H0 lifetime intensity for the exact periodized Gaussian law', + 'Marked iid-copy Poisson limit for actual short H0 bars', + 'blob/main','tree/main', + ) + QUOTES = { + 'program': ('a reusable theorem connecting a local singularity, the probability law transverse to its discriminant, and the intensity of actual persistence bars', + 'a research design and execution route, not a new scientific-status register or an acceptance vote', + 'a precisely stated transfer target','does not verify those five hypotheses for any new field', + 'Keep the full objective open until its explicit proof, computation, publication and uptake requirements have their actual evidence.'), + 'readme': ('constructs a Borel selector and counts every actual finite superlevel H0 bar exactly once', + 'The selected density is not asserted continuous', + 'The sampler and catalogue admissibility labels retain their original meaning.', + 'generates explicitly exploratory fields', + 'does not estimate a slope or compare against reference coefficient digits', + 'No held-out seeds have been consumed by this suite.', + 'regular-fold structural theorem','exact periodized Gaussian H0 adapter','marked short-bar process theorem'), + 'proof': ('No human, blind or provider-distinct acceptance, formal Lean proof, sampler execution, seed consumption or scientific promotion is claimed.', + 'the particular finite Borel representative constructed in Section 5', + 'no O(1) near-term remainder is claimed', + 'No finite-word or quantized sampler is identified with the continuous ideal Gaussian coefficient law.', + 'conventional analytic source'), + 'review': ('a conventional analytic theorem with explicit imports', + 'All contributors/readers are source and route exposed OpenAI/Codex.', + 'No human, blind reconstruction or provider-distinct acceptance is claimed.', + 'Fresh full exact-file nonauthor reviews of the incorporated proof: PASS.', + 'H0 consumes C/CG/ET/FG', + 'Both actual-source mathematical verdicts and proof bytes are unchanged.', + 'The coefficient is positive and field-dependent', + 'Finite-family uniformity is not twenty empirical confirmations.', + 'Positivity-boundary spectra, K1, non-Gaussian coefficients, infinite-field laws, numerical coupling, quantitative usable windows, higher homology, factorial moments, process limits, formal source alignment, blind fifty-law validation and external uptake remain outside the result.'), + } + SOURCE_PATHS = {'program':'docs/PERSISTENCE_UNIVERSALITY_PROGRAM.md','readme':'experiments/universality/README.md', + 'proof':'experiments/universality/finite_h0_lifetime/PROOF.md','review':'experiments/universality/finite_h0_lifetime/REVIEW.md'} + EARLIER_NOTE_DIGESTS = ('b49f2ea5975dc05270f51fea4a3574093f726258cdab94888742507c2caa275f', + '55eb6c33105190da4194e63d90ceeb40f3434b14b92803700ab840df67e9295e', + '3f1d0e1f1af51a20aa49681d0255d09d728e5d62c5f00cbca90e0671798265ed', + '652e66f8645eb1a34c28a85900b05405d424bb0e282b86a7d5597f10b8f9c8e3', + '52dc91e3bc68b8f023f11e9ec37b1423853d721dc9188046246e96b4131e205f', + 'a6fb3d0397e622d8a1061ff6e83d05f66e99d53fbc2dd35c1b8ee82d076a4458') + PROSE_NUMBERS = ('8 314 326 8 0 326 0 329 23:58 0 0 7 318 324 326 0 0 0 1/3 2/3 5 1 1 526 0 326 8 2026 22:42 314 319 321 323 326 ' + '27,064 329 8 23:58 0 326 8 22:42 314 329 10,559 256 326 256 256 256 0 256 0 321 323 326 319 321 323 329 3 18:00 ' + '107 3 20:01 8 2026 256 99 99 103 103 4 00:18 8 2026 256 7 18:37 8 2026 00:58 193 18:45 7 18:46 4 7 18:37') + # Each quote keeps the source the page names for it. + ATTRIBUTIONS = ('In the suite guide’s words, the proof “constructs a Borel selector', + 'The review record says “The coefficient is positive and field-dependent”', + 'The proof says its pointwise law concerns “the particular finite Borel representative', + 'and “no O(1) near-term remainder is claimed”', + 'In the suite guide’s words, “The selected density is not asserted continuous”', + 'The review record says “Finite-family uniformity is not twenty empirical confirmations.”', + 'The proof says “No finite-word or quantized sampler', + 'In the review record’s words, “Positivity-boundary spectra', + 'the record says “All contributors/readers are source and route exposed OpenAI/Codex.”', + 'The proof’s own declaration: “No human, blind or provider-distinct acceptance', + 'The review record calls the proof “a conventional analytic theorem with explicit imports”', + 'The program says to “Keep the full objective open', + 'In the suite guide’s words, “The sampler and catalogue admissibility labels', + 'Its record states “H0 consumes C/CG/ET/FG”', + 'After the first correction the record says “Both actual-source mathematical verdicts', + 'In the suite guide’s words, its exploratory runner “generates explicitly exploratory fields”', + 'The program describes itself as “a research design and execution route', + 'which counts actual finite H0 bars for fixed ideal finite Gaussian laws; it is not a universality theorem.') + OTHER_PAGES_ROW = ('
Words used on other pages
ACCEPT and AMEND / open are the proof index’s and STATUS.md’s wording at their pinned snapshots, shown on Source records and the Library board. PROVED_REVIEWED, AUTHOR_SIDE_CANDIDATE and the other gate classifications are the downstream gate’s states, shown on the dated claim-dependency snapshot. Each page quotes its own source; none of ACCEPT, AMEND, PROVED_REVIEWED or AUTHOR_SIDE_CANDIDATE appears in this page’s cuts.
') + + class Tree(HTMLParser): + """Elements of one section with class, attributes, direct text and inner text.""" + VOID = {'br','img','meta','link','hr','input'} + def __init__(self, text): + super().__init__();self.elements=[];self.stack=[];self.feed(text) + def handle_starttag(self, tag, attrs): + node={'tag':tag,'attrs':dict(attrs),'classes':set((dict(attrs).get('class') or '').split()),'text':[],'parents':[n['tag'] for n in self.stack],'parent_classes':set().union(*[n['classes'] for n in self.stack]) if self.stack else set()} + self.elements.append(node) + if tag not in self.VOID: self.stack.append(node) + def handle_endtag(self, tag): + while self.stack: + node=self.stack.pop() + if node['tag']==tag: break + def handle_data(self, data): + for node in self.stack: node['text'].append(data) + def find(self, tag=None, cls=None): + return [n for n in self.elements if (tag is None or n['tag']==tag) and (cls is None or cls in n['classes'])] + + @staticmethod + def text_of(node): return ''.join(node['text']) + + def page(self): return (SITE/'research.html').read_text() + + def section(self): + text=self.page() + start=text.index(f'
')+len('')] + + def source_bytes(self, ref, path): + # Pinned sources are read from git objects (CI checks out with full history); a tree without them cannot check identities. + import subprocess + try: + return subprocess.run(['git','cat-file','blob',f'{ref}:{path}'],cwd=ROOT,check=True,capture_output=True).stdout + except (OSError,subprocess.CalledProcessError): + self.skipTest(f'git object {ref[:8]}:{path} unavailable in this checkout') + + def test_cut_is_newest_entry_and_links_to_the_7_october_cut_and_upstream(self): + text=self.page();section=self.section() + self.assertTrue(section.endswith('
\n'),'the new cut sits immediately above the 7 October cut') + self.assertLess(text.index('id="status-words"'),text.index(f'
',section) + self.assertIn('

How common are short-lived bars in a fixed finite Gaussian field?

',section) + self.assertEqual(re.findall(r'