diff --git a/.github/workflows/c6-cluster-coefficients-numerics.yml b/.github/workflows/c6-cluster-coefficients-numerics.yml new file mode 100644 index 000000000..0331e4e39 --- /dev/null +++ b/.github/workflows/c6-cluster-coefficients-numerics.yml @@ -0,0 +1,62 @@ +name: C6 cluster coefficient numerics (replay) + +'on': + pull_request: + paths: + - 'frontiers/c6_cluster_coefficients_numerics_20260930/**' + - '.github/workflows/c6-cluster-coefficients-numerics.yml' + workflow_dispatch: + +permissions: + contents: read + +jobs: + exact-controls-and-replay: + runs-on: ubuntu-latest + timeout-minutes: 20 + steps: + - uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262 + with: + persist-credentials: false + - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 + with: + python-version: '3.11.16' + - name: Verify manifest and main-resident pins, replay exact controls and GH40, reject mutants + env: + PYTHONDONTWRITEBYTECODE: '1' + run: | + set -euo pipefail + python -B -S - <<'PY' + import hashlib, json, pathlib, subprocess, sys + root = pathlib.Path('frontiers/c6_cluster_coefficients_numerics_20260930').resolve() + manifest = json.loads((root / 'SOURCE_FILES.json').read_text())['files'] + present = sorted(p.name for p in root.iterdir()) + if present != sorted([e['path'] for e in manifest] + ['SOURCE_FILES.json']): + raise ValueError('packet tree differs from manifest: ' + repr(present)) + for entry in manifest: + path = root / entry['path'] + if pathlib.PurePosixPath(entry['path']).name != entry['path'] or path.is_symlink(): + raise ValueError('flat regular source required: ' + entry['path']) + data = path.read_bytes() + if len(data) != entry['bytes'] or hashlib.sha256(data).hexdigest() != entry['sha256']: + raise ValueError('source identity mismatch: ' + entry['path']) + pins = json.loads((root / 'SOURCE_MAP.json').read_text()) + for entry in pins['sources']: + if not entry['current_required']: + continue + data = pathlib.Path(entry['path']).read_bytes() + blob = hashlib.sha1(b'blob %d\0' % len(data) + data).hexdigest() + if len(data) != entry['bytes'] or hashlib.sha256(data).hexdigest() != entry['sha256'] or blob != entry['git_blob']: + raise ValueError('consumed source identity mismatch on this tree: ' + entry['path']) + script = str(root / 'coefficients.py') + for flags in (['-B', '-S'], ['-B', '-O', '-S']): + out = subprocess.run([sys.executable, *flags, script, '--check'], cwd=root, capture_output=True, timeout=900) + if out.returncode != 0: + raise RuntimeError('check failed under ' + ' '.join(flags) + ': ' + out.stdout.decode()[-400:]) + for m in ['cubic-sign', 'antiderivative', 'typed-boundary']: + rc = subprocess.run([sys.executable, *flags, script, '--check', '--mutant', m], cwd=root, capture_output=True, timeout=900).returncode + if rc != 1: + raise RuntimeError('mutant ' + m + ' not rejected') + print(json.dumps({'scientific_effect': 'NONE', 'certified': False})) + PY + git diff --exit-code diff --git a/.github/workflows/c6-witness-collision-reconciliation.yml b/.github/workflows/c6-witness-collision-reconciliation.yml new file mode 100644 index 000000000..adc6c7d16 --- /dev/null +++ b/.github/workflows/c6-witness-collision-reconciliation.yml @@ -0,0 +1,74 @@ +name: C6 witness-collision reconciliation checks + +'on': + pull_request: + paths: + - 'reviews/c6_witness_collision_reconciliation_20260929/**' + - '.github/workflows/c6-witness-collision-reconciliation.yml' + - 'frontiers/c6_*/**' + - 'frontiers/d5_dimension_lift_20260929/**' + - 'frontiers/elder_dimension_lift_20260928/**' + - 'frontiers/remote_collision_20260928/**' + - 'frontiers/remote_window_20260924/**' + - 'frontiers/downstream_gate_20260925/GRAPH.json' + - 'frontiers/downstream_gate_20260925/SELECTOR_REGION.json' + - 'imports/lifetime_parent_20260925/**' + - 'reviews/d5_reconciliation_20260929/**' + - 'reviews/c6_fourier_completion_20260929/**' + - 'reviews/elder_dimension_lift_claude_20260928/**' + - 'reviews/d5_remote_collision_grok_20260928/**' + - 'reviews/d5_offpin_second_moment_20260928/**' + - 'PROOF_INDEX.md' + - 'reviews/candidates_pending_20260928/CANDIDATES.md' + workflow_dispatch: + +permissions: + contents: read + +jobs: + exact-and-probe: + runs-on: ubuntu-latest + timeout-minutes: 10 + steps: + - uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262 + with: + persist-credentials: false + - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 + with: + python-version: '3.11.16' + - name: Verify sources, replay both modes, reject mutants + env: + PYTHONDONTWRITEBYTECODE: '1' + run: | + set -euo pipefail + python -B -S - <<'PY' + import hashlib, json, pathlib, subprocess, sys + root = pathlib.Path('reviews/c6_witness_collision_reconciliation_20260929').resolve() + manifest = json.loads((root / 'SOURCE_FILES.json').read_text())['files'] + present = sorted(p.name for p in root.iterdir()) + expected_names = sorted([e['path'] for e in manifest] + ['SOURCE_FILES.json']) + if present != expected_names: + raise ValueError('packet tree differs from manifest: ' + repr(present)) + for entry in manifest: + path = root / entry['path'] + if pathlib.PurePosixPath(entry['path']).name != entry['path'] or path.is_symlink(): + raise ValueError('flat regular source required: ' + entry['path']) + data = path.read_bytes() + if len(data) != entry['bytes'] or hashlib.sha256(data).hexdigest() != entry['sha256']: + raise ValueError('source identity mismatch: ' + entry['path']) + script = str(root / 'reconciliation_check.py') + expected = (root / 'RESULTS.json').read_bytes() + mutants = ['allow-symlink', 'no-hash', 'drop-edge', 'stale-fingerprint', 'executed-flag', 'close-residual', 'drop-lower-bound', 'regional-strict', 'clone-live-node', 'open-cell-left'] + for flags in (['-B', '-S'], ['-B', '-O', '-S']): + out = subprocess.run([sys.executable, *flags, script], + check=True, capture_output=True, timeout=300).stdout + if out != expected: + raise RuntimeError('output differs from RESULTS.json under ' + ' '.join(flags)) + for m in mutants: + rc = subprocess.run([sys.executable, *flags, script, '--mutant', m], + capture_output=True, timeout=300).returncode + if rc != 1: + raise RuntimeError('mutant ' + m + ' not rejected') + print(json.dumps({'scientific_effect': 'NONE', 'mathematical_acceptance': False})) + PY + git diff --exit-code diff --git a/.github/workflows/cluster-exponential-weight.yml b/.github/workflows/cluster-exponential-weight.yml new file mode 100644 index 000000000..b01274852 --- /dev/null +++ b/.github/workflows/cluster-exponential-weight.yml @@ -0,0 +1,40 @@ +name: Cluster exponential weight controls +'on': + pull_request: + paths: + - 'frontiers/cluster_exponential_weight_20260930/**' + - '.github/workflows/cluster-exponential-weight.yml' + push: + branches: [main] + paths: + - 'frontiers/cluster_exponential_weight_20260930/**' + - '.github/workflows/cluster-exponential-weight.yml' + workflow_dispatch: +permissions: + contents: read +jobs: + exact-exponential: + runs-on: ubuntu-latest + timeout-minutes: 15 + steps: + - uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262 + with: + fetch-depth: 0 + persist-credentials: false + - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 + with: + python-version: '3.11.16' + - name: Finite controls and immutable source custody (not proof acceptance) + run: | + set -euo pipefail + packet=frontiers/cluster_exponential_weight_20260930 + python -B -S "$packet/verify_packet.py" + python -B -O -S "$packet/verify_packet.py" + python -B -S "$packet/finite_checks.py" > /tmp/exponential-normal.json + python -B -O -S "$packet/finite_checks.py" > /tmp/exponential-optimized.json + cmp /tmp/exponential-normal.json /tmp/exponential-optimized.json + python -B -S -m unittest discover -s "$packet" -p 'test_*.py' -v + python -B -O -S -m unittest discover -s "$packet" -p 'test_*.py' -v + git fetch --no-tags origin cbb2f978f9b3e8e2eaca94f3b359b18d7c144f1b 7a44130b41b827577424a73c4feac4cde20b5568 + python -B -S "$packet/verify_sources.py" --repo-root "$GITHUB_WORKSPACE" + git diff --exit-code diff --git a/.github/workflows/register-alignment.yml b/.github/workflows/register-alignment.yml new file mode 100644 index 000000000..e8d30be7f --- /dev/null +++ b/.github/workflows/register-alignment.yml @@ -0,0 +1,75 @@ +name: Register alignment checks + +'on': + pull_request: + paths: + - 'reviews/register_alignment_20260930/**' + - '.github/workflows/register-alignment.yml' + - 'frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md' + - 'frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md' + - 'coefficients/side24_v1/PROOF.md' + - 'frontiers/remote_window_20260924/PROOF.md' + - 'frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md' + - 'frontiers/full_price_20260924/PROOF.md' + - 'imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md' + - 'reviews/pr22_fixed_annulus_nonauthor_20260925/**' + - 'reviews/p15_full_price_nonauthor_20260926/**' + - 'reviews/side24_v1_coefficient_claude_20260929/**' + - 'frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md' + - 'reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md' + - 'frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md' + - 'frontiers/downstream_gate_20260925/GRAPH.json' + - 'frontiers/downstream_gate_20260925/hard_gate.py' + - 'PROOF_INDEX.md' + workflow_dispatch: + +permissions: + contents: read + +jobs: + exact-and-probe: + runs-on: ubuntu-latest + timeout-minutes: 10 + steps: + - uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262 + with: + persist-credentials: false + - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 + with: + python-version: '3.11.16' + - name: Verify sources, replay both modes, reject mutants + env: + PYTHONDONTWRITEBYTECODE: '1' + run: | + set -euo pipefail + python -B -S - <<'PY' + import hashlib, json, pathlib, subprocess, sys + root = pathlib.Path('reviews/register_alignment_20260930').resolve() + manifest = json.loads((root / 'SOURCE_FILES.json').read_text())['files'] + present = sorted(p.name for p in root.iterdir()) + expected_names = sorted([e['path'] for e in manifest] + ['SOURCE_FILES.json']) + if present != expected_names: + raise ValueError('packet tree differs from manifest: ' + repr(present)) + for entry in manifest: + path = root / entry['path'] + if pathlib.PurePosixPath(entry['path']).name != entry['path'] or path.is_symlink(): + raise ValueError('flat regular source required: ' + entry['path']) + data = path.read_bytes() + if len(data) != entry['bytes'] or hashlib.sha256(data).hexdigest() != entry['sha256']: + raise ValueError('source identity mismatch: ' + entry['path']) + script = str(root / 'alignment_check.py') + expected = (root / 'RESULTS.json').read_bytes() + mutants = ['allow-symlink', 'no-hash', 'stale-fingerprint', 'drop-review-source', 'controlling-true', 'executed-flag', 'skip-interface-premise', 'holder-reversed', 'baseline-drift', 'duplicate-drift', 'region-unlinked', 'review-metadata-only'] + for flags in (['-B', '-S'], ['-B', '-O', '-S']): + out = subprocess.run([sys.executable, *flags, script], + check=True, capture_output=True, timeout=300).stdout + if out != expected: + raise RuntimeError('output differs from RESULTS.json under ' + ' '.join(flags)) + for m in mutants: + rc = subprocess.run([sys.executable, *flags, script, '--mutant', m], + capture_output=True, timeout=300).returncode + if rc != 1: + raise RuntimeError('mutant ' + m + ' not rejected') + print(json.dumps({'scientific_effect': 'NONE', 'mathematical_acceptance': False})) + PY + git diff --exit-code diff --git a/.github/workflows/spectral-cluster-closure.yml b/.github/workflows/spectral-cluster-closure.yml new file mode 100644 index 000000000..9fed2e14d --- /dev/null +++ b/.github/workflows/spectral-cluster-closure.yml @@ -0,0 +1,36 @@ +name: Spectral cluster closure checks + +'on': + pull_request: + paths: + - 'frontiers/spectral_cluster_closure_20260929/**' + - '.github/workflows/spectral-cluster-closure.yml' + workflow_dispatch: + +permissions: + contents: read + +jobs: + exact-and-source: + runs-on: ubuntu-latest + timeout-minutes: 10 + steps: + - uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262 + with: + persist-credentials: false + fetch-depth: 0 + - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 + with: + python-version: '3.11.16' + - name: Fetch exact public non-main source objects + run: | + set -euo pipefail + git fetch --no-tags --depth=1 origin bfcc67dc8957b3ed1fbb789e5a0305e98d7359c8 + git fetch --no-tags --depth=1 origin f0d11805854b1938a2f89235ec590a37b04a7cb9 + - name: Verify every source and replay both Python modes + env: + PYTHONDONTWRITEBYTECODE: '1' + run: | + set -euo pipefail + python -B -S frontiers/spectral_cluster_closure_20260929/verify.py + git diff --exit-code diff --git a/.github/workflows/two-scale-cluster-geometry.yml b/.github/workflows/two-scale-cluster-geometry.yml new file mode 100644 index 000000000..5dae60249 --- /dev/null +++ b/.github/workflows/two-scale-cluster-geometry.yml @@ -0,0 +1,41 @@ +name: Two-scale cluster geometry checks + +'on': + push: + branches: ['main'] + paths: + - 'frontiers/two_scale_cluster_geometry_20260929/**' + - '.github/workflows/two-scale-cluster-geometry.yml' + pull_request: + paths: + - 'frontiers/two_scale_cluster_geometry_20260929/**' + - '.github/workflows/two-scale-cluster-geometry.yml' + workflow_dispatch: + +permissions: + contents: read + +jobs: + exact-and-source: + runs-on: ubuntu-latest + timeout-minutes: 10 + steps: + - uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262 + with: + persist-credentials: false + fetch-depth: 0 + - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 + with: + python-version: '3.11.16' + - name: Fetch immutable non-base source objects + run: | + set -euo pipefail + git fetch --no-tags --depth=1 origin 7a44130b41b827577424a73c4feac4cde20b5568 + git fetch --no-tags --depth=1 origin bfcc67dc8957b3ed1fbb789e5a0305e98d7359c8 + - name: Verify all sources, exact controls and both Python modes + env: + PYTHONDONTWRITEBYTECODE: '1' + run: | + set -euo pipefail + python -B -S frontiers/two_scale_cluster_geometry_20260929/verify.py + git diff --exit-code diff --git a/frontiers/c6_cluster_coefficients_numerics_20260930/NOTE.md b/frontiers/c6_cluster_coefficients_numerics_20260930/NOTE.md new file mode 100644 index 000000000..845881d40 --- /dev/null +++ b/frontiers/c6_cluster_coefficients_numerics_20260930/NOTE.md @@ -0,0 +1,149 @@ +# Numerical values of the planar near cluster coefficients `alpha_1`, `alpha_2` + +**Object:** CL-C6-CLUSTER-COEFF-NUMERICS-20260930-v1. +**Author:** Anthropic Claude (Claude Code session `session_015wNj8LPTKXsaT68G3DgPPh`), 30 September 2026. +**Disposition:** numerical evaluation. **Not a proof, not a certified enclosure.** Floating-point quadrature and Monte +Carlo values with reported standard errors, for the explicit finite-dimensional Gaussian integrals that the cluster-law +candidates define. Every packet on the C6 cluster line lists "no numerical value of `nu(1)`, `nu(2)`" as a non-claim; +this note supplies values for the *near* coefficients only, and says exactly what they are conditional on. +**Scientific effect:** NONE. No `STATUS`, `PROOF_INDEX`, `GRAPH`, claim, catalog, prize or source body changes. +Same GitHub account as every lane; zero organizational-independence credit. + +## 1. What is evaluated + +Planar model of [LP] (`d = 2`), torus side `L`, variance-one periodized Gaussian field with spectral weights +`a_n = exp(-2 pi^2 |n|^2 / L^2) / sum_j exp(-2 pi^2 |j|^2 / L^2)` ([LP] §2), pins `f(M) = b`, `f(S) = b - k r^3`, +`grad f(M) = grad f(S) = 0`, original weight `W_r` and full normalizer `Z_r`. The near coefficients of the cluster law +are, in the notation of [CL] (1.3) and (3.11) at `d = 2` (equivalently Theorem F of [CUB]), + + alpha_j = (1/z_0) integral_(R^4) h_0(0, a, beta, c) w_0(s, a, beta) 1{ n(s, a, beta, c) = j } ds da dbeta dc, j = 1, 2, + +where `h_0` is the contact density of `(f_zz, f_xxz, f_xzz, f_zzz)(0)` given the contact pins +`U_0 = (f, f_x, f_xx, f_xxx, f_z, f_xz)(0) = (b, 0, 0, 12k, 0, 0)`, `z_0 = lim Z_r / r^2`, `w_0 = [-6k(s - beta/2) - +a^2/4]_+ [a^2/4 - 6k(s + beta/2)]_+` is the pin weight, and `n` is the number of extra critical points of the pinned cubic +`F_0` with height in `(-k, 0)`. In the cluster law, `nu(2) = alpha_2` and `nu(1) = alpha_1 + k integral_X Lambda`; the +remote part `k integral_X Lambda` ([RM]) is **not** evaluated here. + +Everything below is conditional on these formulas, i.e. on [CL] Theorem N (Math-#159, nonauthor-accepted and merged 30 September 2026) or on +[CUB] Theorem F (merged, Claude-accepted) for the near coefficients as *lower bounds* of the global intensities. The +numbers do not accept either source. + +## 2. Exact structure of the contact regression (checked exactly, control `exact_structure`) + +Because `a_n` depends only on `|n|` through a Gaussian, `K_L` is the periodization of `K(z) = exp(-|z|^2/2)`; the jet +covariances at one site are the continuum values up to `O(exp(-L^2/2))`, and the lattice sums at `L = 24` and `L = 12` +reproduce them to `1.4e-13` (control `lattice_vs_continuum`). With `Cov(d^alpha f, d^beta f) = (-1)^|beta| d^(alpha+beta) K(0)` +and `d^(2m) exp(-x^2/2)|_0 = (-1)^m (2m-1)!!`: + +| jets | covariance | +|---|---| +| `Var f, Var f_x, Var f_z, Var f_xz` | `1` | +| `Var f_xx, Var f_zz, Var f_xxz, Var f_xzz` | `3` | +| `Var f_xxx, Var f_zzz` | `15` | +| `Cov(f, f_xx) = Cov(f, f_zz) = Cov(f_x, f_xzz) = Cov(f_z, f_xxz)` | `-1` | +| `Cov(f_xx, f_zz) = Cov(f_xxx, f_xzz) = Cov(f_xxz, f_zzz)` | `1`, `3`, `3` | +| `Cov(f_x, f_xxx) = Cov(f_z, f_zzz)` | `-3` | + +Parity splits the ten jets into the even block `(f, f_xx, f_xz, f_zz)` and the odd block `(f_x, f_z, f_xxx, f_xxz, f_xzz, +f_zzz)` with zero cross-covariance ([CUB] Theorem B). Exact regression (rational arithmetic): + +- Even block: `A = f_zz | (f, f_xx, f_xz) = (b, 0, 0)` is `N(-b, 2)`. Hence `p_b(0) = phi(b/sqrt2)/sqrt2` and + `z_0 = 36 k^2 m_(2,b)`, `m_(2,b) = E[A^2 1{A < 0}] = (b^2 + 2) Phi(b/sqrt2) + sqrt2 b phi(b/sqrt2)`; in particular + `z_0 = 36 k^2` exactly at `b = 0` and `m_(2,1) = 3 Phi(1/sqrt2) + sqrt2 phi(1/sqrt2) = 2.72014...`. +- Odd block: `(a, beta, c) = (f_xxz, f_xzz, f_zzz) | (f_x, f_z, f_xxx) = (0, 0, 12k)` is `N(0, diag(2, 2, 6))` for every + `k` and `b`: the regression coefficient of every output on the `f_xxx = 12k` pin vanishes (for `f_xzz` it is + `[-1, 3] . [[1, -3], [-3, 15]]^(-1) = [-1, 0]`), and the parity zeros kill the rest. + +Therefore + + alpha_j(k, b) = [ phi(b/sqrt2) / ( sqrt2 . 36 k^2 m_(2,b) ) ] . J_j(k), J_j(k) = E_( (a,beta,c) ~ N(0, diag(2,2,6)) ) [ I_j(a, beta, c; k) ], + +and the ratio `alpha_2/(alpha_1 + alpha_2) = J_2/(J_1 + J_2)` is independent of `b` ([CUB] Theorem B), while its `k` +dependence is genuine (the jet law does not scale with `k`). + +## 3. The `s`-integral, exactly + +With `B = beta - a^2/(12k)`, `D = (c - a beta/(4k) + a^3/(72k^2))/2` and the sheared cubic +`G(u, Z) = C(u) + (s + Bu) Z^2/2 + (D/3) Z^3` ([CUB] (C2)–(C3), [CL] (3.12)), the pin weight on the typed domain +`s < -|B|/2` is `w_0 = 9k^2 (4s^2 - B^2)`, and the classifier ([CUB] Theorem C) reads, with + + g(s) = -2 s^3 + 3 B s^2 - B^3 - 12 k D^2 = 12k ( T_*(s) - D^2 ), T_*(s) = -(s - B)^2 (B + 2s) / (12k), + +`n = 2` iff `s > B` and `g(s) > 0`; `n = 1` iff `g(s) < 0`; `n = 0` iff `s <= B` and `g(s) > 0`. So + + I_j(a, beta, c; k) = integral_(s < -|B|/2) 9k^2 (4s^2 - B^2) 1{n = j} ds + +is a sum over at most two intervals with endpoints among the real roots of the cubic `g` (found by bracketed +bisection to machine precision), of the exact antiderivative `12 k^2 s^3 - 9 k^2 B^2 s`. Closed forms used as +controls: the [LM] cubic `(a, beta, c) = (0, -2k, 0)` gives `(I_1, I_2) = (0, 48 k^5)` (`n = 2` exactly on `(B, B/2)`); +the family `(0, 0, c)` gives `(72 k^3 D^2, 0)` with `D = c/2`. The classifier is checked against a direct count of the +critical points of `G` (quadratic in `u`, heights in `(-k, 0)`) on 4000 random typed samples (control `classifier`), and +`I_j` against brute-force `s`-quadrature during development (agreement `1e-4`, the quadrature error). Lemma 3.6 of [CL] +(`-s <= 2|B| + (32 k D^2)^(1/3)` on `{n >= 1}`) is the reason the outer integrand is a polynomial times a Gaussian and +the outer integral converges. + +## 4. Numerical values + +Outer integration over `(a, beta, c) ~ N(0, diag(2, 2, 6))`: tensor Gauss–Hermite of orders 40 and 60 (64,000 and +216,000 nodes) and Monte Carlo with `10^6` samples (fixed seed), standard errors from the sample variance. The +integrand `I_j` is **not** bounded: it grows polynomially in the jets (on the `B = 0` family `I_1 = 18 k^3 c^2`), as +Lemma 3.6 of [CL] allows, and it has kinks where a root of `g` crosses `-|B|/2` or `B`. Against a Gaussian weight a +polynomially growing, piecewise-smooth integrand is integrable, but no convergence rate for Gauss–Hermite is proved +here; the two orders are reported as two deterministic estimates, and the Monte Carlo standard error is the only +statistical error indication. **All precision statements below are empirical.** + +| `k` | `J_1` GH40 / GH60 / MC (`±` s.e.) | `J_2` GH40 / GH60 / MC (`±` s.e.) | `J_2/(J_1+J_2)` | near Palm excess `2J_2/(J_1+2J_2)` | +|---|---|---|---|---| +| `1/2` | 35.652 / 35.676 / 35.559 ± 0.086 | 1.121 / 1.109 / 1.115 ± 0.0062 | 0.0301 | 0.0585 | +| `1` | 169.63 / 169.61 / 169.37 ± 0.28 | 3.249 / 3.255 / 3.281 ± 0.022 | 0.0188 | 0.0370 | +| `2` | 1104.2 / 1103.7 / 1102.6 ± 1.7 | 8.421 / 8.641 / 8.875 ± 0.073 | 0.0078 | 0.0154 | + +`J_j(k) = E_(N(0, diag(2,2,6)))[I_j]`; the ratio columns are `b`-free. Prefactor `p_b(0)/z_0` and the coefficients `alpha_j = (p_b(0)/z_0) J_j` (GH60 values; MC in `RESULTS.json`): + +| `k` | `b` | `z_0 = 36 k^2 m_(2,b)` | `p_b(0)/z_0` | `alpha_1` | `alpha_2` | +|---|---|---|---|---|---| +| `1/2` | `0` | 9 | 0.031344 | 1.118 | 0.0347 | +| `1/2` | `1` | 24.4813 | 0.008974 | 0.3202 | 0.00995 | +| `1` | `0` | 36 | 0.007836 | 1.329 | 0.0255 | +| `1` | `1` | 97.9251 | 0.0022435 | 0.3805 | 0.0073 | +| `2` | `0` | 144 | 0.001959 | 2.162 | 0.0169 | +| `2` | `1` | 391.7 | 0.00056088 | 0.619 | 0.00485 | + +Reading: at `k = 1`, `b = 0`, `alpha_1 ≈ 1.33` and `alpha_2 ≈ 0.026`; about 1.9% of nonempty near clusters are two-point clusters, and the near part of the Palm excess `2 nu(2)/(nu(1) + 2 nu(2))` of [C6] Corollary P is at most about 3.7% (the remote singleton part of `nu(1)` only lowers it). The two-point share decreases in `k` (3.0% at `k = 1/2`, 0.78% at `k = 2`). Empirical precision (GH60 against MC, `10^6` samples): + +| `k` | `J_1`: GH60 − MC (in MC s.e., relative) | `J_2`: GH60 − MC (in MC s.e., relative) | +|---|---|---| +| `1/2` | +0.1162 (+1.4 s.e., 0.33%) | -0.00615 (-1.0 s.e., 0.6%) | +| `1` | +0.237 (+0.8 s.e., 0.14%) | -0.02519 (-1.1 s.e., 0.8%) | +| `2` | +1.05 (+0.6 s.e., 0.10%) | -0.2336 (-3.2 s.e., 2.6%) | + +So `J_1` (hence `alpha_1`) is reproduced by the two independent methods to about `0.1`–`0.3%`, within `1.4` MC standard +errors; `J_2` (hence `alpha_2`) to about `0.5`–`0.8%` at `k = 1/2, 1` (within `1.1` s.e.) and to about `2.7%` at `k = 2`, +where GH60 lies `3.2` s.e. below MC and GH40 further below: the Gauss–Hermite sequence is still moving there, so the MC +value with its standard error is the better estimate of `J_2(2)` and the third digit of `alpha_2(2)` is not established. +These are observed discrepancies, not error bounds. + +Finite `L`: the integrations above use the continuum jet covariance, which the lattice sums reproduce to `1e-13` at +`L = 24` (the parent's SIDE24 application) and `L = 12`. At `L = 6` the lattice jet covariances deviate from the continuum +table by up to `8.8e-4` (absolute), so `L = 6` is *not* covered by the continuum computation: the script propagates the +actual `L = 6` lattice covariance through the even/odd regressions (floating point) and the order-40 quadrature, and +`RESULTS.json` (`lattice_L6`) records the resulting `alpha_j` and their relative deviations from the continuum values, +of order `1e-4`–`1e-3`; `--check` replays the `k = 1` case. The full run is `coefficients.py` (writes `RESULTS.json`); the +replay mode `--check` re-verifies the exact structure, the closed forms, the classifier and the order-40 quadrature +against `RESULTS.json` (tolerance `1e-6`, floating point), and three mutants (`cubic-sign`, `antiderivative`, +`typed-boundary`) exit 1. + +## 5. What these numbers are not + +Not certified: no interval arithmetic; the Monte Carlo standard errors and the Gauss–Hermite order comparison are the +only error indications. Not the full `nu(1)`: the remote singleton coefficient `k integral_X Lambda` of [RM] is a +separate two-site Gaussian integral, not evaluated. Not a statement about `d >= 3`: the odd/even block structure and +the `N(0, diag(2, 2, 6))` law are planar. Not an acceptance of [CL] or [CUB]: if either near-coefficient formula fails +review, these are numbers for a formula, not for the model. Not a rate, not a finite-`r` statement. + +## 6. Provenance + +Sources and their exact bytes are in `SOURCE_MAP.json`: [LP] and [CUB] on `main`; [CL] at the head of Math-#159 (not +required on `main`). `coefficients.py` is standard-library Python; `RESULTS.json` is its output rounded to six +significant digits. The [LM] cubic `(−3k/2, 0, −2k, 0)` and the classifier are the same objects as in [CUB] and [CL]; +no new mathematics is claimed here beyond the exact regression identities of §2, which are elementary. diff --git a/frontiers/c6_cluster_coefficients_numerics_20260930/README.md b/frontiers/c6_cluster_coefficients_numerics_20260930/README.md new file mode 100644 index 000000000..5e7d05e10 --- /dev/null +++ b/frontiers/c6_cluster_coefficients_numerics_20260930/README.md @@ -0,0 +1,16 @@ +# C6 cluster coefficient numerics (CL-C6-CLUSTER-COEFF-NUMERICS-20260930-v1) + +Numerical values (floating point, with standard errors; **not certified**) of the planar near cluster coefficients +`alpha_1`, `alpha_2` defined by the C6 cluster-law candidates ([CL] Math-#159 (1.3)/(3.11) at `d = 2`, [CUB] Theorem F) +for the exact periodized Gaussian kernel of the parent [LP]. Scientific effect NONE. + +- `NOTE.md`: what is evaluated, the exact contact-regression structure (`A ~ N(-b, 2)`, odd block `N(0, diag(2,2,6))`, + `z_0 = 36 k^2 m_(2,b)`), the exact interval structure of the `s`-integral, the values, and what they are not. +- `coefficients.py`: standard library only. `python -B -S coefficients.py` recomputes `RESULTS.json` (several minutes); + `python -B -S coefficients.py --check` replays the exact controls and the order-40 quadrature against `RESULTS.json`; + `--check --mutant NAME` exits 1 for `cubic-sign`, `antiderivative`, `typed-boundary`. +- `RESULTS.json`: `J_j(k)` (Gauss–Hermite 40/60, Monte Carlo `10^6` with standard errors), the exact prefactor + `p_b(0)/z_0`, and `alpha_j(k, b)` for `k in {1/2, 1, 2}`, `b in {0, 1}`. +- `SOURCE_MAP.json`, `SOURCE_FILES.json`: pins and manifest. + +Not evaluated: the remote part `k integral Lambda` of `nu(1)`; anything for `d >= 3`; any rate or enclosure. diff --git a/frontiers/c6_cluster_coefficients_numerics_20260930/RESULTS.json b/frontiers/c6_cluster_coefficients_numerics_20260930/RESULTS.json new file mode 100644 index 000000000..2648314f8 --- /dev/null +++ b/frontiers/c6_cluster_coefficients_numerics_20260930/RESULTS.json @@ -0,0 +1,172 @@ +{ + "certified": false, + "exact_structure": { + "cov_fx_fxxx": "-3", + "mu_A": "-b", + "odd_cov_diag": [ + 2, + 2, + 6 + ], + "odd_mean": [ + 0, + 0, + 0 + ], + "var_A": 2, + "var_fxxx": "15" + }, + "lattice_L6": { + "k=1": { + "J1_gh40": 169.6136140680646, + "J2_gh40": 3.249752944819857, + "alpha1_gh40": 1.32905, + "alpha2_gh40": 0.0254643, + "muA": 0.0, + "muJ": [ + 0.0, + 3.99757e-15, + 0.0 + ], + "prefactor_b0": 0.00783576, + "rel_dev_alpha1_vs_continuum_gh40": -0.000152308, + "rel_dev_alpha2_vs_continuum_gh40": 7.00985e-05, + "varA": 2.00004 + }, + "k=1/2": { + "J1_gh40": 35.649991916363994, + "J2_gh40": 1.1211979306327606, + "alpha1_gh40": 1.11738, + "alpha2_gh40": 0.0351418, + "muA": 0.0, + "muJ": [ + 0.0, + 1.99879e-15, + 0.0 + ], + "prefactor_b0": 0.031343, + "rel_dev_alpha1_vs_continuum_gh40": -9.38401e-05, + "rel_dev_alpha2_vs_continuum_gh40": 2.09463e-05, + "varA": 2.00004 + }, + "k=2": { + "J1_gh40": 1104.0768381368005, + "J2_gh40": 8.42232807714671, + "alpha1_gh40": 2.16282, + "alpha2_gh40": 0.0164988, + "muA": 0.0, + "muJ": [ + 0.0, + 7.99515e-15, + 0.0 + ], + "prefactor_b0": 0.00195894, + "rel_dev_alpha1_vs_continuum_gh40": -0.000176894, + "rel_dev_alpha2_vs_continuum_gh40": 0.00011526, + "varA": 2.00004 + } + }, + "lattice_vs_continuum_max_dev": { + "12": 1.95399e-14, + "24": 1.36779e-13, + "6": 0.000878343 + }, + "method": "exact contact regression + interval-exact s-integral + Gauss-Hermite / Monte Carlo", + "object": "CL-C6-CLUSTER-COEFF-NUMERICS-20260930-v1", + "per_k": { + "1": { + "J1_gh40": 169.63498712445082, + "J1_gh60": 169.611, + "J1_mc": 169.374, + "J1_mc_se": 0.282859, + "J2_gh40": 3.2494396407422346, + "J2_gh60": 3.25538, + "J2_mc": 3.28057, + "J2_mc_se": 0.02219, + "palm_near_gh60": 0.0369675, + "ratio2_gh60": 0.0188318 + }, + "1/2": { + "J1_gh40": 35.652399345763925, + "J1_gh60": 35.6757, + "J1_mc": 35.5595, + "J1_mc_se": 0.0856231, + "J2_gh40": 1.1211449404513953, + "J2_gh60": 1.10852, + "J2_mc": 1.11467, + "J2_mc_se": 0.00618859, + "palm_near_gh60": 0.0585084, + "ratio2_gh60": 0.0301358 + }, + "2": { + "J1_gh40": 1104.2431167706125, + "J1_gh60": 1103.68, + "J1_mc": 1102.63, + "J1_mc_se": 1.68663, + "J2_gh40": 8.421135809095846, + "J2_gh60": 8.64125, + "J2_mc": 8.87486, + "J2_mc_se": 0.0727029, + "palm_near_gh60": 0.0154176, + "ratio2_gh60": 0.00776868 + } + }, + "prefactor": { + "k=1,b=0": { + "alpha1_gh60": 1.32906, + "alpha1_mc": 1.32721, + "alpha2_gh60": 0.0255091, + "alpha2_mc": 0.0257064, + "m2_b": 1.0, + "p_b0_over_z0": 0.00783597, + "z0": 36.0 + }, + "k=1,b=1": { + "alpha1_gh60": 0.380523, + "alpha1_mc": 0.379993, + "alpha2_gh60": 0.00730347, + "alpha2_mc": 0.00735999, + "m2_b": 2.72014, + "p_b0_over_z0": 0.00224351, + "z0": 97.9251 + }, + "k=1/2,b=0": { + "alpha1_gh60": 1.11821, + "alpha1_mc": 1.11457, + "alpha2_gh60": 0.0347454, + "alpha2_mc": 0.034938, + "m2_b": 1.0, + "p_b0_over_z0": 0.0313439, + "z0": 9.0 + }, + "k=1/2,b=1": { + "alpha1_gh60": 0.320155, + "alpha1_mc": 0.319112, + "alpha2_gh60": 0.00994791, + "alpha2_mc": 0.0100031, + "m2_b": 2.72014, + "p_b0_over_z0": 0.00897403, + "z0": 24.4813 + }, + "k=2,b=0": { + "alpha1_gh60": 2.1621, + "alpha1_mc": 2.16004, + "alpha2_gh60": 0.0169281, + "alpha2_mc": 0.0173858, + "m2_b": 1.0, + "p_b0_over_z0": 0.00195899, + "z0": 144.0 + }, + "k=2,b=1": { + "alpha1_gh60": 0.619027, + "alpha1_mc": 0.61844, + "alpha2_gh60": 0.00484668, + "alpha2_mc": 0.0049777, + "m2_b": 2.72014, + "p_b0_over_z0": 0.000560877, + "z0": 391.7 + } + }, + "schema": 1, + "scientific_effect": "NONE" +} diff --git a/frontiers/c6_cluster_coefficients_numerics_20260930/SOURCE_FILES.json b/frontiers/c6_cluster_coefficients_numerics_20260930/SOURCE_FILES.json new file mode 100644 index 000000000..a96c69cf8 --- /dev/null +++ b/frontiers/c6_cluster_coefficients_numerics_20260930/SOURCE_FILES.json @@ -0,0 +1,45 @@ +{ + "schema": 1, + "scientific_effect": "NONE", + "certified": false, + "review_status": "AUTHOR_SIDE_NUMERICAL_NOTE", + "files": [ + { + "path": "NOTE.md", + "bytes": 11018, + "sha256": "f20c1ac96b00edc071e428bd2e5dc4c91b8546a3ee0693367b783109b26aa518", + "git_blob": "845881d40520d4acbe15ee196a1ba0d5412eafa1" + }, + { + "path": "README.md", + "bytes": 1317, + "sha256": "1c47f7009455e1a4e72eb3f40e45def4fd4f530b61a87eb610d080bbed9bfbc0", + "git_blob": "5e7d05e10c3f61d2629bd5cf1ab47957860bf40f" + }, + { + "path": "RESULTS.json", + "bytes": 4095, + "sha256": "9c88ea85b6ba08199996c9b5ff74ecd06afc0f458e08c28b4c3af6191f437fcb", + "git_blob": "2648314f8c11f0637ce301ba76360142a8309e8f" + }, + { + "path": "SOURCE_MAP.json", + "bytes": 3651, + "sha256": "29ab4b897055724afcebb52d570f8271df60fe770b5a38bcb933bebffcedb7e6", + "git_blob": "443970cadfd2c06222f46fdf4582047f0ce13459" + }, + { + "path": "coefficients.py", + "bytes": 18825, + "sha256": "bcd63f0806a58a76a85189372bc6eee99fc3847c74dcc34906ef63464a64b97b", + "git_blob": "bd45a9fdecf300111b646644384dcead20c2e529" + } + ], + "nonauthor_reads": [ + { + "lane": "xAI/Grok", + "review_id": 5360559751, + "scope": "Slices A+B accepted as identities; Slice C empirical, not certified" + } + ] +} diff --git a/frontiers/c6_cluster_coefficients_numerics_20260930/SOURCE_MAP.json b/frontiers/c6_cluster_coefficients_numerics_20260930/SOURCE_MAP.json new file mode 100644 index 000000000..443970cad --- /dev/null +++ b/frontiers/c6_cluster_coefficients_numerics_20260930/SOURCE_MAP.json @@ -0,0 +1,55 @@ +{ + "schema": 1, + "object": "CL-C6-CLUSTER-COEFF-NUMERICS-20260930-v1", + "scientific_effect": "NONE", + "source_repository": "d6g8k5htny-coder/Math-", + "main_at_creation": "2479a7c2bcadf441517cadd1adff2cc07019b49d", + "note": "Numerical evaluation only. The formulas evaluated are (1.3)/(3.11) of [CL] at d = 2 (equivalently Theorem F of [CUB]) with the exact kernel of [LP] section 2. No source theorem is consumed as accepted; [CL] (Math-#159) was nonauthor-accepted (OpenAI review 5360192822, source-exposed) and merged to main on 30 September 2026 with the evaluated PROOF.md bytes unchanged; it is now pinned on main like the other sources. The numbers are floating-point quadrature and Monte Carlo values with reported standard errors, not enclosures. xAI/Grok review 5360559751 (30 September 2026, head 0b35e76) accepts Slices A and B as identities and reads Slice C as correctly empirical; recorded under nonauthor_reads without changing review_status (numerical note, not a theorem).", + "sources": [ + { + "path": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "bytes": 40261, + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "git_blob": "dfed3b8d318a3ab1950957f393307733a4bef3f2", + "id": "LP", + "commit": "2479a7c2bcadf441517cadd1adff2cc07019b49d", + "role": "section 2: the exact periodized Gaussian kernel K_L and its spectral weights a_n; section 3: contact frame U_0 and target v_0 = (b, 0, 0, 12k, 0, 0); (5.4)-(5.5): the full normalizer z_0 = lim Z_r / r^2", + "current_required": true, + "on_main": true + }, + { + "path": "frontiers/planar_cubic_cluster_20260929/PROOF.md", + "bytes": 19889, + "sha256": "117e9299a71e6139270266889eb772ed97518e402d9af029bbdb67caf9d4a0f0", + "git_blob": "bb446d08db8a944537a743ad550b88c1c2ad5758", + "id": "CUB", + "commit": "2479a7c2bcadf441517cadd1adff2cc07019b49d", + "role": "Theorem C (exact classifier of the extra window critical points of the sheared cubic; xAI-accepted at algebraic scope) and Theorem F (finite positive alpha_1, alpha_2; Claude-accepted); Theorem B (birth-height parity factorization)", + "current_required": true, + "on_main": true + }, + { + "path": "frontiers/c6_cluster_law_20260929/PROOF.md", + "bytes": 70131, + "sha256": "96b8e2d59defee6059bf151a896b7fc7c91fc529b385a3db8a87574901197b38", + "git_blob": "ba492c8e62e58bfc055fc8254c790e893d346ba5", + "id": "CL", + "commit": "98fdb54954a2d9ac0b8ba8ca03e279701f70d751", + "role": "(1.3) the near coefficient integral, (3.11) the reduced weight, section 1.4 (planar reduction m = p_0), Lemma 3.6 (saddles only; s-range) and section 3.8 (sheared form); Math-#159, nonauthor-accepted (OpenAI review 5360192822) and merged to main on 30 September 2026 with PROOF.md bytes unchanged", + "current_required": true, + "on_main": true + } + ], + "nonauthor_acceptance": false, + "governing_status_changed": false, + "main_at_update": "7d0c89a5bb77a52a7a661d7292ba5d955bd0a66d", + "nonauthor_reads": [ + { + "lane": "xAI/Grok", + "review_id": 5360559751, + "head": "0b35e76ff05676e6ad5c89171d65807668c8de15", + "date": "2026-09-30", + "disposition": "ACCEPT Slices A and B as identities (one-site covariances, even/odd regressions, b-free share, exact antiderivative and the two closed controls); Slice C read as correctly stated empirical precision, not certified; classifier-versus-direct table not re-audited; not a second acceptance of [CL]/[CUB]; same GitHub account, organizational-independence credit 0" + } + ] +} diff --git a/frontiers/c6_cluster_coefficients_numerics_20260930/coefficients.py b/frontiers/c6_cluster_coefficients_numerics_20260930/coefficients.py new file mode 100644 index 000000000..bd45a9fde --- /dev/null +++ b/frontiers/c6_cluster_coefficients_numerics_20260930/coefficients.py @@ -0,0 +1,357 @@ +"""Numerical evaluation of the planar near cluster coefficients alpha_1, alpha_2 (CL-C6-CLUSTER-COEFF-NUMERICS-20260930-v1). + +Standard library only. NOT a proof and NOT a certified enclosure: floating-point quadrature and Monte Carlo with +reported standard errors. Scientific effect NONE. + + python -B -S coefficients.py # full run: writes RESULTS.json (GH40, GH60, MC 1e6 per k) + python -B -S coefficients.py --check # quick replay: exact identities, closed forms, GH40 against RESULTS.json + python -B -S coefficients.py --check --mutant NAME # rc 1 for each name in MUTANTS +""" +import argparse, json, math, os, random, sys +from fractions import Fraction as F + +HERE = os.path.dirname(os.path.abspath(__file__)) +MUTANTS = ('cubic-sign', 'antiderivative', 'typed-boundary') +MUTANT = None +K_VALUES = (F(1, 2), F(1), F(2)) +B_VALUES = (F(0), F(1)) + +# ------------------------------------------------------------------ exact part: continuum Gaussian kernel jets +JETS = {'f': (0, 0), 'fx': (1, 0), 'fz': (0, 1), 'fxx': (2, 0), 'fxz': (1, 1), 'fzz': (0, 2), + 'fxxx': (3, 0), 'fxxz': (2, 1), 'fxzz': (1, 2), 'fzzz': (0, 3)} + +def hermite_moment(m): + """d^m/dx^m exp(-x^2/2) at 0 = (-1)^(m/2) (m-1)!! for even m, 0 for odd m.""" + if m % 2: return F(0) + v = F(1) + for j in range(1, m, 2): v *= j + return v if (m // 2) % 2 == 0 else -v + +def exact_cov(): + """Cov(d^alpha f(0), d^beta f(0)) = (-1)^|beta| d^(alpha+beta) K(0), K(z) = exp(-|z|^2/2).""" + C = {} + for u, au in JETS.items(): + for v, av in JETS.items(): + sign = -1 if (av[0] + av[1]) % 2 else 1 + C[(u, v)] = sign * hermite_moment(au[0] + av[0]) * hermite_moment(au[1] + av[1]) + return C + +def solve(A, B): + n = len(A); m = len(B[0]); Ab = [A[i][:] + B[i][:] for i in range(n)] + for i in range(n): + piv = next(r for r in range(i, n) if Ab[r][i] != 0) + Ab[i], Ab[piv] = Ab[piv], Ab[i]; p = Ab[i][i] + Ab[i] = [x / p for x in Ab[i]] + for r in range(n): + if r != i and Ab[r][i] != 0: + f = Ab[r][i]; Ab[r] = [x - f * y for x, y in zip(Ab[r], Ab[i])] + return [row[n:] for row in Ab] + +def regression(C, targets, outputs): + """(coefficient matrix K, conditional covariance) with mean = K . target values.""" + S_tt = [[C[(r, c)] for c in targets] for r in targets] + S_ot = [[C[(r, c)] for c in targets] for r in outputs] + S_oo = [[C[(r, c)] for c in outputs] for r in outputs] + Kt = solve(S_tt, [list(col) for col in zip(*S_ot)]) # S_tt^-1 S_ot^T + K = [list(col) for col in zip(*Kt)] # S_ot S_tt^-1 + cov = [[S_oo[i][j] - sum(K[i][t] * S_ot[j][t] for t in range(len(targets))) for j in range(len(outputs))] + for i in range(len(outputs))] + return K, cov + +def require(ok, msg): + if not ok: raise ValueError(msg) + +def exact_structure(): + C = exact_cov() + K_even, cov_even = regression(C, ['f', 'fxx', 'fxz'], ['fzz']) + require(K_even == [[F(-1), F(0), F(0)]], 'even block: mean of f_zz given (f, f_xx, f_xz) = (b,0,0) is -b') + require(cov_even == [[F(2)]], 'even block: conditional variance of f_zz is 2') + K_odd, cov_odd = regression(C, ['fx', 'fz', 'fxxx'], ['fxxz', 'fxzz', 'fzzz']) + require(all(K_odd[i][2] == 0 for i in range(3)), 'odd block: no dependence on the f_xxx = 12k pin') + require(K_odd[0][0] == 0 and K_odd[2][0] == 0 and K_odd[1][1] == 0, 'odd block: parity zeros') + require(cov_odd == [[F(2), F(0), F(0)], [F(0), F(2), F(0)], [F(0), F(0), F(6)]], + 'odd block: (f_xxz, f_xzz, f_zzz) | pins ~ N(0, diag(2, 2, 6))') + return {'mu_A': '-b', 'var_A': 2, 'odd_mean': [0, 0, 0], 'odd_cov_diag': [2, 2, 6], + 'var_fxxx': str(C[('fxxx', 'fxxx')]), 'cov_fx_fxxx': str(C[('fx', 'fxxx')])} + +# ------------------------------------------------------------------ lattice sums for the exact periodized kernel +def lattice_cov(L): + N = int(math.ceil(L * 2.6)) + 3; c = 2 * math.pi ** 2 / L ** 2 + Z = 0.0; M = {} + for n1 in range(-N, N + 1): + for n2 in range(-N, N + 1): + w = math.exp(-c * (n1 * n1 + n2 * n2)); Z += w + for p in range(0, 7, 2): + for q in range(0, 7, 2): + M[(p, q)] = M.get((p, q), 0.0) + w * n1 ** p * n2 ** q + C = {} + for u, au in JETS.items(): + for v, av in JETS.items(): + p, q = au[0] + av[0], au[1] + av[1] + if p % 2 or q % 2: C[(u, v)] = 0.0; continue + coef = (2j * math.pi / L) ** (au[0] + au[1]) * (-2j * math.pi / L) ** (av[0] + av[1]) + C[(u, v)] = (coef * M[(p, q)] / Z).real + return C + +# ------------------------------------------------------------------ the s-integral of the pin weight over {n = j} +def cubic_g(s, B, k, D2): + sgn = 1 if MUTANT == 'cubic-sign' else -1 + return -2 * s ** 3 + 3 * B * s ** 2 + sgn * B ** 3 - 12 * k * D2 + +def cubic_roots(B, k, D2): + g = lambda s: cubic_g(s, B, k, D2) + pts = sorted({-1e3 * (1 + abs(B) + k + D2), B, 0.0, 1e3 * (1 + abs(B) + k + D2)}) + while g(pts[0]) <= 0: pts[0] *= 2 + while g(pts[-1]) >= 0: pts[-1] *= 2 + roots = [] + for lo, hi in zip(pts[:-1], pts[1:]): + glo, ghi = g(lo), g(hi) + if glo == 0: roots.append(lo); continue + if glo * ghi < 0: + for _ in range(200): + mid = 0.5 * (lo + hi); gm = g(mid) + if gm == 0: lo = hi = mid; break + if glo * gm < 0: hi, ghi = mid, gm + else: lo, glo = mid, gm + roots.append(0.5 * (lo + hi)) + return sorted(set(roots)) + +def shear(a, b, c, k): + B = b - a * a / (12 * k); D = (c - a * b / (4 * k) + a ** 3 / (72 * k * k)) / 2 + return B, D + +def typed_top(B): + return -abs(B) if MUTANT == 'typed-boundary' else -abs(B) / 2 + +def n_classifier(s, a, b, c, k): + B, D = shear(a, b, c, k) + if not s < typed_top(B): return 0 + g = cubic_g(s, B, k, D * D) + if s > B: return 2 if g > 0 else 1 + return 1 if g < 0 else 0 + +def n_direct(s, a, b, c, k): + """critical points of G(u, Z) = C(u) + (s + Bu) Z^2/2 + (D/3) Z^3 off Z = 0 with height in (-k, 0).""" + B, D = shear(a, b, c, k); Cu = lambda u: 2 * k * u ** 3 - 1.5 * k * u - k / 2; hs = [] + if abs(D) > 1e-14: + A2 = 6 * k + B ** 3 / (2 * D * D); A1 = B * B * s / (D * D); A0 = B * s * s / (2 * D * D) - 1.5 * k + if abs(A2) < 1e-14: us = [-A0 / A1] if abs(A1) > 1e-14 else [] + else: + disc = A1 * A1 - 4 * A2 * A0 + us = [] if disc < 0 else [(-A1 + sg * math.sqrt(disc)) / (2 * A2) for sg in (1, -1)] + for u in us: + w = s + B * u; Z = -w / D + if abs(Z) > 1e-12: hs.append(Cu(u) + w * Z * Z / 2 + D * Z ** 3 / 3) + elif abs(B) > 1e-14: + u = -s / B; Z2 = 3 * k * (1 - 4 * u * u) / B + if Z2 > 1e-14: hs += [Cu(u), Cu(u)] + return sum(1 for h in hs if -k < h < 0) + +def antiderivative(s, B, k): + if MUTANT == 'antiderivative': return 12 * k * k * s ** 3 - 9 * k * k * B * s + return 12 * k * k * s ** 3 - 9 * k * k * B * B * s # of 9 k^2 (4 s^2 - B^2) + +def I_j(a, b, c, k): + B, D = shear(a, b, c, k); D2 = D * D; top = typed_top(B) + roots = cubic_roots(B, k, D2); g = lambda s: cubic_g(s, B, k, D2) + bps = [-math.inf] + roots + [math.inf]; pos, neg = [], [] + for lo, hi in zip(bps[:-1], bps[1:]): + if lo == -math.inf and hi == math.inf: mid = 0.0 + elif lo == -math.inf: mid = hi - 1.0 - abs(hi) + elif hi == math.inf: mid = lo + 1.0 + abs(lo) + else: mid = 0.5 * (lo + hi) + (pos if g(mid) > 0 else neg).append((lo, hi)) + def clip(lo, hi, a_, b_): + lo2, hi2 = max(lo, a_), min(hi, b_) + return antiderivative(hi2, B, k) - antiderivative(lo2, B, k) if hi2 > lo2 else 0.0 + I1 = sum(clip(lo, hi, -1e300, top) for lo, hi in neg) + I2 = sum(clip(lo, hi, B, top) for lo, hi in pos) if B < top else 0.0 + return I1, I2 + +# ------------------------------------------------------------------ prefactor p_b(0) / z_0, closed form +def phi(x): return math.exp(-x * x / 2) / math.sqrt(2 * math.pi) +def Phi(x): return 0.5 * math.erfc(-x / math.sqrt(2)) + +def prefactor(k, b): + """p_b(0) / z_0 with A ~ N(-b, 2): p_b(0) = phi(b/sqrt2)/sqrt2, z_0 = 36 k^2 E[A^2 1{A<0}].""" + t = b / math.sqrt(2) + m2 = (b * b + 2) * Phi(t) + math.sqrt(2) * b * phi(t) + return phi(t) / math.sqrt(2) / (36 * k * k * m2), m2 + +# ------------------------------------------------------------------ quadrature +def gauss_hermite(n): + """probabilists' Gauss-Hermite nodes/weights (sum of weights 1), by Newton on normalized Hermite functions.""" + nodes = [] + for i in range(1, n // 2 + 1): + if i == 1: x = math.sqrt(2 * n + 1) - 1.85575 * (2 * n + 1) ** (-1 / 6) + elif i == 2: x = nodes[-1] - 1.14 * n ** 0.426 / nodes[-1] + elif i == 3: x = 1.86 * nodes[-1] - 0.86 * nodes[0] + elif i == 4: x = 1.91 * nodes[-1] - 0.91 * nodes[-2] + else: x = 2 * nodes[-1] - nodes[-2] + for _ in range(100): + p0 = 1.0 / math.pi ** 0.25; pm, pc = p0, math.sqrt(2) * x * p0 + for j in range(2, n + 1): + pm, pc = pc, math.sqrt(2 / j) * x * pc - math.sqrt((j - 1) / j) * pm + dx = pc / (math.sqrt(2 * n) * pm); x -= dx + if abs(dx) < 1e-15: break + nodes.append(x) + out = [] + for x in sorted(set(nodes + [-v for v in nodes] + ([0.0] if n % 2 else []))): + p0 = 1.0 / math.pi ** 0.25; pm, pc = p0, math.sqrt(2) * x * p0 + for j in range(2, n + 1): + pm, pc = pc, math.sqrt(2 / j) * x * pc - math.sqrt((j - 1) / j) * pm + w = 2.0 / (2 * n * pm * pm) / math.sqrt(math.pi) + out.append((x * math.sqrt(2), w)) + return out + +SIG = (math.sqrt(2.0), math.sqrt(2.0), math.sqrt(6.0)) # odd block: N(0, diag(2, 2, 6)), exact structure + +def float_regression(C, targets, target_vals, outputs): + """Floating-point Gaussian regression (used only for the finite-L lattice covariance).""" + S_tt = [[C[(r, c)] for c in targets] for r in targets] + S_ot = [[C[(r, c)] for c in targets] for r in outputs] + S_oo = [[C[(r, c)] for c in outputs] for r in outputs] + n = len(targets); Ab = [S_tt[i][:] + [S_ot[j][i] for j in range(len(outputs))] for i in range(n)] + for i in range(n): + piv = max(range(i, n), key=lambda r: abs(Ab[r][i])); Ab[i], Ab[piv] = Ab[piv], Ab[i]; pv = Ab[i][i] + Ab[i] = [x / pv for x in Ab[i]] + for r in range(n): + if r != i and Ab[r][i] != 0.0: + f = Ab[r][i]; Ab[r] = [x - f * y for x, y in zip(Ab[r], Ab[i])] + K = [[Ab[i][n + j] for i in range(n)] for j in range(len(outputs))] # S_ot S_tt^-1 + mean = [sum(K[j][i] * target_vals[i] for i in range(n)) for j in range(len(outputs))] + cov = [[S_oo[a][b] - sum(K[a][i] * S_ot[b][i] for i in range(n)) for b in range(len(outputs))] for a in range(len(outputs))] + return mean, cov + +def cholesky(A): + n = len(A); Lm = [[0.0] * n for _ in range(n)] + for i in range(n): + for j in range(i + 1): + v = A[i][j] - sum(Lm[i][k] * Lm[j][k] for k in range(j)) + Lm[i][j] = math.sqrt(v) if i == j else v / Lm[j][j] + return Lm + +def lattice_setup(L, k, b): + """Finite-L contact regression from the lattice covariance: odd-block mean/Cholesky and the prefactor p_b(0)/z_0.""" + C = lattice_cov(L) + muA, covA = float_regression(C, ['f', 'fxx', 'fxz'], [b, 0.0, 0.0], ['fzz']) + muA = muA[0]; sA = math.sqrt(covA[0][0]); t = -muA / sA + m2 = muA * muA * Phi(t) - 2 * muA * sA * phi(t) + sA * sA * (Phi(t) - t * phi(t)) + pf = phi(t) / sA / (36 * k * k * m2) + muJ, covJ = float_regression(C, ['fx', 'fz', 'fxxx'], [0.0, 0.0, 12 * k], ['fxxz', 'fxzz', 'fzzz']) + return {'mu': muJ, 'chol': cholesky(covJ), 'prefactor': pf, 'muA': muA, 'varA': sA * sA, 'covJ': covJ} + +def J_gh_lattice(k, order, setup): + gh = gauss_hermite(order); mu, Lc = setup['mu'], setup['chol']; J1 = J2 = 0.0 + for x1, w1 in gh: + for x2, w2 in gh: + for x3, w3 in gh: + a = mu[0] + Lc[0][0] * x1 + bb = mu[1] + Lc[1][0] * x1 + Lc[1][1] * x2 + c = mu[2] + Lc[2][0] * x1 + Lc[2][1] * x2 + Lc[2][2] * x3 + i1, i2 = I_j(a, bb, c, k); w = w1 * w2 * w3 + J1 += w * i1; J2 += w * i2 + return J1, J2 + +def J_gh(k, order): + gh = gauss_hermite(order); J1 = J2 = 0.0 + for x1, w1 in gh: + for x2, w2 in gh: + for x3, w3 in gh: + i1, i2 = I_j(SIG[0] * x1, SIG[1] * x2, SIG[2] * x3, k); w = w1 * w2 * w3 + J1 += w * i1; J2 += w * i2 + return J1, J2 + +def J_mc(k, n, seed): + rng = random.Random(seed); s1 = s2 = q1 = q2 = 0.0 + for _ in range(n): + i1, i2 = I_j(SIG[0] * rng.gauss(0, 1), SIG[1] * rng.gauss(0, 1), SIG[2] * rng.gauss(0, 1), k) + s1 += i1; s2 += i2; q1 += i1 * i1; q2 += i2 * i2 + m1, m2 = s1 / n, s2 / n + return m1, m2, math.sqrt(max(q1 / n - m1 * m1, 0) / n), math.sqrt(max(q2 / n - m2 * m2, 0) / n) + +def sig6(x): return float('%.6g' % x) + +# ------------------------------------------------------------------ controls +def controls(): + ex = exact_structure() + # lattice sums at L = 24 and 12 agree with the continuum table + devs = {} + for L in (24.0, 12.0, 6.0): + C = lattice_cov(L); dev = 0.0 + for key, val in exact_cov().items(): + dev = max(dev, abs(C[key] - float(val))) + devs[str(int(L))] = dev + require(devs['24'] < 1e-9 and devs['12'] < 1e-9, 'lattice-sum jet covariances match the continuum Gaussian table at L = 24, 12') + require(1e-4 < devs['6'] < 2e-3, 'the finite-L correction at L = 6 is of order 1e-3 (recorded, not negligible)') + dev = devs + # classifier against direct root count on the typed domain + rng = random.Random(5); mism = 0 + for _ in range(4000): + k = rng.choice([0.5, 1.0, 2.0]); a, b, c = (rng.uniform(-4, 4) for _ in range(3)) + B, _ = shear(a, b, c, k); s = -abs(B) / 2 - rng.uniform(0, 6) + mism += n_classifier(s, a, b, c, k) != n_direct(s, a, b, c, k) + require(mism == 0, 'classifier agrees with the direct critical-point count on the typed domain') + # closed forms: [LM] cubic gives (0, 48 k^5); B = 0 family gives (72 k^3 D^2, 0); exact antiderivative identity + for k in (0.5, 1.0, 2.0): + i1, i2 = I_j(0.0, -2 * k, 0.0, k) + require(abs(i1) < 1e-9 and abs(i2 - 48 * k ** 5) < 1e-9 * (1 + 48 * k ** 5), '[LM] cubic mass 48 k^5 on n = 2') + i1, i2 = I_j(0.0, 0.0, 1.0, k) + require(abs(i2) < 1e-9 and abs(i1 - 18 * k ** 3) < 1e-9 * (1 + 18 * k ** 3), 'B = 0 family mass 72 k^3 D^2 on n = 1') + kq, Bq = F(1), F(-2); Fq = lambda s: 12 * kq * kq * s ** 3 - 9 * kq * kq * Bq * Bq * s + require(Fq(Bq / 2) - Fq(Bq) == 48, 'exact antiderivative of 9k^2(4s^2 - B^2) over (B, B/2) at k = 1, B = -2') + require(sum(w for _, w in gauss_hermite(40)) - 1 < 1e-12 and abs(sum(x * x * w for x, w in gauss_hermite(40)) - 1) < 1e-10, + 'Gauss-Hermite weights normalized') + return ex, devs + +def main(): + global MUTANT + ap = argparse.ArgumentParser(description=__doc__) + ap.add_argument('--check', action='store_true'); ap.add_argument('--mutant', choices=MUTANTS) + args = ap.parse_args(); MUTANT = args.mutant + try: + ex, dev = controls() + if args.check: + ref = json.load(open(os.path.join(HERE, 'RESULTS.json'))) + for k in K_VALUES: + J1, J2 = J_gh(float(k), 40) + rec = ref['per_k'][str(k)] + for got, name in ((J1, 'J1_gh40'), (J2, 'J2_gh40')): + require(abs(got - rec[name]) <= 1e-6 * (1 + abs(rec[name])), 'GH40 replay matches RESULTS.json for ' + name) + st6 = lattice_setup(6.0, 1.0, 0.0); J6 = J_gh_lattice(1.0, 40, st6); rec6 = ref['lattice_L6']['k=1'] + for got, name in ((J6[0], 'J1_gh40'), (J6[1], 'J2_gh40')): + require(abs(got - rec6[name]) <= 1e-6 * (1 + abs(rec6[name])), 'L = 6 GH40 replay matches RESULTS.json for ' + name) + print(json.dumps({'passed': True, 'mode': 'check', 'scientific_effect': 'NONE'}, sort_keys=True)) + return 0 + out = {'schema': 1, 'object': 'CL-C6-CLUSTER-COEFF-NUMERICS-20260930-v1', 'scientific_effect': 'NONE', + 'certified': False, 'method': 'exact contact regression + interval-exact s-integral + Gauss-Hermite / Monte Carlo', + 'exact_structure': ex, 'lattice_vs_continuum_max_dev': {L: sig6(v) for L, v in dev.items()}, 'per_k': {}, 'prefactor': {}, + 'lattice_L6': {}} + for k in K_VALUES: + kf = float(k) + g40 = J_gh(kf, 40); g60 = J_gh(kf, 60); mc = J_mc(kf, 1000000, seed=2026) + rec = {'J1_gh40': g40[0], 'J2_gh40': g40[1], 'J1_gh60': sig6(g60[0]), 'J2_gh60': sig6(g60[1]), + 'J1_mc': sig6(mc[0]), 'J2_mc': sig6(mc[1]), 'J1_mc_se': sig6(mc[2]), 'J2_mc_se': sig6(mc[3]), + 'ratio2_gh60': sig6(g60[1] / (g60[0] + g60[1])), 'palm_near_gh60': sig6(2 * g60[1] / (g60[0] + 2 * g60[1]))} + out['per_k'][str(k)] = rec + for b in B_VALUES: + pf, m2 = prefactor(kf, float(b)) + out['prefactor'][f'k={k},b={b}'] = {'p_b0_over_z0': sig6(pf), 'm2_b': sig6(m2), 'z0': sig6(36 * kf * kf * m2), + 'alpha1_gh60': sig6(pf * g60[0]), 'alpha2_gh60': sig6(pf * g60[1]), + 'alpha1_mc': sig6(pf * mc[0]), 'alpha2_mc': sig6(pf * mc[1])} + st6 = lattice_setup(6.0, kf, 0.0); J6 = J_gh_lattice(kf, 40, st6) + out['lattice_L6'][f'k={k}'] = {'J1_gh40': J6[0], 'J2_gh40': J6[1], 'prefactor_b0': sig6(st6['prefactor']), + 'alpha1_gh40': sig6(st6['prefactor'] * J6[0]), 'alpha2_gh40': sig6(st6['prefactor'] * J6[1]), + 'rel_dev_alpha1_vs_continuum_gh40': sig6(st6['prefactor'] * J6[0] / (prefactor(kf, 0.0)[0] * g40[0]) - 1), + 'rel_dev_alpha2_vs_continuum_gh40': sig6(st6['prefactor'] * J6[1] / (prefactor(kf, 0.0)[0] * g40[1]) - 1), + 'muJ': [sig6(x) for x in st6['mu']], 'varA': sig6(st6['varA']), 'muA': sig6(st6['muA'])} + print(f'k={k}: done', file=sys.stderr, flush=True) + path = os.path.join(HERE, 'RESULTS.json') + json.dump(out, open(path, 'w'), indent=2, sort_keys=True); open(path, 'a').write('\n') + print(json.dumps({'passed': True, 'mode': 'full', 'scientific_effect': 'NONE'}, sort_keys=True)) + return 0 + except ValueError as exc: + print(json.dumps({'passed': False, 'error': str(exc)}, sort_keys=True)); return 1 + +if __name__ == '__main__': + sys.exit(main()) diff --git a/frontiers/cluster_exponential_weight_20260930/INTERNAL_REVIEWS.md b/frontiers/cluster_exponential_weight_20260930/INTERNAL_REVIEWS.md new file mode 100644 index 000000000..a2f77a2d8 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/INTERNAL_REVIEWS.md @@ -0,0 +1,141 @@ +# Review chronology and current scoped disposition + +The original author-side snapshot below is preserved verbatim as published at +commit `0e70540b70e5e3183df5ed1a6bd70a212b734c9c` on 30 September 2026 UTC. +Its pending-review wording describes that original snapshot. The appended +current disposition records later actual native reviews of the same proof. + +## Original author-side snapshot (historical) + +# Internal challenges, exposure and unresolved review + +Target in both mathematical slices: PROOF.md, 12576 bytes, Git blob +`bf1268b9c18ec05561fd9b14c645ef0b8e530484`, SHA256 +`3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee`. +The target was not amended after either mathematical review. + +Root authored the proof. The two OpenAI agents below made no proof edits and +were noncontributors to this implication; both had the root's draft and source +copies as exposure. Same-provider work supplies **zero organizational +independence**. Exact model version was not independently verified. These are +internal challenge results, not external organizational review or acceptance +of either upstream theorem. Public nonauthor review of this packet remains +required; its disposition is AUTHOR_SIDE / CONDITIONAL. + +## Slice A: endpoint tails and normalization (agent exp_weight_tail_review) + +**ACCEPT — §§1–3, conditional on MF1 and SC(3). No amendment required.** + +The declared input interfaces agree: original variance-one periodized field, +endpoint regression, typed determinant weight, full endpoint-only normalizer, +and all-index additional count in the open height window with both pins +excluded. Setting T=L resolves the side-length notation. A fixed admissible +positive gap lies inside a compact family with positive gap floor. No extra +conditioning or size bias enters E1–E2. + +E1 gives sum n w(n)nu_r(n)<=C; retaining n yields the endpoint tail +sum_(n>M)w(n)nu_r(n)<=C/(M+1). Fatou gives the same bound for the limit. +Finite-coordinate convergence then proves EW1 at theta itself. Since w>=1, +a_r->a>0. Centering at zero gives E4; positive conditioning correctly uses +the denominator a_r. For q and theta'=0, exp(-s a_r) sum_j s^j nu_r^{*j}/j! is nonnegative with mass one; +the comparisons therefore use genuine compound-Poisson laws. Independence +supplies the convolution power of the one-copy law. m=0, t=0 and T=0 are +handled. For alpha=1, absolute weighted convergence controls PGFs uniformly +on the closed disk of radius exp(theta), with analyticity in the interior +and continuity at the boundary. For alpha<1, the proposed +n^-3 exp(-2theta n^alpha) contamination obeys the premise but yields +prelimit radius exactly one. No larger disk follows. + +Excluded stronger claims have concrete falsifiers: all replicas equal to +the same N_r defeats the compound-Poisson limit; a coefficient perturbation +1/|log r| defeats an automatic O(r³) replica rate and O(r6) one-copy +limiting-mark error; alpha>1 defeats E11 using two unit atoms. + +Custody caveat at the first read: SOURCES.json was not yet present and the +historical Git objects were unavailable locally. The root later supplied +SOURCES.json and separately verified the source identities through the +public GitHub connector. This is not attributed to the first reviewer as +a historical-tree replay. + +## Custody challenge, repair and separate re-review (agent exp_weight_tail_review) + +Initial verifier SHA256 `45bddfbdd3e4c8b9cf5dd7311f46db870856f28c93c3d6a2bbbf9d4a3ecc78bb`: +**AMEND**. Eight controls passed, but a tree could masquerade as a commit, +and local Git replacement refs could make absent paths pass under an empty +commit's identity. A boolean JSON schema also passed as integer 1. + +Root reproduced all three defects with failing tests before repair. Every +Git read now uses --no-replace-objects; cat-file requires object type commit; +schema requires an actual integer. Repaired verifier SHA256 +`0bc355e6b5bc4459d5395f1730456bca8bb26aa6220f94e657f6dd57f93d7784`: +**PASS — bounded custody re-review**, 11 controls in each Python mode. +The real manifest correctly fails locally when historical objects are absent. +This repair concerns custody code only, not a proof amendment or parent verdict. + +--- + +## Current disposition after actual native reviews (30 September 2026 UTC) + +The unchanged PROOF.md now has **scoped nonauthor ACCEPT, CONDITIONAL** for +Slice A (§§1–3) and Slice B (§§4–5). This supersedes the historical pending-review +status above; it does not rewrite the author-side challenges or make them +independent reviews. The complete actual bodies are retained in +[REVIEW_RECORD.json](REVIEW_RECORD.json): + +- [Anthropic/Claude A+B, review5360109371](https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360109371): + actual analytic acceptance of the elementary implications of E1–E2, at fixed + parameters with existential constants, independent copies and no rate. +- [OpenAI/Codex A, review5360144037](https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360144037): + §§1–3, E1–E10, conditional on the exact MF1 and SC(3) interfaces; Slice B + outside that individual verdict. +- [OpenAI/Codex B, review5360159070](https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360159070): + §§4–5, EW3/EW4, E11–E15 and dimension/independence/rate qualifications, + retaining E1–E2 and Slice A's endpoint consequence as dependencies. + +All three native objects identify original commit +`0e70540b70e5e3183df5ed1a6bd70a212b734c9c`, PROOF.md's 12,576 bytes, +Git blob `bf1268b9c18ec05561fd9b14c645ef0b8e530484`, and SHA256 +`3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee`. +Their source exposure is preserved in their complete native bodies, not +replaced by this summary. Claude identifies provider distinction from the +author and reviewer exposure to SC; both Codex reviewers disclose their earlier +source reviews and challenges. All use the same GitHub account and carry +**zero organizational-independence credit**. + +The original MF1/SC(3) statements remain imported hypotheses; these reviews +do not prove their Gaussian, spectral or regional parents, supply rates or +moving-mark uniformity, identify a spatial event, or justify spatial +independence. Scientific effect remains NONE. The later engineering repair +preserves every mathematical source byte. Its implementer previously reviewed +Slice B; that does not self-accept the engineering repair. A separate engineering +review, current-base CI and authorized integration remain distinct gates. + +VALIDATION.json is retained unchanged as the original author execution/history +record. The new packet guard binds its proof hash and REVIEW_RECORD.json's +proof identity to actual PROOF.md and checks MANIFEST.json membership and hashes. +Passing that guard establishes local custody only, not GitHub authenticity or +mathematical acceptance. diff --git a/frontiers/cluster_exponential_weight_20260930/MANIFEST.json b/frontiers/cluster_exponential_weight_20260930/MANIFEST.json new file mode 100644 index 000000000..b854d28a8 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/MANIFEST.json @@ -0,0 +1,85 @@ +{ + "files": [ + { + "path": "INTERNAL_REVIEWS.md", + "bytes": 8160, + "sha256": "3df02b032e97e735a3a52973312d6459aa103e069fde38359e250741e11b0f5d", + "git_blob": "a2f77a2d8e5516e1a851e6db06266edac7489cc3" + }, + { + "path": "PROOF.md", + "bytes": 12576, + "sha256": "3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee", + "git_blob": "bf1268b9c18ec05561fd9b14c645ef0b8e530484" + }, + { + "path": "README.md", + "bytes": 4224, + "sha256": "c4fe795143c4b922bea2f215e73b97ca30cd697f3aca2eabbd58f26ebea8f894", + "git_blob": "31bfd56bce487a695a46b257e95ef57a9af75689" + }, + { + "path": "RECONNAISSANCE.md", + "bytes": 1440, + "sha256": "fb0ecd7559e5d451c567896fcc8e5a614ad4f6cb010fdc9699b138ac4c62d847", + "git_blob": "e0b3d9ea52aff5b1abc4b808f96be416289adcb1" + }, + { + "path": "REVIEW_RECORD.json", + "bytes": 42755, + "sha256": "0d9239543a0c23eb476843f6c122884f2b6258c2bf371adad598266b2fa5b56e", + "git_blob": "ee34321999980716e320b8c25eb0f12a7abd3e15" + }, + { + "path": "SOURCES.json", + "bytes": 1650, + "sha256": "478bd0ad93200b0993562d1a7ea3a6f96c7e15620781df469df1e5c127a1b4a1", + "git_blob": "4b3eeb938bca54aa28ce4746028a2f152a94dac6" + }, + { + "path": "VALIDATION.json", + "bytes": 1932, + "sha256": "b1e6b78b10c61820e3ee25db4602348690a2f20dd63348de37f5aa0dec0e1347", + "git_blob": "ab9e91fce0c8b8dba5c69a3538ed6dad826794b2" + }, + { + "path": "finite_checks.py", + "bytes": 7409, + "sha256": "143e3a64f7f07d2d2e0c29bb5dae5cc1ad59b06d50650ff72dc1daf4e1be8ad2", + "git_blob": "86d7f2482acf9326f47b9e39ebe3d56a92fce8f1" + }, + { + "path": "test_finite_checks.py", + "bytes": 11876, + "sha256": "134f7e3074afa8b5fa2e5fbc67fd7867b246434469e00d96575e51a3df477787", + "git_blob": "d350286f0b1291813d6c0dcbb9c3b849e1b0e2f3" + }, + { + "path": "test_verify_packet.py", + "bytes": 9862, + "sha256": "6409627e94f41358d880aacb25f90fc58b693c641c5c9251d54424c4188243e4", + "git_blob": "e597b179f3d116ae79e15c616f3b17b4f13630ea" + }, + { + "path": "test_verify_sources.py", + "bytes": 4863, + "sha256": "ac8a0ae72e3f1982ea722992ae3c9af2684454301a7fc7d407ea3e23e5b3186f", + "git_blob": "0cde3642d6fff16223e94003978d9a00e1de9383" + }, + { + "path": "verify_packet.py", + "bytes": 5441, + "sha256": "a505f52939e10eff494aab7ae81f7dce96f5ea8f78a94a34e49d689fa15aceab", + "git_blob": "70b540e53f9921885c62a2a09724d022fdadcadf" + }, + { + "path": "verify_sources.py", + "bytes": 3410, + "sha256": "0bc355e6b5bc4459d5395f1730456bca8bb26aa6220f94e657f6dd57f93d7784", + "git_blob": "a8ac3636c011337d9d4a12f4cd052d666572afb8" + } + ], + "manifest_self_excluded": true, + "schema": 1, + "scientific_effect": "NONE" +} diff --git a/frontiers/cluster_exponential_weight_20260930/PROOF.md b/frontiers/cluster_exponential_weight_20260930/PROOF.md new file mode 100644 index 000000000..bf1268b9c --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/PROOF.md @@ -0,0 +1,259 @@ +# Endpoint exponential-weight closure and independent-replica error + +Object: OA-CLUSTER-EXP-WEIGHT-20260930-v1. +Author: OpenAI / Codex. Date: 30 September 2026 UTC. +Disposition: AUTHOR_SIDE conditional proof; nonauthor review required. +Scientific effect NONE. No source theorem, review, register, graph, prize or +Boolean is changed. This is a new implication of two exact interfaces, not a +proof or retrospective acceptance of either interface. + +## 1. Exact consumption and the mathematical purpose + +Fix one dimension d>=2, torus side L>0, real birth b, gap k>0 and frame. Use the +same variance-one periodized field, endpoint observations, ORIGINAL typed +determinant weight W_r, full endpoint-only Z_r and law Q_r^W=(W_r/Z_r)Q_r as +the two sources. N_r is their ALL-INDEX additional critical-point count in +(b-k r^3,b), with both endpoint pins excluded. In the marked source T=L; a +fixed admissible mark can be placed inside its compact family. No further +normalizer, height conditioning, or Palm size bias enters this definition. + +The source interface [MF] is MF1 at Math-#157, exact commit +cbb2f978f9b3e8e2eaca94f3b359b18d7c144f1b. For alpha=2/d there exist +theta>0, C0 such that + + E_QW[N_r exp(theta N_r^alpha)] <= C r^3. (E1) + +The source interface [SC] is (3) at Math-#162, exact commit +7a44130b41b827577424a73c4feac4cde20b5568. At these fixed parameters, + + nu_r(n)=r^-3 Q_r^W(N_r=n), n>=1, + nu=nu1 delta_1+nu2 delta_2, 0 nu(n) for each n>=1. (E2) + +[SC] proves more than the coordinate convergence consumed here. Its separate +A/B/C review requirements and parent premises remain separate; an open slice +is not discharged by this implication. [MF] has its own Fourier-regression +and regional marked-Kac--Rice premises. SOURCES.json binds both full texts. + +[MF] Section7 previously gives only subsequential weighted compactness from +(E1). [SC] identifies the coefficients in polynomial weights without consuming +(E1). Here their intersection removes the subsequence in exponential weights, +including a boundary exponent that does not require slack. It also gives a +finite error bound for replica sums in that stronger norm. The generic +probability argument below is self-contained and does not use a new Gaussian +regression, Kac--Rice formula, spatial independence, or a coefficient rate. + +## 2. The endpoint norm theorem + +For a signed or complex measure sigma on the nonnegative integers define + + ||sigma||_w = sum_(n>=0) w(n)|sigma(n)|, + w(n)=exp(theta n^alpha), w(0)=1. (E3) + +Measures nu_r and nu have zero mass at0. Put epsilon_r=||nu_r-nu||_w. + +**Theorem EW1.** Under (E1)--(E2), epsilon_r ->0 as r->0. This is convergence +at theta ITSELF, not only at theta'0. (E4) + +The zero mass is centered; r^-3 Q(N_r=0) has no finite limit. + +**Proof.** Equation(E1) is exactly + + sum_(n>=1) n w(n)nu_r(n)<=C. (E5) + +For every integer M>=1, + + sum_(n>M) w(n)nu_r(n)<= C/(M+1). (E6) + +Fatou on finite sums in(E2) gives sum n w(n)nu(n)<=C. Therefore the same +tail estimate holds for nu. On1<=n<=M, coordinate convergence and finiteness +of the sum give convergence in the w-norm. The norm outside that set is at +most2C/(M+1). First let r->0 at fixed M, then M->infinity. This proves EW1. +The retained n factor in(E5), not an extra exponential moment, supplies the +endpoint uniform integrability. Since |a_r-a|<=epsilon_r and the exact law is +delta_0+r^3 H_r, (E4) follows. The full original tilt was used once in(E1) +and(E2); this step introduces no additional field normalizer. QED. + +**Theorem EW2.** For every fixed integer q>=0 and0<=theta'=1) n^q exp(theta' n^alpha)|nu_r(n)-nu(n)| ->0. (E7) + +In particular the positive-conditioned law converges in the ENDPOINT w-norm +to nu/a. The size-biased law converges in every STRICTLY smaller exponential +weight exp(theta'n^alpha) to +(nu1 delta_1+2nu2 delta_2)/(nu1+2nu2). + +**Proof.** Put gamma=theta-theta'>0. On n>M the weighted tail of nu_r is bounded +by + + C sup_(n>M) n^(q-1) exp(-gamma n^alpha), (E8) + +which tends to zero. The same holds for nu by Fatou. Finite-coordinate +convergence proves(E7). For positive conditioning use a_r->a>0 and + + ||nu_r/a_r-nu/a||_w + <= epsilon_r/a_r+|a_r-a| ||nu||_w/(a a_r). + +For size bias let z_r=sum n nu_r(n), z=nu1+2nu2. The q=1 case of(E7) gives +convergence of n nu_r in the smaller exponential norm and z_r->z>0. Divide +by z_r as above. These are distinct denominators and distinct probability +laws. QED. + +## 3. Why endpoint size bias is excluded: an exact escaping-mass example + +The endpoint exponent for EW1 does NOT justify n times that weight. For any +00 take m=m(r)>=3 tending to infinity and + + nu_r=delta_1+delta_2+eta_m delta_m, + eta_m=1/[m exp(theta m^alpha)]. (E9) + +For small r, define the genuine probability law +mu_r=(1-r^3(2+eta_m))delta_0+r^3 nu_r. Its nonempty intensity satisfies(E2) +with nu1=nu2=1 and satisfies(E5) with the constant +exp(theta)+2exp(theta 2^alpha)+1. Every fixed polynomial moment of nu_r +converges. Its endpoint norm error is exactly1/m, as EW1 requires. + +But z_r=3+exp(-theta m^alpha). The size-biased law has w-weighted mass + + w(m) m eta_m/z_r=1/[3+exp(-theta m^alpha)] ->1/3 (E10) + +at m, where the limiting size-biased law has zero mass. It therefore fails +endpoint weighted convergence. This is a counterexample to a tempting stronger +inference, not a counterexample to the Gaussian source law. Extra uniform +integrability at n exp(theta n^alpha) would be needed for that inference. + +## 4. Weighted convolution and an explicit replica bound + +**Lemma EW3 (convolution algebra).** For0=0, +(x+y)^alpha<=x^alpha+y^alpha, so w(x+y)<=w(x)w(y). Thus on measures with finite +w-norm, convolution satisfies + + ||sigma*tau||_w<=||sigma||_w ||tau||_w. (E11) + +This normed space is complete, has identity delta_0, and +exp_*(A)=sum_(j>=0) A^(*j)/j! converges in norm with +||exp_*(A)||_w<=exp(||A||_w). + +**Proof.** For alpha<1, the derivative in y of (x+y)^alpha-y^alpha is +nonpositive for y>0, and its value at y=0 is x^alpha. For alpha=1 equality +holds. Multiplying absolute convolution coefficients by w, summing and using +nonnegative Fubini gives(E11). Completeness is that of weighted l1, equivalently +ordinary l1 after multiplying coordinates by w. The exponential series is +dominated in norm by the scalar exponential series. QED. + +Let delta=r^3, m_r(t)=floor(t/delta), and take m_r(t) deliberately INDEPENDENT +copies of N_r. Write their sum as S_r(t). By(E5), ||H_r||_w<=2C and +||H||_w<=2C. Choose B=2C. Let + + P_t=Law(P1+2P2), P1~Pois(t nu1), P2~Pois(t nu2), + P1 and P2 independent. + +**Theorem EW4.** For every finite T>=0 and all0<=t<=T, + + ||Law(S_r(t))-P_t||_w + <= exp(TB)[delta(TB^2/2+B)+2T epsilon_r]. (E12) + +In particular the replica laws converge uniformly on bounded t intervals in +the endpoint exponential-weight norm. This includes weighted tail control, +not only an ordinary TV or PGF limit. It claims no rate for epsilon_r. + +**Proof.** One-copy law is u_r=delta_0+delta H_r. Independence gives the exact +law u_r^(*m). The convolution exponential + + exp_*(s H_r)=exp(-s a_r) sum_(j>=0) s^j nu_r^(*j)/j! + +is a compound-Poisson probability law. Thus exp_*(t H)=P_t. These are +convolution exponentials of signed generators, not signed approximating +probability laws. The series remainder obeys + + ||exp_*(delta H_r)-u_r||_w + <= delta^2 B^2 exp(delta B)/2. (E13) + +Indeed for every j>=2,1/j!<=1/[2(j-2)!], so the scalar remainder is bounded +by that right side. Also ||u_r||_w<=1+delta B<=exp(delta B). +Telescoping m convolution factors with(E11) gives, for m>=1, + + ||u_r^(*m)-exp_*(m delta H_r)||_w + <= m delta^2 B^2 exp(m delta B)/2 + <= t delta B^2 exp(tB)/2. (E14) + +For m=0 the first difference is zero. For any A,D in this commutative algebra, +norm differentiation of the exponential series and integration in s imply + + exp_*(A)-exp_*(D) + = integral_0^1 exp_*((1-s)D+sA)*(A-D) ds, + ||exp_*(A)-exp_*(D)||_w + <= ||A-D||_w exp(max(||A||_w,||D||_w)). (E15) + +The floor error0<=t-m delta=1)(nu_r(n)-nu(n))(z^n-1)|<=2epsilon_r. + +Each PGF is analytic in its interior and continuous on the boundary. By(E12) +the replica PGFs converge uniformly on that closed disk to +exp[t nu1(z-1)+t nu2(z^2-1)], uniformly0<=t<=T. This does not claim an analytic +neighborhood beyond that disk for each prelimit. + +For d>2, alpha<1. No common disk extending the unit disk follows from(E1) +and(E2), despite the finite-support limit. To see this, let q(n),n>=3, be a +probability proportional to n^-3 exp(-2theta n^alpha), and set +nu_r=delta_1+delta_2+epsilon(r)q with epsilon(r)>0 tending to zero. It satisfies +(E1)--(E2): sum n exp(theta n^alpha)q(n)1, +sum z^n q(n)=infinity, since n log z-2theta n^alpha-3log n ->infinity. +The associated small-r probability laws are constructed exactly as in(E9). +So prelimit PGFs may have radius1. The endpoint convolution norm result still +holds. This generic counterexample does not assert that Gaussian counts +actually have radius1; a larger radius needs another argument. + +## 6. Scope, source exposure, falsifiers and review division + +The elementary theorems EW1--EW4 apply to ANY nonnegative-integer laws satisfying +(E1)--(E2), with delta=r^3; the proofs also work for another positive delta->0. +Their application here is conditional on BOTH full mathematical interfaces +at the listed fixed parameters. This does not upgrade [SC]'s fixed-parameter +claim to mark-uniform convergence, or [MF]'s compact-family statement to +unbounded birth/gap/dimension/volume. Constants theta,C,B are existential; +no extra coefficient digits or numerical enclosure is claimed. + +The author is exposed to both OpenAI source packets and the prior Slice-C +review of [SC]. That source-exposed work is not independent acceptance of +[SC] or [MF]. Internal OpenAI challenge agents have zero organizational +independence. A contributor who changes this proof cannot self-accept it. +Finite checks, custody hashes and CI establish finite/custody facts only. + +Falsifiers of the conditional application: unequal original W/Z/count +interfaces; failure of(E1) at any sufficiently small r; failure of(E2)'s +coefficient limit; replacement of independent copies by coupled copies. +Falsifiers of the NEW implication: an arithmetic/algebra error in the tail +bound(E6), absolute convolution(E11), floor/telescoping ledger(E12)--(E15), +or normalized-law passage. The exact examples(E9)--(E10) preserve the failure +of endpoint SIZE-BIASED convergence; they must not be removed from an honest +stronger-weight statement. The dimension counterexample preserves the +non-implication of a complex neighborhood for alpha<1. + +Proposed nonauthor slices, each independently rejectable: +A: endpoint intensity tails, strict-weight moments, positive/size-biased +normalizations and the escaping-mass falsifier (§§2--3). +B: submultiplicative convolution, uniform replica error and actual-versus-limit +mark rate (§4), plus the complex-disk boundary (§5). +The parent Gaussian/spectral and Fourier arguments are OUTSIDE these slices. +No merge or scientific-status transition is justified solely by this packet. diff --git a/frontiers/cluster_exponential_weight_20260930/README.md b/frontiers/cluster_exponential_weight_20260930/README.md new file mode 100644 index 000000000..31bfd56bc --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/README.md @@ -0,0 +1,71 @@ +# Endpoint exponential-weight closure + +Read [the complete conditional proof](PROOF.md) and [the exact inputs](SOURCES.json). +The packet combines Math-#157 MF1 with Math-#162's fixed-parameter coefficient +limit. Neither parent is accepted or promoted by this combination. + +It proves convergence of the nonempty count intensity in the endpoint norm +sum exp(theta n^(2/d))|nu_r(n)-nu(n)|, removes the subsequence from #157's +weighted consequence, and gives an explicit uniform finite-time replica bound. +Positive conditioning retains that endpoint weight. Size bias requires a +strictly smaller exponent; an exact escaping-mass counterexample preserves +this boundary. The replica construction uses independent copies of the field. + +The earlier polynomial and ordinary-TV consequences remain credited to the +input packets. No spatial independence, new Gaussian theorem, convergence +rate for coefficients, uniformity in moving marks, or numerical enclosure +is introduced. The unchanged proof now has actual scoped nonauthor +**ACCEPT, CONDITIONAL** dispositions for Slice A (§§1–3) and Slice B (§§4–5). +The [source-bound review record](REVIEW_RECORD.json) preserves the actual native +bodies, original commit, exact proof identity and exposure. These reviews +retain MF1 and SC(3) as imported premises; they do not accept the parents or +establish engineering merge readiness. Scientific effect NONE. + +The three recorded reviews are [Claude A+B](https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360109371), +[Codex A](https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360144037), +and [Codex B](https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360159070), +all on original commit `0e70540b70e5e3183df5ed1a6bd70a212b734c9c` and +proof SHA256 `3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee`. +They use the same GitHub account and carry zero organizational-independence +credit. The original author-side [validation history](VALIDATION.json) and +the dated original section of [internal challenges](INTERNAL_REVIEWS.md) +remain historical snapshots; their pending-review language is not the current +disposition. + +## Bounded plan and verification + +1. Bind the two existing interfaces at exact commit/path/blob/SHA256 identities. +2. Prove endpoint tail tightness and retain the failure of endpoint size bias. +3. Prove the weighted convolution and floor/Euler/intensity error ledger. +4. Run independent finite rational controls and deliberate wrong variants. +5. Preserve the completed source-bound reviews of §§1–3 and §§4–5, including + exact original source exposure, in REVIEW_RECORD.json. +6. Publish on an isolated additive branch; require real source-tree verification + and current-head hosted checks before any engineering integration. + +From the repository root, run the commands used by the packet workflow: + +```sh +packet=frontiers/cluster_exponential_weight_20260930 +python -B -S "$packet/verify_packet.py" +python -B -O -S "$packet/verify_packet.py" +python -B -S "$packet/finite_checks.py" +python -B -O -S "$packet/finite_checks.py" +python -B -S -m unittest discover -s "$packet" -p 'test_*.py' -v +python -B -O -S -m unittest discover -s "$packet" -p 'test_*.py' -v +python -B -S "$packet/verify_sources.py" --repo-root . +``` + +The two finite-control outputs must be byte-identical; they establish finite +arithmetic only. The packet guard enforces exact file membership and recorded +byte counts, SHA256 and Git blobs, excluding the manifest itself. It separately +binds VALIDATION.json and REVIEW_RECORD.json to the unchanged PROOF.md. +This checks custody, not remote review authenticity or mathematical acceptance. +VALIDATION.json is a historical record, not finite_checks.py output. Historical +source verification requires both pinned Git objects in a complete checkout; +connector-acquired copies do not substitute for that historical-tree check. + +Publication adds this packet and its isolated workflow only. Existing sources, +root indexes, live integration branches and scientific registers stay under +their own owners. Internal OpenAI challenge reviews carry zero organizational +independence and never self-accept the author's amendments. diff --git a/frontiers/cluster_exponential_weight_20260930/RECONNAISSANCE.md b/frontiers/cluster_exponential_weight_20260930/RECONNAISSANCE.md new file mode 100644 index 000000000..e0b3d9ea5 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/RECONNAISSANCE.md @@ -0,0 +1,27 @@ +# Reconnaissance memo — 30 September 2026 UTC + +Purpose: check the literature context for the elementary compound-Poisson +convolution step, without importing an unverified external theorem or making +novelty claims. + +Consensus was queried for compound-Poisson approximation with weighted total +variation and submultiplicative convolution weights. That lookup could not +complete. No Consensus result is claimed or consumed. + +Two primary author records were retrieved directly afterward: + +- Bero Roos, *Refined total variation bounds in the multivariate and compound + Poisson approximation*, arXiv:1509.04167v2, revised7 March2017: + https://arxiv.org/abs/1509.04167v2 . The abstract concerns approximation of + convolutions by compound-Poisson and signed measures. Only the abstract was + read here; no exact bound or weighted theorem from that paper is consumed. +- A.D. Barbour, Oliver Johnson, Ioannis Kontoyiannis and Mokshay Madiman, + *Compound Poisson Approximation via Information Functionals*, + arXiv:1004.3692v1, submitted21 April2010: + https://arxiv.org/abs/1004.3692v1 . The abstract gives independent-sum + compound-Poisson approximation context. Only the abstract was read; its + information-functional machinery is not used. + +The new implication is proved directly in PROOF.md using a weighted l1 +convolution algebra. This memo gives limited context, not a priority/novelty +audit and not an additional mathematical premise. diff --git a/frontiers/cluster_exponential_weight_20260930/REVIEW_RECORD.json b/frontiers/cluster_exponential_weight_20260930/REVIEW_RECORD.json new file mode 100644 index 000000000..ee3432199 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/REVIEW_RECORD.json @@ -0,0 +1,57 @@ +{ + "schema": 1, + "scientific_effect": "NONE", + "recorded_at_utc": "2026-09-30", + "original_review_head": "0e70540b70e5e3183df5ed1a6bd70a212b734c9c", + "proof": { + "path": "PROOF.md", + "bytes": 12576, + "sha256": "3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee", + "git_blob": "bf1268b9c18ec05561fd9b14c645ef0b8e530484" + }, + "source_map": { + "path": "SOURCES.json", + "bytes": 1650, + "sha256": "478bd0ad93200b0993562d1a7ea3a6f96c7e15620781df469df1e5c127a1b4a1", + "git_blob": "4b3eeb938bca54aa28ce4746028a2f152a94dac6" + }, + "current_disposition": "Scoped nonauthor ACCEPT, CONDITIONAL: Slice A and Slice B at the exact original proof bytes. Imported MF1 and SC(3), fixed parameters, independent copies and all stated limits remain hypotheses or restrictions. No parent acceptance, register transition or engineering merge readiness is inferred.", + "identity_policy": "verify_packet.py binds this declared proof identity to the actual proof and verifies this record through MANIFEST.json. It does not authenticate GitHub, recompute analytic review, or accept mathematical conclusions. The native records below were read back through authenticated GitHub access; their exact bodies and original source exposure are retained.", + "exposure_and_credit": [ + "Review5360109371 identifies Anthropic/Claude, provider-distinct from the mathematical author, same GitHub account, zero organizational-independence credit, reviewer-only prior exposure to SC.", + "Review5360144037 identifies OpenAI/Codex agent /root/c17_metadata_repair, same provider as the mathematical author; it discloses prior SC Slice A review and later complementary Claude exposure.", + "Review5360159070 identifies OpenAI/Codex agent /root/c17_pr158_slice_d_audit, same provider as the mathematical author; it discloses prior157 engineering,158D,162 spectral challenge and triage exposure, plus one same-provider internal challenge. It did not consume the complementary Claude analytic review before its own verdict.", + "All three native reviews use the same GitHub account. Provider distinction is not organizational independence. These records add no vote beyond the original scoped reviews.", + "The later C23 engineering repair was implemented by the prior Slice B reviewer, preserving the proof and mathematical sources. That contribution cannot self-accept the engineering repair; a separate nonauthor engineering review and current-base CI remain required." + ], + "historical_records": "VALIDATION.json and the original portion of INTERNAL_REVIEWS.md remain the original author-side snapshot, including pending-review language and historical run counts. This record supplies the later actual scoped dispositions without rewriting that history.", + "native_reviews": [ + { + "id": 5360109371, + "html_url": "https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360109371", + "commit_id": "0e70540b70e5e3183df5ed1a6bd70a212b734c9c", + "submitted_at": "2026-09-30T00:30:29Z", + "state": "COMMENTED", + "body": "## Anthropic/Claude NONAUTHOR analytic review — **Slices A (§§2–3) and B (§§4–5)** — exact head `0e70540b70e5e3183df5ed1a6bd70a212b734c9c`\n\n`frontiers/cluster_exponential_weight_20260930/PROOF.md`, blob `bf1268b9c18ec05561fd9b14c645ef0b8e530484`, SHA256 `3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee`, 12576 B. Scientific effect **NONE**. Will not merge. Exposure and provenance as in pickup [5901664947](https://github.com/d6g8k5htny-coder/Math-/pull/164#issuecomment-5901664947): provider-distinct from the author, same GitHub account, zero organizational-independence credit; not the author of [MF] or [SC]; reviewer-only exposure to [SC].\n\n### Interface check (§1) before the slices\n- [MF] at `cbb2f978`, blob `efb702f6…`, SHA256 `a5163679…` (verified from the object store): MF1 is `E_{Q_r^W}[N exp(θ N^{2/d})] ≤ C r³` for the original variance-one periodized field, original value/gradient pins, typed `W_r`, endpoint-only `Z_r`, `Q_r^W = (W_r/Z_r)Q_r`, all-index count in `(b − kr³, b)` excluding both pins, uniformly on a fixed compact family (`T` is the torus side). Fixing one parameter inside the family is legitimate. ✔\n- [SC] at `7a44130`, blob `16c56821…`: (3) at fixed `d, L, b, k, frame` with the same `W_r`, `Z_r`, `N_r` (§1 of that proof) gives, at `q = 0`, the coordinate convergence `r^{−3}Q(N_r = n) → ν1 1{n=1} + ν2 1{n=2}` with `0 < ν1 = a1 + β_far, ν2 = a2 < ∞`. ✔ So (E1)–(E2) are the two sources' statements at one common parameter, with identical `W/Z/count` interfaces; the packet's \"unequal interfaces\" falsifier does not fire.\n\n### VERDICT: **ACCEPT Slice A** (EW1, EW2, the escaping-mass example §3) and **ACCEPT Slice B** (Lemma EW3, EW4 with (E12)–(E15), the actual-versus-limit mark remark, and the §5 dimension boundary) — as elementary implications of (E1)–(E2) for any nonnegative-integer laws with `δ = r³`, at fixed `d, L, b, k, frame`, existential `θ, C, B`, independent copies only, no rate. No defect found. Four non-blocking wording notes.\n\n### Slice A — what I checked\n- **(E5)/(E6).** `r^{−3}E[N_r w(N_r)] = Σ_{n≥1} n w(n) ν_r(n)` (the `n = 0` term vanishes), so (E1) is (E5); for `n > M`, `1 ≤ n/(M+1)` gives (E6). Passing to the limit in the finite sums `Σ_{n≤M} n w(n) ν_r(n) ≤ C` and letting `M → ∞` gives `Σ n w(n) ν(n) ≤ C`, hence the same tail for `ν`. ✔\n- **EW1.** `ε_r ≤ Σ_{n≤M} w(n)|ν_r(n) − ν(n)| + 2C/(M+1)`; `r → 0` then `M → ∞`. Convergence at `θ` itself, as claimed: the retained factor `n` is what supplies the uniform integrability. **(E4):** `Law(N_r) = (1 − r³a_r)δ_0 + r³ν_r`, so `r^{−3}(Law − δ_0) = H_r`; `‖H_r − H‖_w = |a_r − a| + Σ_{n≥1} w|ν_r − ν| ≤ 2ε_r` since `w ≥ 1` gives `|a_r − a| ≤ ε_r`. ✔ The zero mass is centred, not scaled. ✔\n- **EW2.** With `γ = θ − θ' > 0`, `Σ_{n>M} n^q e^{θ'n^α}ν_r(n) ≤ C sup_{n>M} n^{q−1}e^{−γn^α} → 0` for every fixed `q` (E8); same for `ν`; finite coordinates converge. Positive conditioning: `ν_r/a_r` is `Law(N_r | N_r ≥ 1)`, `a_r → a > 0`, and the displayed two-term bound is the triangle inequality with `‖ν‖_w ≤ C`. Size bias: `nν_r(n)/z_r` is `N_r dQ_r^W/EN_r` on `{n ≥ 1}`; `q = 1` in (E7) gives the strictly-smaller-weight convergence and `z_r → ν1 + 2ν2`; limit `(ν1δ_1 + 2ν2δ_2)/(ν1 + 2ν2)`. ✔ The two denominators are correctly kept distinct.\n- **§3 example.** `Σ n w(n)ν_r(n) = e^θ + 2e^{θ2^α} + 1` (the `m` term is exactly 1) ✔; `ν_r(n) → ν(n)` coordinatewise as `m(r) → ∞` ✔; polynomial moments `m^{q−1}e^{−θm^α} → 0` ✔; `‖ν_r − ν‖_w = w(m)η_m = 1/m` ✔; `z_r = 3 + e^{−θm^α}` ✔; size-biased `w`-mass at `m` equals `1/(3 + e^{−θm^α}) → 1/3` (E10) while the limit size-biased law has no mass there ✔; `μ_r` is a probability law once `r³(2 + η_m) ≤ 1` ✔. This is a correct counterexample to endpoint size-biased convergence under (E1)–(E2) alone.\n\n### Slice B — what I checked\n- **Lemma EW3.** `(x+y)^α ≤ x^α + y^α` on `x, y ≥ 0`, `0 < α ≤ 1` (the derivative argument is right: `α[(x+y)^{α−1} − y^{α−1}] ≤ 0`, value `x^α` at `y = 0`), hence `w(x+y) ≤ w(x)w(y)` with `w(0) = 1`; (E11) by nonnegative Fubini; `(ℓ¹_w, *)` is a unital commutative Banach algebra (`‖δ_0‖_w = 1`), so `exp_*` converges with `‖exp_*(A)‖_w ≤ e^{‖A‖_w}`. ✔\n- **`B = 2C`.** `‖H_r‖_w = a_r + Σ_{n≥1} wν_r ≤ 2Σ_{n≥1} wν_r ≤ 2Σ nwν_r ≤ 2C`; same for `H`. ✔\n- **Compound Poisson identification.** `exp_*(sH_r) = e^{−sa_r}Σ_j s^jν_r^{*j}/j!` (commutativity, `exp_*(−sa_rδ_0) = e^{−sa_r}δ_0`) is the compound-Poisson law with intensity `sν_r`; `exp_*(tH) = Law(P1 + 2P2)` ✔.\n- **(E13).** `‖Σ_{j≥2}δ^jH_r^{*j}/j!‖ ≤ Σ_{j≥2}δ^jB^j/j! ≤ (δ²B²/2)e^{δB}` by `j! ≥ 2(j−2)!` ✔; `‖u_r‖_w ≤ 1 + δB ≤ e^{δB}` ✔.\n- **(E14).** Telescoping `u^{*m} − E^{*m} = Σ_{i 2`: `q(n) ∝ n^{−3}e^{−2θn^α}` has `Σ n e^{θn^α}q(n) < ∞` yet `Σ z^n q(n) = ∞` for every `z > 1`, so the prelimit PGF radius is 1; the laws are built as in (E9). Correct, and correctly limited to \"no common disk follows\", not a claim about the Gaussian counts. ✔\n\n### Custody (finite/custody facts only, never proof)\nWorktree at `0e70540`: `test_finite_checks` + `test_verify_sources` → **23/23** in `-B -S` and `-B -O -S`; `finite_checks.py` output byte-identical across the two modes (`12` checks, `8` positive, `4` intended negatives all rejected); `verify_sources.py --repo-root` reproduces both pinned identities (MF `efb702f6…`/`a5163679…`, SC `16c56821…`/`e971b2cb…`); tree clean. Hosted checks on `0e70540` read SUCCESS (`exact-exponential`, downstream, formal, gates). `VALIDATION.json` is a record file, not the checker's output, so no byte comparison to it is claimed.\n\n### Non-blocking wording notes\n1. §2, EW1 proof: \"Fatou on finite sums\" — the step is a limit of finite sums followed by `M → ∞` (monotone convergence of the partial sums); naming it so avoids a reader looking for a lim inf of a series.\n2. (E6) and (E8) use `ν_r ≥ 0` and `w ≥ 1`; one clause \"(`w ≥ 1`, so `|a_r − a| ≤ ε_r`)\" before (E4) would make the factor 2 self-evident.\n3. §3: say once that `μ_r` is a probability law for `r³(2 + η_m) ≤ 1`, i.e. for small `r` (the text says \"for small r\" in the definition but not why).\n4. §5, `d = 2`: the closed disk `|z| ≤ e^θ` is where the *intensity* PGFs converge by (E4); the replica PGF statement uses (E12) — already so, but one cross-reference to (E12) in the sentence would help.\n\n### Not established by this review\nNothing beyond Slices A and B at the scope above: no revalidation of [MF] or [SC] or of their parents; no mark-uniformity, no rate for `ε_r`, no within-field Poisson process, no spatial independence, no numerical constant; no register transition, no merge, and no second independent vote (same account; provider-distinct from the author and from the Codex pickup, but Claude sibling sessions share my provider).\n\n---\n_Generated by [Claude Code](https://claude.ai/code)_", + "github_login": "d6g8k5htny-coder" + }, + { + "id": 5360144037, + "html_url": "https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360144037", + "commit_id": "0e70540b70e5e3183df5ed1a6bd70a212b734c9c", + "submitted_at": "2026-09-30T00:36:55Z", + "state": "COMMENTED", + "body": "# C22 — nonauthor analytic review of PR164 Slice A\n\n**Verdict: ACCEPT Slice A, §§1–3, equations (E1)–(E10), as an elementary implication conditional on the exact MF1 and SC(3) interfaces. No blocking defect found.** The two imported statements are checked for matching objects and scope; their Gaussian, Fourier, spectral and regional proofs are not reaccepted by this review. Slice B, §§4–5, is outside this verdict.\n\nThe reviewed object is `OA-CLUSTER-EXP-WEIGHT-20260930-v1`, Math PR164, exact head `0e70540b70e5e3183df5ed1a6bd70a212b734c9c`, path `frontiers/cluster_exponential_weight_20260930/PROOF.md`: **12,576 bytes**, SHA256 `3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee`, Git blob `bf1268b9c18ec05561fd9b14c645ef0b8e530484`. I read the complete actual proof, then reconstructed §§1–3 and the consumed source interfaces. Later sections were read for boundaries, not reviewed as Slice B.\n\nScientific effect **NONE**. This review does not authorize a register transition, a source amendment, a whole-PR acceptance or a merge. Organizational-independence credit is **zero**.\n\n## Authorship, exposure and coordination\n\nI am the OpenAI/Codex review agent `/root/c17_metadata_repair`, operating in the GPT-6 agent environment. I did not author or modify PR164's proof, its implementation, or either consumed mathematical source. My earlier work includes an unpublished C17 metadata repair that was stopped after a competing author's successor, triage exposure, the actual PR162 Slice A nonauthor review, and the C21 delivery builder. Reviewing SC Slice A is prior exposure; its verdict is not transferred into acceptance of SC(3) or this new implication. This is fresh review of PR164's new conditional probability argument, with disclosed source exposure and the same provider as its author.\n\nThe first independent current timeline read showed only the author's request5901532627 and our actual pickup5901632715. Claim `cb43a8b2-57e1-4e51-8cab-21c9efa7fe6a` was read back in Work Events296, with expiry2026-09-30T02:26:20Z. I verified the exact row in root's saved actual readback before creating review evidence. Source and evidence writes are confined to this review directory; no source file or remote object was changed.\n\nAfter my analytic reconstruction and exact control runs were complete, the final coordination read exposed complementary Claude pickup5901664947 and actual review5360109371 at the same original head. That review's body was returned in the live timeline and therefore constitutes disclosed later exposure. It is not the basis for my reconstruction, tests or verdict, supplies no additional organizational independence, and is not counted as my work. Its remarks do not change the calculations recorded below. The timeline also identifies the separate C23 engineering pickup5901702618; that is not a competing analytic claim and is not integration evidence for this report. The shared GitHub account does not identify an independent organization. I did not use author-side internal challenges as review substitutes.\n\n## Exact parent interfaces and the common probability law\n\nThe target `SOURCES.json` contains two immutable proof inputs. Both full texts were read. Existing source bytes were reused only after byte count, SHA256 and computed Git-blob verification; no whole-Drive or repository recrawl occurred.\n\n| Input | Exact source | Identity | Consumption here |\n| --- | --- | --- | --- |\n| MF | `cbb2f978f9b3e8e2eaca94f3b359b18d7c144f1b`, `frontiers/c6_marked_fourier_20260929/PROOF.md` | 15,304 bytes; SHA256 `a5163679400d7d68c1c51538c9ed4ac111015487f79e820057f4ff3e20d09544`; blob `efb702f601eb0c0a24dad6d125061158158867b9` | MF1 at one fixed admissible parameter; its Fourier-regression and regional marked-Kac–Rice premises remain imported. Author: OpenAI / ChatGPT. |\n| SC | `7a44130b41b827577424a73c4feac4cde20b5568`, `frontiers/spectral_cluster_closure_20260929/PROOF.md` | 25,006 bytes; SHA256 `e971b2cbe50a8a06b47c1219191201e0d1037c9adac23e5e3b7d2051bb70c2eb`; blob `16c56821b52fd76b0be791622b9c3809eafde75a` | Coordinate consequence of (3), together with finite positive ν1,ν2, at fixed d,L,b,k,frame. Its other slices and imported premises remain separate. Author: OpenAI / GPT-6 Astra Pro. |\n\nMF §1 fixes the original variance-one periodized field, original maximum/saddle value-and-gradient endpoint pins, endpoint-conditioned Q_r, typed determinant product W_r, full endpoint-only Z_r, and Q_r^W=(W_r/Z_r)Q_r. Its N counts additional **all-index** critical points in the open height window `(b-k r³,b)`, excluding both pins. SC §1 explicitly defines the same observations at M=(-r/2,0), S=(r/2,0), the same typed product `F_d(H_M)F_(d-1)(H_S)`, same tilt, and same count. MF's torus-side notation T agrees with SC's L. There is no restriction to a single extra-point index, elder-selected points, or branch-adjacent points in the consumed count.\n\nFor any one admissible fixed d≥2, L>0, real b, k>0 and frame, the fixed mark can be placed inside the declared compact family with a positive gap floor. Restricting MF's compact-family assertion to that point supplies θ>0, C<∞ and r_* without making them explicit, uniform in unbounded b/k, or uniform in dimension/volume. SC(3) is explicitly fixed-parameter. Its q=0 consequence implies every coordinate limit in E2, with ν1=a1+β_far and ν2=a2 strictly positive and finite. None of these premises gives a convergence rate.\n\nConsequently the common law can consistently satisfy E1 and E2 without a change of normalization. All later divisions by a_r or z_r define new count laws only where the proof explicitly asks for them. They are not inserted into MF1, SC(3), W_r or Z_r. As a check on the distinction, the probability law with masses μ(1)=μ(2)=δ and μ(0)=1-2δ has full-law `E[N2^N]=10δ`, while conditioning on N≥1 gives expectation5. The latter cannot replace an O(δ) input bound. The retained original full tilt is essential.\n\n## EW1: retained-index endpoint tail and centered zero\n\nSet α=2/d, so 0<α≤1, and w(n)=exp(θn^α), w(0)=1. The measures ν_r and ν are nonnegative and have zero mass at0. Multiplying E1 by r^-3 gives the exact identity\n\n`sum_{n≥1} n w(n)ν_r(n) = r^-3 E_QW[N_r w(N_r)] ≤ C`.\n\nThere is no zero-atom contribution because of the factor n. For integer n>M, n≥M+1, hence\n\n`sum_{n>M} w(n)ν_r(n) ≤ (M+1)^-1 sum_{n>M} n w(n)ν_r(n) ≤ C/(M+1)`.\n\nThe denominator M+1 is sharp under this sole moment bound: a measure concentrated at M+1 with mass `C/[(M+1)w(M+1)]` attains equality. The stronger denominator M+2 is false. This also identifies precisely what would be lost if the retained n were dropped. A bound only on `sum wν_r` allows a mass `1/w(m)` to move to m→∞ while keeping endpoint weighted mass1; coordinate convergence alone would not eliminate it.\n\nFor each finite K, coordinate convergence gives `sum_{n≤K} n w(n)ν(n)≤C`. Increasing K proves the same full bound for ν by monotone convergence of nonnegative partial sums. This is the elementary content of the text's “Fatou on finite sums.” No dominated convergence of the whole infinite series is being assumed. In particular ν has the same C/(M+1) tail, and `||ν||_w≤C`.\n\nWriting ε_r=||ν_r−ν||_w, split the norm at a fixed M. The finite part tends to0; the rest is at most2C/(M+1). Thus `limsup_{r→0} ε_r≤2C/(M+1)` for every M, and sending M→∞ proves ε_r→0. The θ in the norm is exactly the θ from E1. No larger exponential moment or smaller-exponent slack was used. The order of limits is fixed M first, then M→∞.\n\nLet a_r=sumν_r and a=sumν=ν1+ν2>0. Since w≥1, `|a_r−a|≤ε_r`. The exact complete probability law is\n\n`μ_r=Law_QW(N_r)=(1−r³a_r)δ_0+r³ν_r=δ_0+r³H_r`, where `H_r=ν_r−a_rδ_0`.\n\nSupports at0 and at positive integers are disjoint, so there is an exact norm identity, stronger than the displayed inequality:\n\n`||r^-3(μ_r−δ_0)−H||_w = ε_r+|a_r−a| ≤ 2ε_r`, with `H=ν−aδ_0`.\n\nThis verifies E4. The uncentered scaled zero atom is `r^-3μ_r(0)=r^-3−a_r→+∞`; it cannot be silently included in a finite nonempty intensity measure. H and H_r have total signed mass0. The actual tests exercise this identity on genuine probability laws, including signed coefficient differences and the zero-error case.\n\n## EW2: strict exponent gap and the two normalized laws\n\nFix an integer q≥0 and 0≤θ'<θ, and set γ=θ−θ'>0. On n≥1,\n\n`n^q exp(θ'n^α) = n w(n) · n^(q−1) exp(−γn^α)`.\n\nTherefore the tail in E8 is bounded by `C sup_{n>M} n^(q−1)exp(−γn^α)`. The ratio tends to0 because `(q−1)log n−γn^α→−∞` for every fixed q and α>0. For q=0 the n^-1 factor is defined on the positive support and presents no singular zero-coordinate issue. The same bound holds for ν from the just-established moment bound. Finite-coordinate convergence then proves E7. This argument covers θ'=0, which supplies all polynomial moments and in particular first-moment convergence. It supplies no rate for ε_r or E7: coordinate convergence on the finite portion has no specified rate.\n\nFor conditioning on positivity, `Q(N_r≥1)=r³a_r`, so the conditional count distribution is ν_r/a_r. Because a_r→a>0, its denominator is bounded away from0 for all sufficiently small r. The triangle decomposition\n\n`ν_r/a_r−ν/a = (ν_r−ν)/a_r + ν(1/a_r−1/a)`\n\ngives the displayed bound `ε_r/a_r+|a_r−a|||ν||_w/(aa_r)`, which tends to0 at the **endpoint θ**. Its limit is `(ν1δ_1+ν2δ_2)/(ν1+ν2)`.\n\nFor size bias, the original first moment is `E_QW N_r = r³z_r`, where z_r=sum nν_r(n). The count law is `nν_r(n)/z_r`. E7 with q=1 and any strictly smaller θ' gives convergence of nν_r in that smaller weighted norm. Since its weights are at least1, it also gives z_r→z=ν1+2ν2>0. The same triangle argument with denominator z_r yields the asserted strict-weight convergence. Its limit is `(ν1δ_1+2ν2δ_2)/(ν1+2ν2)`.\n\nThe denominators a_r and z_r are distinct. With ν1,ν2>0 the two limiting distributions are distinct as well. The proof does not infer endpoint size-biased convergence from mere boundedness of its endpoint moment, and MF2's boundedness is not such a convergence statement. No additional field normalizer is introduced by these explicitly named count-law operations.\n\nA concrete no-rate family reinforces the qualifier: take θ=log2, α=1, r→0 and ν_r=(1+r)δ_1+δ_2. It satisfies the same type of uniform E5 bound and the required positive finite coordinate limit, but ε_r=2r and ε_r/r³=2/r²→∞. A sufficiently small-r probability law is again formed with zero mass1−r³sumν_r. Consequently coefficient convergence cannot be assigned an automatic O(r³) rate. This is an implication counterexample, not a statement about the source field's actual rate.\n\n## E9–E10: the genuine escaping-mass counterexample\n\nFix any 0<α≤1, θ>0 and any integer m=m(r)≥3 tending to∞. Let `t_m=exp(−θm^α)` and `η_m=t_m/m`. Then ν_r=δ_1+δ_2+η_mδ_m has total mass2+η_m, and η_m≤1/3. Hence, for all sufficiently small r, `r³(2+η_m)≤1` and the displayed μ_r is a genuine nonnegative probability law with positive nonempty intensity exactly ν_r.\n\nFor every fixed coordinate n≥3, the moving atom eventually leaves n; coordinates1 and2 stay1. Thus E2 holds with ν1=ν2=1. The full retained-index exponential budget is exactly\n\n`sum n w(n)ν_r(n) = exp(θ)+2exp(θ2^α)+m exp(θm^α)η_m = exp(θ)+2exp(θ2^α)+1`.\n\nIt is independent of r. Thus the actual μ_r satisfies E1 with that fixed constant. For every fixed polynomial moment q, the moving atom contributes `m^qη_m=m^(q−1)exp(−θm^α)→0`. The endpoint intensity error is exactly `w(m)η_m=1/m→0`, in accordance with EW1.\n\nBut z_r=3+t_m, and the size-biased law assigns m mass `mη_m/z_r=t_m/(3+t_m)`. Weighting it by w(m)=1/t_m gives exactly `1/(3+t_m)→1/3`. The limiting size-biased distribution is supported on1,2 and has zero mass at m. Absolute weighted norm cannot cancel that moving positive contribution. Indeed, the entire endpoint norm error is\n\n`1/(3+t_m) + [w(1)+2w(2)] t_m/[3(3+t_m)] → 1/3`.\n\nThis directly verifies the failure of endpoint weighted convergence, not merely failure of one proposed proof. The ordinary and strict-weight size-biased limits remain consistent with EW2 because the escaping weighted contribution then contains the decaying factor exp[−(θ−θ')m^α]. No contradiction with the endpoint positive-conditioned law occurs: its escaped weighted mass is `1/[m(2+η_m)]→0`.\n\nThe example is fully within the abstract assumptions E1–E2, so it refutes the stronger implication from those assumptions alone. It is expressly not asserted to arise from the Gaussian field. An additional uniform-integrability condition on n w(n)ν_r, or a genuinely stronger moment premise sufficient for it, would be needed to infer endpoint size-biased convergence.\n\n## Actual finite evidence and falsification controls\n\nThe independent script `exact_controls.py` is **8,655 bytes**, SHA256 `f8f0b8af48ca8cfa697cdc91076a96d4cfa9f761b006a839077a1c79681c966d`. It does not import or execute the author's verifier or finite controls. It uses exact Fraction arithmetic, explicit exceptions rather than removable assertions, and transparent rational interval bounds. The analytic derivation above proves the general statements; these finite calculations detect concrete algebraic/scope failures and do not prove Gaussian inputs or infinite-limit theorems by testing.\n\nThere were **20 actual executions**, ten with `-B -S` and ten with `-B -S -O`. In each mode the baseline exited0, all eight deliberate mutants exited1, and the unknown-mutant check exited2. Every corresponding stdout is byte-identical between modes. Original command vectors, return codes, stdout/stderr files and hashes are preserved in `controls/`. `execution-summary.json` is11,186 bytes, SHA256 `8b8faf298e8bfe7acf032ef7a3b3053f06373405f518fc4eaa2cc17be9b97d1f`. The deterministic baseline `RESULTS.json` is580 bytes, SHA256 `6e591f2400d7482695328aa664a53f90e0a88147ed8a9a65ee44c0c6cdb153a8`.\n\nThe positive checks comprise 1,458 retained-index tail inequalities,16 sharp M+1 atoms and M+2 falsifiers,12 exact centered-law identities,12 distinct normalized-law cases,62 genuine escaping probability laws,217 exact strict-exponent-gap identities,33 higher-dimensional rational interval cases, and6 no-automatic-rate cases. For d=2 the weight is exactly2^n. For d=4,6,8, choosing m=j^(d/2) makes m^(2/d)=j and w(m)=2^j exact; the sole irrational small-support weight w(2) lies in[2,4]. E5 is affine in that value, giving the rigorous rational budget interval[7,11]. This interval control is not a numerical coefficient claim.\n\nThe eight deliberately rejected alterations are:\n\n1. Dropping the retained n while retaining the endpoint tail conclusion.\n2. Replacing the sharp denominator M+1 by M+2.\n3. Scaling the raw zero atom without centering it.\n4. Using the size-biased denominator for positive conditioning.\n5. Using the positive-conditioning denominator for size bias.\n6. Inferring endpoint size-biased convergence from E1–E2.\n7. Assigning an automatic r³ coefficient-convergence rate.\n8. Substituting a nonempty-conditioned normalization for the original full tilt in MF1.\n\nThese controls supplement the explicit counterexamples and exact equalities in this report. No full master verification was run or is claimed for this read-only analytic review.\n\n## Retained obligations\n\nAcceptance is confined to the conditional implication in §§1–3 at the original immutable head. MF1 and SC(3) and all their imported hypotheses retain their separate review obligations and scopes. This report supplies no new global field estimate, coefficient value or rate, mark-uniform result, varying-dimension/volume assertion, spatial independence, elder pairing, event-identification result, or RN/JETMOD/prize closure. Independent-copy consequences belong to separately reviewed Slice B. A source amendment would require an affected fresh review; hash equality, CI and this scoped verdict do not authorize whole-PR integration by themselves.\n", + "github_login": "d6g8k5htny-coder" + }, + { + "id": 5360159070, + "html_url": "https://github.com/d6g8k5htny-coder/Math-/pull/164#pullrequestreview-5360159070", + "commit_id": "0e70540b70e5e3183df5ed1a6bd70a212b734c9c", + "submitted_at": "2026-09-30T00:38:56Z", + "state": "COMMENTED", + "body": "# PR164 Slice B — actual nonauthor analytic review\n\nDisposition: **ACCEPT, CONDITIONAL**, limited to PROOF.md §§4–5 (EW3, EW4,\nE11–E15, the actual-versus-limit mark-rate qualification, and the dimension\nboundary for complex PGFs). No actionable defect found in that scope.\n\nThis is an actual reconstruction by the OpenAI/Codex agent\n`/root/c17_pr158_slice_d_audit`, completed 30 September 2026 UTC. It is neither\nauthor self-acceptance nor an organizationally independent vote. The parent\nagent owns any native GitHub publication and disposition. This directory makes\nno remote change and cannot itself merge or change scientific status.\n\n## Exact object and authority\n\nRepository: `d6g8k5htny-coder/Math-`, PR164, exact head\n`0e70540b70e5e3183df5ed1a6bd70a212b734c9c`.\n\nReviewed full source:\n`frontiers/cluster_exponential_weight_20260930/PROOF.md`.\n\n- Bytes: `12576`.\n- Git blob: `bf1268b9c18ec05561fd9b14c645ef0b8e530484`.\n- SHA256: `3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee`.\n- Source-map bytes: `1650`; SHA256\n `478bd0ad93200b0993562d1a7ea3a6f96c7e15620781df469df1e5c127a1b4a1`.\n\nFresh PR metadata was read back during this review: same head, draft/open,\nbase `aa288385af9392c509233c25a0f4012c9ba023e5`. This review is of immutable\nmathematical bytes; those metadata do not establish current-base merge readiness.\n\nRoot R17 claim `cb43a8b2-57e1-4e51-8cab-21c9efa7fe6a` was read back in Work\nEvents row296, with expiry `2026-09-30T02:26:20Z`; pickup comment5901632715.\nThe exact claim/readback envelope is preserved as `claim-and-entry.json`.\nRoot authorized material output only in this Slice-B directory. The later\nClaude complementary pickup reported by root was coordination information,\nnot a premise or source of this verdict; I did not consume its analytic review.\n\n## Provider, authorship, and exposure\n\nActual provider/model identity available here: OpenAI/Codex. No unverifiable\nmodel version or external provider is imputed. I did not author PR164, either\nmathematical source, or the prior #157 mathematical proof. Prior exposure\nincludes #157's engineering workflow repair, #158 Slice D analytic review,\n#162's spectral-Jacobian challenge, and coordination triage. This review read\nthe full PR164 proof, its exact source map, and the consumed parent interfaces.\nI did not read PR164's author internal-review packet or import its test program.\n\nA separate internal read-only challenge agent,\n`/root/c17_pr158_slice_d_audit/c22_pgf_challenge`, directly fetched and read the\nsame full proof and challenged only §5 and the §4 independence/no-rate\nqualifications. It inherited our context and used the same provider. Its report\nis summarized separately in `CHALLENGE.md`; it supplies **zero additional\norganizational independence and no separate vote**. My derivations of the full\nSlice B ledger and the persisted test implementation remain this review's\nown work. Slice A is another agent's assignment and is not accepted here.\n\n## Pinned hypotheses, retained without re-proving them\n\nThe exact parent source bytes were hash-verified and preserved:\n\n| Interface | Immutable source | Bytes | SHA256 |\n|---|---|---:|---|\n| MF1: weighted first moment | commit `cbb2f978f9b3e8e2eaca94f3b359b18d7c144f1b`, `frontiers/c6_marked_fourier_20260929/PROOF.md`, blob `efb702f601eb0c0a24dad6d125061158158867b9` | 15304 | `a5163679400d7d68c1c51538c9ed4ac111015487f79e820057f4ff3e20d09544` |\n| SC(3): coordinate limit | commit `7a44130b41b827577424a73c4feac4cde20b5568`, `frontiers/spectral_cluster_closure_20260929/PROOF.md`, blob `16c56821b52fd76b0be791622b9c3809eafde75a` | 25006 | `e971b2cbe50a8a06b47c1219191201e0d1037c9adac23e5e3b7d2051bb70c2eb` |\n\nMF1 uses the variance-one periodized field, endpoint regression, original typed\nweight W, full endpoint-only Z, and the all-index additional count in the open\nwindow `(b-k*r^3,b)`, with both pins excluded. SC §1 names the same objects and\npins. MF's torus notation T corresponds to the fixed torus side L here; its\ncompact-family guarantee may be evaluated at this one fixed admissible mark.\nSC(3) supplies positive finite nu1,nu2 and coordinate convergence at these\nfixed parameters. None of the matching read or byte verification re-proves\nthe Gaussian, Fourier, regional Kac–Rice, spectral, or global-assembly parents.\n\nFor this slice I retain E1/E2 and Slice A's endpoint conclusion\n`epsilon_r=||nu_r-nu||_w -> 0` as hypotheses/dependencies. In particular, my\nverdict does not independently accept §§2–3, source-status changes, unresolved\nparent premises, or mark-uniformity. E5 is the exact re-expression of E1:\n`sum n*w(n)*nu_r(n) <= C`. All statements below apply for sufficiently small r\nwhere that interface holds, with one fixed dimension, torus, birth, gap, frame,\ntheta and C. No source of an epsilon rate or additional normalizer is supplied.\n\n## Analytic reconstruction\n\n### EW3 and the algebra required by EW4\n\nFor `00, the derivative of\n`(x+y)^alpha-y^alpha` is nonpositive. Its limit at y=0 is x^alpha, proving\nsubadditivity; the x=0 and alpha=1 cases are immediate. Consequently\n`w(n+m)<=w(n)*w(m)` on nonnegative integers. For signed or complex measures,\nthe triangle inequality followed by nonnegative Fubini bounds the convolution\nnorm by the product of norms. This simultaneously justifies absolute\nconvergence and rearrangement. The coordinate map `sigma(n) -> w(n)*sigma(n)`\nis an isometry to ordinary l1, giving completeness; delta0 is a norm-one unit.\nNo positivity of signed generators is needed for E11.\n\nThe exponential series converges absolutely in this unital commutative Banach\nalgebra, with norm bounded by the scalar exponential. The use of a commutative\nalgebra matters for the simple E15 derivative identity; it holds here because\naddition of the nonnegative integer indices commutes. There is no missing\nnoncommutative correction.\n\n### The actual one-copy law and B\n\nBy definition of nu_r on the positive indices, the one-copy law is exactly\n`u_r=delta0+delta*H_r`, with `delta=r^3` and\n`H_r=nu_r-a_r*delta0`. The coefficient at zero is centered. For small r this\nis an actual probability measure, already supplied by the original law, not\nan arbitrarily signed approximation.\n\nSince n>=1 and w(n)>=1,\n`||nu_r||_w<=C`, `a_r<=C`, and hence `||H_r||_w<=2C=B`.\nThe limit has the same bounds by finite-sum Fatou under coordinate convergence.\nAlso `|a_r-a|<=epsilon_r`, so `||H_r-H||_w<=2*epsilon_r`; the zero-coordinate\nerror is essential even when not sharp. For s>=0, splitting the commuting\ngenerator gives\n`exp_*(s*H_r)=exp(-s*a_r)*sum_j s^j*nu_r^(*j)/j!`, which is a compound-Poisson\nprobability law. For `H=nu1*delta1+nu2*delta2-(nu1+nu2)*delta0`, it is exactly\nthe law of the stated independent Poisson counts with jump sizes one and two.\n\n### E13, E14, E15, and the complete error ledger\n\nFor E13, the jth remainder norm is at most `(delta*B)^j/j!`. For j>=2,\n`1/j!<=1/[2*(j-2)!]`, giving the displayed\n`delta^2*B^2*exp(delta*B)/2`. The power delta^2 and coefficient1/2 are correct.\n\nLet `v=exp_*(delta*H_r)`. For m>=1, the exact telescoping difference of m\nconvolution factors has m terms. Each remaining product contains m-1 factors,\neach with norm at most `exp(delta*B)`: for u use `1+delta*B<=exp(delta*B)`;\nfor v use the exponential norm bound. Thus each error term contributes at\nmost `delta^2*B^2*exp(m*delta*B)/2`, and their sum has the factor m in E14.\nThere is no extra uncompensated `exp(delta*B)` after counting all factors.\nFor m=0 both powers are the unit and that difference is exactly zero.\n\nFor E15, set `G(s)=D+s*(A-D)`. Norm-convergent differentiation, justified\nuniformly on the compact s interval by the exponential majorant, gives\n`d exp_*(G(s))/ds=exp_*(G(s))*(A-D)`. Its Bochner integral is the desired\ndifference. Convexity of the norm gives\n`||G(s)||<=max(||A||,||D||)`, proving the stated Lipschitz bound. This\nargument is valid for both signed-real and complex sequences.\n\nThe triangle decomposition is precisely\n\n1. `u_r^(*m)` to `exp_*(m*delta*H_r)` (Euler term);\n2. `exp_*(m*delta*H_r)` to `exp_*(t*H_r)` (floor term);\n3. `exp_*(t*H_r)` to `exp_*(t*H)` (intensity replacement).\n\nWith `m=floor(t/delta)`, `m*delta<=t` and `0<=t-m*delta2, alpha<1. The normalization constant for\n`q(n) proportional to n^-3*exp(-2*theta*n^alpha), n>=3`, is finite and\nstrictly positive. Its required weighted first moment is the finite series\n`constant*sum n^-2*exp(-theta*n^alpha)`. A positive function epsilon(r)->0\nis bounded for sufficiently small r, so the perturbed intensities have one\nuniform E1 constant and converge at each fixed index as in E2. Choosing r\nsmall makes `1-r^3*(2+epsilon(r))` nonnegative, giving genuine probability\nlaws. For every real z>1, the logarithm of the unnormalized PGF term is\n`n*log(z)-2*theta*n^alpha-3*log(n)`, which tends to positive infinity, since\nalpha<1. Thus the terms do not even tend to zero. Their radius is exactly\none because the laws still have finite total mass. The conclusion is a\nfailure of implication for the abstract interfaces; it says nothing negative\nabout the actual Gaussian count's analytic radius.\n\n## Actual finite and interval controls\n\n`verify_slice_b.py` is a new independent implementation using only Python's\nstandard library. It imports neither the author verifier nor any parent test.\nI executed it once successfully; `execution.json` captures the actual command,\nPython version, start/end time, exit code, and exact stdout/stderr hashes.\n`verification.stdout` and `.stderr` are the captured original byte streams.\nThe source identities are checked again during that execution.\n\n- 81 finite signed-rational convolution pairs satisfy E11 and commutativity.\n- 567 exact finite telescoping identities include the zero-factor case.\n- 567 homogeneous coefficient/integral identities reconstruct E15 term by\n term, using exact integration of powers of the interpolation variable.\n- 41 scalar Taylor coefficient inequalities test E13's remainder bound.\n- 25 rational square comparisons test alpha=1/2 subadditivity, including zero.\n- 60 actual replica-law comparisons use d=2, theta=log2, w(n)=2^n, rational\n one/two-jump intensities and times. Of these, 24 have m=0 and 45 have a\n nonzero actual/limiting intensity difference. The entire weighted norm\n against the infinite compound-Poisson law is enclosed: rational Taylor\n bounds enclose the exponential, exact recurrences enclose every retained\n coefficient, and a positive geometric bound covers the omitted weighted\n Poisson jump-count tail. Comparing this norm upper bound with a lower\n enclosure of E12's right side verifies the actual inequality for each case.\n\nEight negative controls were rejected as intended: extending alpha above\none; deleting the floor error; deleting intensity replacement; claiming a\ndelta^3 Euler remainder; replacing independent copies by fully coupled ones;\ndeducing an automatic delta^2 actual-to-limit one-copy rate; removing zero\ncentering; and inferring a disk beyond one from a stretched-exponential bound.\nIn particular, for `delta=k^-2` and positive intensities\n`nu_r=(1+1/k)*delta1+delta2`, the exact one-copy weighted error is `3/k^3`;\nits ratio to delta^2 is `3*k`, recorded as12,24,48,96,192. For fully coupled\ncopies with delta=1/100 and both limiting intensities one, the zero-mass\ndiscrepancy at t=1 is rigorously greater than4/5.\n\nThese finite controls supplement the preceding analytic derivation. Their\npassing does not prove an infinite theorem, validate either parent, or add a\nsecond acceptance. No master or author workflow was rerun by this reviewer.\n\n## Remaining gates\n\nNo amendment is requested for this exact Slice B. It remains conditional on\nE1/E2, the fixed-parameter identification, and Slice A's endpoint norm\nconvergence. The proof's existential constants, missing epsilon rate,\nindependent-copy scope, original W/Z normalization, distinction between\npositive conditioning and size bias, all-index count, and unaccepted parent\nobligations are retained. This verdict grants no all-angle/all-radius result,\nspatial Poisson process, new Gaussian moment proof, event-identification\ntheorem, organizational independence, prize closure, or merge readiness.\n\nExact mathematical changes require a new affected review. Source-preserving\nintegration, current-base CI, native-review custody, R17 release, and delivery\nremain with root under their own applicable authority.\n", + "github_login": "d6g8k5htny-coder" + } + ] +} diff --git a/frontiers/cluster_exponential_weight_20260930/SOURCES.json b/frontiers/cluster_exponential_weight_20260930/SOURCES.json new file mode 100644 index 000000000..4b3eeb938 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/SOURCES.json @@ -0,0 +1,30 @@ +{ + "schema": 1, + "repository": "d6g8k5htny-coder/Math-", + "scientific_effect": "NONE", + "policy": "Direct mathematical interfaces only. Verifying immutable bytes does not accept either parent theorem or this new implication.", + "sources": [ + { + "id": "MF", + "commit": "cbb2f978f9b3e8e2eaca94f3b359b18d7c144f1b", + "path": "frontiers/c6_marked_fourier_20260929/PROOF.md", + "bytes": 15304, + "git_blob": "efb702f601eb0c0a24dad6d125061158158867b9", + "sha256": "a5163679400d7d68c1c51538c9ed4ac111015487f79e820057f4ff3e20d09544", + "author": "OpenAI / ChatGPT", + "use": "MF1 only at a fixed parameter inside the declared compact family, alpha=2/d, ORIGINAL W/Z and ALL-INDEX count. Parent proof not revalidated here.", + "source_url": "https://github.com/d6g8k5htny-coder/Math-/blob/cbb2f978f9b3e8e2eaca94f3b359b18d7c144f1b/frontiers/c6_marked_fourier_20260929/PROOF.md" + }, + { + "id": "SC", + "commit": "7a44130b41b827577424a73c4feac4cde20b5568", + "path": "frontiers/spectral_cluster_closure_20260929/PROOF.md", + "bytes": 25006, + "git_blob": "16c56821b52fd76b0be791622b9c3809eafde75a", + "sha256": "e971b2cbe50a8a06b47c1219191201e0d1037c9adac23e5e3b7d2051bb70c2eb", + "author": "OpenAI / GPT-6 Astra Pro", + "use": "Coordinate consequence of (3), finite positive nu1,nu2 at FIXED d,L,b,k,frame. Pending parent slices and imported premises remain conditional; no source status promotion.", + "source_url": "https://github.com/d6g8k5htny-coder/Math-/blob/7a44130b41b827577424a73c4feac4cde20b5568/frontiers/spectral_cluster_closure_20260929/PROOF.md" + } + ] +} diff --git a/frontiers/cluster_exponential_weight_20260930/VALIDATION.json b/frontiers/cluster_exponential_weight_20260930/VALIDATION.json new file mode 100644 index 000000000..ab9e91fce --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/VALIDATION.json @@ -0,0 +1,28 @@ +{ + "schema": 1, + "scientific_effect": "NONE", + "scope": "finite rational algebra, immutable source custody and conditional prose", + "proof_sha256": "3f32fdd744350a15359451bbbee6c6bcc71af47e4f57f6110d7afb4978e941ee", + "author_disposition": "AUTHOR_SIDE / CONDITIONAL; external scoped nonauthor review required", + "internal_reviews": "INTERNAL_REVIEWS.md; zero organizational independence", + "local_runs": { + "finite_controls": {"tests": 12, "positive": 8, "intended_negative": 4, "normal_exit": 0, "optimized_exit": 0, "stdout_byte_identical": true}, + "signed_convolution_pairs": 729, + "custody_controls": {"tests": 11, "normal_exit": 0, "optimized_exit": 0}, + "packet_discovery": {"tests": 23, "normal_exit": 0, "optimized_exit": 0} + }, + "preserved_failures": [ + "Initial finite-control implementation omitted zero centering; a mass check failed before correction.", + "Four checker-bypass mutation runs each caused one named negative control to fail and exit 1.", + "Initial repository-root discovery found zero tests and exited 5; targeted packet discovery is the supported command.", + "Initial source verifier accepted tree-as-commit, replacement-ref substitution and boolean schema; all three added controls failed before the minimal repairs. Separate re-review passed." + ], + "source_exposure": { + "connector_commit_path_blob_size_sha256_checks": true, + "current_MF_successor_proof_equals_pinned_text": true, + "local_complete_historical_git_objects_available": false, + "local_full_repository_suite_run": false, + "hosted_actual_checkout_source_verification": "REQUIRED, not yet claimed" + }, + "excluded_inferences": ["Gaussian proof from tests", "parent theorem acceptance", "spatial independence", "coefficient convergence rate", "larger-disk analyticity for d>2", "endpoint size-bias convergence", "register transition", "external organizational review", "engineering merge"] +} diff --git a/frontiers/cluster_exponential_weight_20260930/finite_checks.py b/frontiers/cluster_exponential_weight_20260930/finite_checks.py new file mode 100644 index 000000000..86d7f2482 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/finite_checks.py @@ -0,0 +1,218 @@ +"""Deterministic exact finite algebra controls for the conditional EW packet. + +All arithmetic is rational at alpha=1 and theta=log(2), so w(n)=2**n. +These controls validate selected finite identities and inequalities only. +They do not prove MF1, SC, a coefficient rate, or any field independence. +No source-cache content is read or exported by this module. + +Run ``python finite_checks.py`` (also with ``-O``) for one small JSON result. +The only intended failures are the four named variants in the test module. +""" + +from fractions import Fraction +from io import StringIO +import json +from math import factorial +import sys +import unittest + + +class ControlFailure(ValueError): + """An explicit finite invariant failed; never relies on Python assert.""" + + +def require(condition, label): + if not condition: + raise ControlFailure(label) + + +def rational(value): + require(isinstance(value, (int, Fraction)), "exact rational required") + return Fraction(value) + + +def canonical(measure): + result = {} + for n, coefficient in measure.items(): + require(isinstance(n, int) and n >= 0, "nonnegative integer atom required") + coefficient = rational(coefficient) + if coefficient: + result[n] = coefficient + return result + + +def add(left, right): + result = canonical(left) + for n, q in canonical(right).items(): + result[n] = result.get(n, Fraction(0)) + q + return canonical(result) + + +def scale(measure, scalar): + scalar = rational(scalar) + return canonical({n: scalar * q for n, q in canonical(measure).items()}) + + +def subtract(left, right): + return add(left, scale(right, -1)) + + +def weighted_norm(measure): + return sum((2**n * abs(q) for n, q in canonical(measure).items()), Fraction(0)) + + +def positive_intensity(intensity): + intensity = canonical(intensity) + require(all(n >= 1 and q >= 0 for n, q in intensity.items()), "positive intensity required") + return intensity + + +def center(intensity): + intensity = positive_intensity(intensity) + return add(intensity, {0: -sum(intensity.values(), Fraction(0))}) + + +def probability_from_intensity(intensity, delta): + delta = rational(delta) + require(delta > 0, "delta must be positive") + law = add({0: Fraction(1)}, scale(center(intensity), delta)) + require(all(q >= 0 for q in law.values()), "one-copy law must be nonnegative") + check_equal(sum(law.values(), Fraction(0)), Fraction(1), "one-copy probability mass") + return law + + +def escaping_intensity(m): + require(isinstance(m, int) and m >= 3, "escaping atom m must be at least 3") + return {1: Fraction(1), 2: Fraction(1), m: Fraction(1, m * 2**m)} + + +def positive_conditioned(intensity): + intensity = positive_intensity(intensity) + normalizer = sum(intensity.values(), Fraction(0)) + require(normalizer > 0, "positive-conditioned normalizer") + return scale(intensity, 1 / normalizer) + + +def size_biased(intensity): + intensity = positive_intensity(intensity) + biased = {n: n * q for n, q in intensity.items()} + normalizer = sum(biased.values(), Fraction(0)) + require(normalizer > 0, "size-biased normalizer") + return scale(biased, 1 / normalizer) + + +def convolve(left, right): + result = {} + for n, q in canonical(left).items(): + for k, p in canonical(right).items(): + result[n + k] = result.get(n + k, Fraction(0)) + q * p + return canonical(result) + + +def convolution_power(measure, exponent): + require(isinstance(exponent, int) and exponent >= 0, "nonnegative replica count required") + result, base = {0: Fraction(1)}, canonical(measure) + while exponent: + if exponent % 2: + result = convolve(result, base) + exponent //= 2 + if exponent: + base = convolve(base, base) + return result + + +def replica_law(intensity, delta, t): + delta, t = rational(delta), rational(t) + require(delta > 0 and t >= 0, "replica time and delta") + # This operation encodes deliberately independent replicas only. + return convolution_power(probability_from_intensity(intensity, delta), t // delta) + + +def exp_polynomial(generator, t, order=8): + """Signed convolution Taylor polynomial, not an infinite CP law. + + Its mass is exactly 1 when the generator has total mass zero, by + cancellation. For an uncentered positive generator even this mass + statement fails. The remainder must be added to every comparison + with exp_*(t*generator). + """ + t = rational(t) + require(t >= 0 and isinstance(order, int) and order >= 0, "Taylor time and order") + argument = scale(generator, t) + total = term = {0: Fraction(1)} + for j in range(1, order + 1): + term = scale(convolve(term, argument), Fraction(1, j)) + total = add(total, term) + return total + + +def scalar_exp_prefix(x, order=8): + x = rational(x) + require(x >= 0 and isinstance(order, int) and order >= 0, "scalar Taylor argument and order") + return sum((x**j / factorial(j) for j in range(order + 1)), Fraction(0)) + + +def scalar_tail_bound(x, order=8): + """Rigorous rational upper bound for sum_(j>order) x**j/j!. + + The first omitted term is x**(order+1)/(order+1)!. Each subsequent + ratio is at most x/(order+2), so a geometric series bounds the entire + infinite scalar tail when that ratio is below 1. Submultiplicativity + then bounds the omitted convolution tail at x=||t*generator||_w. + Fixtures keep x<=1/4 and use the fixed order 8 for replica comparisons; + no floating-point exponential or adaptive digit refinement is used. + """ + x = rational(x) + require(x >= 0 and isinstance(order, int) and order >= 0, "scalar remainder argument and order") + ratio = x / (order + 2) + require(ratio < 1, "geometric scalar remainder requires ratio below 1") + return x**(order + 1) / factorial(order + 1) / (1 - ratio) + + +def check_zero_mass(measure, label): + require(sum(canonical(measure).values(), Fraction(0)) == 0, label) + + +def check_upper(actual, upper, label): + require(actual <= upper, label) + + +def check_equal(actual, expected, label): + require(actual == expected, label) + + +def run_controls(): + import test_finite_checks + + suite = unittest.defaultTestLoader.loadTestsFromModule(test_finite_checks) + + def flatten(tests): + for test in tests: + if isinstance(test, unittest.TestSuite): + yield from flatten(test) + else: + yield test + + tests = list(flatten(suite)) + negative_ids = {test.id() for test in tests if getattr(test, "NEGATIVE_CONTROL", False)} + diagnostics = StringIO() + result = unittest.TextTestRunner(stream=diagnostics, verbosity=0).run(suite) + failed_ids = {test.id() for test, _ in result.failures + result.errors} + summary = { + "all_passed": result.wasSuccessful(), + "checks": result.testsRun, + "failed": len(failed_ids), + "positive_controls": len(tests) - len(negative_ids), + "intended_negative_controls": len(negative_ids), + "intended_negative_controls_rejected": len(negative_ids - failed_ids), + "scientific_effect": "NONE", + "scope": "finite_algebra_only", + } + print(json.dumps(summary, sort_keys=True, separators=(",", ":"))) + if not result.wasSuccessful(): + sys.stderr.write(diagnostics.getvalue()) + return 0 if result.wasSuccessful() else 1 + + +if __name__ == "__main__": + sys.exit(run_controls()) diff --git a/frontiers/cluster_exponential_weight_20260930/test_finite_checks.py b/frontiers/cluster_exponential_weight_20260930/test_finite_checks.py new file mode 100644 index 000000000..d350286f0 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/test_finite_checks.py @@ -0,0 +1,233 @@ +"""Exact finite controls only: no MF1/SC validation or field simulation.""" + +from fractions import Fraction as F +from itertools import product +from math import factorial +import unittest + +import finite_checks as fc + + +def coefficient_product(left, right): + """Independent oracle: evaluate PGF products, then Newton-interpolate. + + This never forms pairs of measure atoms. Exact product evaluations at + degree+1 distinct integers determine the polynomial coefficients. + """ + degree = max(left, default=0) + max(right, default=0) + values = [ + sum(q * x**n for n, q in left.items()) + * sum(q * x**n for n, q in right.items()) + for x in range(degree + 1) + ] + coefficients = [F(0)] * (degree + 1) + basis = [F(1)] # binomial(x, 0) + for j in range(degree + 1): + for n, q in enumerate(basis): + coefficients[n] += values[0] * q + values = [b - a for a, b in zip(values, values[1:])] + next_basis = [F(0)] * (len(basis) + 1) + for n, q in enumerate(basis): + next_basis[n] -= F(j, j + 1) * q + next_basis[n + 1] += F(1, j + 1) * q + basis = next_basis + return {n: q for n, q in enumerate(coefficients) if q} + + +class PositiveFiniteControls(unittest.TestCase): + def test_original_probability_and_zero_centering(self): + """An omitted negative atom at zero must fail this control.""" + for m in (3, 4, 8, 12): + eta = F(1, m * 2**m) + nu = {1: F(1), 2: F(1), m: eta} + self.assertEqual(fc.escaping_intensity(m), nu) + centered = fc.center(nu) + self.assertEqual(sum(centered.values()), 0) + delta = F(1, 128 * m) + law = fc.probability_from_intensity(nu, delta) + self.assertEqual(sum(law.values()), 1) + self.assertGreater(law[0], 0) + self.assertTrue(all(q >= 0 for q in law.values())) + self.assertEqual(law[m], delta * eta) + scaled = {n: q / delta for n, q in law.items()} + scaled[0] -= 1 / delta + self.assertEqual(scaled, centered) + self.assertEqual(centered[0], -(2 + eta)) + + def test_endpoint_errors_and_distinct_normalizers(self): + """Omitting n in size bias, or equating its denominator with a, fails.""" + limit = {1: F(1), 2: F(1)} + for m in (3, 4, 8, 12): + nu = fc.escaping_intensity(m) + eta = F(1, m * 2**m) + a, z = sum(nu.values()), sum(n * q for n, q in nu.items()) + self.assertEqual(a, 2 + eta) + self.assertEqual(z, 3 + F(1, 2**m)) + self.assertNotEqual(a, z) + self.assertEqual(fc.weighted_norm(fc.subtract(nu, limit)), F(1, m)) + centered_error = fc.weighted_norm( + fc.subtract(fc.center(nu), fc.center(limit)) + ) + self.assertEqual(centered_error, F(1, m) + eta) + self.assertLessEqual(centered_error, F(2, m)) + ordinary, biased = fc.positive_conditioned(nu), fc.size_biased(nu) + self.assertEqual(sum(ordinary.values()), 1) + self.assertEqual(sum(biased.values()), 1) + self.assertEqual(ordinary[1], 1 / a) + self.assertEqual(biased[1], 1 / z) + self.assertEqual(biased[2], 2 / z) + self.assertEqual(2**m * ordinary[m], 1 / (m * a)) + self.assertEqual(2**m * biased[m], 1 / z) + self.assertGreaterEqual(2**m * biased[m], F(1, 4)) + + def test_retained_n_factor_certifies_endpoint_tail(self): + """Replacing the first weighted moment by the zeroth breaks E6.""" + for m in (3, 4, 8, 12): + nu = fc.escaping_intensity(m) + first_moment = sum(n * 2**n * q for n, q in nu.items()) + self.assertEqual(first_moment, 11) + for cutoff in (1, 2, m - 1, m, m + 1): + tail = sum(2**n * q for n, q in nu.items() if n > cutoff) + fc.check_upper(tail, F(11, cutoff + 1), "E6 endpoint tail") + + def test_signed_convolution_against_coefficient_product(self): + """Lost signs, missed coefficients and a wrong weight fail the oracle.""" + measures = [ + {n: q for n, q in enumerate(entries) if q} + for entries in product((F(-2, 3), F(0), F(1, 2)), repeat=3) + ] + for left, right in product(measures, repeat=2): + convolution = fc.convolve(left, right) + self.assertEqual(convolution, coefficient_product(left, right)) + fc.check_upper( + fc.weighted_norm(convolution), + fc.weighted_norm(left) * fc.weighted_norm(right), + "E11 signed convolution", + ) + cancellation = fc.convolve({0: F(1), 1: F(-1)}, {0: F(1), 1: F(1)}) + self.assertEqual(cancellation, {0: F(1), 2: F(-1)}) + self.assertEqual(fc.weighted_norm(cancellation), 5) + + def test_taylor_polynomial_remainder_and_mass_are_explicit(self): + """Dropping the tail or treating every Taylor polynomial as a law fails.""" + generator = {0: F(-1), 1: F(1)} + polynomial = fc.exp_polynomial(generator, F(1, 16), order=2) + self.assertEqual(polynomial, {0: F(481, 512), 1: F(15, 256), 2: F(1, 512)}) + self.assertEqual(sum(polynomial.values()), 1) # centered cancellation + positive_polynomial = fc.exp_polynomial({1: F(1), 2: F(1)}, F(1, 128), 8) + positive_mass = sum(positive_polynomial.values()) + expected_mass = sum(F(1, 64)**j / factorial(j) for j in range(9)) + self.assertEqual(positive_mass, expected_mass) + self.assertNotEqual(positive_mass, 1) + self.assertGreater(F(1, 64)**9 / factorial(9), 0) # omitted CP-series mass + for x in (F(0), F(1, 16), F(1, 4)): + for order in (0, 2, 8): + remainder = fc.scalar_tail_bound(x, order) + tail_prefix = sum(x**j / factorial(j) for j in range(order + 1, order + 10)) + self.assertGreaterEqual(remainder, tail_prefix) + self.assertEqual(fc.scalar_exp_prefix(x, order), sum(x**j / factorial(j) for j in range(order + 1))) + + def test_one_copy_euler_error_with_infinite_tail_allowance(self): + """E13 comparison adds a rigorous remainder instead of truncating truth.""" + bound = F(22) # B=2C, C=11 in these escaping-mass fixtures. + for m in (3, 4, 8, 12): + nu, delta = fc.escaping_intensity(m), F(1, 128 * m) + generator = fc.center(nu) + x = delta * fc.weighted_norm(generator) + self.assertLessEqual(x, F(1, 4)) + law = fc.probability_from_intensity(nu, delta) + polynomial = fc.exp_polynomial(generator, delta, 8) + certified_error = fc.weighted_norm(fc.subtract(law, polynomial)) + fc.scalar_tail_bound(x, 8) + # A lower scalar enclosure makes this a stronger finite check. + e13_lower = delta**2 * bound**2 * fc.scalar_exp_prefix(delta * bound, 8) / 2 + fc.check_upper(certified_error, e13_lower, "E13 with Taylor remainder") + + def test_actual_replica_convolution_and_floor_ledger(self): + """Wrong replica multiplication or omitting m=floor(t/delta) fails.""" + bound = F(22) + for escape_m in (3, 4, 8, 12): + nu = fc.escaping_intensity(escape_m) + delta = F(1, 128 * escape_m) + generator = fc.center(nu) + for t in (F(0), delta / 2, 2 * delta, 7 * delta / 3): + copies = t // delta + law = fc.replica_law(nu, delta, t) + one_copy = fc.probability_from_intensity(nu, delta) + self.assertEqual(law, fc.convolution_power(one_copy, copies)) + self.assertEqual(sum(law.values()), 1) + self.assertGreaterEqual(t - copies * delta, 0) + self.assertLess(t - copies * delta, delta) + s = copies * delta + polynomial = fc.exp_polynomial(generator, s, 8) + x = s * fc.weighted_norm(generator) + self.assertLessEqual(x, F(1, 4)) + certified_error = fc.weighted_norm(fc.subtract(law, polynomial)) + fc.scalar_tail_bound(x, 8) + e14_lower = copies * delta**2 * bound**2 * fc.scalar_exp_prefix(s * bound, 8) / 2 + fc.check_upper(certified_error, e14_lower, "E14 with Taylor remainder") + bernoulli = {0: F(7, 8), 1: F(1, 8)} + self.assertEqual(fc.convolution_power(bernoulli, 2), {0: F(49, 64), 1: F(7, 32), 2: F(1, 64)}) + self.assertEqual(fc.convolution_power(bernoulli, 0), {0: F(1)}) + + def test_e12_actual_laws_against_limit_exponential_with_remainder(self): + """Endpoint mark error, floor and infinite-series tail all enter E12.""" + limit = {1: F(1), 2: F(1)} + generator = fc.center(limit) + bound, horizon = F(22), F(1, 100) + self.assertLessEqual(horizon * bound, F(1, 4)) + exponential_lower = fc.scalar_exp_prefix(horizon * bound, 8) + for m in (3, 4, 8, 12): + nu, delta = fc.escaping_intensity(m), F(1, 128 * m) + epsilon = fc.weighted_norm(fc.subtract(nu, limit)) + self.assertEqual(epsilon, F(1, m)) + for t in (F(0), delta / 2, 2 * delta, 7 * delta / 3): + self.assertLessEqual(t, horizon) + actual = fc.replica_law(nu, delta, t) + polynomial = fc.exp_polynomial(generator, t, 8) + x = t * fc.weighted_norm(generator) + certified_error = fc.weighted_norm(fc.subtract(actual, polynomial)) + fc.scalar_tail_bound(x, 8) + e12_lower = exponential_lower * ( + delta * (horizon * bound**2 / 2 + bound) + 2 * horizon * epsilon + ) + fc.check_upper(certified_error, e12_lower, "E12 with Taylor remainder") + + +class IntendedNegativeControls(unittest.TestCase): + NEGATIVE_CONTROL = True + + def test_reject_omitted_zero_centering(self): + """Deliberately wrong generator nu must be rejected as noncentered.""" + wrong_generator = fc.escaping_intensity(8) + with self.assertRaisesRegex(fc.ControlFailure, "zero-centering"): + fc.check_zero_mass(wrong_generator, "omitted-zero-centering") + + def test_reject_omitted_n_factor(self): + """A bounded zeroth weighted moment cannot justify the endpoint tail.""" + m = 16 + wrong_intensity = {1: F(1), 2: F(1), m: F(1, 2**m)} + wrong_constant = fc.weighted_norm(wrong_intensity) + self.assertEqual(wrong_constant, 7) + self.assertEqual(sum(n * 2**n * q for n, q in wrong_intensity.items()), 26) + with self.assertRaisesRegex(fc.ControlFailure, "omitted-n-factor"): + fc.check_upper(F(1), wrong_constant / m, "omitted-n-factor") + + def test_reject_endpoint_size_bias_convergence_inference(self): + """The false extension of the intensity's 2/m bound is rejected.""" + limit_biased = {1: F(1, 3), 2: F(2, 3)} + for m in (16, 32, 64): + biased = fc.size_biased(fc.escaping_intensity(m)) + error = fc.weighted_norm(fc.subtract(biased, limit_biased)) + self.assertGreaterEqual(error, F(1, 4)) + with self.assertRaisesRegex(fc.ControlFailure, "endpoint-size-bias"): + fc.check_upper(error, F(2, m), "endpoint-size-bias") + + def test_reject_coupled_replicas_as_independent(self): + """Perfectly coupled Bernoulli copies omit the positive middle atom.""" + coupled_sum = {0: F(7, 8), 2: F(1, 8)} + independent_sum = {0: F(49, 64), 1: F(7, 32), 2: F(1, 64)} + self.assertEqual(fc.weighted_norm(fc.subtract(coupled_sum, independent_sum)), F(63, 64)) + with self.assertRaisesRegex(fc.ControlFailure, "coupled-replicas"): + fc.check_equal(coupled_sum, independent_sum, "coupled-replicas") + + +if __name__ == "__main__": + unittest.main() diff --git a/frontiers/cluster_exponential_weight_20260930/test_verify_packet.py b/frontiers/cluster_exponential_weight_20260930/test_verify_packet.py new file mode 100644 index 000000000..e597b179f --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/test_verify_packet.py @@ -0,0 +1,249 @@ +"""Fail-closed packet custody regressions; no mathematical claim is tested.""" +import hashlib +import json +from pathlib import Path +import subprocess +import sys +import tempfile +import unittest + + +CHECKER = Path(__file__).with_name('verify_packet.py') + + +class PacketIdentityTests(unittest.TestCase): + def setUp(self): + self.temp = tempfile.TemporaryDirectory() + self.root = Path(self.temp.name) / 'packet' + self.root.mkdir() + (self.root / 'PROOF.md').write_bytes(b'Exact synthetic proof.\n') + (self.root / 'SOURCES.json').write_bytes(b'{"synthetic":true}\n') + (self.root / 'README.md').write_bytes(b'Original custody fixture.\n') + self.validation = {'schema': 1, 'scientific_effect': 'NONE', + 'proof_sha256': hashlib.sha256(b'Exact synthetic proof.\n').hexdigest(), + 'preserved_failures': ['Historical fixture, not finite output.']} + self.write_validation() + proof = (self.root / 'PROOF.md').read_bytes() + self.review = {'schema': 1, 'scientific_effect': 'NONE', 'proof': { + 'path': 'PROOF.md', 'bytes': len(proof), + 'sha256': hashlib.sha256(proof).hexdigest(), + 'git_blob': hashlib.sha1(b'blob '+str(len(proof)).encode()+b'\0'+proof).hexdigest()}} + (self.root / 'REVIEW_RECORD.json').write_text(json.dumps(self.review) + '\n') + self.resign() + + def tearDown(self): + self.temp.cleanup() + + def write_validation(self): + (self.root / 'VALIDATION.json').write_text(json.dumps(self.validation) + '\n') + + def resign(self): + self.manifest = {'schema': 1, 'scientific_effect': 'NONE', + 'manifest_self_excluded': True, 'files': []} + for p in sorted(self.root.iterdir()): + if p.name != 'MANIFEST.json': + b = p.read_bytes() + self.manifest['files'].append({'path': p.name, 'bytes': len(b), + 'sha256': hashlib.sha256(b).hexdigest(), + 'git_blob': hashlib.sha1(b'blob '+str(len(b)).encode()+b'\0'+b).hexdigest()}) + self.write_manifest() + + def write_manifest(self): + (self.root / 'MANIFEST.json').write_text(json.dumps(self.manifest) + '\n') + + def check(self, accepted=False): + flags = ['-B', '-S'] + (['-O'] if sys.flags.optimize else []) + p = subprocess.run([sys.executable, *flags, str(CHECKER), '--packet-root', str(self.root)], + capture_output=True) + if accepted: + self.assertEqual(p.returncode, 0, p.stderr.decode()) + result = json.loads(p.stdout) + self.assertEqual(result['packet_files_verified'], 5) + self.assertTrue(result['validation_proof_identity_verified']) + self.assertTrue(result['review_proof_identity_verified']) + self.assertFalse(result['mathematical_acceptance']) + else: + self.assertEqual(p.returncode, 1, 'bad packet accepted or wrong failure: '+p.stdout.decode()+p.stderr.decode()) + self.assertEqual(p.stdout, b'') + self.assertIn(b'packet identity failed:', p.stderr) + + def test_valid_packet_cli_and_historical_validation(self): + self.check(accepted=True) + + def test_stale_file_bytes_rejected(self): + (self.root / 'README.md').write_bytes(b'Changed but unrecorded.\n') + self.check() + + def test_each_recorded_identity_is_enforced(self): + original = json.loads(json.dumps(self.manifest)) + for key, wrong in [('bytes', 1), ('sha256', '0'*64), ('git_blob', '0'*40)]: + with self.subTest(key=key): + self.manifest = json.loads(json.dumps(original)) + self.manifest['files'][0][key] = wrong + self.write_manifest() + self.check() + + def test_unlisted_file_rejected(self): + (self.root / 'EXTRA.txt').write_bytes(b'Unlisted.\n') + self.check() + + def test_missing_declared_file_rejected(self): + (self.root / 'README.md').unlink() + self.check() + + def test_duplicate_manifest_path_rejected(self): + self.manifest['files'].append(dict(self.manifest['files'][0])) + self.write_manifest() + self.check() + + def test_empty_manifest_rejected(self): + self.manifest['files'] = [] + self.write_manifest() + self.check() + + def test_essential_proof_cannot_be_removed_and_resigned(self): + (self.root / 'PROOF.md').unlink() + self.resign() + self.check() + + def test_essential_validation_cannot_be_removed_and_resigned(self): + (self.root / 'VALIDATION.json').unlink() + self.resign() + self.check() + + def test_manifest_self_exclusion_must_be_true_boolean(self): + for wrong in [False, 1, 'true', None]: + with self.subTest(value=wrong): + self.manifest['manifest_self_excluded'] = wrong + self.write_manifest() + self.check() + + def test_boolean_schema_rejected(self): + self.manifest['schema'] = True + self.write_manifest() + self.check() + + def test_invalid_size_types_rejected(self): + for wrong in [True, -1, 1.0, '1', None]: + with self.subTest(value=wrong): + self.manifest['files'][0]['bytes'] = wrong + self.write_manifest() + self.check() + + def test_unsafe_or_nonflat_paths_rejected(self): + for wrong in ['', '.', '..', '../PROOF.md', '/PROOF.md', './PROOF.md', + 'a//b', 'a/b', 'a\\b', 'C:proof', 'bad\0name', 7]: + with self.subTest(path=wrong): + self.manifest['files'][0]['path'] = wrong + self.write_manifest() + self.check() + + def test_duplicate_manifest_json_key_rejected(self): + text = (self.root / 'MANIFEST.json').read_text() + (self.root / 'MANIFEST.json').write_text(text.replace('"schema": 1', '"schema": 1, "schema": 1')) + self.check() + + def test_duplicate_record_key_rejected(self): + text = (self.root / 'MANIFEST.json').read_text() + (self.root / 'MANIFEST.json').write_text(text.replace('"bytes": ', '"bytes": 0, "bytes": ', 1)) + self.check() + + def test_manifest_symlink_rejected(self): + manifest = self.root / 'MANIFEST.json' + outside = self.root.parent / 'outside.json' + manifest.replace(outside) + manifest.symlink_to(outside) + self.check() + + def test_payload_symlink_rejected_even_when_bytes_match(self): + path = self.root / 'README.md' + outside = self.root.parent / 'outside.md' + path.replace(outside) + path.symlink_to(outside) + self.check() + + def test_unlisted_directory_rejected(self): + (self.root / 'extra').mkdir() + self.check() + + def test_listed_directory_rejected(self): + p = self.root / 'README.md' + p.unlink() + p.mkdir() + self.check() + + def test_symlink_packet_root_rejected(self): + original = self.root + self.root = original.parent / 'linked' + self.root.symlink_to(original, target_is_directory=True) + self.check() + + def test_false_validation_proof_rejected_after_manifest_resign(self): + self.validation['proof_sha256'] = '0'*64 + self.write_validation() + self.resign() + self.check() + + def test_boolean_validation_schema_rejected_after_manifest_resign(self): + self.validation['schema'] = True + self.write_validation() + self.resign() + self.check() + + def test_missing_validation_digest_rejected_after_manifest_resign(self): + del self.validation['proof_sha256'] + self.write_validation() + self.resign() + self.check() + + def test_duplicate_validation_key_rejected_after_manifest_resign(self): + p = self.root / 'VALIDATION.json' + text = p.read_text().replace('"schema": 1', '"schema": 1, "schema": 1') + p.write_text(text) + self.resign() + self.check() + + def test_nonfinite_json_rejected_after_manifest_resign(self): + self.validation['unexpected_number'] = float('nan') + self.write_validation() + self.resign() + self.check() + + def test_validation_history_not_compared_to_finite_output(self): + self.validation['local_runs'] = {'old_count': 23, 'old_missing_objects': True} + self.write_validation() + self.resign() + self.check(accepted=True) + + def test_overflowed_json_number_rejected_after_manifest_resign(self): + p = self.root / 'VALIDATION.json' + text = p.read_text().replace('"schema": 1', '"unbounded": 1e999, "schema": 1') + p.write_text(text) + self.resign() + self.check() + + def test_review_cannot_transfer_after_proof_validation_manifest_resign(self): + (self.root / 'PROOF.md').write_bytes(b'New proof with stale old review.\n') + self.validation['proof_sha256'] = hashlib.sha256((self.root / 'PROOF.md').read_bytes()).hexdigest() + self.write_validation() + self.resign() + self.check() + + def test_each_review_proof_identity_is_enforced_after_resign(self): + original = json.loads(json.dumps(self.review)) + for key, wrong in [('bytes', True), ('git_blob', '0'*40), ('sha256', '0'*64), ('path', 'README.md')]: + with self.subTest(key=key): + self.review = json.loads(json.dumps(original)) + self.review['proof'][key] = wrong + (self.root / 'REVIEW_RECORD.json').write_text(json.dumps(self.review) + '\n') + self.resign() + self.check() + + def test_review_record_cannot_be_removed_and_manifest_resigned(self): + (self.root / 'REVIEW_RECORD.json').unlink() + self.resign() + self.check() + + +if __name__ == '__main__': + unittest.main() diff --git a/frontiers/cluster_exponential_weight_20260930/test_verify_sources.py b/frontiers/cluster_exponential_weight_20260930/test_verify_sources.py new file mode 100644 index 000000000..0cde3642d --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/test_verify_sources.py @@ -0,0 +1,112 @@ +"""Hostile custody controls in synthetic Git trees; no Gaussian claim is tested.""" +import copy +import hashlib +import json +from pathlib import Path +import subprocess +import tempfile +import unittest + +from verify_sources import no_duplicates, verify + + +class SourceCustodyTests(unittest.TestCase): + def setUp(self): + self.temp = tempfile.TemporaryDirectory() + self.root = Path(self.temp.name) + subprocess.run(["git", "init", "-q", str(self.root)], check=True) + entries, sources = [], [] + for label in ("MF", "SC"): + data = ("Synthetic " + label + " custody fixture\n").encode() + blob = self.git("hash-object", "-w", "--stdin", data=data).decode().strip() + name = "parent/" + label + ".md" + entries.append("100644 blob " + blob + "\t" + name + "\n") + sources.append({"id": label, "path": name, "git_blob": blob, + "sha256": hashlib.sha256(data).hexdigest(), "bytes": len(data)}) + sub = self.git("mktree", data="".join(e.replace("parent/", "") for e in entries).encode()).decode().strip() + tree = self.git("mktree", data=("040000 tree " + sub + "\tparent\n").encode()).decode().strip() + commit = self.git("-c", "user.name=Fixture", "-c", "user.email=fixture@example.invalid", + "commit-tree", tree, data=b"Synthetic fixture\n").decode().strip() + for source in sources: + source["commit"] = commit + self.manifest = {"schema": 1, "scientific_effect": "NONE", "sources": sources} + + def tearDown(self): + self.temp.cleanup() + + def git(self, *args, data=None): + return subprocess.run(["git", "-C", str(self.root), *args], input=data, + check=True, stdout=subprocess.PIPE, stderr=subprocess.PIPE).stdout + + def test_valid_historical_trees(self): + self.assertEqual(len(verify(self.root, self.manifest)["historical_sources_verified"]), 2) + + def test_nested_caller_has_full_tree_semantics(self): + nested = self.root / "frontiers" / "new-packet" + nested.mkdir(parents=True) + self.assertEqual(verify(nested, self.manifest), verify(self.root, self.manifest)) + + def test_wrong_path_even_with_correct_blob(self): + bad = copy.deepcopy(self.manifest) + bad["sources"][0]["path"] = "MF.md" + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_wrong_digest_or_size(self): + for key, wrong in (("sha256", "0" * 64), ("bytes", 1)): + bad = copy.deepcopy(self.manifest) + bad["sources"][0][key] = wrong + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_wrong_blob_in_real_commit(self): + bad = copy.deepcopy(self.manifest) + bad["sources"][0]["git_blob"] = bad["sources"][1]["git_blob"] + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_absent_commit_fails(self): + bad = copy.deepcopy(self.manifest) + bad["sources"][0]["commit"] = "0" * 40 + with self.assertRaises(subprocess.CalledProcessError): + verify(self.root, bad) + + def test_tree_must_not_pass_as_commit(self): + bad = copy.deepcopy(self.manifest) + tree = self.git("rev-parse", bad["sources"][0]["commit"] + "^{tree}").decode().strip() + for source in bad["sources"]: + source["commit"] = tree + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_local_replace_cannot_substitute_historical_commit(self): + empty_tree = self.git("mktree", data=b"").decode().strip() + empty_commit = self.git("-c", "user.name=Fixture", "-c", "user.email=fixture@example.invalid", + "commit-tree", empty_tree, data=b"No source paths\n").decode().strip() + self.git("replace", empty_commit, self.manifest["sources"][0]["commit"]) + bad = copy.deepcopy(self.manifest) + for source in bad["sources"]: + source["commit"] = empty_commit + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_boolean_schema_rejected(self): + bad = copy.deepcopy(self.manifest) + bad["schema"] = True + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_unsafe_path_fails(self): + for name in ("../parent/MF.md", "/parent/MF.md", "parent//MF.md"): + bad = copy.deepcopy(self.manifest) + bad["sources"][0]["path"] = name + with self.assertRaises(ValueError): + verify(self.root, bad) + + def test_duplicate_json_keys_fail(self): + with self.assertRaises(ValueError): + json.loads('{"schema":1,"schema":2}', object_pairs_hook=no_duplicates) + + +if __name__ == "__main__": + unittest.main() diff --git a/frontiers/cluster_exponential_weight_20260930/verify_packet.py b/frontiers/cluster_exponential_weight_20260930/verify_packet.py new file mode 100644 index 000000000..70b540e53 --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/verify_packet.py @@ -0,0 +1,135 @@ +"""Check local packet custody; this neither authenticates reviews nor proves mathematics.""" +import argparse +import hashlib +import json +import math +from pathlib import Path +import re +import stat +import sys + + +ESSENTIAL = {'PROOF.md', 'SOURCES.json', 'VALIDATION.json', 'REVIEW_RECORD.json'} + + +def unique_object(pairs): + result = {} + for key, value in pairs: + if key in result: + raise ValueError('duplicate JSON key: '+key) + result[key] = value + return result + + +def reject_constant(value): + raise ValueError('nonfinite JSON constant: '+value) + + +def finite_float(value): + result = float(value) + if not math.isfinite(result): + raise ValueError('nonfinite JSON number: '+value) + return result + + +def read_regular(path): + if not stat.S_ISREG(path.lstat().st_mode): + raise ValueError('not a regular, nonsymlink file: '+str(path)) + return path.read_bytes() + + +def read_json(data, label): + result = json.loads(data, object_pairs_hook=unique_object, parse_constant=reject_constant, + parse_float=finite_float) + if not isinstance(result, dict): + raise ValueError(label+' must be a JSON object') + if type(result.get('schema')) is not int or result['schema'] != 1: + raise ValueError(label+' must have integer schema 1') + if result.get('scientific_effect') != 'NONE': + raise ValueError(label+' scientific_effect must be NONE') + return result + + +def safe_name(value): + if (not isinstance(value, str) or not value or value in {'.', '..'} + or any(c in value for c in '/\\:\0')): + raise ValueError('unsafe or nonflat packet path: '+repr(value)) + return value + + +def check_identity(record, data, label): + if not isinstance(record, dict): + raise ValueError(label+' identity must be an object') + size = record.get('bytes') + if type(size) is not int or size < 0 or size != len(data): + raise ValueError(label+' byte count mismatch or invalid type') + actual = {'sha256': hashlib.sha256(data).hexdigest(), + 'git_blob': hashlib.sha1(b'blob '+str(len(data)).encode('ascii')+b'\0'+data).hexdigest()} + for key, length in [('sha256', 64), ('git_blob', 40)]: + value = record.get(key) + if not isinstance(value, str) or re.fullmatch('[0-9a-f]{'+str(length)+'}', value) is None: + raise ValueError(label+' invalid '+key) + if value != actual[key]: + raise ValueError(label+' '+key+' mismatch') + + +def verify(packet_root): + root = Path(packet_root) + if not stat.S_ISDIR(root.lstat().st_mode): + raise ValueError('packet root must be a nonsymlink directory') + manifest = read_json(read_regular(root / 'MANIFEST.json'), 'MANIFEST.json') + if manifest.get('manifest_self_excluded') is not True: + raise ValueError('MANIFEST.json must explicitly exclude itself') + records = manifest.get('files') + if not isinstance(records, list) or not records: + raise ValueError('MANIFEST.json files must be a nonempty list') + indexed = {} + for record in records: + if not isinstance(record, dict): + raise ValueError('manifest file entry must be an object') + name = safe_name(record.get('path')) + if name == 'MANIFEST.json' or name in indexed: + raise ValueError('self or duplicate manifest path: '+name) + indexed[name] = record + if not ESSENTIAL <= indexed.keys(): + raise ValueError('manifest lacks essential packet files') + observed = {p.name for p in root.iterdir()} + expected = set(indexed) | {'MANIFEST.json'} + if observed != expected: + raise ValueError('packet membership mismatch; missing='+repr(sorted(expected-observed)) + +'; undeclared='+repr(sorted(observed-expected))) + payloads = {} + for name, record in indexed.items(): + data = read_regular(root / name) + check_identity(record, data, name) + payloads[name] = data + proof = payloads['PROOF.md'] + validation = read_json(payloads['VALIDATION.json'], 'VALIDATION.json') + # VALIDATION is a retained author execution/history record, not finite_checks output. + if validation.get('proof_sha256') != hashlib.sha256(proof).hexdigest(): + raise ValueError('VALIDATION.json proof_sha256 does not bind current PROOF.md') + reviews = read_json(payloads['REVIEW_RECORD.json'], 'REVIEW_RECORD.json') + proof_record = reviews.get('proof') + if not isinstance(proof_record, dict) or proof_record.get('path') != 'PROOF.md': + raise ValueError('REVIEW_RECORD.json must bind PROOF.md') + check_identity(proof_record, proof, 'REVIEW_RECORD.json proof') + return {'schema': 1, 'scientific_effect': 'NONE', 'packet_files_verified': len(indexed), + 'validation_proof_identity_verified': True, 'review_proof_identity_verified': True, + 'remote_review_authenticity_checked': False, 'mathematical_acceptance': False} + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument('--packet-root', type=Path, default=Path(__file__).absolute().parent) + args = parser.parse_args() + try: + result = verify(args.packet_root) + except (ValueError, OSError) as error: + print('packet identity failed: '+str(error), file=sys.stderr) + return 1 + print(json.dumps(result, indent=2, sort_keys=True)) + return 0 + + +if __name__ == '__main__': + sys.exit(main()) diff --git a/frontiers/cluster_exponential_weight_20260930/verify_sources.py b/frontiers/cluster_exponential_weight_20260930/verify_sources.py new file mode 100644 index 000000000..a8ac3636c --- /dev/null +++ b/frontiers/cluster_exponential_weight_20260930/verify_sources.py @@ -0,0 +1,72 @@ +#!/usr/bin/env python3 +"""Verify immutable upstream Git trees; byte custody is not mathematical acceptance.""" +import argparse +import hashlib +import json +from pathlib import Path, PurePosixPath +import re +import subprocess + + +def no_duplicates(pairs): + result = {} + for key, value in pairs: + if key in result: + raise ValueError("duplicate JSON key: " + key) + result[key] = value + return result + + +def git(repo, *args): + return subprocess.run(["git", "--no-replace-objects", "-C", str(repo), *args], check=True, + stdout=subprocess.PIPE, stderr=subprocess.PIPE).stdout + + +def verify(repo, manifest): + if type(manifest.get("schema")) is not int or manifest["schema"] != 1 or manifest.get("scientific_effect") != "NONE": + raise ValueError("unexpected source manifest scope") + sources = manifest.get("sources") + if not isinstance(sources, list) or [s.get("id") for s in sources] != ["MF", "SC"]: + raise ValueError("exactly the MF and SC interfaces are required") + verified = [] + for source in sources: + commit, blob, digest = (source.get(k, "") for k in ("commit", "git_blob", "sha256")) + if not (re.fullmatch("[0-9a-f]{40}", commit) + and re.fullmatch("[0-9a-f]{40}", blob) + and re.fullmatch("[0-9a-f]{64}", digest)): + raise ValueError("invalid immutable identity") + name = source.get("path", "") + path = PurePosixPath(name) + if not name or path.is_absolute() or ".." in path.parts or str(path) != name: + raise ValueError("invalid repository-relative source path") + if type(source.get("bytes")) is not int or source["bytes"] < 1: + raise ValueError("invalid source size") + if git(repo, "cat-file", "-t", commit).strip() != b"commit": + raise ValueError(source["id"] + ": expected an actual historical commit") + # --full-tree is essential: callers may run from a nested packet directory. + listing = git(repo, "ls-tree", "--full-tree", "-z", commit, "--", name) + expected = ("100644 blob " + blob + "\t" + name + "\0").encode() + if listing != expected: + raise ValueError(source["id"] + ": historical commit/path/blob mismatch") + data = git(repo, "cat-file", "blob", blob) + if len(data) != source["bytes"] or hashlib.sha256(data).hexdigest() != digest: + raise ValueError(source["id"] + ": source bytes mismatch") + if hashlib.sha1(b"blob " + str(len(data)).encode() + b"\0" + data).hexdigest() != blob: + raise ValueError(source["id"] + ": Git blob content mismatch") + verified.append({"id": source["id"], "commit": commit, "path": name, + "git_blob": blob, "sha256": digest, "bytes": len(data)}) + return {"scientific_effect": "NONE", "historical_sources_verified": verified} + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("--repo-root", required=True) + args = parser.parse_args() + manifest = json.loads(Path(__file__).with_name("SOURCES.json").read_text(), + object_pairs_hook=no_duplicates, + parse_constant=lambda value: (_ for _ in ()).throw(ValueError(value))) + print(json.dumps(verify(Path(args.repo_root).resolve(), manifest), sort_keys=True)) + + +if __name__ == "__main__": + main() diff --git a/frontiers/spectral_cluster_closure_20260929/AUDIT_AND_REPAIR.md b/frontiers/spectral_cluster_closure_20260929/AUDIT_AND_REPAIR.md new file mode 100644 index 000000000..23dadc6a3 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/AUDIT_AND_REPAIR.md @@ -0,0 +1,29 @@ +# Source-bound audit and explicit replacement + +Scientific effect NONE. The old mathematical bytes are preserved. This document does not rewrite another author's proof or change a global disposition. + +## Audited object + +Math-#159, author Anthropic Claude, head f0d11805854b1938a2f89235ec590a37b04a7cb9, PROOF.md blob1ce3769e76c540ab03b42f2deb6f2d1124459a81. Full byte identity is AUDITED-159 in SOURCES.json and is checked by the verifier although its results are NOT consumed. + +OpenAI source-exposed review5359646638 gave AMEND REQUIRED. Exposure correction5901054091: RC is Claude-authored, not OpenAI-authored as inadvertently grouped in the initial exposure sentence. The relevant OpenAI author-side exposure is LM/LP/RM/RCL. The mathematical findings remain unchanged; no independent revalidation of the parents is claimed. + +## Findings and replacement steps + +1. Proposition4.4 includes a finite limit for r^-3 P(N_near=0). Since P(N_near=0)=1-O(r^3), that quantity diverges. PROOF.md excludes count0 from the intensity measure and states explicitly that its mass must be centered before scaling. + +2. Lemma4.3 uses r/|det D|^2 <= r/eta^2 on |det D|0 makes |raw J|>=c|tau|. The replacement retains compact orthogonal O, all tensor coordinates, and the actual non-isotropic Gaussian density under the Haar integral. + +4. Fixed-radius observables depend on the old q-dependent ellipse, so q cannot first be integrated out and then used outside the integral. Exact-count indicators are not monotone in radius (0 then1 then2 is possible). The new formula retains every angular variable and uses actual soft-plane spatial coordinates. Dominated convergence, not monotone convergence of exact-count indicators, takes the radius limit. + +5. The prior near-witness conditioning route requires uniform rank estimates through coalescence. The replacement bounds the far first moment after conditioning on a fixed-origin COMPLETE physical jet, first on a compact spectral box. It proves O(r^(9/2)) there and only o(r^3) after exhaustion. It does not falsely transfer the compact-box rate to the whole space. + +## Collaboration record + +main#95 pickup5900871219 and PR159 comments5900894321/5900933928 presented the planar absorption repair and its orthogonal all-d extension. The new packet is a separate author-side candidate requiring nonauthor review, not an ACCEPT of PR159. Claude's lane can compare or consume this replacement only with its new review status respected. The new proof uses #158's accepted deterministic classifier, not its still-separate Gaussian-sector disposition. + +## Test limits + +The finite tests catch the reversed cutoff, zero mass, missing spectral r, missing Vandermonde, wrong hard power, dropped far branch, dropped mixed derivative and wrong normalizer. They do not certify dominated convergence, the implicit-function theorem, Gaussian rank, or the local-to-global passage. Those obligations are explicitly written in PROOF.md. diff --git a/frontiers/spectral_cluster_closure_20260929/GLOBAL_DERIVATIVE_WEIGHTED.md b/frontiers/spectral_cluster_closure_20260929/GLOBAL_DERIVATIVE_WEIGHTED.md new file mode 100644 index 000000000..3f63edb54 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/GLOBAL_DERIVATIVE_WEIGHTED.md @@ -0,0 +1,161 @@ +# Addendum: the global derivative-weighted rare-count bound + +Object: OA-SPECTRAL-CLUSTER-CLOSURE-20260929-GD1. +Author: OpenAI / GPT-6 Astra Pro, 29 September 2026. +Disposition: author-side conditional derivation; nonauthor review REQUIRED. +Scientific effect NONE. The main PROOF.md is unchanged and does NOT depend on +this addendum. This closes a separately proposed sufficient route if its source +interfaces and the new insertion argument below are accepted. + +## 1. Exact statement and inputs + +Use the ORIGINAL count N_r, Q_r, W_r, full Z_r, and Q_r^W of PROOF.md Section1. +Fix d>=2 and L. Birth and positive-gap marks may range over fixed compact sets, +with k bounded away from zero, and the axial frame over O(d). For each fixed +p>=0 there are C_p,r_p>0 such that + + E_(Q_r^W)[ N_r (1+||f||_C4)^p ] <= C_p r^3, 0=1 satisfies E_Q' K^u <= C_u(1+beta)^u for fixed u. +- Lemma5.1: Kac-Rice for a nonnegative Borel full-field mark, with canonical + Gaussian kernels and monotone exhaustion. It is stated under Q_r. +- Section5.2 and Section6: pathwise geometric bounds on W_r F_j(H_X), density + bounds and the regional beta/penalty table; the normalized integration ledgers + of the pin balls, collar, intermediate shells and fixed remote region. + +All those inputs are retained at their source scope, not revalidated by this +addendum. SOURCES.json already binds the complete [C6] and its parent [D5]/[P] +identities. No use is made of #157, #159, or the new spectral proof's conclusions. + +## 2. One full normalizer, one derivative mark + +Let Xi=K^p. It is nonnegative and Borel on the smooth field space. Applying the +source's formula with mark W_r Xi, and then dividing by the ORIGINAL normalizer, + + E_QW[N_r K^p] + = Z_r^-1 sum_j integral_X integral_Ir p_(grad f(X),f(X)|pins)(0,h) + E_Q'[W_r F_j(H_X) K^p] dh dX. (GD2) + +The two conditioned pins are removed by compact exhaustion. In the all-height +pin-ball/collar regions one may integrate the gradient-only kernel instead; +that gives an upper bound on the window count. A height window of length kr^3 +is retained in the shell and remote regions. This never becomes an all-height +global O(r^3) assertion. + +If a regional source bound is W_r F_j(H_X)<=G_r(X,h) K^(3d), then directly + + E_Q'[W_r F_j(H_X) K^p] + <= G_r E_Q'[K^(3d+p)] + <= C_p G_r (1+beta)^(3d+p). (GD3) + +The source's unmarked estimate is the same expression with exponent3d. Thus the +ONLY new cost is a factor (1+beta)^p; G_r, the spatial/height Jacobians and Z_r +remain unchanged. Where the source has already used Z_r>=z_*r^2 to write a +normalized pathwise bound, use that version exactly once. No additional Z_r +appears and none is removed. This direct moment bound does not use a +Cauchy-Schwarz factor with a missing square root. + +If p is not an integer, bound K^p by K^ceil(p); it suffices to prove the integer +cases. The full conditional C6 moment is available for every such fixed order. + +## 3. Regional absorption with explicit new losses + +For x>=1, M>=0 and a,c>0, + + x^M exp(-c x^a) <= C_(M,a,c) exp(-(c/2)x^a), + C_(M,a,c)=max{1,[2M/(a c e)]^(M/a)} (GD4) + +with the M=0 expression interpreted as1. Maximize M log x-(c/2)x^a to obtain +this inequality. Thus a fixed polynomial cost is absorbed by half the Gaussian +penalty; the remaining half is still available for the original positive +regional integration. No power of r or shell radius has to be weakened. + +Here is the complete additional-cost ledger from [C6] Section6. All labels and +beta bounds are those of that pinned source, not new nondegeneracy assumptions. + +| Region | Source beta bound | Extra K^p cost | Penalty retained for absorption | Resulting normalized integral | +|---|---|---|---|---| +| R1-I, punctured pin ball | C(1+chi) | C_p(1+chi)^p | exp(-c chi^2) | C_p r^3 | +| R1-II, pin axial region | C/r, since chi<=1/r | C_p r^-p | exp(-c/(2r^2)) | C_p r^3 | +| R2a, collar axial strip | C r^-10 | C_p r^-10p | exp(-c r^-2/3) | C_p r^3 | +| R2b, collar small nonzero v | C norm(v)^-4 | C_p norm(v)^-4p | exp(-c/norm(v)^2) | C_p r^3 | +| R2c, collar away from axis | C | C_p | no new penalty needed | C_p r^3 | +| R3a, shell axial strip | C s^-10 | C_p s^-10p | exp(-c s^-1/4) | C_p r^3 s^2 | +| R3b, shell off axis | C norm(v)^-6 | C_p norm(v)^-6p | exp(-c/norm(v)^2), or bounded away from axis | C_p r^3[(r/s)^2+s^2] | +| R4, fixed remote region | C | C_p | no new penalty needed | C_p r^3 | + +Details of the integrations: + +R1-I: the source's factor r^(3-d)|q|^(2-d) is multiplied by a polynomial in +chi and exp(-c chi^2). The extra (1+chi)^p changes only the finite supremum of +that product. The same omega_d integrability and r^d spatial Jacobian give r^3. +R1-II: chi<=1/r, so use (GD4) with x=1/r, M=p, a=2. The remaining exponential +absorbs the original negative radius powers exactly as in [C6](6.3). The +S-centered pin ball is identical; the full normalizer is unchanged. + +R2a: use x=1/r, M=10p, a=2/3, then the original source's density/weight radius +ledger with c replaced by c/2. R2b: use x=1/|v|, M=4p, a=2. The factor +r^(3-d) remains, and integration over the scaled collar supplies r^d. R2c has +bounded beta and hence no new singular factor. + +R3a: the source's AXIS-SAFE endpoint-short-column bound is valid on the entire +strip, not only at v=0. It gives W_r F_j(H_X)/Z_r<=C K^(3d). The extra moment +cost s^-10p is absorbed using x=1/s, a=1/4. The normalized intensity can still +be bounded by a constant. The source's spatial strip volume is at most C s^d, +which is at most C s^2 for d>=2 and s<=1; the retained height window gives r^3. +Thus this contribution is C_p r^3 s^2. + +R3b: the unchanged geometric and density part leaves +s^(-(d+2))(r+s^2)^2 times an inverse-v polynomial and exp(-c/|v|^2). Absorb the +new |v|^-6p using (GD4). Multiplication by shell volume s^d and height length +kr^3 gives C_p r^3[(r/s)^2+2r+s^2]. Since 2r<=r^2/s^2+s^2, this is at most a +constant times r^3[(r/s)^2+s^2]. The same estimate applies where |v| is bounded +away from zero, by bounded beta rather than a singular exponential inequality. + +R4: the complete witness value/gradient law at fixed distance has bounded beta. +The endpoint short columns supply r^2 in W_r, canceled by the one full Z_r~r^2; +the window supplies kr^3. Any fixed added conditional derivative moment remains +bounded. The spatial region has fixed finite volume. + +Finally sum the dyadic shells s=2^j*4r up to the fixed small cutoff s0: + + sum_j (r/s_j)^2 <= C, sum_j s_j^2 <= C s0^2. + +Together with the two pin balls, collar and fixed remote region, (GD2)-(GD3) +give (GD1). The proof is uniform on the same fixed compact marks/frames because +all conditional-moment and penalty constants in the pinned source are uniform +there, and p is fixed before those constants are chosen. QED, conditional on +the declared regional source interfaces. + +## 4. Consequences and exact relationship to the main proof + +For T>=1, + + r^-3 E_QW[N_r; 1+||f||_C4>T] <= C_p T^-p. (GD5) + +This is an actual rare-intensity derivative tail: it is not obtained by dividing +an unconditioned derivative-tail probability by r^3. It also gives bounded fixed +polynomial derivative moments under the count-size-biased law N_r dQ_r^W/EN_r, +using the already positive order-r^3 lower bound on EN_r. + +If #158's compact-sector and deterministic-exclusion arguments are consumed at +their eventual accepted scopes, (GD5) supplies the sufficient probability input +D11 proposed in that packet. The main spectral proof in this packet instead +uses its own residual absorption and does not need (GD1). Neither route is +circular: this addendum uses only the earlier [C6] regional proof, and the main +proof never imports this addendum. + +No exponential derivative moment, convergence rate of the cluster coefficients, +numerical constant, or change in a parent source's acceptance status follows. +Nonauthor review focus: one Z_r^-1 in (GD2); the exact conditional K moment in +(GD3); all eight table rows, especially R1-II and the full R3a strip; and the +unchanged height-window factor in the intermediate/remote regions. Finite +companion probes verify powers and the elementary absorption inequality only. diff --git a/frontiers/spectral_cluster_closure_20260929/MANIFEST.json b/frontiers/spectral_cluster_closure_20260929/MANIFEST.json new file mode 100644 index 000000000..9d6c6eefd --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/MANIFEST.json @@ -0,0 +1,97 @@ +{ + "schema": 1, + "scientific_effect": "NONE", + "review_status": "CORE_AND_GD_NONAUTHOR_ACCEPTED_AT_SCOPED_CONDITIONAL_LEVEL", + "files": [ + { + "path": "AUDIT_AND_REPAIR.md", + "bytes": 3553, + "sha256": "755a2405e7e7925d23adc8b1c7a3abce1fd73bad5fba80e7546618d19a6736ac", + "git_blob": "23dadc6a314492bdf98bfcb84997b541e9656618" + }, + { + "path": "GLOBAL_DERIVATIVE_WEIGHTED.md", + "bytes": 8813, + "sha256": "a445607be26cc2863682c404d702798a984fa2b8994ed0dc5b57fb9c4da153eb", + "git_blob": "3f63edb54ea5422cdc328cc54fb093c8a5d84be1" + }, + { + "path": "PLAN.md", + "bytes": 1851, + "sha256": "531d71ad7009195d25fd42d8ed55593267eb4c8e476e79f106cb3d2512d191ee", + "git_blob": "12f03d8f5082a2c5e7edfbec040804a69a1de3fb" + }, + { + "path": "PROOF.md", + "bytes": 25006, + "sha256": "e971b2cbe50a8a06b47c1219191201e0d1037c9adac23e5e3b7d2051bb70c2eb", + "git_blob": "16c56821b52fd76b0be791622b9c3809eafde75a" + }, + { + "path": "README.md", + "bytes": 5084, + "sha256": "b1e2a0722945a6189d8338c2e5b1f1a74b3b5646b8dc10fe29168c165508342c", + "git_blob": "895dded8aa8e405ad8e9640d3ffebc6449a108d0" + }, + { + "path": "RECONNAISSANCE.md", + "bytes": 1458, + "sha256": "c3af589197c895d2521721c41ac7866d0945ec3c9de1c853d348bdc1a0ce42a1", + "git_blob": "aec1f588dcafa4f1605f4fd53feef04cd350bae5" + }, + { + "path": "RESULTS.json", + "bytes": 338, + "sha256": "f7ebe3d9a6767d967a8b0139de02b3d18e9081f36c9f85b847c6f3f01d6ce529", + "git_blob": "7c564dacf616f1b6099c93e05daf564e5c36ec8f" + }, + { + "path": "REVIEW_RECORD.md", + "bytes": 5629, + "sha256": "6031d36697789097185a8e65bfbdf80f447e229689eac5a706ee8b0558db64a5", + "git_blob": "9bcae183fecdf0ffe4d612a209438a4fb1fa0edd" + }, + { + "path": "SOURCES.json", + "bytes": 5677, + "sha256": "c1e84ef7ccf749b7eb19c713d2b0fe4f4547c03ce56ef18c9858010f99929d9e", + "git_blob": "8daf24b7ea01e889102170dcd056634b4f67e911" + }, + { + "path": "VALIDATION.md", + "bytes": 3082, + "sha256": "602ab8a58b2866b63de06923f0fb259b813b031a1e7c0cb6fc995a269be726f5", + "git_blob": "bf00357c5c7bfb6a019c1edc85e37e865a73d804" + }, + { + "path": "check.py", + "bytes": 5877, + "sha256": "d24e07af792fc0538f977489e7af24a7815413487577f94f1a74cb229c8dec94", + "git_blob": "e747e1c81779e665cdb614562579206237720c76" + }, + { + "path": "test_check.py", + "bytes": 6510, + "sha256": "b094624c46756ab771465ce1eeb73c315e3f36e66e61ff8f116d0e07d88e1f46", + "git_blob": "33fdbff05bbae19f9cb9700ba0d7b1ecea5e05c4" + }, + { + "path": "test_derivative_weighted.py", + "bytes": 2922, + "sha256": "39c11a235a6186189d694794078fa9b29b26f1b530b7b79c423c8fff63b5211b", + "git_blob": "5389a7400feebae73dbaeeb96cd0f1940c3bab66" + }, + { + "path": "test_verify.py", + "bytes": 4439, + "sha256": "16bccfbe377e87ecfbfba6db895fe508dfa1f2eab9d9be807a3d310750b6d0bf", + "git_blob": "d813c34e90a77c9eb15248299380dc8184892cfa" + }, + { + "path": "verify.py", + "bytes": 4729, + "sha256": "d3d499b7b4dc1e7ba7414bcd452d7302e001719fccd6abaceff62a748bb4c3f5", + "git_blob": "db4260655b433c393c62b7abe411de2f416b382c" + } + ] +} diff --git a/frontiers/spectral_cluster_closure_20260929/PLAN.md b/frontiers/spectral_cluster_closure_20260929/PLAN.md new file mode 100644 index 000000000..12f03d8f5 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/PLAN.md @@ -0,0 +1,30 @@ +# Spectral cluster closure implementation plan + +Goal: publish an additive, test-backed conditional replacement for the failed +unbounded-shear domination, proving the fixed-d global count law without assuming +a global derivative-weighted estimate. Preserve all source proofs. + +Architecture: PROOF.md contains vector exclusion, orthogonal spectral coordinates, +residual-target absorption and the nonempty-measure limit. check.py implements +finite exact identities only; test_check.py compares separate formulations. +verify.py and test_verify.py authenticate every declared source and inventory. +SOURCES.json binds consumed/credited sources; MANIFEST.json binds packet files. +The workflow checks the full source objects and leaves existing gates unchanged. + +Tech stack: Python standard library, exact Fraction arithmetic, Git, Markdown. + +Tasks: +1. Audit #159 at its exact head and give reproducible blockers; keep a repair log. +2. Write the full replacement proof and enumerate the remaining non-claims. +3. Write finite tests before implementation, observe intended RED, implement and + replay normal/-O, and reject semantic mutations and unknown labels. +4. Test custody with real temporary Git repositories, including wrong hash, + missing source, duplicate identity, unsafe path and symlink rejection. +5. Generate manifests and exact results. Authenticate remote tree blobs; publish + a new branch/PR, never overwrite peer proof bodies. +6. Request distinct-provider analytic review of three scoped slices. Do not infer + acceptance or a merge from passing tests. Check exact-current-head hosted gates. + +Review focus: near-zero hard spectra; the exceptional absorption branch; rotation +versus isotropy; uncentered zero counts; compact-only cross-term rates; actual +versus limiting compound-Poisson parameters. Finite controls do not prove analysis. diff --git a/frontiers/spectral_cluster_closure_20260929/PROOF.md b/frontiers/spectral_cluster_closure_20260929/PROOF.md new file mode 100644 index 000000000..16c56821b --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/PROOF.md @@ -0,0 +1,491 @@ +# Orthogonal spectral closure of the rare window-count law + +Object: OA-SPECTRAL-CLUSTER-CLOSURE-20260929-v1. +Author: OpenAI / GPT-6 Astra Pro, 29 September 2026. +Disposition: AUTHOR-SIDE CONDITIONAL PROOF CANDIDATE; NONAUTHOR REVIEW REQUIRED. +Scientific effect NONE: no existing proof, acceptance record, global register, +Boolean or prize is changed. Shared GitHub identity is not organizational +independence. All new analytic steps below require their own review. + +## 1. Model, inputs, and the claimed closure + +Fix d>=2, m=d-1, torus side L>0, birth b, gap mark k>0, and an orthonormal +axial/transverse frame. Use exactly [P]'s variance-one periodized Gaussian +covariance, original endpoint observations + + M=(-r/2,0), S=(r/2,0), + f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0, + +and endpoint regression Q_r. Let W_r=F_d(H_M)F_(d-1)(H_S), Z_r=E_Q W_r and +Q_r^W=(W_r/Z_r)Q_r. N_r counts ALL additional critical points with heights in +(b-k r^3,b), excluding the two pins. Constants below depend on these fixed +parameters, d, and L; where stated they also depend on R or rho. No uniformity +in varying dimension, volume, or unbounded/vanishing marks is claimed. + +Exact source commits, paths, sizes and hashes are in SOURCES.json. The inputs are: + +[P] parent Sections2-5: positive Fourier spectrum, nonsingular contact frame U_r, +its target v_r, smooth finite-jet regression, every fixed C^q moment, and +Z_r/r^2 -> z0>0. The endpoint-gradient identity gives W_r/r^2 <= C K^(2d), where +K>=1 is a fixed multiple of 1+||f||C4 bounding operator derivatives through four. + +[D5] the fixed-d global first moment and height-window shell estimate + + E_W N_r <= C r^3, + E_W N({Rr<|x|=4. (1) + +[RM,RC] for fixed rho>0, on D_rho={|x|>=rho}, with Lambda the SUM of the +index-specific normalized contact kernels, + + E_W N(D_rho)=k r^3 integral_Drho Lambda+O_rho(r^4), + E_W (N(D_rho))_2=O_rho(r^5). (2) + +[C6] E_W (N_r)_q<=C_q r^3 for every fixed q>=2. With (1), Stirling's identity +also gives E_W N_r^q=O_q(r^3). We use this only for moment uniform integrability +and consequences, not for the new near-event domination or mixed-event estimate. + +[CUB] the exact deterministic classifier in #158, Theorem C, at its xAI-reviewed +algebraic scope. Its Gaussian sector theorem is NOT consumed. [DEEP] is credited +for the planar exclusion construction; Section3 proves the vector version here. +[RCL] the previously reviewed generic Poisson/compound-Poisson consequences. +The defective global proof in #159 is NOT a premise. This note gives an alternative +spectral-coordinate proof, not a retrospective acceptance of its shear argument. + +Theorem (conditional global cluster law). There are explicitly specified finite +positive numbers a1,a2,beta_far such that, putting + + nu1=a1+beta_far, nu2=a2, + +for every fixed nonnegative integer q, + + sum_(n>=1) n^q |r^-3 Q_r^W(N_r=n)-nu1*1{n=1}-nu2*1{n=2}| -> 0. (3) + +The coefficients are (17) and (22) below. Thus the full limiting nonempty count +measure is unique and supported on {1,2}. This is not a joint law of clusters +from distinct pin pairs, and not a spatial independence statement. Unscaled +Law(N_r) tends to delta_0. The zero mass must be CENTERED before multiplying +by r^-3; r^-3 Q_r^W(N_r=0) diverges. + +## 2. Physical jets, residual coupling, and exact orthogonal coordinates + +Let A=D_y^2 f(0) be the m-by-m midpoint transverse Hessian and T the list of +independent third derivatives at 0 EXCEPT f_xxx. Set J=(A,T). At contact, +(U_0,J) is the complete nonrepeated jet list through degree three: U_0 supplies +f, all first derivatives, f_xx, f_xyi, and f_xxx. Positive Fourier spectrum +therefore gives a positive-definite covariance. For sufficiently small r, the +joint covariance and its inverse are uniformly bounded. The conditional density +h_r(A,T) under Q_r converges locally uniformly to h_0 and obeys + + h_r(A,T)<=C exp[-c(||A||F^2+|T|^2)]. (4) + +The bounded conditional means have been absorbed by reducing c. + +Take an independent copy F of the unconditioned smooth field. For each raw target +j, construct the conditional field by regression on V_r=(U_r,J): + + f_r^j=F+Cov(F,V_r)Cov(V_r)^-1((v_r,j)-V_r(F)). (5) + +All coefficient functions are bounded in C4 and converge there. Averaged contact +functionals in U_r are bounded by a constant times ||F||C3; this uses the integral +forms of the pin divided differences, not separate uncontrolled r^-p terms. +Consequently, with S=C(1+||F||C4), independent of the target j, + + K(f_r^j)<=C(S+|j|), E S^p=1, and let K bound the operator norms of +all derivatives through four. Let lambda=lambda_min(-A). If + + rK<=k/(4R), lambda>(8RK+56RK^2/k)r, (11) + +there are only the two pinned critical points in the cylinder. + +Proof. Throughout the cylinder f_yy<=-lambda/2, since its variation from A is at +most 2RKr. Put g(x)=f_y(x,0). The pin gradients give g(-r/2)=g(r/2)=0. Applying +the scalar two-node interpolation estimate to every unit projection of g gives +||g(x)||<=KR^2r^2, also outside the pin interval. No vector-valued Rolle zero is +assumed. Likewise + + g'(x)=r^-1 integral_(-r/2)^(r/2)[g'(x)-g'(t)]dt + +implies ||g'(x)||<=K(R+1/2)r. For rho=4R^2Kr^2/lambda=11k>0. +The strictly convex function psi' already has the two pinned zeros and cannot +have a third. All critical points in the cylinder lie on its graph. This proves +(11) in every fixed dimension. + +On the typed support H_M<0, A has largest eigenvalue less than rK/2 by the +Hessian Lipschitz bound, so sk/(4R), + + |s|<=C_R K^2<=a_R U^2+a_R r^2 |s|^2, a_R>=1. (12) + +Here K>=1, k is fixed, and (10) was used. The elementary absorption dichotomy is + + x<=a U^2+a r^2 x^2 implies + x<=2a U^2 OR x>=1/(2a r^2), x>=0. (13) + +If x>2aU^2, subtracting aU^2 from (12) proves the second alternative. +On the second alternative |A|op>=r|s|>=c_R/r, hence K>=c_R/r. The first excluded +event also implies K>=c_R/r. All exceptional mass can therefore be bounded in +ORIGINAL Q_r coordinates, before any spectral rescaling. For every p,M>=0, + + E_W[K^p;exceptional] <= C E_Q[K^(p+2d);K>=c_R/r] + <= C_(p,M,R) r^M. (14) + +The last bound uses one higher fixed Q_r moment. The normalizer is the full +Z_r>=z_*r^2 and W_r<=Cr^2K^(2d). There is no need to posit a conditional Gaussian +tail that is uniform in an unbounded scaled target. The exceptional branch has +not been discarded; it is negligible to every fixed power of r. + +## 4. One global majorant, including multiple soft eigenvalues + +At each pin the axial Hessian column has norm <=rK/2 by the vector gradient +average. The TRANSVERSE part of the midpoint column in the soft eigenvector direction is +r s times that eigenvector; its endpoint transverse perturbation is bounded by +rK/2. Its axial entry at a pin is already bounded by the short axial column. +Thus the full soft column is bounded by r(|s|+K), up to a fixed harmless constant. +The axial and soft columns correspond to orthogonal coordinate directions. Hadamard therefore gives + + W_r/r^4 <= C K^(2d-2)(|s|+K)^2. (15) + +This does not divide by any hard eigenvalue. On the regular near-occurrence +branch |s|<=2a_R U^2, (10) gives K<=C_R U^2 (r<=1), so (15)<=C_R U^(4d). +Writing v=m(m-1)/2, (9) gives |J_r|<=C_R U^(2v). Thus the density of the rescaled +NONEMPTY near measure, in spectral variables and the coupling variable F, is +bounded by + + G_R=C_R exp[-c(|h|^2+|tau|^2)] + U^(4d+2v) 1{|s|<=2a_R U^2}. (16) + +Indeed disintegration gives r^-3 times r from (9), times r^4 from the weight, +divided by Z_r: the prefactor is c_m r^2/Z_r, which is bounded. Integrating s in +(16) contributes only another U^2. Gaussian h,tau integration and every fixed +moment of S make G_R integrable. Multiplication by any fixed polynomial in +K, |s|, |h|, |tau| remains integrable on the regular branch. Formula (14) controls +the weighted exceptional branch as well: for a scaled-jet power, use |s|<=K/r +and choose the arbitrarily large power M in (14) to absorb that extra r^-p. + +Consequences: the r^-3 near-occurrence measures are tight in all the spectral +jet variables; their tails outside increasing compact sets tend to zero uniformly +as r->0. Their occurrence-weighted K moments are O(r^3). If m>=2, the limsup of +scaled near-occurrence mass with |h2|<=eta tends to zero as eta->0, directly by +integrating G_R over that strip. The same holds near repeated hard spectra. No +inverse determinant or 1/eta bound appears. This proves the needed multiple-soft +exclusion IN MEASURE, without a pointwise assertion that two soft directions +cannot occur. + +Using C6 only now, Cauchy-Schwarz also yields +E_W[N_R K^p]<=sqrt(E_W N_R^2)*sqrt(E_W[K^(2p);N_R>0])=O_(R,p)(r^3). +Thus the LOCAL derivative-weighted bound is established, not assumed. The global +analogue is not needed for the rest of this proof. + +## 5. Pointwise normal form, typed-boundary control, and the near limit + +Fix spectral variables s,h,O,tau with 0 P_s,tau(X,Z) in C2, + r^-2 grad_w f(rX,rZ,r^2V) -> -diag(h)V+Q_tau(X,Z) in C1, + +where + + P_s,tau=2kX^3-3kX/2-k/2+sZ^2/2 + +(a/2)(X^2-1/4)Z+(beta/2)XZ^2+(c/6)Z^3, + a=tau_xxz, beta=tau_xzz, c=tau_zzz. + +Q_tau contains the hard-index cubic terms. For fixed positive h the hard +Hessian stays negative definite for small r. On the full physical Rr ball, +grad_w f=-diag(h)w+O(Kr^2)+O(Kr|w|). Every critical point therefore has +|w|<=C_(h,R,F,tau) r^2. The hard implicit function is unique and smooth, and +substitution into f/r^3 changes the planar potential by O(r) in C2 on fixed +sets. Its inverse-hard-eigenvalue constants are used ONLY for pointwise +convergence, never in (16). + +At the endpoints the soft Hessian blocks divided by r converge to + + M_M=[[-6k,-a/2],[-a/2,s-beta/2]], + M_S=[[ 6k, a/2],[ a/2,s+beta/2]]. + +A Schur complement across the fixed hard block, or the determinant expansion, +gives W_r/r^4 -> product h_j^2 * w(s,a,beta), where + + w=[-6k(s-beta/2)-a^2/4]_+ [a^2/4-6k(s+beta/2)]_+. + +It is positive exactly on s<-|B|/2, B=beta-a^2/(12k), and equals +9k^2(4s^2-B^2) there. Outside this open typed domain its limiting value is zero; +on the typed boundary the determinant limit is also zero. Consequently no count +convergence is needed at a point with zero limiting weight. This is the explicit +handling of the typed boundary, not an assumed compact exclusion from it. + +Within the typed domain use [CUB]'s exact classifier n(s,a,beta,c) in {0,1,2}. +Let n_R count those additional cubic critical points in X^2+Z^2=1, +Z!=0 at any critical root, and the two gradient equations solve for (beta,s) +as smooth functions of (X,Z,a,c). A circle coordinate plus a,c is three parameters, +so its image in four-dimensional (s,a,beta,c) space is null. Cover by countably +many compact charts with |Z| bounded away from zero. Height boundary relations +are the nonzero polynomial threshold of [CUB]. The pins are nondegenerate and +remain EXACT, so they cannot split into new counted roots. + +Choose disjoint neighborhoods of relevant zeros. C2 convergence and the inverse +function theorem preserve precisely one root in each; on the rest of the compact +set in a slightly enlarged height window the gradient is bounded away from zero. +No condition on lower-height degeneracies is necessary. Hard slaving then proves +N_R -> n_R pointwise for these fixed variables. The hard coordinates vanish on +the r spatial scale. The extra points have full index d-1. + +For precision, extend the coefficient kernel by zero off ordered positive h and +the typed domain. With T=Rot_O(tau), define + + dM(s,h,O,tau) = (c_m/z0) h_0(O diag(0,-h)O^t,T) + * product_(j=2..m) h_j^3 + * product_(2<=i=1. To see this, on the regular branch sum the absolute conditional +errors over the count index j: it is bounded by the weight error plus twice +the weighted probability of a count mismatch. Pointwise convergence gives zero +and (16) dominates. Cases of zero limiting weight give zero directly. On a fixed typed jet with n_R>0 and finite S, K is bounded as r->0, so the +exceptional branch is eventually absent and the regular-branch indicator is +eventually one. No part of the proposed limit is lost by that split. The +exceptional mass is o(r^3) by (14). This proves + + r^-3 Q_W(N_R=j) -> a_j^R=integral 1{n_R=j}dM, j=1,2, + r^-3 Q_W(N_R>=3) -> 0. (18) + +There is NO finite uncentered n=0 formula. For fixed R, the right side is a +finite measure only on nonempty counts. + +## 6. Integrability at arbitrary scaled radius + +For the planar classifier put D=(c-a beta/(4k)+a^3/(72k^2))/2 and +T_*=-(s-B)^2(B+2s)/(12k). It says: s>B gives n=2 below D^2=T_* and n=1 at or above; +s<=B gives n=1 strictly above that threshold and n=0 otherwise. On n>=1, x=-s>0 +satisfies + + x<=2|B|+(48kD^2)^(1/3). + +Indeed s>B forces x<|B|. Otherwise D^2>T_*, and if x>=2|B| then +T_*>=(x/2)^2*x/(12k)=x^3/(48k). Since w<=36k^2 x^2, + + integral_s w 1{n>=1} <=384k^2 |B|^3+2304k^3 D^2. (19) + +This is a polynomial bound in the cubic coordinates at fixed k. The remaining +factor in (17) is a nonnegative polynomial in h times a uniformly Gaussian-decaying +function of h,tau, by ORTHOGONAL norm preservation. Therefore + + a_j=integral 1{n=j}dM, j=1,2 (20) + +are finite. They are strictly positive: take the open two-point cubic sector +(s,a,beta,c)=(-3k/2,0,-2k,0), or the one-point sector (-k,0,0,2k), choose distinct +positive hard h in a compact box, and arbitrary remaining cubic entries in a +small box. Gaussian densities are positive, and the spectral/weight factors are +positive on an open set. For m=1 the empty hard products are 1. + +For every fixed jet, n_R=n eventually as R->infinity. Exact-count indicators +{n_R=1} need NOT be monotone, but are bounded by 1{n>=1}; (19) supplies an +integrable majorant. Dominated convergence proves a_j^R->a_j. No inverse shear +parameter is suppressed by integrating out variables that a spatial observable +still uses. + +## 7. Remote singleton coefficient and vanishing mixed event + +By (1) and [RM]'s fixed-remote mean limit, for 00; equivalently +choose R_r=rho'/r, which is permitted because the shell constant is uniform in +R_r>=4. The kernel is nonnegative and the annulus is fixed, so its mean limit +is supplied by [RM]. Thus + + beta_far=k integral_(X\{0}) Lambda(x)dx (22) + +exists, is finite, and differs from the fixed-rho integral by O(rho^2). +It is positive by positivity on any fixed remote region of positive volume. +Corollary D of [RC] and the mean limit give +r^-3 Q_W(N_far^rho=1)->k integral_Drho Lambda and +Q_W(N_far^rho>=2)=O_rho(r^5). + +Fix R and rho. To control the mixed event, first restrict the spectral jets +(s,h,tau) to a fixed compact box H, retaining all O. Under the conditional law +(5) with these targets, the covariance of (f(x),grad f(x)), |x|>=rho, has a +uniform positive lower bound. At r=0 the conditioning is the COMPLETE degree-three +jet at the origin and x is a distinct site; positive Fourier spectrum gives +full joint rank. Compactness in x, O, and the target-independent covariance, +plus continuity through r=0, proves the bound. Conditional Hessian moments are +bounded on H and on the height window. The usual unweighted Gaussian Kac-Rice +formula, integrated over the window of length k r^3, gives + + E[N_far^rho | U_r,J]<=C_(H,rho) r^3. (23) + +On H, (15) and (6) give a uniform second moment of W_r/r^4. Conditional +Cauchy-Schwarz therefore gives + + E[(W_r/r^4)1{N_far^rho>0} | U_r,J]<=C_(H,rho) r^(3/2). + +Disintegrating over H with (9), the full normalizer, and bounded density and +Vandermonde gives Q_W(spectral jets in H,N_far^rho>0)=O_(H,rho)(r^(9/2)). +In particular this bounds the compact-jet near/far intersection. +Outside H, its probability is bounded by Q_W(N_R>0,jets outside H). By (16) +and (14), its scaled limsup tends to zero as H exhausts the spectral variables. +Thus + + Q_W(N_R>0,N_far^rho>0)=o_(R,rho)(r^3). (24) + +The full mixed term has no asserted r^(9/2) rate: that rate was proved only on +a fixed compact jet box. This proof avoids conditioning on a near WITNESS whose +observation frame degenerates. It uses fixed-origin physical jets instead. + +## 8. The full count limit and all polynomial weights + +Write N=N_R+N_mid+N_far. For fixed R,rho, the bad events N_mid>0, +{N_R>0,N_far>0}, N_far>=2, and N_R>=3 have probabilities bounded by (1), (24), +(2), and (18), respectively. On their complement N equals either the near +count in {0,1,2} or a remote singleton, but not both. Therefore, with an absolute +constant C independent of R,rho, + + limsup |r^-3 Q(N=2)-a_2^R| <= C(R^-2+rho^2), + limsup |r^-3 Q(N=1)-a_1^R-k integral_Drho Lambda| <= C(R^-2+rho^2), + limsup r^-3 Q(N>=3) <= C(R^-2+rho^2). (25) + +First r->0 at fixed R,rho, then R->infinity and rho->0, using (20)-(22). +This proves coordinate convergence to nu1=a1+beta_far and nu2=a2, and vanishing +scaled tail mass. For a fixed integer q>=0, C6 supplies E N^(q+1)<=C r^3; hence + + r^-3 E[N^q;N>M]<=C/M. + +Finite-coordinate convergence plus this uniform tail proves (3). No interchange +of a nonuniform radius limit and r limit has been assumed. No finite unscaled +polynomial moment theorem alone would imply (3); the new domination and regional +sandwich are the essential ingredients. + +In particular + + E N/r^3 -> nu1+2nu2, + E (N)_2/r^3 -> 2nu2, + E (N)_q/r^3 -> 0 for every fixed q>=3. (26) + +The positive-conditioned count converges in TV to +(nu1 delta1+nu2 delta2)/(nu1+nu2), and its size-biased version to +(nu1 delta1+2nu2 delta2)/(nu1+2nu2). The two laws are different. Their formulas +use the normalized full tilt, not a restricted normalizer. + +For independent replicas with floor(t/r^3) counts, the identified compound limit +is P1+2P2, with independent P1~Pois(t nu1), P2~Pois(t nu2), as follows either by +the exact generating function or [RCL]'s proved independent-replica bound. +There is no independence claim for regions of a single field. + +The sharp [RCL] Poisson comparison also now has coefficients: +optimal ordinary-Poisson TV error/r^3 -> nu2 and mean-matched error/r^3 ->2nu2, +so their ratio tends to 2 (not just liminf>=2). The canonical approximant using +the ACTUAL conditional mark law still has Theta(r^6) error. Replacing its mark +law by the identified LIMIT does not inherit that rate: without a convergence +rate for the coefficients, this replacement is only o(r^3) in one-count TV. + +## 9. What is solved here, conditional on review, and what is not + +The proof supplies a replacement for scaled jet tails, typed-boundary control, +nearly singular hard blocks, the near/far mixed event and the radius sandwich. +It works for every FIXED d>=2 via orthogonal spectral coordinates. It does not +require the stronger global derivative-weighted insertion estimate proposed in +#157; Section4 proves the local version as a consequence and the global law does +not need the global version. Thus that former sufficient route is bypassed, not +silently assumed true. + +The local coefficients in d=2 reduce exactly to #158's alpha1,alpha2, and its +contact birth factorization remains a local statement. In higher dimensions the +Haar/stable integration may couple birth-dependent even jets to orientation; +no higher-dimensional or global birth cancellation is asserted. + +No convergence rate, numerical coefficient enclosure, unbounded-mark theorem, +growing-volume limit, inter-pin-pair cluster independence, elder selection of the +extra points, or full Lean formalization is claimed. The input Gaussian and +regional sources remain conditional premises at their exact stated scopes. +Theorem (3) is a new author-side candidate, not accepted merely because finite +controls or existing formal gates pass. + +Review division: A, vector exclusion, absorption, and orthogonal spectral measure; +B, integrable majorant, typed/hard-boundary handling and pointwise normal form; +C, compact-jet remote conditioning, mixed event, radius sandwich and consequences. +The prior #159 diagnosis and the distinction between that proof and this replacement +are retained in AUDIT_AND_REPAIR.md. Source preservation is mandatory. diff --git a/frontiers/spectral_cluster_closure_20260929/README.md b/frontiers/spectral_cluster_closure_20260929/README.md new file mode 100644 index 000000000..895dded8a --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/README.md @@ -0,0 +1,41 @@ +# Orthogonal spectral closure of the window-count law + +OpenAI / GPT-6 Astra Pro. Core conditional proof has completed scoped nonauthor A/B/C acceptance. The separate global derivative-weighted addendum has its own Claude nonauthor acceptance5360082678. All acceptance is at the exact stated conditional scope. Scientific effect NONE. No self-merge, parent-proof modification, or global status/Boolean change. Shared GitHub identity is not organizational independence. + +The new argument proposes the unique limiting nonempty count measure in every FIXED dimension d>=2: nu1 delta1 + nu2 delta2, with explicit positive finite coefficients. Near coefficients are an orthogonal Haar/spectral/Gaussian jet integral; the far contribution is the reviewed remote singleton kernel. The new proof does not consume the audited v1.0 global argument of #159 or the proposed marked Fourier theorem of #157. + +The main new steps are the vector transverse-exclusion lemma; the absorption split into a regular soft layer and a separately controlled exceptional raw-field tail; a polynomial majorant with NO inverse hard eigenvalues; weighted typed-boundary and multiple-soft control; pointwise stable-direction elimination; compact-origin-jet near/far decoupling; and a radius sandwich. Existing C6 moments provide polynomial uniform integrability after, not instead of, this new limit argument. + +Consequences, conditional on the new theorem: complete polynomially weighted count convergence; higher factorial moments o(r^3) for q>=3; identified conditional and Palm laws; independent-replica limit Pois(t nu1)+2 Pois(t nu2); exact limiting ratio 2 between mean-matched and optimized ordinary-Poisson error. No convergence rate or numerical coefficient is supplied. Replacing the actual conditional law in the canonical compound approximant by its limit does not preserve the old O(r^6) rate without new rate information. + +## Read and replay + +Read PROOF.md and AUDIT_AND_REPAIR.md. PLAN.md records the task split. SOURCES.json includes all consumed, credited, and audited identities, including the historical #159 proof; no recorded source is silently skipped. + +In a full checkout containing all pinned commits: + + python -B -S frontiers/spectral_cluster_closure_20260929/verify.py + +In the standalone directory: + + python -B -S verify.py --local-only + +The latter explicitly reports source_pins_checked=false. Local Git fixtures test verifier behavior, not the truth of the actual project sources. The hosted workflow performs the actual source-object checks and full packet replay; existing downstream/formal gates remain separate. + +Current local suite: 55 tests in normal Python and 55 with -O; deterministic result equality; eight semantic mutants rejected with exit1 in each mode and unknown labels with exit2. Controls cover exact algebra only, not Gaussian convergence. The initial12-test stub failed all12 intended assertions. An expanded positive fixture mistakenly violated the absorption premise; that fixture was corrected, not the valid implementation. Source verifier had its own fail-first fixture suite. See VALIDATION.md for the exact scope. + +## Actual scoped core reviews + +A: Claude5359968447 accepts vector exclusion, absorption and the exact spectral/Haar measure. +B: Claude5359845136 accepts the majorant, typed/hard-boundary control, normal form and coefficient integrals. +C: OpenAI/Codex5359879627 accepts the remote conditioning, mixed-event exhaustion, radius sandwich and consequences; this is same-provider nonauthor review, not independent-provider review. + +All bind the unchanged core PROOF.md. The separate OpenAI/Codex A check5360029463 is corroboration, not an additional independent vote. Parent-input acceptance and organizational independence are not renewed by these reviews. A code pass is not their substitute. No Lean formalization of the new proof is claimed. + +The initial hosted nested-directory source-path defect is repaired with git ls-tree --full-tree and a real-Git regression. See VALIDATION.md; a predecessor failure is not concealed by local test success. + +## Separate global derivative-weighted addendum + +GLOBAL_DERIVATIVE_WEIGHTED.md derives E[N_r(1+||f||C4)^p]<=C_p r^3 directly from the earlier C6 regional Kac-Rice proof, in fact with C6 norm. It retains the one full normalizer, adds the conditional-moment cost (1+beta)^p, and writes all eight regional absorptions. It is not a consequence assumed by the core spectral theorem. Nine additional finite ledger tests are included. The addendum has separate Slice D acceptance5360082678; it was not inferred from the earlier core reviews. + +REVIEW_RECORD.md records the completed core A/B/C and separate D coverage, exact byte bindings and provider exposure. GD1 is not an input to the core theorem. The unchanged manuscripts retain their author-time candidate headers to preserve reviewed bytes; this record supplies the later dispositions. Integration still requires successful current-head checks and a nonauthor integrator. The author will not self-merge or change a global scientific register. diff --git a/frontiers/spectral_cluster_closure_20260929/RECONNAISSANCE.md b/frontiers/spectral_cluster_closure_20260929/RECONNAISSANCE.md new file mode 100644 index 000000000..aec1f588d --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/RECONNAISSANCE.md @@ -0,0 +1,10 @@ +# Narrow primary-source reconnaissance, September29 2026 + +Consensus.search was actually called with “Gaussian random fields critical point rare clusters Palm spectral eigenvalue boundary layer Kac Rice domain:math”. It returned the exhausted monthly30-search quota and October1 reset. No Consensus result is claimed. + +Primary arXiv metadata/abstract pages were opened through web: + +- https://arxiv.org/abs/2304.07424v3 — Diego Armentano, Jean-Marc Azais and Jose Rafael Leon, On a general Kac-Rice formula for the measure of a level set. The repository cites v3 (December5 2023); the page reports a later v4 dated April22 2025. This pass did not call v3 latest or audit changes between versions. The parent Kac-Rice interface is retained at its recorded scope. +- https://arxiv.org/abs/2305.17586 — Louis Gass and Michele Stecconi, The number of critical points of a Gaussian field: finiteness of moments, v2 July19 2023. The abstract concerns finite critical-count moments under jet nondegeneracy. It does not substitute for the rare tilted O(r^3) bounds or the identified cluster law proposed here. + +Access depth: metadata and abstracts only, not full-text theorem audits. The orthogonal spectral Jacobian is derived in the manuscript and its normalization is fixed by an explicit Gaussian test integral. No external unverified theorem is imported as a replacement for a missing project premise, and no exhaustive novelty or priority claim is made. diff --git a/frontiers/spectral_cluster_closure_20260929/RESULTS.json b/frontiers/spectral_cluster_closure_20260929/RESULTS.json new file mode 100644 index 000000000..7c564dacf --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/RESULTS.json @@ -0,0 +1,16 @@ +{ + "absorption_cases": 141, + "groups": [ + "spectral-jacobian", + "hard-weight", + "absorption", + "cutoff-direction", + "nonempty-measure", + "vector-third-derivative", + "full-normalizer" + ], + "mathematical_acceptance": false, + "passed": true, + "scientific_effect": "NONE", + "scope": "finite exact controls only" +} diff --git a/frontiers/spectral_cluster_closure_20260929/REVIEW_RECORD.md b/frontiers/spectral_cluster_closure_20260929/REVIEW_RECORD.md new file mode 100644 index 000000000..9bcae183f --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/REVIEW_RECORD.md @@ -0,0 +1,97 @@ +# Completed scoped reviews — spectral core and derivative-weighted addendum + +Scientific effect NONE. This is a factual record of actual nonauthor reviews, +not a self-issued acceptance, governing-register transition, or organizationally +independent endorsement. All lanes share one GitHub account. Source reviews do +not revalidate every parent result or extend beyond the stated parameter scope. + +## Exact immutable mathematical objects + +Core PROOF.md:25006 bytes; SHA256 +e971b2cbe50a8a06b47c1219191201e0d1037c9adac23e5e3b7d2051bb70c2eb; +Git blob16c56821b52fd76b0be791622b9c3809eafde75a, unchanged since +41814598d37de8446dd538ce3cf2d57982a4077f. + +GLOBAL_DERIVATIVE_WEIGHTED.md:8813 bytes; SHA256 +a445607be26cc2863682c404d702798a984fa2b8994ed0dc5b57fb9c4da153eb; +Git blob3f63edb54ea5422cdc328cc54fb093c8a5d84be1, unchanged since +3892aeed64601350472566c657d954e84ffdd78d. It is NOT an input to the core proof. +The manuscripts retain their historical author-time headers; the later actual +review dispositions are recorded below without changing their mathematical bytes. + +## Actual core coverage + +A — Anthropic Claude5359968447, submitted2026-09-30T00:07:07Z at7a44130: +ACCEPT Sections2-3, complete-jet coupling, ordered spectral/Haar coordinates, +vector exclusion, both absorption branches and the original-Q exception bound. +The reviewer declares no authorship of the consumed sources or competing159. +Different provider from the author; no organizational-independence credit. + +B — Anthropic Claude5359845136, submitted2026-09-29T23:46:11Z at41814598: +ACCEPT Sections4-6, majorant, typed/hard-boundary control, normal form and +coefficient integrals, conditional on A and the pinned classifier. That reviewer +authored consumed C6/D5/RC and competing159; this is source-exposed scrutiny, +not a renewal of those inputs or organizational independence. + +C — OpenAI/Codex5359879627, submitted2026-09-29T23:51:40Z at7a44130: +ACCEPT Sections7-8, compact-origin-jet far conditioning, full mixed o(r^3), radius +sandwich and probability consequences, conditional on A/B and exact inputs. +Different author session but SAME PROVIDER. Independent-provider and +organizational credit are zero. Its read-only challenges are not extra votes. +Comment5901273120 clarifies arbitrary fixed real b, not b>0. + +Additional OpenAI/Codex5360029463 corroborates A at the unchanged bytes. It has +the same-provider limitation and is not an additional independent vote. + +Combined core scope: fixed d>=2,L>0,k>0,b in R and frame, with exact imported +Gaussian/regional interfaces. No numerical coefficient or convergence rate, +growing-volume or vanishing-mark uniformity, or distinct-pin-pair independence. + +## Separate D acceptance + +Anthropic Claude5360082678, submitted2026-09-30T00:26:33Z at3892aeed: +ACCEPT GD1-GD5, exactly one full Z^-1, conditional K^(3d+p) moment insertion, +all eight regional absorptions with height window retained, dyadic integration, +and the global rare-intensity derivative tail. This reviewer declares no +authorship of C6 or the other pinned sources; different provider from the author, +but the same shared GitHub account and zero organizational independence. + +Scope: every fixed d>=2,L, compact birth/positive-gap marks bounded away from +k=0, O(d) frames, and each fixed p, with existential constants. The verdict is +conditional exactly on earlier C6 Lemma4.4/5.1 and regional interfaces, not a +revalidation of them. It does not accept an exponential derivative moment or rate. +The earlier core reviews were never used as substitutes for this D review. + +Nonblocking D reading clarifications adopted in author comment5901687461: +choose K=max(source K,1), which preserves its moment bound; R3a is r^3 s^d +<=r^3 s^2; the unmarked comparison is the underlying DL/RM bound before C6's +extra Psi mark; R4 uses Lemma4.4 with RM's bounded beta. GD4's displayed constant +is a convenient valid upper bound, not a claim of the smallest possible constant. +Core clarifications: the soft direction is largest for A/smallest for -A; +||f_xy||<=K(R+1/2)r+K|zeta|<=2RKr; norms are invariant or uniformly equivalent +coordinate norms, never an assumption of field isotropy; N_R is the Euclidean +Rr-ball count inside the exclusion cylinder. + +## Verification and integration boundary + +Initial target36646437664 failed because git ls-tree inherited the nested cwd. +A real-Git fail-first fixture reproduced it; --full-tree fixed it at7a44130. +Codex P1 comment4139440699 is answered4139467347 and RESOLVED. All identity, +path, symlink and negative controls remain; no source check was bypassed. + +Target/full runs36646903471/36646903884 at7a44130,36649121320/36649121574 at3892aeed, +and36650263358/36650263498 atc433a592 all succeeded. These observations are not +automatically rebound to later metadata-only commits. Final-head evidence belongs +in the PR handoff after a fresh readback. + +Local packet:55 tests per normal/optimized mode,141 exact absorption probes, +eight semantic mutants rejected per mode and unknown-label rejection. Eleven +actual consumed/credited/audited Git-source objects are checked by hosted replay. +The local container did not obtain a full upstream checkout; its explicit +local-only mode never reports actual project source pins checked. Existing Lean +package success does not formalize the new analytic proofs. + +Both manuscripts and all executables/source pins are unchanged by this record. +All four requested analytic review slices are complete at their stated scope. +A nonauthor integrator must still read the final diff, review threads and +current-head/current-base checks. No self-merge or global-status fold is implied. diff --git a/frontiers/spectral_cluster_closure_20260929/SOURCES.json b/frontiers/spectral_cluster_closure_20260929/SOURCES.json new file mode 100644 index 000000000..8daf24b7e --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/SOURCES.json @@ -0,0 +1,129 @@ +{ + "schema": 1, + "repository": "d6g8k5htny-coder/Math-", + "scientific_effect": "NONE", + "source_policy": "Every entry, including credit and audited historical bytes, is mandatory for full source verification. Identity is not mathematical acceptance.", + "sources": [ + { + "id": "P", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "bytes": 40261, + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "git_blob": "dfed3b8d318a3ab1950957f393307733a4bef3f2", + "author": "OpenAI", + "role": "consumed", + "use": "Sections2-5, contact jet rank, full-field regression, derivative moments, full normalizer." + }, + { + "id": "D5", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/d5_dimension_lift_20260929/PROOF.md", + "bytes": 53727, + "sha256": "6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80", + "git_blob": "9d82c707fdb17d3072a8930f26dabedf59e456fc", + "author": "Anthropic Claude", + "role": "consumed", + "use": "Fixed-d first moment and height-window shell estimate, exact scope." + }, + { + "id": "C6", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/c6_palm_route_20260929/PROOF.md", + "bytes": 53364, + "sha256": "aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b", + "git_blob": "89eb8adf08fe7afc2cab9662d3a9875c05ae5cc5", + "author": "Anthropic Claude", + "role": "consumed", + "use": "All fixed factorial upper moments, only for uniform integrability and local weighted-count consequence." + }, + { + "id": "RM", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/remote_window_20260924/PROOF.md", + "bytes": 18355, + "sha256": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "git_blob": "b383bfcc88ec4ad497dff01fb6640e429ba24a84", + "author": "OpenAI", + "role": "consumed", + "use": "Fixed-remote first moment and continuous positive normalized contact kernel." + }, + { + "id": "RC", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/remote_collision_20260928/PROOF.md", + "bytes": 26002, + "sha256": "b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2", + "git_blob": "7b48a88e2af54e759e89a8c8219573bb450a65ea", + "author": "Anthropic Claude", + "role": "consumed", + "use": "Corollary D, all-index fixed-remote factorial bound. The actual source author is Claude." + }, + { + "id": "LM", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/window_multiplicity_laws_20260928/LOCAL_MULTIPLICITY.md", + "bytes": 13100, + "sha256": "e6272e8709835ca6290fecb7034fa84832dde08c3c4cc990a48b8019e89e7c8d", + "git_blob": "b5c18aac5529c5f975ee5bb056b304debafc6697", + "author": "OpenAI", + "role": "prior_credit", + "use": "Original exact pinned cubic and Taylor mechanism, credited and re-derived in spectral coordinates." + }, + { + "id": "CUB", + "commit": "bfcc67dc8957b3ed1fbb789e5a0305e98d7359c8", + "path": "frontiers/planar_cubic_cluster_20260929/PROOF.md", + "bytes": 19889, + "sha256": "117e9299a71e6139270266889eb772ed97518e402d9af029bbdb67caf9d4a0f0", + "git_blob": "bb446d08db8a944537a743ad550b88c1c2ad5758", + "author": "OpenAI", + "role": "consumed", + "use": "Only exact deterministic Theorem C/classifier, xAI review5359488967; not Gaussian sector acceptance." + }, + { + "id": "DEEP", + "commit": "bfcc67dc8957b3ed1fbb789e5a0305e98d7359c8", + "path": "frontiers/planar_cubic_cluster_20260929/DEEP_TRANSVERSE_EXCLUSION.md", + "bytes": 6174, + "sha256": "95c03e59262cb9607a21a296a6837932839dd47ec8e15e67bdfa46782adbcd5a", + "git_blob": "309a38cab16ef67dd909351f40a48e1d83ba2c28", + "author": "OpenAI", + "role": "prior_credit", + "use": "Planar exclusion construction; vector extension is fully proved as new work here." + }, + { + "id": "RCL", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "bytes": 11811, + "sha256": "c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb", + "git_blob": "2ab625cedfc2e47575c4a7fa4853413418c532da", + "author": "OpenAI", + "role": "consumed", + "use": "Generic conditional/Palm, compound approximation and independent-replica consequences, not claimed anew." + }, + { + "id": "RCL-A", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/c6_rare_cluster_laws_20260929/SHARP_POISSON_COEFFICIENT.md", + "bytes": 4712, + "sha256": "f96e7a02ceb711fbaf10142aff7ee5dbc5fb908ac24f695a289180a1e094d14f", + "git_blob": "9f96f7d619a3486d0b125a4f4a3528e213f149d6", + "author": "OpenAI", + "role": "consumed", + "use": "Exact optimized/mean-matched Poisson error inequalities." + }, + { + "id": "AUDITED-159", + "commit": "f0d11805854b1938a2f89235ec590a37b04a7cb9", + "path": "frontiers/c6_cluster_law_20260929/PROOF.md", + "bytes": 51313, + "sha256": "7941ae8062aed14e3085583903867ee3612ca34c1b636c69671a9541c2dd4801", + "git_blob": "1ce3769e76c540ab03b42f2deb6f2d1124459a81", + "author": "Anthropic Claude", + "role": "audited_not_consumed", + "use": "Historical proof diagnosed in review5359646638; no theorem or domination from it is imported." + } + ] +} diff --git a/frontiers/spectral_cluster_closure_20260929/VALIDATION.md b/frontiers/spectral_cluster_closure_20260929/VALIDATION.md new file mode 100644 index 000000000..bf00357c5 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/VALIDATION.md @@ -0,0 +1,29 @@ +# Verification record at author publication + +Scientific effect NONE; finite evidence is not analytic acceptance. + +Actual local execution: +- Initial mathematical stub:12 tests,12 intended assertion failures. Expanded stub checks followed. +- Initial implementation replay exposed one erroneous positive fixture: x=2,U=1,r=1/10,a=1 violates the premise x<=aU^2+ar^2x^2 since2>1.04. Corrected the test to x=1, without weakening the premise or modifying the valid implementation. +- Mathematical suite including CLI checks:32 tests pass in normal and optimized modes. +- Source-custody placeholder:13 tests produced17 expected assertion failures including subtests; valid fixture passed. Implemented complete Git-object/mode and byte identity checks. +- Full local suite:45 tests pass in normal and optimized modes. The deterministic checker output matches RESULTS.json. Eight named false variants exit1 in each mode; unknown labels exit2. All packet identities are generated from exact local bytes. + +Custody fixtures use real isolated Git repositories. They cover wrong size/SHA256/blob, missing path/commit, unsafe paths, duplicate source IDs, empty inventories, duplicate JSON, Git leaf and parent symlinks, and packet symlinks. Source verification authenticates the pinned tree/blob rather than following a worktree link. + +The container could not obtain a complete remote checkout, so actual project Git-object verification is not claimed local. Default hosted replay is configured to fetch and verify EVERY declared source, including historical audit and prior-credit entries. Hosted success and full repository/formal checks must be read at the actual current PR head before any integration. No Lean formalization of the new analytic proof is claimed. + +## Hosted nested-directory repair + +Initial hosted run36646437664 failed at source verification, job109670396383, because `git ls-tree` interpreted the pinned repository-root path relative to the nested packet cwd. Both source fetches and inventory authentication had succeeded; the error was not a missing upstream proof. A new real-Git nested-packet regression failed before repair (None!=1). Adding `--full-tree` makes root-relative source paths independent of cwd. The mathematical PROOF.md and all premise identities remain unchanged. Latest local suite:46 tests per mode. The original failing hosted run is retained; the successor still needs its own hosted result. + +## Addendum and review-metadata completion + +The separate GD1 addendum adds nine exact finite ledger tests. Fresh complete +local replay passes55 tests in normal and55 in optimized Python, with identical +RESULTS and all eight semantic mutations rejected per mode. These test the +normalizer/radius/penalty ledgers, not conditional Gaussian integration. +At addendum head3892aeed64601350472566c657d954e84ffdd78d, hosted target36649121320 +and full36649121574 both succeeded. Later metadata-only commits must be checked +at their own exact PR test merge. Core PROOF.md, GD1, all source pins and every +executable remain unchanged by this final review-metadata update. diff --git a/frontiers/spectral_cluster_closure_20260929/check.py b/frontiers/spectral_cluster_closure_20260929/check.py new file mode 100644 index 000000000..e747e1c81 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/check.py @@ -0,0 +1,155 @@ +"""Exact finite controls for orthogonal spectral cluster closure. + +Standard library only. These controls do not prove Gaussian convergence. +""" +import argparse +import json +from fractions import Fraction as F +from math import prod + +MUTANTS=('drop-spectral-r','drop-soft-vandermonde','wrong-hard-power', + 'drop-far-branch','reverse-cutoff','include-zero', + 'drop-mixed-term','swap-full-normalizer') + + +def rat(x): + if type(x) not in (int,F): raise ValueError('exact int/Fraction required') + return F(x) + + +def absorption(x,u,r,a): + x,u,r,a=map(rat,(x,u,r,a)) + if x<0 or u<1 or r<=0 or a<=0: raise ValueError('invalid absorption arguments') + if x>a*u*u+a*r*r*x*x: raise ValueError('absorption premise does not hold') + if x<=2*a*u*u: return 'near' + if x<1/(2*a*r*r): raise ValueError('absorption conclusion failed') + return 'far' + + +def vandermonde(values): + values=list(map(rat,values)) + if any(b<=a for a,b in zip(values,values[1:])): + raise ValueError('strictly ordered spectrum required') + return prod((values[j]-values[i] for i in range(len(values)) + for j in range(i+1,len(values))),start=F(1)) + + +def spectral_factor(r,s,hard): + r,s=map(rat,(r,s)); hard=list(map(rat,hard)) + if r<=0: raise ValueError('positive radius required') + return r*vandermonde([-r*s]+hard) + + +def limit_hard_factor(hard): + hard=list(map(rat,hard)) + if any(x<=0 for x in hard): raise ValueError('positive hard spectrum required') + return prod((x**3 for x in hard),start=F(1))*vandermonde(hard) + + +def typed_weight(k,s,a,beta): + k,s,a,beta=map(rat,(k,s,a,beta)) + if k<=0: raise ValueError('positive gap required') + return max(F(0),-6*k*(s-beta/2)-a*a/4)*max(F(0),a*a/4-6*k*(s+beta/2)) + + +def nonempty_intensity(law,epsilon): + epsilon=rat(epsilon) + if epsilon<=0 or not isinstance(law,dict) or not law: + raise ValueError('positive scale and PMF required') + out={} + for n,p in law.items(): + if type(n) is not int or n<0: raise ValueError('invalid count') + p=rat(p) + if p<0: raise ValueError('negative probability') + if n>0 and p>0: out[n]=p/epsilon + if sum(map(rat,law.values()))!=1: raise ValueError('PMF must sum to one') + return out + + +def reduced_third(xxx,xxy_v,xyy_vv,yyy_vvv): + xxx,xxy_v,xyy_vv,yyy_vvv=map(rat,(xxx,xxy_v,xyy_vv,yyy_vvv)) + return xxx+3*xxy_v+3*xyy_vv+yyy_vvv + + +def majorant_degree(d): + if type(d) is not int or d<2: raise ValueError('integer d>=2 required') + return 4*d+(d-1)*(d-2) + + +def invalid_cutoff_bound(r,determinant,eta): + r,determinant,eta=map(rat,(r,determinant,eta)) + if not 0=1/(2*a*r*r), + 'absorption dichotomy grid') + cases+=1 + return {'passed':True,'scientific_effect':'NONE','mathematical_acceptance':False, + 'scope':'finite exact controls only','absorption_cases':cases, + 'groups':['spectral-jacobian','hard-weight','absorption','cutoff-direction', + 'nonempty-measure','vector-third-derivative','full-normalizer']} + + +def main(): + parser=argparse.ArgumentParser(description=__doc__) + parser.add_argument('--mutant',choices=MUTANTS) + args=parser.parse_args() + try: result=run_checks(args.mutant) + except ValueError as exc: + print(json.dumps({'passed':False,'error':str(exc)},sort_keys=True)); return 1 + print(json.dumps(result,indent=2,sort_keys=True)); return 0 + + +if __name__=='__main__': raise SystemExit(main()) diff --git a/frontiers/spectral_cluster_closure_20260929/test_check.py b/frontiers/spectral_cluster_closure_20260929/test_check.py new file mode 100644 index 000000000..33fdbff05 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/test_check.py @@ -0,0 +1,136 @@ +import unittest +from fractions import Fraction as F +import check as c + +class InitialTests(unittest.TestCase): + def test_absorption_near(self): + self.assertEqual(c.absorption(1,1,F(1,10),1),'near') + def test_absorption_far(self): + self.assertEqual(c.absorption(200,1,F(1,10),1),'far') + def test_absorption_invalid(self): + with self.assertRaises(ValueError): c.absorption(5,1,F(1,10),1) + def test_vandermonde(self): + self.assertEqual(c.vandermonde([1,3,5]),16) + def test_spectral_factor(self): + self.assertEqual(c.spectral_factor(F(1,10),-1,[2,4]),F(741,500)) + def test_empty_hard_factor(self): + self.assertEqual(c.spectral_factor(F(1,10),-1,[]),F(1,10)) + def test_limit_hard_factor(self): + self.assertEqual(c.limit_hard_factor([2,4]),1024) + def test_weight(self): + self.assertEqual(c.typed_weight(1,F(-3,2),0,-2),45) + def test_zero_filtered(self): + self.assertEqual(c.nonempty_intensity({0:F(7,8),1:F(1,16),2:F(1,16)},F(1,8)),{1:F(1,2),2:F(1,2)}) + def test_reduced_derivative(self): + self.assertEqual(c.reduced_third(1,2,3,4),20) + def test_majorant_degree(self): + self.assertEqual(c.majorant_degree(3),14) + def test_bad_cutoff(self): + self.assertFalse(c.invalid_cutoff_bound(F(1,10),F(1,100),F(1,10))) + + +class AlgebraTests(unittest.TestCase): + def test_absorption_grid(self): + count=0 + for a in (F(1),F(3)): + for u in (F(1),F(2),F(5)): + for r in (F(1,100),F(1,10),F(1,2)): + for x in map(F,(0,1,2,5,10,20,100,200,1000,20000)): + if x<=a*u*u+a*r*r*x*x: + branch=c.absorption(x,u,r,a) + self.assertTrue(x<=2*a*u*u if branch=='near' else x>=1/(2*a*r*r)) + count+=1 + self.assertGreater(count,80) + def test_float_rejected(self): + with self.assertRaises(ValueError): c.absorption(1.0,1,F(1,10),1) + def test_bad_dimension(self): + with self.assertRaises(ValueError): c.majorant_degree(1) + def test_bool_dimension(self): + with self.assertRaises(ValueError): c.majorant_degree(True) + def test_unordered_spectrum(self): + with self.assertRaises(ValueError): c.spectral_factor(F(1,10),-30,[1,2]) + def test_hard_zero_rejected(self): + with self.assertRaises(ValueError): c.limit_hard_factor([0,1]) + def test_weight_boundary_zero(self): + self.assertEqual(c.typed_weight(1,-1,0,-2),0) + def test_weight_shear(self): + self.assertEqual(c.typed_weight(1,F(-3,2),6,1),45) + def test_bad_probability(self): + with self.assertRaises(ValueError): c.nonempty_intensity({0:F(1,2)},F(1,10)) + def test_zero_mass_diverges(self): + for j in (10,100,1000): + e=F(1,j) + self.assertEqual((1-e)/e,j-1) + self.assertNotIn(0,c.nonempty_intensity({0:1-e,2:e},e)) + def test_full_mixed_third_identity(self): + for g in (F(1),F(12),F(24)): + for vd in (F(2),F(5)): + for tensor in (F(3),F(7)): + terms=(g-3*vd-tensor,vd+tensor,-tensor,tensor) + self.assertEqual(c.reduced_third(*terms),g) + for index in (1,2,3): + changed=list(terms); changed[index]=F(0) + self.assertNotEqual(c.reduced_third(*changed),g) + def test_determinant(self): + self.assertEqual(c.det([[2,1],[1,3]]),5) + self.assertEqual(c.det([]),1) + def test_weyl_local_jacobian_2(self): + for co,si in ((F(1),F(0)),(F(3,5),F(4,5)),(F(5,13),F(12,13))): + for l1,l2 in ((F(-2),F(3)),(F(1,3),F(7))): + gap=l2-l1 + jac=[[co*co,si*si,2*co*si*gap], + [co*si,-co*si,-(co*co-si*si)*gap], + [si*si,co*co,-2*co*si*gap]] + self.assertEqual(abs(c.det(jac)),gap) + def test_two_soft_column_determinant(self): + # Exact d=3 Schur expansion, keeping the r^3 mixed correction. + for r in (F(1,100),F(1,10),F(1),F(2)): + matrix=[[-6*r,-r,2*r],[-r,-2*r,3*r],[2*r,3*r,-5]] + expected=-55*r*r+50*r**3 + self.assertEqual(c.det(matrix),expected) + def test_orthogonal_norms(self): + for co,si in ((F(3,5),F(4,5)),(F(5,13),F(12,13))): + l1,l2=F(-2),F(7) + a=co*co*l1+si*si*l2; b=co*si*(l1-l2); d=si*si*l1+co*co*l2 + self.assertEqual(a*a+2*b*b+d*d,l1*l1+l2*l2) + def test_unbounded_shear_counterexample(self): + # D=-1,v=t,A00=-t^2, raw T_www=1, transformed tau_zzz=t^3. + for t in (10,100,1000): + raw_norm_upper=F(t*t+2*t+2) + self.assertGreater(F(t**3)/raw_norm_upper,F(t,2)) + def test_deep_constants(self): + for R in (F(1),F(3)): + for K in (F(1),F(12)): + for k in (F(1,10),F(1),F(3)): + r=k/(4*R*K); lam=2*(8*R*K+56*R*K*K/k)*r + rho=4*R*R*K*r*r/lam; slope=4*R*K*r/lam + self.assertLess(rho,R*r/2) + self.assertLess(slope,F(1,2)) + self.assertLess(28*R*K*K*r/lam,k/2) + self.assertEqual(2*R*K*r,k/2) + def test_near_far_scaling(self): + self.assertEqual(F(3)+F(3,2),F(9,2)) + def test_higher_factorials_vanish_in_limit(self): + from math import prod + for q in range(3,9): + for n in (1,2): self.assertEqual(prod(n-j for j in range(q)),0) + +class ExecutionTests(unittest.TestCase): + def test_both_modes_and_semantic_controls(self): + import subprocess,sys + from pathlib import Path + command=str(Path(c.__file__).resolve()) + reference=None + for flags in (['-B','-S'],['-B','-O','-S']): + run=subprocess.run([sys.executable,*flags,command],capture_output=True,timeout=30) + self.assertEqual(run.returncode,0,run.stderr) + if reference is None: reference=run.stdout + self.assertEqual(run.stdout,reference) + for label in c.MUTANTS: + run=subprocess.run([sys.executable,*flags,command,'--mutant',label],capture_output=True,timeout=30) + self.assertEqual(run.returncode,1,(label,run.stdout,run.stderr)) + self.assertEqual(run.stderr,b'') + run=subprocess.run([sys.executable,*flags,command,'--mutant','unknown'],capture_output=True,timeout=30) + self.assertEqual(run.returncode,2) + +if __name__=='__main__': unittest.main() diff --git a/frontiers/spectral_cluster_closure_20260929/test_derivative_weighted.py b/frontiers/spectral_cluster_closure_20260929/test_derivative_weighted.py new file mode 100644 index 000000000..5389a7400 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/test_derivative_weighted.py @@ -0,0 +1,73 @@ +"""Exact finite ledgers for GD1. They do not prove conditional Gaussian bounds.""" +from fractions import Fraction as F +from math import ceil, factorial +import unittest + + +class DerivativeWeightTests(unittest.TestCase): + def test_one_full_normalizer(self): + # Remote normalized moment: endpoint short columns, normalizer, height. + self.assertEqual(2-2+3,3) + self.assertNotEqual(2+3,3) + self.assertNotEqual(2-2-2+3,3) + + def test_pin_and_collar_spatial_powers(self): + for d in range(2,10): + self.assertEqual((3-d)+d,3) + + def test_exponential_absorption_budgets(self): + # These overestimate by retaining the older source's cap costs as well. + for d in range(2,9): + for p in range(10): + for alpha,cost in ((F(2),F(6+3*d+p)), + (F(2,3),F(15+39*d+10*p)), + (F(1,4),F(40*d+5+10*p))): + n=ceil(cost/alpha) + self.assertGreaterEqual(alpha*n,cost) + self.assertLess(alpha*(n-1),cost) + + def test_inverse_angle_budgets(self): + for d in range(2,9): + for p in range(10): + for cost in (16*d+10+4*p,22*d+15+6*p): + n=ceil(F(cost,2)) + self.assertGreaterEqual(2*n,cost) + self.assertLess(2*(n-1),cost) + + def test_positive_exponential_series_term(self): + # exp(y)>=y^n/n!: retain the n-th term of a strictly positive polynomial. + for y in (F(1,2),F(1),F(3),F(10)): + for n in (1,2,5,9): + partial=sum((y**j/F(factorial(j)) for j in range(n+1)),F(0)) + self.assertGreater(partial,y**n/F(factorial(n))) + + def test_shell_cross_term(self): + for r in (F(1,100),F(1,20),F(1,10)): + for s in (4*r,F(1,2),F(1)): + if r>s/4: continue + value=(r+s*s)**2/(s*s) + self.assertEqual(value,r*r/(s*s)+2*r+s*s) + self.assertLessEqual(value,2*(r*r/(s*s)+s*s)) + + def test_full_strip_volume(self): + for d in range(2,10): + for s in (F(1,100),F(1,3),F(1,2),F(1)): + self.assertLessEqual(s**d,s*s) + + def test_dyadic_sums(self): + for levels in range(1,13): + r=F(1,2**(levels+3)) + scales=[4*r*2**j for j in range(levels)] + self.assertLess(sum((r/s)**2 for s in scales),F(1,12)) + self.assertLess(sum(s*s for s in scales),F(4,3)*scales[-1]**2) + + def test_count_weighted_tail_is_pointwise(self): + for count in (0,1,2,9): + for norm in (F(1),F(3),F(10)): + for threshold in (F(1),F(2),F(5)): + for p in range(5): + left=count if norm>threshold else 0 + self.assertLessEqual(left,count*norm**p/threshold**p) + + +if __name__=='__main__': unittest.main() diff --git a/frontiers/spectral_cluster_closure_20260929/test_verify.py b/frontiers/spectral_cluster_closure_20260929/test_verify.py new file mode 100644 index 000000000..d813c34e9 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/test_verify.py @@ -0,0 +1,80 @@ +"""Source-custody tests against a real isolated Git repository, not mocked Git.""" +import copy +import hashlib +import json +from pathlib import Path +import subprocess +import tempfile +import unittest +import verify as v + +class CustodyTests(unittest.TestCase): + def setUp(self): + temp=tempfile.TemporaryDirectory(); self.addCleanup(temp.cleanup) + self.root=Path(temp.name); self.data=b'proof fixture\n' + (self.root/'nested').mkdir(); (self.root/'nested'/'source.md').write_bytes(self.data) + (self.root/'leaf.md').symlink_to('nested/source.md') + (self.root/'alias').symlink_to('nested',target_is_directory=True) + self.git('init','-q'); self.git('add','nested/source.md','leaf.md','alias') + self.git('-c','user.name=Fixture','-c','user.email=fixture@example.invalid','commit','-qm','fixture') + self.entry={'id':'S','commit':self.git('rev-parse','HEAD').decode().strip(), + 'path':'nested/source.md','bytes':len(self.data), + 'sha256':hashlib.sha256(self.data).hexdigest(), + 'git_blob':self.git('rev-parse','HEAD:nested/source.md').decode().strip()} + def git(self,*args): + return subprocess.run(['git',*args],cwd=self.root,check=True,capture_output=True,timeout=15).stdout + def run_pins(self,entries): + p=self.root/'SOURCES.json'; p.write_text(json.dumps({'sources':entries})) + return v.verify_sources(self.root) + def test_valid_source(self): + self.assertEqual(self.run_pins([self.entry]),1) + def test_valid_source_from_nested_packet(self): + packet=self.root/'frontiers'/'packet'; packet.mkdir(parents=True) + (packet/'SOURCES.json').write_text(json.dumps({'sources':[self.entry]})) + try: + result=v.verify_sources(packet) + except (ValueError,subprocess.CalledProcessError): + result=None + self.assertEqual(result,1,'repo-root source identity must work from nested packet') + def test_wrong_size(self): + e=copy.deepcopy(self.entry); e['bytes']=0 + with self.assertRaises(ValueError): self.run_pins([e]) + def test_wrong_sha(self): + e=copy.deepcopy(self.entry); e['sha256']='0'*64 + with self.assertRaises(ValueError): self.run_pins([e]) + def test_wrong_blob(self): + e=copy.deepcopy(self.entry); e['git_blob']='0'*40 + with self.assertRaises(ValueError): self.run_pins([e]) + def test_missing_path(self): + e=copy.deepcopy(self.entry); e['path']='missing.md' + with self.assertRaises((ValueError,subprocess.CalledProcessError)): self.run_pins([e]) + def test_bad_commit(self): + e=copy.deepcopy(self.entry); e['commit']='0'*40 + with self.assertRaises((ValueError,subprocess.CalledProcessError)): self.run_pins([e]) + def test_unsafe_paths(self): + for path in ('../source.md','/source.md','',':source.md','nested/../source.md','nested//source.md'): + e=copy.deepcopy(self.entry); e['path']=path + with self.subTest(path=path),self.assertRaises(ValueError): self.run_pins([e]) + def test_duplicate_source_ids(self): + with self.assertRaises(ValueError): self.run_pins([self.entry,self.entry]) + def test_missing_inventory(self): + with self.assertRaises(ValueError): self.run_pins([]) + def test_git_leaf_symlink(self): + e=copy.deepcopy(self.entry); e['path']='leaf.md' + e['git_blob']=self.git('rev-parse','HEAD:leaf.md').decode().strip() + data=b'nested/source.md'; e['bytes']=len(data); e['sha256']=hashlib.sha256(data).hexdigest() + with self.assertRaises(ValueError): self.run_pins([e]) + def test_git_parent_symlink(self): + e=copy.deepcopy(self.entry); e['path']='alias/source.md' + with self.assertRaises((ValueError,subprocess.CalledProcessError)): self.run_pins([e]) + def test_duplicate_json(self): + p=self.root/'dup.json'; p.write_text('{"a":1,"a":2}') + with self.assertRaises(ValueError): v.read_json(p) + def test_packet_leaf_symlink(self): + packet=self.root/'packet'; packet.mkdir() + (packet/'file.md').symlink_to('../nested/source.md') + e={k:value for k,value in self.entry.items() if k in ('bytes','sha256','git_blob')}; e['path']='file.md' + (packet/'MANIFEST.json').write_text(json.dumps({'files':[e]})) + with self.assertRaises(ValueError): v.verify_inventory(packet) + +if __name__=='__main__': unittest.main() diff --git a/frontiers/spectral_cluster_closure_20260929/verify.py b/frontiers/spectral_cluster_closure_20260929/verify.py new file mode 100644 index 000000000..db4260655 --- /dev/null +++ b/frontiers/spectral_cluster_closure_20260929/verify.py @@ -0,0 +1,102 @@ +"""Fail-closed spectral packet replay. --local-only excludes project Git objects.""" +import argparse +import hashlib +import json +from pathlib import Path, PurePosixPath +import re +import subprocess +import sys + + +def read_json(path): + def unique(pairs): + result={} + for key,value in pairs: + if key in result: raise ValueError('duplicate JSON key: '+key) + result[key]=value + return result + return json.loads(Path(path).read_text(encoding='utf-8'),object_pairs_hook=unique) + + +def safe_path(path): + if not isinstance(path,str) or not path or '\\' in path or ':' in path or '\x00' in path: + raise ValueError('unsafe source path') + p=PurePosixPath(path) + if p.is_absolute() or '..' in p.parts or '.' in path.split('/') or str(p)!=path: + raise ValueError('unsafe source path') + return path + + +def identity(data,entry): + blob=hashlib.sha1(b'blob '+str(len(data)).encode()+b'\0'+data).hexdigest() + if (type(entry['bytes']) is not int or len(data)!=entry['bytes'] + or hashlib.sha256(data).hexdigest()!=entry['sha256'] or blob!=entry['git_blob']): + raise ValueError('identity mismatch: '+entry['path']) + + +def verify_sources(root): + entries=read_json(root/'SOURCES.json')['sources'] + ids=[e['id'] for e in entries] + if not entries or len(ids)!=len(set(ids)): + raise ValueError('missing or duplicate source inventory') + for entry in entries: + commit,path=entry['commit'],safe_path(entry['path']) + if not re.fullmatch('[0-9a-f]{40}',commit): raise ValueError('invalid source commit') + # The pinned tree, not a followed worktree symlink, is the authority. + out=subprocess.run(['git','ls-tree','--full-tree','-z',commit,'--',path],cwd=root, + check=True,capture_output=True,timeout=60).stdout + records=[x for x in out.split(b'\0') if x] + if len(records)!=1: raise ValueError('missing or ambiguous pinned path: '+path) + header,actual=records[0].split(b'\t',1) + mode,kind,blob=header.decode().split() + if actual.decode()!=path or mode!='100644' or kind!='blob': + raise ValueError('pinned source must be a regular nonexecutable blob: '+path) + if blob!=entry['git_blob']: raise ValueError('tree blob mismatch: '+path) + data=subprocess.run(['git','cat-file','blob',blob],cwd=root,check=True, + capture_output=True,timeout=60).stdout + identity(data,entry) + return len(entries) + + +def verify_inventory(root): + if (root/'MANIFEST.json').is_symlink(): raise ValueError('manifest symlink') + entries=read_json(root/'MANIFEST.json')['files'] + names=[e['path'] for e in entries] + if len(names)!=len(set(names)): raise ValueError('duplicate packet path') + if sorted(p.name for p in root.iterdir())!=sorted(names+['MANIFEST.json']): + raise ValueError('packet inventory mismatch') + for entry in entries: + name=safe_path(entry['path']); path=root/name + if PurePosixPath(name).name!=name or path.is_symlink() or not path.is_file(): + raise ValueError('flat regular packet file required') + identity(path.read_bytes(),entry) + return len(entries) + + +def main(): + parser=argparse.ArgumentParser(description=__doc__) + parser.add_argument('--local-only',action='store_true') + args=parser.parse_args(); root=Path(__file__).resolve().parent + verify_inventory(root) + source_count=0 if args.local_only else verify_sources(root) + expected=(root/'RESULTS.json').read_bytes() + mutants=['drop-spectral-r','drop-soft-vandermonde','wrong-hard-power', + 'drop-far-branch','reverse-cutoff','include-zero', + 'drop-mixed-term','swap-full-normalizer'] + for flags in (['-B','-S'],['-B','-O','-S']): + subprocess.run([sys.executable,*flags,'-m','unittest','discover','-v'],cwd=root, + check=True,timeout=120) + cmd=[sys.executable,*flags,str(root/'check.py')] + out=subprocess.run(cmd,check=True,capture_output=True,timeout=30) + if out.stdout!=expected or out.stderr: raise ValueError('deterministic replay mismatch') + for mutant in mutants+['unknown']: + out=subprocess.run(cmd+['--mutant',mutant],capture_output=True,timeout=30) + if out.returncode!=(2 if mutant=='unknown' else 1): + raise ValueError('negative control not rejected: '+mutant) + verify_inventory(root) + print(json.dumps({'passed':True,'source_pins_checked':not args.local_only, + 'source_count':source_count,'scientific_effect':'NONE', + 'mathematical_acceptance':False},sort_keys=True)) + + +if __name__=='__main__': main() diff --git a/frontiers/two_scale_cluster_geometry_20260929/MANIFEST.json b/frontiers/two_scale_cluster_geometry_20260929/MANIFEST.json new file mode 100644 index 000000000..5fd85bd38 --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/MANIFEST.json @@ -0,0 +1,85 @@ +{ + "schema": 1, + "scientific_effect": "NONE", + "review_status": "NONAUTHOR_ACCEPTED_SCOPED_CONDITIONAL_GEOMETRY", + "files": [ + { + "path": "RADIAL_TAIL.md", + "bytes": 12533, + "sha256": "250897858c8b314c0ff85ec1860a725efacfdae0ff7409fced4cadf7bfb85973", + "git_blob": "0f14417ef7038b9c6f50e4b01e393a58b7b5e3a4" + }, + { + "path": "README.md", + "bytes": 5636, + "sha256": "80e419ca23cfc4083957dcd5708fd77c82316dd65222691b54e5f30afeb11506", + "git_blob": "4036b28db7484aa85868afb9443a28f7cceedee3" + }, + { + "path": "RECONNAISSANCE.md", + "bytes": 2643, + "sha256": "b9af79b2ee56f151f947e233a684c6a91b0b306cd564dcefa722e43d3cb975e4", + "git_blob": "d6e523e5f92ae9ea710d6da54acb5bf4213a39c9" + }, + { + "path": "RESULTS.json", + "bytes": 337, + "sha256": "3277199a22d6f187354e6f912361648e737bc8aa65107d1d7863a099c176ca8d", + "git_blob": "99678cd670b9f8fee2f02d73fdb091705b825491" + }, + { + "path": "REVIEW_RECORD.json", + "bytes": 4226, + "sha256": "958d2e1ae8ea5d034d0d87efce6cde9be57ebb9d7c0b671e69d3d6598a6675ca", + "git_blob": "a4b0fb99c24e2edf41973ea2a5e5176584602855" + }, + { + "path": "REVIEW_RECORD.md", + "bytes": 6732, + "sha256": "af1540308f37220e6592b700bf42181205b1d4588a040a5c151bf0a6f861e728", + "git_blob": "31896de23fc56822c184375d0dc2b1c7e27fcae4" + }, + { + "path": "SOURCES.json", + "bytes": 2923, + "sha256": "de09c2cf3c9082a09d168f451f78a1a60b150f9f55c0c6b9bfe94ac26652dfe0", + "git_blob": "59d11113e208965fefeaadd1bd5866585e77dc82" + }, + { + "path": "TWO_SCALE_LAW.md", + "bytes": 17139, + "sha256": "e81d7fe09d25c3266eb8e62922756f54761d7f74d692fb35d9a8071fffd73769", + "git_blob": "a32fd5f7d941bbe1fe943df045b1e0fbec8d691c" + }, + { + "path": "VALIDATION.md", + "bytes": 3023, + "sha256": "7600037a03b43c6d20e50002cc0afed912cf6c5bc71e51a490959b3725cfaec0", + "git_blob": "33f00592e26a8f0a652c6554b6e3ddc389065425" + }, + { + "path": "geometry.py", + "bytes": 7252, + "sha256": "e8582266faf3b4277412c00ea68751aeab0aa4e764ef831c56e34b8dbf68a7e9", + "git_blob": "f7fd5b69953d631b8cd9e1e92b3d25f1ce824f69" + }, + { + "path": "test_custody.py", + "bytes": 13368, + "sha256": "70ff39e53dd2d763e3ddf28affddedb7468c410e95565e9d0854e393f200de31", + "git_blob": "631ebf653ea760ae6cc01afd46c23b0eb893c046" + }, + { + "path": "test_geometry.py", + "bytes": 5999, + "sha256": "ad87486bec154bf2ed9eb427c2527912579878ae7cd3462082c76bfd57acfa4d", + "git_blob": "a787f6e6bfe90385b51ce41d3709bf08af636d04" + }, + { + "path": "verify.py", + "bytes": 8457, + "sha256": "152a41410fbf4774368e40900b9b988505f263d574c632fe5fcdae999a0ca6ef", + "git_blob": "6ecc60a58f8f77ee59eaa4c276e5b4ae17beedb4" + } + ] +} diff --git a/frontiers/two_scale_cluster_geometry_20260929/RADIAL_TAIL.md b/frontiers/two_scale_cluster_geometry_20260929/RADIAL_TAIL.md new file mode 100644 index 000000000..0f14417ef --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/RADIAL_TAIL.md @@ -0,0 +1,277 @@ +# An eleven-power microscopic radius tail and its universal extreme-height law + +Object: OA-TWO-SCALE-CLUSTER-GEOMETRY-20260929-R1. +Author: OpenAI / GPT-6 Astra Pro, foreground recovery, 29 September 2026 (Central). +Disposition: AUTHOR-SIDE CONDITIONAL PROOF; NONAUTHOR REVIEW REQUIRED. +Scientific effect NONE. No scientific-status transition or numerical Gaussian +coefficient is asserted. This is an analytic calculation for the explicit +limiting MICROSCOPIC measure M of TWO_SCALE_LAW.md (M1), not for the entire +finite-r global field or its remote singleton component. + +## 1. Which radius and which sampling law? + +Use the exact source conventions and fixed d,L,b,k,frame of TWO_SCALE_LAW.md. +For each additional root (X_i,Z_i) of the unsheared planar cubic, its physical +rescaled position is + + v_i=X_i e_axis+Z_i e_soft(O), R_i=|v_i|. + +Define the finite point-intensity measure by integrating the sum over these roots +against M. Its tail mass is + + F(t)=integral sum_i 1{R_i>t} dM. (R1) + +This is point-intensity sampling: a cluster with two qualifying points contributes +two, not one. Every assertion below is a statement about the limiting microscopic +measure. In an application to the Gaussian field, r->0 is taken before t->infinity. +No finite-r uniform spatial moment or rate is inferred. + +**Theorem R.** There is an explicit finite positive C_star such that + + F(t) ~ C_star t^-11. (R2) + +For p>=0 the microscopic intensity moment integral sum_i R_i^p dM is finite +exactly when p<11. The same threshold holds for the maximum radius of a nonempty +cluster under its normalized limiting law. At the boundary, the capped intensity +moment satisfies + + integral sum_i min(R_i,t)^11 dM ~ 11 C_star log t. (R3) + +A full formula for C_star is given in (R13). No numerical evaluation of its +Gaussian integral is claimed. + +## 2. Resolve one stationary point by an exact change of variables + +Retain the canonical shear invariants of CUB: + + u=X+aZ/(12k), B=beta-a^2/(12k), + D=(c-a beta/(4k)+a^3/(72k^2))/2, x=-s>0. + +At fixed a the inverse raw-jet map is + + beta=a^2/(12k)+B, + c=a^3/(144k^2)+aB/(4k)+2D, + |d(beta,c)/d(B,D)|=2. (R4) + +The factor 2 is essential. This is a change in the JET coordinates, separate +from the determinant-one spatial shear. The remaining third-jet entries, denoted +xi, are unchanged. + +Let + + b0(u)=3-12u^2, v=xZ^2/k. + +For an extra root, the canonical conic and line give the inverse parametrization + + x=kv/Z^2, + B=k b0(u)/Z^2, + D=k(v-b0(u)u)/Z^3, Z!=0. (R5) + +Conversely, every parameter in the region defined below with Z!=0 gives a strict +window root at (X,Z)=(u-aZ/(12k),Z). The normalized DOWNWARD height is + + eta=-P/k=u+1/2+v/6. (R6) + +Typed endpoints require v>|b0(u)|/2. The open height window requires 0-6u-3 is automatic on R7: +for -1/2<=u<1/2 its right side is nonpositive; for -3/2=0. The upper height inequality and v>|b0|/2 are +compatible exactly on the displayed u interval. Boundaries are excluded. + +An explicit determinant computation gives the ORIENTED Jacobian + + det d(x,B,D)/d(v,u,Z) + =6k^3(12u^2+4uv-3)/Z^8 + =-6k^3[b0(u)-4uv]/Z^8. (R8) + +On R7 both b0(u)-4uv and 4v^2-b0(u)^2 are strictly positive. The first is also +the saddle determinant sign from CUB; it can be checked directly: for u<-1/2, +use v>|b0|/2, and for u>=0 use v<3-6u, giving a lower bound +12(u-1/2)^2, with the remaining interval -1/2<=u<0 immediate. The second follows +from v>|b0|/2. Thus the Jacobian is nonzero in the open region. + +For each fixed (x,B,D) in the typed domain there are at most two extra window +roots. The usual change of variables with multiplicity is legitimate here: +cover R7 times (R minus {0}) by countably many neighborhoods where R5 is a +diffeomorphism, make them disjoint measurably, apply the ordinary change of +variables to each, and sum the resulting nonnegative integrals. The multiplicity +is exactly the number of counted roots, rather than an omitted or extra factor +of two. Degenerate/boundary jets are algebraically null and not in the strict +window. This justifies applying R5 to a point-intensity sum. + +Define + + Q(u,v)=[4v^2-b0(u)^2][b0(u)-4uv]. (R9) + +The endpoint weight is w=9k^4[4v^2-b0(u)^2]/Z^4. Combining this with the absolute +Jacobian R8 and the raw-jet Jacobian 2 of R4 gives exactly + + w ds d beta dc =108 k^7 Q(u,v)|Z|^-12 du dv dZ, (R10) + +in the point-counted integral, with a and all other spectral/tensor variables +retained. This identity incorporates the root multiplicity through the map, +not by an additional constant. The two signs of Z will be integrated next. + +## 3. Tail scaling, domination and the complete coefficient + +Let h,O,xi be the remaining variables of M, and let tau(a,beta,c,xi) denote the +full rotated cubic tensor in those coordinates. Its raw contact Gaussian density +remains evaluated at + + h0(A0,Rot_O(tau)), A0=O diag(0,-h)O^t. + +It is NOT replaced by an isotropic density. Combining M1 and R10 gives the exact +representation of F(t) as the integral over R7 and Z!=0 of + + (108 k^7 c_m/z0) Q(u,v) H(h) |Z|^-12 + h0(A0,Rot_O tau(a, a^2/(12k)+k b0/Z^2, + a^3/(144k^2)+a b0/(4 Z^2)+2k(v-b0 u)/Z^3, xi)) + *1{ (u-aZ/(12k))^2+Z^2 > t^2 }, (R11) + +with measure du dv dZ da dxi dh dO, ordered positive h, and the empty-product +conventions for d=2. The coefficient a b0/(4Z^2) in c includes the k cancellation +in aB/(4k). Formula R11 is often where confusing the spatial and jet Jacobians, +or integrating out a before testing the actual radius, gives a wrong exponent +or coefficient. + +Put Z=t z and gamma(a)=sqrt(1+(a/(12k))^2). Then |Z|^-12 dZ=t^-11 |z|^-12 dz. +At each fixed nonzero z the raw jet tends to the cusp slice + + beta_cusp=a^2/(12k), c_cusp=a^3/(144k^2), + +and the radius indicator tends almost everywhere to 1{gamma(a)|z|>1}. +For t>=3 and |u|<=3/2, the indicator in R11 implies + + |z|>1/[2gamma(a)] + +by the triangle inequality t<|u|+gamma|Z|. Orthogonal norm equivalence and SC's +Gaussian density bound imply, uniformly in t,z,u,v,O, + + h0(A0,Rot_O tau(a,beta,c,xi)) + <= C exp[-c(|h|^2+a^2+|xi|^2)]. + +Dropping beta and c from this upper bound is legitimate; it never introduces +an inverse hard eigenvalue. Integration in z over |z|>1/(2gamma) costs at most +a constant times gamma^11. Q is bounded on the bounded region R7, H(h) is a +nonnegative polynomial, and Gaussian integration in h,a,xi dominates gamma^11. +Dominated convergence therefore applies to t^11 F(t). + +Let + + J_cusp=integral H(h) gamma(a)^11 + h0(A0,Rot_O tau(a,a^2/(12k),a^3/(144k^2),xi)) + da dxi dh dO. (R12) + +This is finite by the same majorant and positive by positivity of the Gaussian +density and H on open sets. Integrating both signs of z gives +integral_(gamma|z|>1)|z|^-12 dz=2 gamma^11/11. Finally, + + I_shape=integral_Dshape Q(u,v) du dv=246528/35, + + C_star=(216/11) k^7 (c_m/z0) I_shape J_cusp + =(53250048/385) k^7 (c_m/z0) J_cusp. (R13) + +For an exact check of I_shape, integrate v first using + + (4b0/3)v^3 -4u v^4 -b0^3 v +2u b0^2 v^2. + +The strips -3/2=2 under the source interface. The exponent 11 +is dimension-independent here because the hard directions affect only the +finite integral J_cusp; the soft jet weights are s,B of degree -2, D of degree -3, +and endpoint weight of degree -4, for total 2+2+3+4=11. This explanatory homogeneity +is not substituted for the dominated-convergence proof. + +For p>0, Tonelli gives the moment identity integral R^p=p integral_0^infinity +t^(p-1)F(t)dt. Finite total point mass handles t<=1 and R2 handles infinity. +This proves the threshold in Theorem R and the boundary formula R3. If R_max +is the maximum radius of a nonempty cluster, its unnormalized tail lies between +F(t)/2 and F(t), since there are at most two points. Its normalized law therefore +has the same exact moment threshold, although no exact maximum-tail coefficient +is claimed. QED. + +## 4. A universal law for an intensity-selected far local point + +Normalize the point-intensity measure restricted to R_i>t. For that selected +point retain its canonical shape variables (u,v), downward height eta, radial +ratio q=R_i/t, sign epsilon=sign Z, and the remaining variables (a,h,O,xi). + +**Theorem H (extreme local marks).** As t->infinity, the joint law converges +weakly to the product of: + +1. shape density Q(u,v)/I_shape on R7; +2. a Pareto radial ratio q>=1 with density 11q^-12; +3. a symmetric sign epsilon in {-1,1}; +4. the parameter measure with density H(h) gamma(a)^11 times the cusp Gaussian + in R12, divided by J_cusp. + +In particular eta=u+1/2+v/6 is independent of the limiting radial ratio and the +remaining parameter measure. Its probability density on 01. The limiting Gaussian depends only on (a,h,O,xi), while +Q depends only on (u,v). Division by R13 gives exactly the four factors above. +No claim of spatial independence in the original field is involved. + +To obtain H1, substitute v=6e-6u-3, with dv=6de. Conditions R7 become + + -1/2-sqrt(e) < u < 1/2-sqrt(1-e), 0=0 a reproducible rational formula before dividing by I_shape is + + integral e^j H_eta(e) de + =(110592/7)[1/(j+9/2)-B(j+1,9/2)+1/(j+1)] + +13824[1/(j+5)-2/(j+4)+5/(j+3)-4/(j+2)], (H4) + +with B(j+1,9/2)=j!/product_(l=0..j)(9/2+l). No special-function numeric library +is needed to check these moments. Seven such moments are checked independently +against exact double polynomial integration on R7. QED. + +## 5. Evidence boundary and useful falsifiers + +The finite companion independently checks the oriented root Jacobian, the inverse +raw-jet map and its factor 2, stationary heights and gradients at 648 rational +parameter choices, the two exact shape integrals, H4 versus direct integration, +and the k^7/radius-power ledgers. Eight explicit false variants must fail. +These controls do not prove the Gaussian bound, change-of-variables multiplicity, +weak convergence or domination; those are the written analytic obligations above. + +The result would fail if the contact slice lost full positive Gaussian density, +if the physical radius were incorrectly replaced by |Z| before retaining a, +or if the invariant density were assumed isotropic rather than kept under Haar. +A finite-r spatial-moment convergence claim, a global tail including remote +singletons, an ordinary configuration-selected version of H1, or a numerical +Gaussian value of C_star would require new work and is not supplied here. diff --git a/frontiers/two_scale_cluster_geometry_20260929/README.md b/frontiers/two_scale_cluster_geometry_20260929/README.md new file mode 100644 index 000000000..4036b28db --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/README.md @@ -0,0 +1,96 @@ +# Two-scale cluster geometry and an exact eleven-power tail + +OpenAI / GPT-6 Astra Pro. Author-side conditional mathematical packet, nonauthor +review COMPLETE at the stated conditional scope: Claude5360227991 (A), +5360178611 (B), and5360216551 (C). See REVIEW_RECORD.md. Scientific effect NONE; +no source proof or global status is changed. +No self-merge or organizational-independence claim. + +TWO_SCALE_LAW.md is a conditional consumer of the exact spectral proof in +Math-#162. It upgrades the count interface to a weak law of whole two-scale +configurations: microscopic roots are scaled by 1/r, remote singletons keep +physical torus positions. It proves localization of all leading ordered pair +mass, describes remote height marks, and shows why spatial total variation of +double clusters is impossible in d>=3 even though weak convergence holds. + +RADIAL_TAIL.md computes the tail of the resulting limiting MICROSCOPIC point +intensity. The tail is C_star t^-11 with a finite positive Gaussian coefficient; +its geometric factor is exactly 53250048/385 times k^7. The radial moment threshold +is p<11. An intensity-selected point far out in this limiting local law has an +independent Pareto(11) radial ratio and a universal downward-height density, with +mean 5771/7062. This is NOT a finite-r uniform tail or a global law including +remote singletons; the order is r->0 first, radius->infinity second. + +The exact scalar classifier of #158 is consumed only at its algebraic scope. +The #159 competitor is not a premise, and the #157 exponential-moment theorem +is not consumed. Source-condition failures block the corresponding applications. +A green check does not decide any mathematical review. + +## Replay + + python -B -S verify.py + +Run inside a full Git checkout with the immutable commits in SOURCES.json +available. This verifies all six named source objects (including ancestors' +Git modes), the flat packet inventory, 52 unit tests in each Python mode, +deterministic output, eight semantic negative controls and unknown-label refusal. +The workflow fetches the two non-base source commits explicitly. + + python -B -S verify.py --local-only + +This explicitly excludes project source-object authentication and reports +source_pins_checked=false. Local isolated-Git tests still exercise the checker; +they do not establish the actual project source identities. The new arguments +are not Lean-formalized; the repository's existing formal gate is separate. + +Exact controls include 648 rational stationary-point substitutions, the signed +three-variable Jacobian, raw-jet inverse, two shape-strip integrals, seven height +moments computed in two independent ways, localization inequalities and source +custody regressions. No Gaussian coefficient is numerically estimated. + +## Completed scoped reviews + +A. Two-scale configuration convergence, arbitrary cutoff, remote marks, counted +pair localization and the d>=3 spatial-TV obstruction. +B. Root change of variables with multiplicity, all Jacobian factors, Gaussian +majorant with the shear parameter retained, tail coefficient and moment boundary. +C. Extreme intensity-selected mark law, universal height density and exact +rational companion. All three reviews bind the unchanged mathematical files +at7c82252533c3fe14ee262f7f87c0549c10968592. One Claude session reviewed these +three disjoint scopes; this is not three independent-provider votes. Current +head/base verification and nonauthor integration remain separate requirements. + +The custody successor disables Git replacement objects and requires the declared +source identity to be a commit object, not merely a forty-hex tree-ish name. Four +real-Git red/green regressions cover forged/legitimate replacement bindings and +tree/tag substitution. Both mathematical manuscripts and all mathematical inputs +remain byte-identical to the initial reviewed head. + +## Current proof-to-review custody replay + +The earlier 52-test count describes the preceding custody repair. The current +replay runs 61 unit tests in each Python mode, including nine additional test +methods for proof and review bindings. The verifier requires both manuscripts, +the source/result declarations, both review records, the executable checker and +verifier, and both test modules. Regenerating MANIFEST.json cannot silently omit +these files or move an old review to different proof bytes. + +REVIEW_RECORD.json records the actual A/B/C native IDs, COMMENTED states, raw +review-body byte counts and SHA256 digests, exact reviewed commit, proof mapping, +conditional scopes and exposure. The verifier anchors the entire frozen record +and the accepted manuscript/source identities outside the regenerable inventory. +Intentional future mathematical changes require reviewed updates to those +anchors and the review record. Both current manuscripts, SOURCES.json, +RESULTS.json and geometry.py remain unchanged. + +This is an offline consistency check. Its successful summary explicitly reports +remote_review_authenticity_checked=false and mathematical_acceptance=false. +The native bodies were actually fetched during integration preflight; the local +CLI does not fetch them or authenticate a remote reviewer. In --local-only mode, +the source declaration's frozen bytes are still checked, while the historical +Git objects remain excluded and source_pins_checked=false. + +The same workflow now also runs for main pushes affecting this packet or its own +workflow, providing a scoped post-merge replay route. Prior PR/manual coverage +was not itself a verifier defect. Hosted success must bind the actual candidate +or merge commit; this local note supplies no CI result or mathematical vote. diff --git a/frontiers/two_scale_cluster_geometry_20260929/RECONNAISSANCE.md b/frontiers/two_scale_cluster_geometry_20260929/RECONNAISSANCE.md new file mode 100644 index 000000000..d6e523e5f --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/RECONNAISSANCE.md @@ -0,0 +1,45 @@ +# External reconnaissance — foreground recovery, 29 September 2026 Central + +Scope: primary-source context for Gaussian critical-point geometry, not an +exhaustive novelty, priority or full-text literature audit. No external theorem +is imported as an unverified substitute for the source-bound arguments. + +Consensus.search was actually called for Gaussian random field persistence, +rare critical clusters, spatial scaling, cubic saddles and marked processes. +It returned the monthly 30-search quota error (reset October 1), not papers. + +Primary arXiv abstract/metadata pages actually opened: + +1. Diego Armentano, Jean-Marc Azais and Jose Rafael Leon, On a general Kac-Rice +formula for the measure of a level set, arXiv:2304.07424v3. +https://arxiv.org/abs/2304.07424v3 +The page distinguishes v3 (5 December 2023) from later v4 (22 April 2025). The +in-project sources cite v3; this memo does not silently replace that version. +Only metadata and abstract were read here, not an independent framework audit. + +2. Dmitry Beliaev, Valentina Cammarota and Igor Wigman, No repulsion between +critical points for planar Gaussian random fields, arXiv:1911.03455v3 +(27 November 2020). https://arxiv.org/abs/1911.03455 +The abstract concerns near-diagonal two-point correlations for isotropic +stationary fields and index-sensitive behavior. It is relevant context, not the +same determinant-tilted, coalescing-pinned law or the new limiting radial tail. +No priority claim follows from that distinction. + +3. Job Feldbrugge and coauthors, Stochastic Homology of Gaussian vs. non-Gaussian +Random Fields: Graphs towards Betti Numbers and Persistence Diagrams, +arXiv:1908.01619 (2019). https://arxiv.org/abs/1908.01619 +The abstract supplies random-field topology and persistence context. This pass +does not claim to have searched every occurrence of a cubic normal form in its +full text or the wider literature. + +The new calculation gives its stationary-root change of variables, integrable +Gaussian majorant, shape integrals and marked convergence arguments in full. +The sources in SOURCES.json keep their own review conditions. The generic +measure-theoretic tools are not claimed novel, and the exact radius/height +result is an author-side candidate pending separate nonauthor review. + +For the later custody repair, the official Git documentation was searched and +read at https://git-scm.com/docs/git and the primary git-replace manual at +https://www.kernel.org/pub/software/scm/git/docs/git-replace.html. They document +replacement refs and the --no-replace-objects override. This external check +supports the engineering repair only, not any mathematical claim. diff --git a/frontiers/two_scale_cluster_geometry_20260929/RESULTS.json b/frontiers/two_scale_cluster_geometry_20260929/RESULTS.json new file mode 100644 index 000000000..99678cd67 --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/RESULTS.json @@ -0,0 +1,11 @@ +{ + "mathematical_acceptance": false, + "passed": true, + "radial_factor_at_k1": "53250048/385", + "scientific_effect": "NONE", + "scope": "exact finite identities, not Gaussian or limiting-law verification", + "shape_integral": "246528/35", + "stationary_map_cases": 648, + "tail_exponent": 11, + "universal_height_mean": "5771/7062" +} diff --git a/frontiers/two_scale_cluster_geometry_20260929/REVIEW_RECORD.json b/frontiers/two_scale_cluster_geometry_20260929/REVIEW_RECORD.json new file mode 100644 index 000000000..a4b0fb99c --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/REVIEW_RECORD.json @@ -0,0 +1,77 @@ +{ + "schema": "math166-scoped-review-binding-v1", + "scientific_effect": "NONE", + "mathematical_acceptance": false, + "remote_review_authenticity_checked": false, + "reviewed_commit": "7c82252533c3fe14ee262f7f87c0549c10968592", + "proofs": [ + { + "path": "TWO_SCALE_LAW.md", + "bytes": 17139, + "sha256": "e81d7fe09d25c3266eb8e62922756f54761d7f74d692fb35d9a8071fffd73769", + "git_blob": "a32fd5f7d941bbe1fe943df045b1e0fbec8d691c" + }, + { + "path": "RADIAL_TAIL.md", + "bytes": 12533, + "sha256": "250897858c8b314c0ff85ec1860a725efacfdae0ff7409fced4cadf7bfb85973", + "git_blob": "0f14417ef7038b9c6f50e4b01e393a58b7b5e3a4" + } + ], + "source_manifest": { + "path": "SOURCES.json", + "bytes": 2923, + "sha256": "de09c2cf3c9082a09d168f451f78a1a60b150f9f55c0c6b9bfe94ac26652dfe0", + "git_blob": "59d11113e208965fefeaadd1bd5866585e77dc82" + }, + "reviews": [ + { + "slice": "A", + "native_review_id": 5360227991, + "native_state": "COMMENTED", + "url": "https://github.com/d6g8k5htny-coder/Math-/pull/166#pullrequestreview-5360227991", + "submitted_at": "2026-09-30T00:52:00Z", + "reviewed_commit": "7c82252533c3fe14ee262f7f87c0549c10968592", + "proof_path": "TWO_SCALE_LAW.md", + "body_bytes": 7840, + "body_sha256": "c63efc292d7cf209e2770419cc159276897d0ba955c32ee1d2af88c8aa7f0ed8", + "reported_disposition": "ACCEPT at the stated conditional scope", + "scope": "Theorem T, Theorem L, ordered-pair law L3, sampling/order of limits and spatial-TV obstruction V1; conditional on exact imported source interfaces, without a rate or parent revalidation." + }, + { + "slice": "B", + "native_review_id": 5360178611, + "native_state": "COMMENTED", + "url": "https://github.com/d6g8k5htny-coder/Math-/pull/166#pullrequestreview-5360178611", + "submitted_at": "2026-09-30T00:42:15Z", + "reviewed_commit": "7c82252533c3fe14ee262f7f87c0549c10968592", + "proof_path": "RADIAL_TAIL.md", + "body_bytes": 7631, + "body_sha256": "3042d958b769b0a9ada1359b6f8d9461c090060fe5057cff795c99b6c6c2894d", + "reported_disposition": "ACCEPT at the stated conditional scope", + "scope": "RADIAL_TAIL R4-R13: the already-formed limiting microscopic point-intensity tail, full coefficient and moment boundary; conditional on SC/CUB, with r tending to zero before radius tends to infinity." + }, + { + "slice": "C", + "native_review_id": 5360216551, + "native_state": "COMMENTED", + "url": "https://github.com/d6g8k5htny-coder/Math-/pull/166#pullrequestreview-5360216551", + "submitted_at": "2026-09-30T00:49:42Z", + "reviewed_commit": "7c82252533c3fe14ee262f7f87c0549c10968592", + "proof_path": "RADIAL_TAIL.md", + "body_bytes": 4277, + "body_sha256": "9a2c89c6e0c122fc75cc96a2b6392b47ab33bc47feb072b9f2a56315c527df84", + "reported_disposition": "ACCEPT at the stated conditional scope", + "scope": "RADIAL_TAIL H1-H4: extreme marks under point-intensity sampling of the already-formed microscopic measure, not a uniformly sampled configuration or finite-r global law.", + "proof_binding_note": "The native C review refers to B's same full Git blob and an abbreviated SHA256. The integration preflight matched the complete proof bytes at the native reviewed commit; this record does not claim C printed a fresh full digest." + } + ], + "exposure": { + "reviewer_provider": "Anthropic", + "reviewer_model_attribution": "Claude", + "same_session_for_all_three": true, + "organizational_independence_credit": 0, + "notes": "Actual native review bodies were read back by the integration preflight. These are three disjoint scopes from one provider-distinct session, not three independent votes. Parent proofs remain imported; no new analytic review is supplied by this custody repair." + }, + "binding_policy": "The verifier pins this complete record and the accepted proof/source byte identities. Regenerating MANIFEST.json cannot transfer these old reviews to changed mathematics. An intentional future update requires reviewed changes to the bindings and verifier anchors. Offline replay does not contact GitHub or authenticate a remote reviewer." +} diff --git a/frontiers/two_scale_cluster_geometry_20260929/REVIEW_RECORD.md b/frontiers/two_scale_cluster_geometry_20260929/REVIEW_RECORD.md new file mode 100644 index 000000000..31896de23 --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/REVIEW_RECORD.md @@ -0,0 +1,117 @@ +# Scoped review and custody repair record + +Scientific effect NONE. This is a record of actual reviews, not a new scientific +status register or a self-issued acceptance. Same GitHub login gives no +organizational-independence credit. + +## Completed analytic Slice B + +Anthropic Claude review5360178611, submitted2026-09-30 00:42:15Z: +https://github.com/d6g8k5htny-coder/Math-/pull/166#pullrequestreview-5360178611 + +Binding: head7c82252533c3fe14ee262f7f87c0549c10968592, RADIAL_TAIL.md +blob0f14417ef7038b9c6f50e4b01e393a58b7b5e3a4, SHA256 +250897858c8b314c0ff85ec1860a725efacfdae0ff7409fced4cadf7bfb85973. + +ACCEPT scope: R4-R13, the tail F(t)~C_star*t^-11 of the already-formed limiting +microscopic point intensity, the complete coefficient, p<11 radial-moment +threshold and capped-eleventh-moment asymptotic, at fixed d,L,b,k,frame and +conditional on the exact SC/CUB interfaces. The reviewer did not author the +pinned sources; prior reviewer exposure to SC is disclosed. No source theorem +is independently revalidated by this consumer review. + +Four nonblocking clarifications are adopted without changing the proof bytes: +R8's sign is chart orientation and R10 uses its absolute value; root multiplicity +uses CUB Theorem C/C6; the density majorant is SC(10); dimension dependence stays +in c_m/z0,H,h0 and J_cusp, not the shape integral/exponent. + +At the initial B-only record, A and C remained open; the courtesy height check +was not counted as a verdict. The separate actual A/C reviews below now complete +the requested mathematical scope, without changing either manuscript. + +## Completed analytic Slice C + +Anthropic Claude review5360216551, submitted2026-09-30 00:49:42Z: +https://github.com/d6g8k5htny-coder/Math-/pull/166#pullrequestreview-5360216551 + +Binding: the same mathematical head and RADIAL_TAIL.md blob as B. ACCEPT of +Theorem H and H1-H4: the four-factor limit under point-intensity sampling, the +universal downward-height density, its exact normalization and moments. This +uses the already formed microscopic measure and then radius->infinity, not a +finite-r global distribution or uniformly sampled configuration. The parameter +and orientation factors need not be universal. Courtesy algebra checks in B +were not substituted for this full C review. + +Its two nonblocking notes are reading clarifications: the bounded test uses +q=R_i/t at finite t before passing to gamma(a)|z|, and the H4 moment index is a +nonnegative integer with the second bracket coming from the polynomial density. + +## Completed analytic Slice A + +Anthropic Claude review5360227991, submitted2026-09-30 00:52:00Z: +https://github.com/d6g8k5htny-coder/Math-/pull/166#pullrequestreview-5360227991 + +Binding: head7c82252533c3fe14ee262f7f87c0549c10968592, TWO_SCALE_LAW.md +bloba32fd5f7d941bbe1fe943df045b1e0fbec8d691c, SHA256 +e81d7fe09d25c3266eb8e62922756f54761d7f74d692fb35d9a8071fffd73769. + +ACCEPT of Theorem T, Theorem L, ordered-pair law L3, the sampling/order-of-limits +statements and spatial-TV obstruction V1, conditional on the exact SC/CUB/RM/C6/P +interfaces. The review checks entire-configuration functionals, both spatial +scales, arbitrary admissible cutoff, count-weighted tail control, uniform remote +height marks and the absolutely-continuous versus collinear-support argument. +It does not revalidate the consumed Gaussian parent proofs or supply a rate. + +Three nonblocking notes are retained as reading clarifications: near configuration +convergence holds for almost every (theta,F), with hard coordinates O(r^2)/r->0; +the configuration space is Polish with locally constant cardinality; separated +spatial exhaustion suffices for V1 since pins and coincidence diagonal are null, +and the latter contains no ordered distinct pair. + +## Combined mathematical disposition + +All A/B/C requests now have actual nonauthor ACCEPT at their stated conditional +scope. The same provider-distinct Claude session supplied all three; this is +not three independent votes or organizational independence. Both manuscripts +are unchanged throughout custody and metadata successors. No review merges the +packet, promotes a global register, removes parent conditions, evaluates a +numerical Gaussian coefficient or establishes finite-r spatial-moment rates. + +## Custody repair, separate from mathematical acceptance + +Author-side audit reproduced replacement-ref and tree/tag-substitution defects +with four failing real-Git regression assertions. Source lookup now explicitly +disables Git replacement objects and requires actual commit type. All52 tests +pass in each local Python mode; old tests and semantic mutants remain. The +changed verifier received Codex engineering comment5901897673 at repair commit +80059a97cd8eb32d1a17a0ad9cb22cb2a0d7b337: no major issues found. That comment +is not a mathematical verdict or an exhaustive security guarantee. Targeted +source run36652196578 and full downstream/formal run36652196938 both succeeded +at the repair commit. A later metadata successor still needs fresh current-head +checks; no old-head run is automatically rebound. The mathematical files, +geometry.py, source pins and RESULTS.json have not changed. + +## Current integration custody repair + +At b8b028ea0a3f45aa8d2640b339977a04154909a4, independent full-CLI fixtures showed +that changing either manuscript, or removing either manuscript, still passed +after honestly regenerating MANIFEST.json. The ordinary unresigned mutation +correctly failed. These were inventory/review-binding defects, not mathematical +counterexamples. The original reviewed manuscripts remain unchanged. + +The current repair requires the proof/review declarations and every executable +or test module used by the advertised replay. It binds both current manuscripts +and SOURCES.json to fixed accepted identities and pins the complete additive +REVIEW_RECORD.json, including actual native review body identities. A co-edit of +a manuscript, review metadata and manifest cannot rebind an old review merely by +re-signing the mutable inventory. Nine new regression methods cover these cases; +the current suite contains 61 tests per Python mode. Existing exact geometry, +eight semantic mutants and Git replacement/commit-type controls remain intact. + +The A/B/C records above retain their original conditional scope and exposure. +C's native proof identity cross-references B's full blob and gives an abbreviated +digest; actual bytes at the native reviewed commit were independently matched +in preflight. The machine-readable record makes that distinction explicit. +Offline validation authenticates local byte relationships only: it grants no +remote-review authentication, mathematical acceptance or independence credit. +Fresh engineering review, current-head CI and integration remain separate gates. diff --git a/frontiers/two_scale_cluster_geometry_20260929/SOURCES.json b/frontiers/two_scale_cluster_geometry_20260929/SOURCES.json new file mode 100644 index 000000000..59d11113e --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/SOURCES.json @@ -0,0 +1,62 @@ +{ + "schema": 1, + "repository": "d6g8k5htny-coder/Math-", + "scientific_effect": "NONE", + "condition": "Source identity is not a new review or an automatic status transition. All applications retain the pinned source hypotheses.", + "sources": [ + { + "id": "SC", + "commit": "7a44130b41b827577424a73c4feac4cde20b5568", + "path": "frontiers/spectral_cluster_closure_20260929/PROOF.md", + "bytes": 25006, + "sha256": "e971b2cbe50a8a06b47c1219191201e0d1037c9adac23e5e3b7d2051bb70c2eb", + "git_blob": "16c56821b52fd76b0be791622b9c3809eafde75a", + "use": "Sections4-8: actual spectral/root limit, domination, radius and mixed-event estimates, full count limit. Conditional input; not revalidated." + }, + { + "id": "CUB", + "commit": "bfcc67dc8957b3ed1fbb789e5a0305e98d7359c8", + "path": "frontiers/planar_cubic_cluster_20260929/PROOF.md", + "bytes": 19889, + "sha256": "117e9299a71e6139270266889eb772ed97518e402d9af029bbdb67caf9d4a0f0", + "git_blob": "bb446d08db8a944537a743ad550b88c1c2ad5758", + "use": "Theorem C and exact shear/height/type identities only. Separate Gaussian sector theorem not consumed." + }, + { + "id": "RM", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/remote_window_20260924/PROOF.md", + "bytes": 18355, + "sha256": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "git_blob": "b383bfcc88ec4ad497dff01fb6640e429ba24a84", + "use": "Sections2-5, complete height-disintegrated integrand12 and normalized kernel13; finite-r spatial Kac-Rice framework." + }, + { + "id": "C6", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/c6_palm_route_20260929/PROOF.md", + "bytes": 53364, + "sha256": "aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b", + "git_blob": "89eb8adf08fe7afc2cab9662d3a9875c05ae5cc5", + "use": "Theorem Q for polynomial count uniform integrability, not a spatial moment bound." + }, + { + "id": "P", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "bytes": 40261, + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "git_blob": "dfed3b8d318a3ab1950957f393307733a4bef3f2", + "use": "Section2 distinct-site jet rank for finite-r spatial absolute continuity; original model conventions." + }, + { + "id": "D5", + "commit": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "path": "frontiers/d5_dimension_lift_20260929/PROOF.md", + "bytes": 53727, + "sha256": "6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80", + "git_blob": "9d82c707fdb17d3072a8930f26dabedf59e456fc", + "use": "Global first moment and uniform R-dependent shell interface, as composed in SC." + } + ] +} diff --git a/frontiers/two_scale_cluster_geometry_20260929/TWO_SCALE_LAW.md b/frontiers/two_scale_cluster_geometry_20260929/TWO_SCALE_LAW.md new file mode 100644 index 000000000..a32fd5f7d --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/TWO_SCALE_LAW.md @@ -0,0 +1,331 @@ +# Two-scale marked clusters and localization of all leading pair mass + +Object: OA-TWO-SCALE-CLUSTER-GEOMETRY-20260929-v1. +Author: OpenAI / GPT-6 Astra Pro, foreground recovery, 29 September 2026 (Central). +Disposition: AUTHOR-SIDE CONDITIONAL PROOF; NONAUTHOR REVIEW REQUIRED. +Scientific effect NONE. No source proof, prior verdict, global register, Boolean, +prize or integration disposition is changed. A shared GitHub account is not +organizational independence. + +## 1. Exact interface, not a silent revalidation + +Fix d>=2, L>0, k>0, b in R, and one orthonormal axial/transverse frame. Use the +original periodized Gaussian field, pins M=(-r/2,0), S=(r/2,0), values b,b-kr^3, +zero gradients, determinant weight W_r and FULL normalizer Z_r of [SC]. Write +P_r=Q_r^W. N_r counts all additional critical points in the open height window, +excluding M,S. No observation set or normalizer is replaced. + +All source identities are in SOURCES.json. This paper is a new conditional +consumer of [SC], not a review of it. In particular: + +[SC] frontiers/spectral_cluster_closure_20260929/PROOF.md, exact commit +7a44130b41b827577424a73c4feac4cde20b5568, blob +16c56821b52fd76b0be791622b9c3809eafde75a. + +[CUB] frontiers/planar_cubic_cluster_20260929/PROOF.md, exact commit +bfcc67dc8957b3ed1fbb789e5a0305e98d7359c8, blob +bb446d08db8a944537a743ad550b88c1c2ad5758. Only its deterministic cubic classifier +is consumed; not its separate Gaussian compact-sector theorem. + +[RM] frontiers/remote_window_20260924/PROOF.md, Sections 2-5: the complete +height-disintegrated integrand in (12) is Lambda_j(x)+O_rho(r), uniformly at +fixed remote separation rho and throughout the window. + +[C6] frontiers/c6_palm_route_20260929/PROOF.md, Theorem Q, together with [SC]'s +first moment: every fixed ordinary count moment is O(r^3). + +[P] imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md, +Section 2: full distinct-site jet rank. Used only for the finite-r spatial +absolute-continuity statement in Section 6. + +RM, C6 and P are pinned at source cut 7a1cb09a9d58d179393e6d29146252f714b9c9bf. +A defect or unfulfilled condition in an imported result blocks the corresponding +application here. Publication, tests and a status string do not remove that +condition. No theorem from the competing #159 proof or the #157 Fourier packet +is imported. + +The following exact portions of SC are needed, not just its final count law: + +* (14)-(18): the integrable full-field/spectral near-occurrence majorant, + negligible exceptional branch, and pointwise convergence of the individual + roots, heights and indices in each fixed rescaled ball. +* (19)-(20): a finite spectral measure on nonempty cubic configurations, with + positive masses a1,a2 for one and two points. +* (21)-(25): beta_far=k integral Lambda is finite and positive, remote multiple + probability O_rho(r^5), mixed near/remote probability o_(R,rho)(r^3), and + middle-window mean <=C r^3(R^-2+rho^2), with the last constant independent + of R>=4 and small rho. +* (3), or its C6 tail argument: polynomially weighted count convergence and + E_r N_r^p=O_p(r^3) for every fixed positive integer p. + +Let m=d-1. In SC's coordinates theta=(s,h,O,tau), ordered hard eigenvalues are +0 0, delta_r/r -> infinity. (T1) + +For sufficiently small r the delta_r ball is embedded. For each additional +window critical point x put eta=(b-f(x))/(k r^3) in (0,1), and retain its index j. +Use the following two tags: + + micro: dist(x,0)=delta_r, with mark (x,eta,j). (T2) + +The micro position uses the unique local lift, expressed in the fixed original +frame. Remote positions remain actual torus points; they are not divided by r. +The state space Y is the disjoint topological union + + Y_micro=R^d x (0,1) x {0,...,d}, + Y_remote=(X minus {0}) x (0,1) x {0,...,d}. + +Let Conf_+(Y) be the disjoint union over n>=1 of the finite symmetric products +Y^n/S_n, with the quotient product topology. Multiplicities are allowed in this +ambient space; the particular laws below are simple almost surely. Cardinality +is a continuous, discrete-valued function. This space retains configurations, +not merely their one-point intensity. + +Let Xi_r be the tagged configuration (T2). Define the finite nonempty measure + + L_r(G)=r^-3 E_r[G(Xi_r);N_r>0]. (T3) + +For a spectral jet theta, define the micro-only configuration + + C_micro(theta)=sum_(X,Z in C(theta)) + delta_(micro, X e_axis+Z e_soft(O), -P_theta(X,Z)/k,d-1). + +Let L_micro be the pushforward of 1{n>=1}dM under this map. Let L_remote be the +singleton-configuration measure induced by + + k sum_(j=0..d) Lambda_j(x) dx d eta, + x in X minus {0}, 0 L=L_micro+L_remote weakly as finite measures (T5) + +on Conf_+(Y). The convergence also holds when testing G times any fixed +nonnegative integer power of the total count, for bounded continuous G. +The mass of L is a1+a2+beta_far=nu1+nu2. In particular, the probability law +of Xi_r conditioned on N_r>0 converges weakly to L/(nu1+nu2). + +This is weak convergence of spatially marked configurations. It is not stated +as spatial total-variation convergence; Section 6 shows that such a statement +would be false in general. Count and tag-count marginals, which have a discrete +state space, do converge in total variation. + +### Proof: fixed-radius limits, then the regional sandwich + +Fix R>=4 and a sufficiently small rho>0. For small r, Rr0} union {N_R>0,N_far>0} + union {N_far>=2} union {N_R>=3}. + +SC's exact bounds imply + + limsup_(r->0) r^-3 P_r(E_bad) <= C(R^-2+rho^2). (T6) + +Only the middle term survives this limsup. The mixed bound here is the full +o(r^3) result, not a uniform extension of the compact-jet O(r^(9/2)) estimate. + +For fixed R, SC's pointwise hard-direction slaving gives convergence of the +individual micro roots, their normalized heights and their indices for almost +every spectral jet and field coupling realization. Height and observation-circle +exceptional sets are null. Its integrable near-occurrence majorant (16), with the +exceptional branch handled by (14), therefore proves convergence of the entire +bounded continuous CONFIGURATION functional G, not only sums of one-point +functions, to the pushforward of 1{n_R>=1}dM. Here n_R counts cubic roots in the +R ball. All angular variables remain under the integral. No independent root +labelling is needed: local labellings from root stability induce convergence in +the symmetric-product topology. + +For the remote component, change height variable t to eta=(b-t)/(kr^3) in +RM (12). Its complete integrand differs uniformly from Lambda_j(x) by O_rho(r). +The rescaled first-moment measure on D_rho x (0,1) x indices thus converges in +full variation to k Lambda_j(x) dx d eta. On N_far>=2, the mean number of remote +points is at most E_r(N_far)_2=O_rho(r^5). Subtracting this multiple-point +intensity shows that the SINGLETON-configuration measure has the same limit. +This proves T4 first on D_rho. In particular the limiting eta is uniform on +(0,1), independent of the remote location and index under the normalized remote +component; this is a marked consequence of the uniform height disintegration, +not a field-independence assertion. + +On the complement of E_bad the global configuration is precisely either the +near configuration or a remote singleton, but never both. Testing a bounded G +and comparing these three finite measures gives an error bounded by a fixed +multiple of ||G||_infinity P_r(E_bad). Hence T6 bounds the scaled error. + +For almost every fixed theta, every cubic root is finite and n_R=n eventually +as R->infinity. The measure 1{n>=1}M is finite by SC (19), so dominated convergence +of bounded configuration functionals gives the full micro pushforward. Meanwhile +SC (21) bounds the missing remote mass by C rho^2. Let r->0 first at fixed R,rho, +then R->infinity and rho->0. These steps prove T5 for every bounded continuous G, +including G=1. They apply to any delta_r obeying T1 because only the inequalities +RrM] <= C_q/M, (T7) + +using the (q+1)-st ordinary moment, including q=0. The limiting count is at most +two. Let M increase after the finite truncation limit. This proves the weighted +claim. Total mass tends to the positive value nu1+nu2, so normalization is valid. +Discrete tag-count convergence follows from the coordinate probabilities and +the vanishing scaled mass outside the three possible limit sectors. QED. + +## 3. What singleton and double-cluster sampling mean + +Conditional on N_r=1, Theorem T gives a mixture of a micro singleton, with weight + + a1/(a1+beta_far), + +and a remote singleton, with weight beta_far/(a1+beta_far). The first is the +pushforward of 1{n=1}dM/a1; the second has density T4/beta_far. Conditional on +N_r=2, it gives the micro pair pushforward of 1{n=2}dM/a2, and both points have +index d-1. Positivity of a1,a2,beta_far was established by SC and remains an input. + +A law obtained by sampling a nonempty configuration is not the same as a law +obtained by selecting one point from the intensity measure. The latter weights +clusters by their sizes. RADIAL_TAIL.md uses explicitly the second convention. +Likewise a first-moment formula of the form E sum phi(point) does not, by itself, +identify the full configuration law; T5 uses bounded continuous functionals of +ALL points in each configuration. + +Plainly scaling ALL global positions by 1/r and seeking a finite Euclidean +configuration limit would lose a positive component. For fixed rho>0, the +remote singleton event has scaled probability tending to k integral_Drho Lambda, +while its rescaled distance is at least rho/r. Dividing by P_r(N>0)~(nu1+nu2)r^3 +shows that a fixed positive fraction of the conditional mass escapes every +compact spatial set. The appropriate remedy is the two-scale space T2, not +silently deleting the remote contribution. + +## 4. All leading ordered pair mass is microscopic + +Let N_in count the points in the delta_r ball, with any cutoff T1. For q>=2, +(N)_q-(N_in)_q counts ordered distinct q-tuples not wholly inside that ball. + +**Theorem L (factorial localization).** For every fixed integer q>=2, + + r^-3 E_r[(N_r)_q-(N_in)_q] -> 0. (L1) + +In particular all order-r^3 second-factorial mass is microscopic and its limiting +coefficient is 2a2. The assertion does not hold for q=1, whose omitted coefficient +is beta_far>0. + +**Proof.** On the good event used in T6, either all points belong to the near ball +and hence to the delta_r ball, or the only point is a remote singleton. For q>=2 +the difference in L1 is zero in both cases. Everywhere it is between zero and +N_r^q 1_Ebad. By Cauchy-Schwarz and C6, + + r^-3 E_r[N_r^q 1_Ebad] + <= (r^-3 E_r N_r^(2q))^(1/2) + (r^-3 P_r(E_bad))^(1/2). + +Take the small-r limsup, then R->infinity and rho->0 using T6. This proves L1. +The coefficient 2a2 follows from SC's count law and polynomial moment convergence. +The identical argument for fixed R,rho and their mixed event gives + + E_r[N_R N_far^rho]=o_(R,rho)(r^3), (L2) + +using N_R N_far<=N^2 and E N^4=O(r^3). Thus the probability localization also +controls the COUNTED mixed pair mass; an event bound alone without uniform +integrability would not have supplied that conclusion. QED. + +For a bounded continuous function of an ordered pair of micro position/height/ +index marks, the scaled ordered-pair measure converges weakly to + + integral_(n=2) [delta_(z1(theta),z2(theta)) + +delta_(z2(theta),z1(theta))] dM(theta). (L3) + +This is T5 with a count-quadratic functional and T7, followed by L1 to remove +nonmicroscopic pairs. No arbitrary root ordering enters L3. It gives a precise +conditional answer to localization of the leading pair mass, without changing +any existing scientific register or accepting a different proof of that problem. + +## 5. The order of limits remains a real restriction + +T5 concerns a two-scale weak limit as r->0. The sharp radius tail in the companion +paper concerns the tail of the already formed MICROSCOPIC limiting measure. +Neither result asserts a convergence rate or an interchange with a radius that +grows arbitrarily quickly at finite r. Count-polynomial uniform integrability +T7 is not spatial-moment uniform integrability. In particular an eleventh radial +moment conclusion for the limiting local law must not be advertised as an +asymptotic for the finite-r global eleventh moment, which also has remote points. + +## 6. A rigorous obstruction to spatial total-variation convergence in d>=3 + +In the micro double-cluster limit, both transverse displacement vectors are +multiples of the same soft eigenvector. Let E_col be the event that a two-point +configuration has both tags micro and linearly dependent transverse vectors. +The limiting probability conditional on N=2 is one. + +For any fixed r>0, the factorial spatial measure of two distinct additional +critical points under P_r is absolutely continuous away from the pins and the +coincidence diagonal. To see this, exhaust that domain by compact separated +sets; [P]'s distinct-site jet rank gives a nonsingular two-gradient covariance. +The Gaussian two-point Kac-Rice formula with the single endpoint weight W_r and +single Z_r gives a Lebesgue density there. Polynomial Gaussian moments make it +finite on each compact piece. A spatially null set therefore has zero factorial +measure. The conditional law on N=2 is dominated, as a null-set statement, by +this nonnegative factorial measure. No unproved uniform near-diagonal density +bound is needed for this absolute-continuity assertion. + +When d>=3, the transverse dimension m>=2. Linear dependence of two transverse +vectors is a Lebesgue-null algebraic condition: for example the zero set of the +sum of squares of their 2-by-2 minors, a nonzero polynomial. Hence P_r(E_col|N=2)=0 +whenever that conditioning is defined. SC implies it is defined for all small r +because P_r(N=2)~a2 r^3 and a2>0. The probability total-variation distance is thus + + dTV(Law(Xi_r|N_r=2), L_micro restricted to n=2 / a2)=1. (V1) + +Weak convergence is fully compatible with V1. Latent-jet/count total variation +from SC must not be pushed through an r-dependent spatial map as if the map were +fixed. No V1 claim is made in d=2. + +## 7. Review scope + +New obligations: the marked configuration-space sandwich (not merely intensity), +remote height disintegration, arbitrary-cutoff localization with counted tails, +and the finite-r versus limiting-support argument V1. The cubic, SC domination +and imported Gaussian estimates keep their own review obligations. Exact finite +controls verify exponent ledgers and count inequalities; they do not certify +these measure-theoretic or Gaussian steps. The radius/height calculation is +separate in RADIAL_TAIL.md and has its own nonauthor review request. diff --git a/frontiers/two_scale_cluster_geometry_20260929/VALIDATION.md b/frontiers/two_scale_cluster_geometry_20260929/VALIDATION.md new file mode 100644 index 000000000..33f00592e --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/VALIDATION.md @@ -0,0 +1,49 @@ +# Executed validation and scope + +Scientific effect NONE. Finite tests are not analytic acceptance. + +The mathematical companion was test-first: ten assertion failures were observed +against explicit missing-implementation stubs; implementation then passed those +ten tests and the expanded suite. A separate real-Git custody suite was written +against stubs: 19 tests produced 24 intended assertion failures (some tests had +multiple subcases), then all 19 passed after implementation. Logs are retained +in the conversation evidence bundle, not invented as upstream execution receipts. + +Initial standalone suite: 29 mathematical tests plus 19 custody tests = 48 tests +in each normal/optimized mode. The mathematical executable verifies 648 rational +stationary substitutions and exact root/weight/height constants. Eight semantic +mutants must each return1; an unknown mutant must return2. Normal and optimized +RESULTS.json outputs are byte-identical. + +The source checker uses git ls-tree --full-tree for repository-root paths while +running from the nested packet directory. Fixtures include changed size/SHA/blob, +missing path, malformed commit, path traversal, leaf and parent Git symlinks, +missing/duplicate/empty inventories, duplicate JSON, and packet/manifest symlinks. +All six declared sources are mandatory; no prior or auxiliary source is skipped. + +The local environment did not obtain a full network checkout of the project. +Therefore local-only replay explicitly reports source_pins_checked=false. +Actual project Git-object identities and the final packet inventory must pass +hosted replay at the published commit. Full downstream and existing Lean gates +remain separate and must be read at their current tested head/base. No local +full-repository run or Lean formalization of these new proofs is claimed. + +Mathematical limits not validated by the checker: Gaussian rank/regression, +spatial root convergence, change-of-variables multiplicity, domination, two-scale +configuration topology, singular-support TV obstruction and the continuum tail +asymptotics. These are the written proof obligations for nonauthor reviewers. + +## Replacement-object and object-type repair + +A later author-side audit reproduced four intended assertion failures in actual +local Git repositories: replacement refs could forge a commit/path binding, +replacement refs could incorrectly invalidate a legitimate original pin, and a +tree or annotated-tag object could pass as a declared forty-hex commit. These +were verifier weaknesses, not observations of altered project evidence. + +The repair uses git --no-replace-objects for every source-object lookup and +requires cat-file -t to return commit before tree traversal. Four new regressions +pass after the change. The complete suite is now 29 mathematical plus 23 custody +tests = 52 per Python mode, with all previous exact and mutant controls retained. +All mathematical and source-pin bytes remain unchanged. The final successor's +hosted replay must be checked separately from initial-head runs. diff --git a/frontiers/two_scale_cluster_geometry_20260929/geometry.py b/frontiers/two_scale_cluster_geometry_20260929/geometry.py new file mode 100644 index 000000000..f7fd5b699 --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/geometry.py @@ -0,0 +1,217 @@ +"""Exact finite controls for two-scale geometry and the limiting radial tail. + +Standard library only. No Gaussian integral is numerically approximated. +Sparse polynomials have keys (power_of_u, power_of_v) and Fraction values. +""" +import argparse +from fractions import Fraction as F +import json +import math + +MUTANTS = ('omit-jet-factor-two', 'omit-z-reflection', 'power-ten', + 'wrong-cusp', 'height-reversed', 'wrong-window', 'wrong-k-power', + 'half-root-jacobian') + + +def rational(x): + if type(x) not in (int, F): + raise ValueError('exact int or Fraction required') + return F(x) + + +def nonnegative_integer(q): + if type(q) is not int or q < 0: + raise ValueError('nonnegative integer required') + return q + + +def positive_k(k): + k = rational(k) + if k <= 0: + raise ValueError('positive k required') + return k + + +def add(p, q): + out = dict(p) + for powers, c in q.items(): + out[powers] = out.get(powers, F(0)) + c + return {powers:c for powers,c in out.items() if c} + + +def scale(p, c): + c = rational(c) + return {powers:c*a for powers,a in p.items() if c*a} + + +def mul(p, q): + out = {} + for (i,j), a in p.items(): + for (k,l), b in q.items(): + powers = (i+k,j+l) + out[powers] = out.get(powers,F(0))+a*b + return {powers:c for powers,c in out.items() if c} + + +def power(p, n): + nonnegative_integer(n) + out = {(0,0): F(1)} + for _ in range(n): + out = mul(out,p) + return out + + +def integrate_strip(poly, lower, upper, left, right): + """Exact integral: u in [left,right], polynomial lower(u)<=v<=upper(u).""" + left, right = map(rational,(left,right)) + if left > right or any(j for i,j in set(lower)|set(upper)): + raise ValueError('ordered endpoints and univariate bounds required') + out = {} + for (i,j), c in poly.items(): + v_integral = add(power(upper,j+1),scale(power(lower,j+1),-1)) + out = add(out,mul({(i,0): c/F(j+1)},v_integral)) + return sum((c*(right**(i+1)-left**(i+1))/F(i+1) + for (i,j),c in out.items()),F(0)) + + +def shape_polynomial(): + b = {(0,0):F(3),(2,0):F(-12)} + return mul(add({(0,2):F(4)},scale(mul(b,b),-1)), + add(b,{(1,1):F(-4)})) + + +def shape_integrals(height_order=0): + nonnegative_integer(height_order) + b = {(0,0):F(3),(2,0):F(-12)} + upper = {(0,0):F(3),(1,0):F(-6)} + height = {(0,0):F(1,2),(1,0):F(1),(0,1):F(1,6)} + poly = mul(shape_polynomial(),power(height,height_order)) + return (integrate_strip(poly,scale(b,F(-1,2)),upper,F(-3,2),F(-1,2)), + integrate_strip(poly,scale(b,F(1,2)),upper,F(-1,2),F(1,2))) + + +def radial_factor(k): + """Coefficient multiplying the remaining spectral/Gaussian cusp integral.""" + return F(216,11)*positive_k(k)**7*sum(shape_integrals()) + + +def tail_power(): + return 2+2+3+4 # ds,dB,dD and the typed determinant weight + + +def height_moment(q): + """Exact integral of eta^q H_eta(eta), without probability normalization.""" + nonnegative_integer(q) + beta = F(math.factorial(q),1) + for j in range(q+1): + beta /= F(9,2)+j + return (F(110592,7)*(1/(F(q)+F(9,2))-beta+F(1,q+1)) + +13824*(F(1,q+5)-F(2,q+4)+F(5,q+3)-F(4,q+2))) + + +def raw_jet(k,a,B,D): + k = positive_k(k) + a,B,D = map(rational,(a,B,D)) + return a*a/(12*k)+B, a**3/(144*k*k)+a*B/(4*k)+2*D + + +def point_map(k,u,v,z,a): + """Recover original s,a,beta,c from one canonical stationary point.""" + k = positive_k(k) + u,v,z,a = map(rational,(u,v,z,a)) + if z == 0: + raise ValueError('nonzero transverse coordinate required') + b = 3-12*u*u + s = -k*v/z**2 + B = k*b/z**2 + D = k*(v-b*u)/z**3 + beta,c = raw_jet(k,a,B,D) + return s,a,beta,c + + +def cubic_gradient(k,s,a,beta,c,X,Z): + k = positive_k(k) + s,a,beta,c,X,Z = map(rational,(s,a,beta,c,X,Z)) + return (6*k*X*X-F(3,2)*k+a*X*Z+beta*Z*Z/2, + s*Z+a*(X*X-F(1,4))/2+beta*X*Z+c*Z*Z/2) + + +def cubic_height(k,s,a,beta,c,X,Z): + k = positive_k(k) + s,a,beta,c,X,Z = map(rational,(s,a,beta,c,X,Z)) + return (2*k*X**3-F(3,2)*k*X-k/2+s*Z*Z/2 + +a*(X*X-F(1,4))*Z/2+beta*X*Z*Z/2+c*Z**3/6) + + +def root_jacobian(k,u,v,z): + k = positive_k(k) + u,v,z = map(rational,(u,v,z)) + if z == 0: + raise ValueError('nonzero transverse coordinate required') + return 6*k**3*(12*u*u+4*u*v-3)/z**8 + + +def require(ok, message): + if not ok: + raise ValueError(message) + + +def run_checks(mutant=None): + raw = raw_jet(1,6,0,0) + if mutant == 'wrong-cusp': raw = (raw[0],F(3)) + require(raw == (F(3),F(3,2)), 'cusp raw-coordinate inverse') + exponent = 10 if mutant == 'power-ten' else tail_power() + require(exponent == 11,'weighted radial homogeneity') + volume = sum(shape_integrals()) + if mutant == 'wrong-window': volume = shape_integrals()[1] + require(volume == F(246528,35),'both typed height-window strips') + factor = radial_factor(1) + if mutant in ('omit-jet-factor-two','omit-z-reflection','half-root-jacobian'): + factor /= 2 + require(factor == F(53250048,385),'raw-jet, root-Jacobian and sign factors') + value = radial_factor(2) + if mutant == 'wrong-k-power': value /= 2 + require(value == 128*factor,'k-to-the-seventh scaling') + mean = height_moment(1)/height_moment(0) + if mutant == 'height-reversed': mean = 1-mean + require(mean == F(5771,7062),'height measured downward from birth') + for q in range(7): + require(sum(shape_integrals(q)) == height_moment(q), + 'independent double-integral/height-density moment comparison') + cases = 0 + for k in (F(1,2),F(1),F(2)): + for u in (F(-5,4),F(-1),F(-3,4),F(-1,4),F(0),F(1,4)): + b = 3-12*u*u + for frac in (F(1,4),F(1,2),F(3,4)): + v = abs(b)/2+frac*(3-6*u-abs(b)/2) + for z in (F(-3),F(-1),F(1,2),F(2)): + for a in (F(-2),F(0),F(6)): + s,a,beta,c = point_map(k,u,v,z,a) + X = u-a*z/(12*k) + require(cubic_gradient(k,s,a,beta,c,X,z)==(0,0),'stationary map') + eta = u+F(1,2)+v/6 + require(0 s=-3/2,B=-9/4,D=-3/8. + self.assertEqual(g.point_map(1,-1,6,2,0), (F(-3,2),F(0),F(-9,4),F(-3,4))) + def test_cusp_curve(self): + self.assertEqual(g.raw_jet(1,6,0,0), (F(3),F(3,2))) + def test_exponent(self): + self.assertEqual(g.tail_power(),11) + + +class AdditionalTests(unittest.TestCase): + def test_sparse_algebra(self): + p={(1,0):F(1),(0,0):F(1)} + self.assertEqual(g.power(p,2),{(2,0):F(1),(1,0):F(2),(0,0):F(1)}) + self.assertEqual(g.add(p,g.scale(p,-1)),{}) + def test_exact_rectangular_integral(self): + self.assertEqual(g.integrate_strip({(2,1):F(1)},{},{(0,0):F(2)},0,3),18) + def test_constant_integral(self): + self.assertEqual(g.integrate_strip({(0,0):F(1)},{},{(0,0):F(1)},0,1),1) + def test_empty_polynomial(self): + self.assertEqual(g.integrate_strip({}, {}, {(0,0):F(1)},0,1),0) + def test_bad_order(self): + with self.assertRaises(ValueError): g.height_moment(-1) + def test_float_rejected(self): + with self.assertRaises(ValueError): g.radial_factor(1.0) + def test_bool_rejected(self): + with self.assertRaises(ValueError): g.radial_factor(True) + def test_zero_k_rejected(self): + with self.assertRaises(ValueError): g.radial_factor(0) + def test_zero_z_rejected(self): + with self.assertRaises(ValueError): g.point_map(1,0,1,0,0) + def test_invalid_strip(self): + with self.assertRaises(ValueError): g.integrate_strip({}, {}, {(0,1):F(1)},0,1) + def test_height_moments_independent(self): + for q in range(8): + self.assertEqual(sum(g.shape_integrals(q)),g.height_moment(q)) + def test_height_variance_positive(self): + mass=g.height_moment(0) + self.assertGreater(g.height_moment(2)/mass-(g.height_moment(1)/mass)**2,0) + def test_root_jacobian_independent(self): + def det(a): + return (a[0][0]*(a[1][1]*a[2][2]-a[1][2]*a[2][1]) + -a[0][1]*(a[1][0]*a[2][2]-a[1][2]*a[2][0]) + +a[0][2]*(a[1][0]*a[2][1]-a[1][1]*a[2][0])) + for k in (F(1,2),F(1),F(3)): + for u in (F(-5,4),F(-3,4),F(-1,4),F(1,4)): + b=3-12*u*u; bp=-24*u + v=(abs(b)/2+3-6*u)/2 + for z in (F(-3),F(1),F(4)): + rows=[[k/z**2,0,-2*k*v/z**3], + [0,k*bp/z**2,-2*k*b/z**3], + [k/z**3,-k*(bp*u+b)/z**3,-3*k*(v-b*u)/z**4]] + self.assertEqual(det(rows),g.root_jacobian(k,u,v,z)) + def test_raw_inverse(self): + for k in (F(1,2),F(1),F(3)): + for a in (F(-3),F(0),F(4)): + for B,D in ((F(-2),F(1,3)),(F(1),F(-1))): + beta,c=g.raw_jet(k,a,B,D) + self.assertEqual(beta-a*a/(12*k),B) + self.assertEqual((c-a*beta/(4*k)+a**3/(72*k*k))/2,D) + def test_root_homogeneity(self): + k,u,v,z,a=F(1),F(-3,4),F(3),F(2),F(3) + s,a,beta,c=g.point_map(k,u,v,z,a) + B=beta-a*a/(12*k); D=(c-a*beta/(4*k)+a**3/(72*k*k))/2 + for t in (F(2),F(5),F(10)): + st,at,betat,ct=g.point_map(k,u,v,t*z,a) + self.assertEqual(st,s/t**2) + self.assertEqual(betat-a*a/(12*k),B/t**2) + self.assertEqual((ct-a*betat/(4*k)+a**3/(72*k*k))/2,D/t**3) + def test_factorial_localization_inequality(self): + def falling(n,q): + out=1 + for j in range(q):out*=max(n-j,0) + return out + for near in range(5): + for mid in range(5): + for far in range(5): + n=near+mid+far + bad=bool(mid or (near and far) or far>=2 or near>=3) + for q in range(2,6): + loss=falling(n,q)-falling(near,q) + self.assertGreaterEqual(loss,0) + self.assertLessEqual(loss,n**q*bad) + def test_moment_uniform_integrability_bound(self): + for q in range(5): + for M in range(1,10): + for n in range(M+1,30): + self.assertLessEqual(F(n**q),F(n**(q+1),M)) + def test_counting_grid(self): + self.assertEqual(g.run_checks()['stationary_map_cases'],648) + def test_cli_modes_and_mutants(self): + import subprocess,sys + from pathlib import Path + script=str(Path(g.__file__).resolve()) + reference=None + for flags in (['-B','-S'],['-B','-O','-S']): + out=subprocess.run([sys.executable,*flags,script],capture_output=True,timeout=30) + self.assertEqual(out.returncode,0,out.stderr) + if reference is None: reference=out.stdout + self.assertEqual(out.stdout,reference) + for name in g.MUTANTS: + bad=subprocess.run([sys.executable,*flags,script,'--mutant',name],capture_output=True,timeout=30) + self.assertEqual(bad.returncode,1,(name,bad.stdout,bad.stderr)) + bad=subprocess.run([sys.executable,*flags,script,'--mutant','unknown'],capture_output=True,timeout=30) + self.assertEqual(bad.returncode,2) + +if __name__=='__main__': unittest.main() diff --git a/frontiers/two_scale_cluster_geometry_20260929/verify.py b/frontiers/two_scale_cluster_geometry_20260929/verify.py new file mode 100644 index 000000000..6ecc60a58 --- /dev/null +++ b/frontiers/two_scale_cluster_geometry_20260929/verify.py @@ -0,0 +1,181 @@ +"""Fail-closed local packet and historical Git-source verification. + +Default replay verifies all six declared project source objects. --local-only +excludes those objects explicitly; real local Git fixtures still test the code. +""" +import argparse +import hashlib +import json +from pathlib import Path, PurePosixPath +import re +import subprocess +import sys + +SOURCE_IDS = frozenset(('SC','CUB','RM','C6','P','D5')) +REQUIRED_PACKET_FILES = frozenset(('TWO_SCALE_LAW.md','RADIAL_TAIL.md','SOURCES.json', + 'RESULTS.json','REVIEW_RECORD.md','REVIEW_RECORD.json', + 'geometry.py','verify.py','test_geometry.py','test_custody.py')) +# These anchors are deliberately outside the regenerable MANIFEST.json. Updating +# mathematics requires a reviewed change to these anchors and the native-review +# record; re-signing an inventory cannot transfer an old review to new bytes. +ACCEPTED_FILES = ( + {'path':'TWO_SCALE_LAW.md','bytes':17139, + 'sha256':'e81d7fe09d25c3266eb8e62922756f54761d7f74d692fb35d9a8071fffd73769', + 'git_blob':'a32fd5f7d941bbe1fe943df045b1e0fbec8d691c'}, + {'path':'RADIAL_TAIL.md','bytes':12533, + 'sha256':'250897858c8b314c0ff85ec1860a725efacfdae0ff7409fced4cadf7bfb85973', + 'git_blob':'0f14417ef7038b9c6f50e4b01e393a58b7b5e3a4'}, + {'path':'SOURCES.json','bytes':2923, + 'sha256':'de09c2cf3c9082a09d168f451f78a1a60b150f9f55c0c6b9bfe94ac26652dfe0', + 'git_blob':'59d11113e208965fefeaadd1bd5866585e77dc82'}, +) +# Pins the entire local record, including actual A/B/C IDs, native COMMENTED +# states, review-body hashes, proof mappings, conditional scopes and exposure. +# This authenticates a frozen local record, not GitHub or the reviewer's identity. +FROZEN_REVIEW_RECORD = { + 'path':'REVIEW_RECORD.json','bytes':4226, + 'sha256':'958d2e1ae8ea5d034d0d87efce6cde9be57ebb9d7c0b671e69d3d6598a6675ca', + 'git_blob':'a4b0fb99c24e2edf41973ea2a5e5176584602855', +} +MUTANTS = ('omit-jet-factor-two','omit-z-reflection','power-ten','wrong-cusp', + 'height-reversed','wrong-window','wrong-k-power','half-root-jacobian') + + +def read_json(path): + path=Path(path) + if path.is_symlink() or not path.is_file(): + raise ValueError('regular JSON source required: '+str(path)) + def unique(pairs): + result={} + for key,value in pairs: + if key in result:raise ValueError('duplicate JSON key: '+key) + result[key]=value + return result + return json.loads(path.read_text(encoding='utf-8'),object_pairs_hook=unique) + + +def safe_path(path): + if not isinstance(path,str) or not path or '\\' in path or '\0' in path: + raise ValueError('unsafe path') + pure=PurePosixPath(path) + if pure.is_absolute() or str(pure)!=path or any(p in ('.','..') for p in path.split('/')): + raise ValueError('unsafe path: '+path) + return pure + + +def identity(data,entry): + expected_bytes=entry['bytes'] + if type(expected_bytes) is not int or expected_bytes<0: + raise ValueError('invalid source size') + sha=hashlib.sha256(data).hexdigest() + blob=hashlib.sha1(b'blob '+str(len(data)).encode()+b'\0'+data).hexdigest() + if len(data)!=expected_bytes or sha!=entry['sha256'] or blob!=entry['git_blob']: + raise ValueError('identity mismatch: '+entry['path']) + + +def git(root,*args): + return subprocess.run(['git','--no-replace-objects',*args],cwd=root,check=True,capture_output=True, + timeout=60).stdout + + +def tree_entry(root,commit,path): + # --full-tree is essential: callers run from a NESTED packet directory. + data=git(root,'ls-tree','-z','--full-tree',commit,'--',path) + records=[r for r in data.split(b'\0') if r] + if len(records)!=1:raise ValueError('missing or ambiguous source: '+path) + header,found=records[0].split(b'\t',1) + mode,kind,blob=header.decode('ascii').split() + if found.decode('utf-8')!=path:raise ValueError('source path substitution') + return mode,kind,blob + + +def verify_source_entry(root,entry): + commit=entry['commit'];path=entry['path'];pure=safe_path(path) + if not isinstance(commit,str) or not re.fullmatch('[0-9a-f]{40}',commit): + raise ValueError('immutable forty-hex commit required') + if git(root,'cat-file','-t',commit).strip()!=b'commit': + raise ValueError('source identity must name a commit object') + for length in range(1,len(pure.parts)): + prefix='/'.join(pure.parts[:length]) + mode,kind,blob=tree_entry(root,commit,prefix) + if mode!='040000' or kind!='tree':raise ValueError('non-tree source ancestor') + mode,kind,blob=tree_entry(root,commit,path) + if mode not in ('100644','100755') or kind!='blob': + raise ValueError('regular Git blob required: '+path) + if blob!=entry['git_blob']:raise ValueError('Git tree/blob identity mismatch: '+path) + identity(git(root,'cat-file','blob',blob),entry) + + +def verify_sources(root): + entries=read_json(root/'SOURCES.json')['sources'] + if not isinstance(entries,list) or len(entries)!=len(SOURCE_IDS): + raise ValueError('six source entries required') + ids=[e['id'] for e in entries] + if len(set(ids))!=len(ids) or set(ids)!=SOURCE_IDS: + raise ValueError('missing, duplicate or unexpected source identity') + for entry in entries:verify_source_entry(root,entry) + return len(entries) + + +def verify_review_bindings(root): + record=read_json(root/'REVIEW_RECORD.json') + identity((root/'REVIEW_RECORD.json').read_bytes(),FROZEN_REVIEW_RECORD) + if (record['proofs']!=list(ACCEPTED_FILES[:2]) or + record['source_manifest']!=ACCEPTED_FILES[2]): + raise ValueError('review proof/source mapping mismatch') + for entry in ACCEPTED_FILES: + path=root/entry['path'] + if path.is_symlink() or not path.is_file(): + raise ValueError('regular reviewed source required: '+entry['path']) + identity(path.read_bytes(),entry) + return len(record['reviews']) + + +def verify_inventory(root): + entries=read_json(root/'MANIFEST.json')['files'] + if not isinstance(entries,list) or not entries:raise ValueError('empty packet inventory') + names=[e['path'] for e in entries] + if len(set(names))!=len(names) or 'MANIFEST.json' in names: + raise ValueError('duplicate or self-referential packet inventory') + if not REQUIRED_PACKET_FILES.issubset(names): + raise ValueError('missing required proof or review packet leaf') + if sorted(p.name for p in root.iterdir())!=sorted(names+['MANIFEST.json']): + raise ValueError('packet inventory mismatch') + for entry in entries: + pure=safe_path(entry['path']) + path=root/entry['path'] + if len(pure.parts)!=1 or path.is_symlink() or not path.is_file(): + raise ValueError('flat regular packet leaf required') + identity(path.read_bytes(),entry) + verify_review_bindings(root) + return len(entries) + + +def main(): + parser=argparse.ArgumentParser(description=__doc__) + parser.add_argument('--local-only',action='store_true') + args=parser.parse_args() + root=Path(__file__).resolve().parent + count=verify_inventory(root) + source_count=0 if args.local_only else verify_sources(root) + expected=(root/'RESULTS.json').read_bytes() + for flags in (['-B','-S'],['-B','-O','-S']): + subprocess.run([sys.executable,*flags,'-m','unittest','discover','-v'],cwd=root, + check=True,timeout=120) + command=[sys.executable,*flags,str(root/'geometry.py')] + result=subprocess.run(command,check=True,capture_output=True,timeout=60) + if result.stdout!=expected or result.stderr: + raise ValueError('deterministic checker output mismatch') + for mutant in MUTANTS+('unknown',): + result=subprocess.run(command+['--mutant',mutant],capture_output=True,timeout=60) + if result.returncode!=(2 if mutant=='unknown' else 1): + raise ValueError('negative control not rejected: '+mutant) + verify_inventory(root) + print(json.dumps({'passed':True,'packet_leaves':count,'source_count':source_count, + 'source_pins_checked':not args.local_only,'scientific_effect':'NONE', + 'review_bindings_checked':True,'review_count':3, + 'remote_review_authenticity_checked':False, + 'mathematical_acceptance':False},sort_keys=True)) + + +if __name__=='__main__':main() diff --git a/reviews/c6_witness_collision_reconciliation_20260929/PROPOSED_TRANSITIONS.json b/reviews/c6_witness_collision_reconciliation_20260929/PROPOSED_TRANSITIONS.json new file mode 100644 index 000000000..8d70ee749 --- /dev/null +++ b/reviews/c6_witness_collision_reconciliation_20260929/PROPOSED_TRANSITIONS.json @@ -0,0 +1,948 @@ +{ + "schema": 1, + "object": "C6-WITNESS-COLLISION-RECONCILIATION-20260929-v1", + "scientific_effect": "NONE", + "disposition": "PROPOSAL_FOR_A_NON_CLAUDE_LANE", + "base_commit": "8e61fc4c055b56e526b5b3488104945e8e0e29cc", + "reverified_at": "ec6db8c (Math- main after Math-#151 merged 2026-09-30T00:56:58Z; no inventoried path changed; PROOF_INDEX.md, GRAPH.json and reviews/candidates_pending_20260928/CANDIDATES.md changed as quoted in RECONCILIATION.md section 1a; SELECTOR_REGION.json unchanged)", + "revision": { + "version": "v1.7", + "applies": [ + "v1.1: OpenAI review 5359701805 items 1-3; OpenAI pickup 5900929519 residual wording", + "v1.2: merge of Math- main 5c484bf; candidate status after Math-#161 merged", + "v1.3: Codex review 5359693191 threads 4139312857 (catalog bound), 4139312869 (live LP node reused), 4139312863 (all six selector cells resolved, SELECTOR check), 4139312874 (residual defined at scale r)", + "v1.4: merge of Math- main aa28838 (Math-#158 merged); xAI 5901345590 recorded (ACCEPT as inventory, HOLD on execution); explicit execution_order", + "v1.5: merge of Math- main bb429d3; Math-#166 (TWO_SCALE_LAW.md a32fd5f7, math head 7c82252) recorded as the third residual candidate, matching the residual's definition, conditional on #162, A under review", + "v1.6: xAI bounded discharge read 5901915195 recorded (agrees sections 1 and 4; HOLD execution until Math-#151 on main; residual node first; not the PALM sections 4-6 second-provider read)", + "v1.7: re-verified at ec6db8c (Math-#151 merged); register surfaces re-quoted (section 1a); OBLIGATION check rebound to the current PROOF_INDEX/catalog text and the open node's reading rule; live D5 nodes bound to the D5 proposal's fingerprints; keep-open alternative recorded" + ], + "unchanged": "22-file inventory, status-row statement, historical predicates; one proposed node removed in favour of the live node" + }, + "review_record": [ + { + "lane": "OpenAI", + "id": 5900929519, + "kind": "pickup", + "at": "6a0e3b9" + }, + { + "lane": "OpenAI", + "id": 5359701805, + "kind": "review", + "verdict": "ACCEPT sections 1 and 4 (obligation reading and count-bound discharge); executable fold deferred to a separate engineering review after Math-#151", + "at": "6a0e3b9" + }, + { + "lane": "xAI", + "id": 5901345590, + "kind": "bounded read", + "at": "3e00f21", + "verdict": "ACCEPT as inventory (count-estimate obligation discharged at existential fixed-d compact-mark window scope); HOLD on graph execution until Math-#151 lands, residual node created first, xAI read of PALM sections 4-6 as a separate slice" + }, + { + "lane": "xAI", + "id": 5901915195, + "kind": "bounded discharge read", + "at": "c641df1", + "verdict": "count obligation discharged by Theorem Q + (A4) at existential fixed-d compact-mark window scope; monotonicity upper bound only; HOLD execution until Math-#151 lands; residual node before the old node moves; not the second-provider read of PALM sections 4-6" + } + ], + "presupposes": [ + "reviews/d5_reconciliation_20260929/PROPOSED_TRANSITIONS.json executed by Math-#151, on main at ec6db8c: math.d5-pin-neighborhood-first-moment (PROVED_REVIEWED, aggregate) and its 13 component nodes are live; bound by TRANSITIONS" + ], + "status_rows": [ + { + "id": "C6", + "current": "STATUS C6 row cites the planar Fourier bound E N(N-1) <= C r^3 log(1/r) only; catalog C6 open; PROOF_INDEX line 45 NO COMPLETE PROOF YET", + "proposed": "ACCEPT_SCOPED_FACTORIAL_MOMENT", + "scope": "E_{Q_r^W}[(N)_q] <= C_q r^3 for every fixed integer q >= 2 and c r^3 <= E_{Q_r^W} N(N-1) <= C r^3; every fixed d >= 2; fixed torus; compact marks with k_- > 0; all frames and indices; window I_r; original W_r and full Z_r; existential constants. At d = 2 conditional on PALM's own steps only; for d >= 3 additionally on DL at its OpenAI acceptance. Regional monotonicity gives upper bounds only; the lower bound is global (EDL (A4) event).", + "graph_node": "math.c6-witness-collision-factorial-moment", + "required": [ + "frontiers/c6_palm_route_20260929/PROOF.md", + "frontiers/c6_palm_route_20260929/README.md", + "frontiers/c6_palm_route_20260929/SOURCE_MAP.json", + "frontiers/c6_palm_route_20260929/palm_exact_check.py", + "frontiers/c6_palm_route_20260929/RESULTS.json", + "frontiers/c6_factorial_moment_20260929/PROOF.md", + "frontiers/d5_dimension_lift_20260929/PROOF.md", + "frontiers/d5_dimension_lift_20260929/CONTINUUM_CROSSWALK.md", + "frontiers/elder_dimension_lift_20260928/PROOF.md", + "reviews/elder_dimension_lift_claude_20260928/REVIEW.md", + "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "reviews/d5_reconciliation_20260929/PROPOSED_TRANSITIONS.json" + ], + "supporting": [ + "frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "reviews/c6_fourier_completion_20260929/READING_NOTE.md", + "frontiers/c6_count_cap_boundary_20260929/PROOF.md", + "frontiers/c6_sharpened_20260929/PROOF.md", + "frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "frontiers/remote_collision_20260928/PROOF.md", + "reviews/d5_remote_collision_grok_20260928/REVIEW.md", + "reviews/d5_offpin_second_moment_20260928/REVIEW.md", + "frontiers/remote_window_20260924/PROOF.md" + ] + } + ], + "graph": [ + { + "node": "math.rn-region.witness-collision", + "current": "OPEN_ACTIVE", + "proposed": "PROVED_REVIEWED", + "scope": "RECONCILIATION.md section 4: torus-wide factorial moments of the window count at every mutual separation and every distance from the pins; every fixed d >= 2; existential constants; the regional monotonicity of section 4 yields upper bounds only, for every Borel selector on ordered q-tuples (OpenAI 5359701805); the lower bound c r^3 is global, on the EDL (A4) event", + "required": [ + "frontiers/c6_palm_route_20260929/PROOF.md", + "frontiers/c6_palm_route_20260929/README.md", + "frontiers/c6_palm_route_20260929/SOURCE_MAP.json", + "frontiers/c6_palm_route_20260929/palm_exact_check.py", + "frontiers/c6_palm_route_20260929/RESULTS.json", + "frontiers/c6_factorial_moment_20260929/PROOF.md", + "frontiers/d5_dimension_lift_20260929/PROOF.md", + "frontiers/d5_dimension_lift_20260929/CONTINUUM_CROSSWALK.md", + "frontiers/elder_dimension_lift_20260928/PROOF.md", + "reviews/elder_dimension_lift_claude_20260928/REVIEW.md", + "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "reviews/d5_reconciliation_20260929/PROPOSED_TRANSITIONS.json" + ], + "required_nodes": [ + "math.c6-witness-collision-factorial-moment", + "math.d5-pin-neighborhood-first-moment", + "math.uniform-matrix-cap-lifetime" + ], + "supporting": [ + "frontiers/remote_collision_20260928/PROOF.md", + "reviews/d5_remote_collision_grok_20260928/REVIEW.md", + "reviews/d5_offpin_second_moment_20260928/REVIEW.md", + "frontiers/remote_window_20260924/PROOF.md" + ] + }, + { + "node": "math.rn-region.witness-collision.leading-mass-localization", + "current": "ABSENT", + "proposed": "OPEN_ACTIVE", + "scope": "RECONCILIATION.md section 5: leading-mass localization at scale r, i.e. lim_{R->oo} limsup_{r->0} r^-3 E #{ordered pairs of distinct window points not both within R r of the midpoint} = 0. Known: pairs within C_d r carry >= c r^3 (EDL (A4)), so local-local pairs between C_d r and R r are localized mass, not residual; both-remote pairs carry O(r^5) (P_eta); pairs with a witness in the shells R r <= |X - o| <= s_0 carry <= C r^3 (R^-2 + s_0^2) (PALM section 6 R3, marked shell bound, q = 2). Open piece: the mixed count M(R, s_0) of pairs with one witness within R r of the midpoint and the other at distance >= s_0, where PALM R4 gives C r^3 only; the residual is equivalent to lim_{s_0->0} lim_{R->oo} limsup_r r^-3 M(R, s_0) = 0, not supplied by the landed reviewed chain. Author-side candidates: Math-#161 (OpenAI, e7f8929, merged 5c484bf; planar; Anthropic analytic ACCEPT 5359733142 by the PALM/DL author session, source-exposed; Codex engineering ACCEPT 5359797442; sections 6-7 conditional on Math-#158, whose slices A/B/C/D carry verdicts and which merged at aa28838) and Math-#159 (Claude, 7188bfa, every fixed d, under OpenAI reassessment) and Math-#166 (OpenAI, TWO_SCALE_LAW.md a32fd5f7, math head 7c82252; states r^-3 E[(N)_q - (N_in)_q] -> 0 for q >= 2, conditional on #162; B/C accepted by session 01NMeKE, A under review); not premises, not inventoried, not consumed. Stays OPEN_ACTIVE for every fixed d; a planar sub-status is for an executing lane. Required by no theorem.", + "required": [], + "supporting": [ + "frontiers/elder_dimension_lift_20260928/PROOF.md", + "frontiers/remote_collision_20260928/PROOF.md" + ] + }, + { + "node": "regional.shrinking-regions.analytic-route", + "current": "ABSENT", + "proposed": "SUPERSEDED_NONBLOCKING", + "scope": "RECONCILIATION.md section 6: for the reviewed scopes of math.rn-region.pin-collision, math.rn-region.intermediate-r-to-rho and math.rn-region.witness-collision, the analytic route (planar D5 reconciliation, DL, PALM) bypasses hist.CH-LIFT, hist.Piece-2-annulus and hist.OBL-H5-JETMOD. The historical predicates keep their classifications in their original replay scopes. Scope retained: original W_r, full Z_r, compact marks with k_- > 0, fixed d and torus, window I_r where the source is window-only; no all-height bound, no numerical certificate.", + "required": [], + "supporting": [] + } + ], + "historical_predicates_unchanged": [ + "hist.CH-LIFT", + "hist.Piece-2-annulus", + "hist.OBL-H5-JETMOD", + "hist.ENV-RESCOV", + "hist.ALLCELL-FDZ-Q4" + ], + "selector_region_proposal": { + "regions": [ + "pin-collision", + "intermediate-r-to-rho", + "witness-collision" + ], + "cells": { + "CH-LIFT": "BYPASSED_BY_ANALYTIC_ROUTE", + "Piece-2-annulus": "BYPASSED_BY_ANALYTIC_ROUTE", + "OBL-H5-JETMOD": "BYPASSED_BY_ANALYTIC_ROUTE", + "H5-REMOTE-THRESHOLD": "BYPASSED_BY_ANALYTIC_ROUTE", + "ALLCELL-FDZ-Q4": "NOT_REQUIRED", + "ENV-RESCOV": "REDERIVED_QUALITATIVELY" + }, + "under_node": "regional.shrinking-regions.analytic-route", + "resulting_covered_region_ids": [ + "math.rn-region.fixed-remote", + "math.rn-region.pin-collision", + "math.rn-region.intermediate-r-to-rho", + "math.rn-region.witness-collision" + ], + "resulting_open_region_ids": [ + "math.rn-region.mesoscopic-scaled-annulus" + ], + "precedent": "fixed-remote row: ALLCELL-FDZ-Q4 NOT_REQUIRED, ENV-RESCOV REDERIVED_QUALITATIVELY; the analytic route uses the positive Fourier spectrum and the joint floors (PALM Lemma 6.1 / Lemma E_d), not the historical carriers. hist.ENV-RESCOV and hist.ALLCELL-FDZ-Q4 keep their classifications.", + "alternative": "node-only supersession as regional.fixed-annulus.high-jet-route (cells untouched, lists unchanged); the executing lane decides." + }, + "proposed_graph_nodes": [ + { + "id": "math.c6-witness-collision-factorial-moment", + "layer": "D5", + "kind": "candidate", + "classification": "PROVED_REVIEWED", + "controlling": false, + "scope": "RECONCILIATION.md section 4; every fixed d >= 2; fixed torus; compact marks with k_- > 0; window I_r; existential constants", + "source": "reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md" + }, + { + "id": "math.c6-component.palm-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "proof", + "author_provider": "Anthropic", + "fingerprint": "aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b", + "source": "frontiers/c6_palm_route_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#145 5356233690", + "provider": "OpenAI", + "verdict": "section 4 sound", + "depth": "full", + "source_exposed": true + }, + { + "review": "Math-#145 5358116559", + "provider": "OpenAI", + "verdict": "ACCEPT sections 5-7, Theorem Q, Corollaries Theta and P", + "depth": "full", + "source_exposed": true + } + ] + }, + { + "id": "math.c6-component.palm-review-record", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "review_record", + "author_provider": "Anthropic", + "fingerprint": "56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1", + "source": "frontiers/c6_palm_route_20260929/README.md" + }, + { + "id": "math.c6-component.palm-source-map", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "source_map", + "author_provider": "Anthropic", + "fingerprint": "c7cc195f00cc0c45577b7a27eb5e76f5cd9f1dbd1f11d855bcc9be427d699278", + "source": "frontiers/c6_palm_route_20260929/SOURCE_MAP.json" + }, + { + "id": "math.c6-component.palm-check", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "finite_companion", + "author_provider": "Anthropic", + "fingerprint": "3bd19ec659b2ebceaf2fadeff29c1913ab28998d5182503a6de012c018bb550b", + "source": "frontiers/c6_palm_route_20260929/palm_exact_check.py" + }, + { + "id": "math.c6-component.palm-results", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "finite_companion_result", + "author_provider": "Anthropic", + "fingerprint": "7812de453ff1efd77ffc2431874243713615ce4fcc0e55f2beae991e24f6f6bc", + "source": "frontiers/c6_palm_route_20260929/RESULTS.json" + }, + { + "id": "math.c6-component.c6l-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "proof", + "author_provider": "Anthropic", + "fingerprint": "b19927563e2e9ff8f38648b61cd3f2c09ee1a081494b98cc285283554746e6d3", + "source": "frontiers/c6_factorial_moment_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#140 5355120953", + "provider": "OpenAI", + "verdict": "ACCEPT sections 4-6", + "depth": "full" + }, + { + "review": "Math-#140 5355457002", + "provider": "OpenAI", + "verdict": "ACCEPT Lemma R and sections 2/7/8", + "depth": "full" + }, + { + "review": "Math-#140 5355682335", + "provider": "OpenAI", + "verdict": "rebind to v1.3", + "depth": "full" + }, + { + "review": "Math-#140 5894209739", + "provider": "xAI", + "verdict": "bounded read, no contradiction", + "depth": "partial" + } + ] + }, + { + "id": "math.c6-component.dimension-lift-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "proof", + "author_provider": "Anthropic", + "fingerprint": "6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80", + "source": "frontiers/d5_dimension_lift_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#141 5357858391", + "provider": "OpenAI", + "verdict": "ACCEPT P_d, C_d", + "depth": "full", + "source_exposed": true + }, + { + "review": "Math-#141 5357882570", + "provider": "OpenAI", + "verdict": "ACCEPT I_d, G_d composition", + "depth": "full", + "source_exposed": true + }, + { + "review": "Math-#141 5894274124", + "provider": "xAI", + "verdict": "identities ACCEPT (Slice A)", + "depth": "algebraic" + }, + { + "review": "Math-#141 5894406926", + "provider": "xAI", + "verdict": "identities and rank claims ACCEPT (Slice B)", + "depth": "algebraic" + } + ] + }, + { + "id": "math.c6-component.dimension-lift-crosswalk", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "review_record", + "author_provider": "Anthropic", + "fingerprint": "bdb83c28ef77041ae8d5903b1e46ec96b8046660a07be439bcd60cac02f8c7dc", + "source": "frontiers/d5_dimension_lift_20260929/CONTINUUM_CROSSWALK.md" + }, + { + "id": "math.c6-component.elder-lift-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "proof", + "author_provider": "OpenAI", + "fingerprint": "b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669", + "source": "frontiers/elder_dimension_lift_20260928/PROOF.md", + "review_basis": [ + { + "review": "reviews/elder_dimension_lift_claude_20260928", + "provider": "Anthropic", + "verdict": "(A4) ACCEPT", + "depth": "full" + } + ] + }, + { + "id": "math.c6-component.elder-lift-review", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "review_record", + "author_provider": "Anthropic", + "fingerprint": "032bb4c79e4a985e5b53f5abb6bb06da4d643ec7345e4df9591e2046fb287e12", + "source": "reviews/elder_dimension_lift_claude_20260928/REVIEW.md" + }, + { + "id": "math.c6-component.planar-reading-rule", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "reading_rule", + "author_provider": "Anthropic", + "fingerprint": "14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432", + "source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md" + }, + { + "id": "math.c6-component.planar-reading-rule-transitions", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "reading_rule", + "author_provider": "Anthropic", + "fingerprint": "02f91870b636635244a767ba92f2490dd480b1720d456889216a56e07705a68b", + "source": "reviews/d5_reconciliation_20260929/PROPOSED_TRANSITIONS.json" + }, + { + "id": "math.c6-component.fourier-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "supporting_proof", + "author_provider": "OpenAI", + "fingerprint": "c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733", + "source": "frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#148 5356335148", + "provider": "Anthropic", + "verdict": "ACCEPT Theorem F, W as composition, (F4) planar", + "depth": "full" + } + ] + }, + { + "id": "math.c6-component.fourier-reading-note", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "review_record", + "author_provider": "OpenAI", + "fingerprint": "62f84b68b3bcd034f1427eacf3919c7fb418d311af64f0ab2807d17682cc00b3", + "source": "reviews/c6_fourier_completion_20260929/READING_NOTE.md" + }, + { + "id": "math.c6-component.count-cap-boundary-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "supporting_proof", + "author_provider": "OpenAI", + "fingerprint": "264a5e762f598145e9230aa0947acb2e0354efdb2e3adf65d331e7ee0ba52011", + "source": "frontiers/c6_count_cap_boundary_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#146 5355817385", + "provider": "Anthropic", + "verdict": "ACCEPT Theorems A, B, Proposition C (abstract)", + "depth": "full" + } + ] + }, + { + "id": "math.c6-component.sharpened-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "supporting_proof", + "author_provider": "Anthropic", + "fingerprint": "9f45274ab59d4f4417d1a51e9c97f5916240fdb0a4640ca6f0d3e9e0aea37dd7", + "source": "frontiers/c6_sharpened_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#142 5355652934", + "provider": "OpenAI", + "verdict": "ACCEPT (source-exposed)", + "depth": "full", + "source_exposed": true + } + ] + }, + { + "id": "math.c6-component.rare-cluster-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "downstream_consequence", + "author_provider": "OpenAI", + "fingerprint": "c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb", + "source": "frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "review_basis": [ + { + "review": "Math-#153 5358565704", + "provider": "Anthropic", + "verdict": "ACCEPT sections 1, 2, 5-7", + "depth": "full" + }, + { + "review": "Math-#153 5358623521", + "provider": "xAI", + "verdict": "ACCEPT sections 3-4 and addendum", + "depth": "full" + } + ] + }, + { + "id": "math.c6-component.remote-collision-proof", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "supporting_proof", + "author_provider": "Anthropic", + "fingerprint": "b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2", + "source": "frontiers/remote_collision_20260928/PROOF.md", + "review_basis": [ + { + "review": "reviews/d5_remote_collision_grok_20260928", + "provider": "xAI", + "verdict": "P_eta ACCEPT", + "depth": "full" + } + ] + }, + { + "id": "math.c6-component.remote-collision-review-grok", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.c6-witness-collision-factorial-moment", + "component_role": "review_record", + "author_provider": "xAI", + "fingerprint": "f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e", + "source": "reviews/d5_remote_collision_grok_20260928/REVIEW.md" + }, + { + "id": "math.rn-region.witness-collision.leading-mass-localization", + "layer": "D5", + "kind": "region", + "classification": "OPEN_ACTIVE", + "controlling": false, + "fingerprint": "leading-order r^3 mass of E N(N-1): scale-r localization; open piece = mixed local/remote pairs M(R, s_0)", + "notes": "Residual after the count-level discharge of math.rn-region.witness-collision. Definition: lim_{R->oo} limsup_{r->0} r^-3 E #{ordered pairs not both within R r of the midpoint} = 0. Known: pairs within C_d r carry >= c r^3 (EDL (A4)); both-remote pairs O(r^5) (P_eta); pairs with a shell witness <= C r^3 (R^-2 + s_0^2) (PALM section 6 R3, q = 2). Open: the mixed local/remote count M(R, s_0), o(r^3) in the iterated limit, not supplied by the landed reviewed chain; Math-#161 (e7f8929, merged 5c484bf, planar, Anthropic 5359733142 source-exposed + Codex engineering 5359797442, conditional on Math-#158) Math-#159 (7188bfa, under reassessment) and Math-#166 (a32fd5f7, states the residual exactly, conditional on #162, A under review); not premises, not consumed. Required by no theorem; recorded so that the register keeps a precise statement. Required by no theorem; recorded so that the register keeps a precise statement." + }, + { + "id": "regional.shrinking-regions.analytic-route", + "layer": "D0", + "kind": "regional_supersession", + "classification": "SUPERSEDED_NONBLOCKING", + "controlling": false, + "fingerprint": "regional-bypass-shrinking-regions-v1", + "scope": "pin-collision, intermediate-r-to-rho and witness-collision at their reviewed scopes (planar D5 reconciliation; DL in every fixed d; PALM Theorem Q); compact positive gaps; window I_r where the source is window-only; original W_r and full Z_r; fixed d and fixed torus; no all-height collision bound; no numerical certificate (RN annulus partition, 24-jet / OBL-H5-JETMOD)", + "notes": "For these scopes only, the reviewed analytic route bypasses CH-LIFT / Piece-2 / OBL-H5-JETMOD. Historical predicates remain OPEN/ABSENT in their original replay scopes." + } + ], + "proposed_graph_edges": [ + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-witness-collision-factorial-moment", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.d5-pin-neighborhood-first-moment", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.palm-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.palm-review-record", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.palm-source-map", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.palm-check", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.palm-results", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.c6l-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.dimension-lift-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.dimension-lift-crosswalk", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.elder-lift-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.elder-lift-review", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.uniform-matrix-cap-lifetime", + "required": true, + "relation": "requires_evidence_via_live_reconciled_node" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.planar-reading-rule", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.planar-reading-rule-transitions", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.remote-collision-proof", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.c6-component.remote-collision-review-grok", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.d5-component.offpin-second-moment-review", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.rn-region.witness-collision", + "to": "math.rn-fixed-remote-window", + "required": false, + "relation": "supporting_evidence_via_live_node" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.palm-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.palm-review-record", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.palm-source-map", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.palm-check", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.palm-results", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.c6l-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.dimension-lift-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.dimension-lift-crosswalk", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.elder-lift-proof", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.elder-lift-review", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.uniform-matrix-cap-lifetime", + "required": true, + "relation": "requires_evidence_via_live_reconciled_node" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.planar-reading-rule", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.planar-reading-rule-transitions", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.d5-pin-neighborhood-first-moment", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.fourier-proof", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.fourier-reading-note", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.count-cap-boundary-proof", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.sharpened-proof", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.rare-cluster-proof", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.remote-collision-proof", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.c6-component.remote-collision-review-grok", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.d5-component.offpin-second-moment-review", + "required": false, + "relation": "supporting_evidence" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "math.rn-fixed-remote-window", + "required": false, + "relation": "supporting_evidence_via_live_node" + }, + { + "from": "math.rn-region.witness-collision.leading-mass-localization", + "to": "math.c6-component.elder-lift-proof", + "required": false, + "relation": "lower_bound_localized" + }, + { + "from": "math.rn-region.witness-collision.leading-mass-localization", + "to": "math.c6-component.remote-collision-proof", + "required": false, + "relation": "partial_cover_only" + }, + { + "from": "math.c6-witness-collision-factorial-moment", + "to": "regional.shrinking-regions.analytic-route", + "required": false, + "relation": "regionally_supersedes_historical_high_jet_route" + }, + { + "from": "math.d5-pin-neighborhood-first-moment", + "to": "regional.shrinking-regions.analytic-route", + "required": false, + "relation": "regionally_supersedes_historical_high_jet_route" + }, + { + "from": "regional.shrinking-regions.analytic-route", + "to": "hist.CH-LIFT", + "required": false, + "relation": "regional_bypass_only" + }, + { + "from": "regional.shrinking-regions.analytic-route", + "to": "hist.Piece-2-annulus", + "required": false, + "relation": "regional_bypass_only" + }, + { + "from": "regional.shrinking-regions.analytic-route", + "to": "hist.OBL-H5-JETMOD", + "required": false, + "relation": "regional_bypass_only" + } + ], + "note": "DECLARATIVE, NOT EXECUTED: no GRAPH, SELECTOR_REGION, PROOF_INDEX, STATUS or catalog edit is made here. Every required evidence file is a proposed graph node with its SHA256 as fingerprint, reached by a required edge from each consuming node. Supporting files are reached by non-required edges. The residual node is required by nothing. The supersession node changes no historical predicate. Execution is for a non-Claude lane. Math-#151's planar fold is on main (ec6db8c) and defines math.d5-pin-neighborhood-first-moment and math.d5-component.offpin-second-moment-review as live nodes (reused here rather than duplicated); the [LP] and remote_window bytes are referenced through the live nodes math.uniform-matrix-cap-lifetime and math.rn-fixed-remote-window (the latter now duplicated by the live math.d5-component.remote-window-proof; Math-#167 proposes the alignment).", + "declarative": true, + "executed": false, + "live_nodes_reused": [ + { + "id": "math.uniform-matrix-cap-lifetime", + "source": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "fingerprint": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "reading_rule_required": [ + "math.d1-component.congruence-erratum", + "math.d1-component.section9-replacement-v1_1", + "math.d1-component.marked-cylinder-cap", + "math.d1-component.reconciliation-record" + ], + "why": "the live graph already carries these bytes with four required reading-rule edges (D1 reconciliation, Math-#126); a second terminal node would not inherit a later hold on them (Codex 4139312869)" + }, + { + "id": "math.rn-fixed-remote-window", + "source": "frontiers/remote_window_20260924/PROOF.md", + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "role": "supporting only", + "note": "live classification AUTHOR_SIDE_CANDIDATE although the source was reviewed at main#76; the D5 proposal creates math.d5-component.remote-window-proof for the same bytes. This record references the live node; collapsing the pair and repairing the classification is for the executing lane." + }, + { + "id": "math.d5-pin-neighborhood-first-moment", + "live_since": "ec6db8c (Math-#151)", + "classification": "PROVED_REVIEWED", + "kind": "candidate (aggregate, no fingerprint)", + "source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "role": "required evidence of the witness node and of the aggregate (planar reading rule)" + }, + { + "id": "math.d5-component.offpin-second-moment-review", + "live_since": "ec6db8c (Math-#151)", + "classification": "PROVED_REVIEWED", + "fingerprint": "43beb4ef7da5bf71e15164d5c4bc1862db387d83f906aebdf9831625b1ca6369", + "source": "reviews/d5_offpin_second_moment_20260928/REVIEW.md", + "role": "supporting only; since ec6db8c also the live reading_rule of math.rn-region.witness-collision" + }, + { + "id": "math.d5-component.remote-window-proof", + "live_since": "ec6db8c (Math-#151)", + "classification": "PROVED_REVIEWED", + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "source": "frontiers/remote_window_20260924/PROOF.md", + "role": "not referenced; second live node for the math.rn-fixed-remote-window bytes (Math-#151 landed the D5 proposal as written); Math-#167 proposes the alignment of the older node" + } + ], + "register_read": { + "reviews/candidates_pending_20260928/CANDIDATES.md": { + "git_blob": "02455f0561d51990e1486e5d4fbb4229c8a34f5a", + "sha256": "cbaa71b55190ac234b8363614b7e57387f60c33b393ea102408eb88ec1e44513", + "at": "ec6db8c (rewritten by Math-#151; section 1a)", + "previous": { + "git_blob": "e3fc1a310c89ac9fd9249af26e28da509649ffd5", + "sha256": "3809e6147321df260085815b2d9e995094d63492534afa4ad1cd05b9a168ce4d", + "through": "bb429d3" + }, + "binding": "OBLIGATION check: the section 1 C6 heading with its open-task sentence, or the section 1a heading with the node named OPEN_ACTIVE, or this record referenced; workflow re-runs on change" + }, + "PROOF_INDEX.md": { + "git_blob": "030447a1130b52a09230e21c039409f87ef2ba32", + "sha256": "a1259b8bff4d73d97ee0835ea5c82568d4fac39fae352f5a3a2422c6bf0f8a0c", + "at": "ec6db8c (rewritten by Math-#151; section 1a)", + "previous": { + "git_blob": "dc7cea1568cd5562594bce6fae27d1422515253f", + "through": "bb429d3" + }, + "binding": "OBLIGATION check: the section 1 sentence, or the section 1a sentence, or this record referenced; workflow re-runs on change" + }, + "frontiers/downstream_gate_20260925/GRAPH.json": { + "git_blob": "220b56867f24c5ef6f55a3cce70490e9777cf3af", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09", + "at": "ec6db8c (Math-#151 fold: 14 nodes and 30 edges added; witness node gains scope, review_source, review_disposition OPEN, reading_rule and notes; classification and fingerprint unchanged)", + "previous": { + "git_blob": "fa6ba930fac75e22079fb3b9f13e302a57d5f819", + "through": "bb429d3" + }, + "binding": "OBLIGATION, TRANSITIONS and SELECTOR checks; workflow re-runs on change" + }, + "frontiers/downstream_gate_20260925/SELECTOR_REGION.json": { + "git_blob": "ebffdb0969c7d3484f8fd1f4352ea290346f0318", + "sha256": "53fa0ec88e417882eff2a40e4b575c639d43b7e8787e7fb8917aa22ace79390d", + "at": "unchanged through ec6db8c", + "binding": "OBLIGATION and SELECTOR checks; workflow re-runs on change" + } + }, + "execution_order": [ + "1. create math.rn-region.witness-collision.leading-mass-localization (OPEN_ACTIVE, required by nothing)", + "2. create regional.shrinking-regions.analytic-route (SUPERSEDED_NONBLOCKING) with its three regional_bypass_only edges; selector cells per selector_region_proposal or the node-only alternative", + "3. create the component nodes and the required/supporting edges; reference the live nodes listed in live_nodes_reused", + "4. Math-#151's fold is on main (ec6db8c). Remaining precondition for this step: the xAI bounded read of PALM sections 4-6 (per xAI 5901915195) or an explicit integrator decision that OpenAI 5358116559 plus the section 1 reading suffices; then move math.rn-region.witness-collision to PROVED_REVIEWED and update STATUS/PROOF_INDEX/catalog rows. Register-equivalent alternative (section 1a): keep the node OPEN_ACTIVE, give it the residual's definition and fingerprint, record the discharge on the aggregate node, and do not create the residual node separately", + "executing lane: non-Claude; this record executes nothing" + ] +} diff --git a/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md b/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md new file mode 100644 index 000000000..e488c0afe --- /dev/null +++ b/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md @@ -0,0 +1,407 @@ +# C6 / witness collision — source-bound reconciliation + +**Object:** C6-WITNESS-COLLISION-RECONCILIATION-20260929-v1. +**Reconciler:** Anthropic Claude, Claude Code session `session_017Mi3hxjaxV45x6zo6o1ee3`. +**Read at:** Math- `main` `8e61fc4c055b56e526b5b3488104945e8e0e29cc` (29 September 2026); every inventoried byte +re-verified identical at the record's base `7a1cb09` (the merges of Math-#155 and Math-#156 in between touch no +inventoried path); re-verified again at `5c484bf` (Math-#161 merged), at `aa28838` (Math-#158 merged) and at +`bb429d3` (Math-#157 and #165 merged); no inventoried path changed at any of them. Re-verified at `ec6db8c` (Math-#151 +merged, 30 September 00:56Z): no inventoried path changed; three register surfaces did (§1a). +**Revision:** v1.1 applies the scope corrections and the residual wording of OpenAI nonauthor review 5359701805 +(at `6a0e3b9`) and pickup 5900929519; v1.2 merges Math- main `5c484bf` and updates the §5/§9 status of the +candidates after Math-#161 merged; v1.3 answers Codex review 5359693191 (the [LP] evidence reuses the live node +`math.uniform-matrix-cap-lifetime`; the selector proposal resolves all six cells per region and is checked; the +catalog is bound by the `OBLIGATION` check and the workflow paths; the residual is defined at scale `r`). §§1 and +3, the §4 statement and the 22-file inventory are unchanged; v1.3 removes one proposed node in favour of a live one. +v1.4 merges main `aa28838`, records xAI 5901345590 (ACCEPT as inventory; HOLD on execution until Math-#151 lands) and +makes the execution order explicit in §7. v1.5 merges main `bb429d3` and records Math-#166 as the third candidate +for the §5 residual, the one whose statement matches the residual's definition. v1.6 records xAI 5901915195. v1.7 re-verifies at `ec6db8c`, +quotes the register as Math-#151 rewrote it (§1a), rebinds the `OBLIGATION` check to the current text, lists the D5 nodes +now live, and records that Math-#151 took the keep-open alternative without defining the regional mechanism. +**Effect:** register reconciliation, **declarative only**. This record introduces **no new mathematical claim**. It binds +the merged C6 chain to exact bytes, quotes the open obligation as the register recorded it, states which reviewed +theorem discharges that obligation and at what scope, states precisely what is *not* discharged, and proposes the +register transitions in machine-readable form (`PROPOSED_TRANSITIONS.json`, `"executed": false`). Execution of any +STATUS, PROOF_INDEX, GRAPH or catalog change is a separate act for a **non-Claude lane**. `lemma_closed`, prizes and +premises are untouched. Scientific effect: NONE. + +## 0. Exposure, stated first + +Every lane shares one GitHub account; no organizational independence is claimed anywhere below. + +| Object | Author | Nonauthor verdict(s) | This reconciler's relation | +|---|---|---|---| +| [C6L] `frontiers/c6_factorial_moment_20260929/PROOF.md` (Math-#140) | Anthropic Claude, **this session** | OpenAI 5355120953 (§§4–6), 5355457002 (Lemma R, §§2/7/8), 5355682335 (rebind to v1.3); xAI bounded read 5894209739 | **author** | +| [PALM] `frontiers/c6_palm_route_20260929/PROOF.md` (Math-#145) | Anthropic Claude, session `015wNj8L…` | OpenAI 5356233690 (§4), 5357899713 (AMEND R3a), 5358116559 (ACCEPT §§5–7, Theorem Q, Corollaries Θ, P at `06bc0d6`); Codex integration review 5358643154 | none | +| [DL] `frontiers/d5_dimension_lift_20260929/PROOF.md` (Math-#141) | Anthropic Claude, session `015wNj8L…` | OpenAI 5357858391 (P_d, C_d), 5357882570 (I_d, G_d), source-exposed; xAI identities 5894274124, 5894406926; xAI planar P2 continuum 5894512272 | none | +| [EDL] `frontiers/elder_dimension_lift_20260928/PROOF.md` | OpenAI | Anthropic `reviews/elder_dimension_lift_claude_20260928/` ((A4) ACCEPT) | **reviewer** of (A4) | +| [LP] `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md` | OpenAI | D1 reconciliation (Math-#126); register row D1 | reviewer C1 and D1 reconciler | +| [P_η] `frontiers/remote_collision_20260928/PROOF.md` | Anthropic Claude, **this session** | xAI `reviews/d5_remote_collision_grok_20260928/`, `reviews/d5_offpin_second_moment_20260928/` | **author** | +| [FOU] `frontiers/c6_fourier_cutoff_20260929/PROOF.md` (Math-#148) | OpenAI | Anthropic review 5356335148 (session `01NMeKE…`), recorded in `reviews/c6_fourier_completion_20260929/READING_NOTE.md` | none | +| [BND] `frontiers/c6_count_cap_boundary_20260929/PROOF.md` (Math-#146) | OpenAI | Anthropic review 5355817385 (**this session**) | reviewer and integrator | +| [SHP] `frontiers/c6_sharpened_20260929/PROOF.md` (Math-#142) | Anthropic Claude, **this session** | OpenAI 5355652934 (source-exposed: the route was OpenAI's) | **author** | +| [CLU] `frontiers/c6_rare_cluster_laws_20260929/PROOF.md` (Math-#153) | OpenAI | Anthropic 5358565704 (session `01NMeKE…`), xAI 5358623521 | none | + +The three load-bearing proofs of the discharge, [C6L], [DL] and [PALM], are all Claude-authored (two sessions). Their +nonauthor verdicts are OpenAI's, and OpenAI states its own source exposure in each (it authored the planar first-moment +sources that [DL] lifts and that [C6L]/[PALM] consume). xAI's verdicts cover [DL]'s identities, the planar P2 continuum +and a bounded read of [C6L]. **An integrating lane that wants a second provider on the discharge itself should ask xAI +for a bounded read of [PALM] §§4–6 before executing §7.** That is the same caveat the D5 record carried for P2. + +**Verdicts on this record.** OpenAI nonauthor scope review 5359701805 (at `6a0e3b9`, `RECONCILIATION.md` blob +`66bb7cfd`): ACCEPT of §§1 and 4, the identification and the count-bound discharge of the original obligation, with +three scope corrections applied in v1.1 (§2 [P_η] row; §4 upper bounds only; §6 scope retention) and the §5 wording +"not supplied by the landed reviewed chain". That review explicitly does **not** accept the executable fold +(inventory, edges, selector transition, checker, hosted results); it defers that to a separate engineering review +after Math-#151 lands. No register transition occurs from it. + +xAI bounded read 5901345590 (at `3e00f21`): **ACCEPT as inventory** (§1 quotes a count estimate; §3 byte-binds the +chain; `MONOTONE` is correct; the line-45 sentence is discharged at existential fixed-`d` compact-mark window scope) +and **HOLD on execution** for three reasons this record already states: `executed: false` and the dependence on +Math-#151; the residual node must exist before the old node moves (§7 ordering); and the xAI read of [PALM] §§4–6 +asked for above is a separate slice, not that comment. The record may land declaratively; the +`OPEN_ACTIVE → PROVED_REVIEWED` step is a later non-Claude act. + +xAI bounded discharge read 5901915195 (at `c641df1`): agrees that §1 quotes a count estimate and that [PALM] +Theorem Q with [EDL] (A4) discharges it at existential, fixed-`d ≥ 2`, compact-mark, window-`I_r` scope, with the +regional monotonicity an upper bound only; holds execution until Math-#151 is on main; requires the residual node +to exist before the old node moves (the §7 order); and states that it is not the second-provider read of [PALM] +§§4–6, which the xAI lane (Benjamin) is taking separately. + +## 1. The obligation, as the register recorded it + +Four places define the open item. They are quoted at the bytes of `8e61fc4`. + +1. **`PROOF_INDEX.md`, line 45:** + > D5 shrinking multiple-witness collision: fixed-separation machinery is `frontiers/remote_window_20260924/PROOF.md` + > section 6, (15)–(16), at fixed `eta>0`. **NO COMPLETE PROOF YET: shrinking-separation factorial-moment/collision + > estimate.** +2. **`frontiers/downstream_gate_20260925/GRAPH.json`, node `math.rn-region.witness-collision`:** layer D5, kind + `region`, classification `OPEN_ACTIVE`, fingerprint **"eta->0 mutual witness separation"**, notes **"Fixed-eta + factorial moments do not cover shrinking separation"**. +3. **`frontiers/remote_window_20260924/PROOF.md`** (D4, reviewed at main#76), after (15)–(16): + > Witness tuples whose mutual separation tends to zero; (15) does not control that collision. +4. **`frontiers/remote_collision_20260928/PROOF.md`** ([P_η], xAI-reviewed), §1 and §8: + > […] records that shrinking separation is uncontrolled. This is the open "witness-collision" region of the D5 graph + > (`math.rn-region.witness-collision`, "eta->0 mutual witness separation"). […] + > Not established: **A torus-wide second factorial moment, or `math.rn-region.witness-collision` in its full + > torus-wide sense.** Pairs with either witness in the local, collar or intermediate regions are not estimated here. + +The D5 reconciliation (`reviews/d5_reconciliation_20260929/RECONCILIATION.md` §5, landed via Math-#138) restated it: +> **D5-open (catalog C6): shrinking multiple-witness collision.** Target. A torus-wide second factorial moment +> `E_{Q_r^W} N(N−1)` for the window count, with pairs where at least one witness is within fixed `η` of a pin. +> […] **No upper bound.** The optimal order is open. + +And catalog C6 (`reviews/candidates_pending_20260928/CANDIDATES.md`, read at blob `e3fc1a31`, unchanged through +`5c484bf`; bound by the `OBLIGATION` check and the workflow paths) asked for "a valid full-window factorial upper +bound with the pin-neighborhood collisions included". + +**Reading.** In all five places the obligation is a **count estimate**: a factorial-moment (collision) bound for the +window count that covers (a) witness pairs at shrinking *mutual* separation, including coincidence limits, and (b) +witness pairs with a member at shrinking distance from a pin. The fixed-`η` results ([D4] (15)–(16); [P_η]) cover (a) +only when both witnesses stay in a fixed remote region; nothing covered (b). No source defines the node as a regional +decomposition of the leading-order mass, as a Palm or conditional statement, or as anything other than the count +estimate above. §5 returns to that point. + +### 1a. The register at `ec6db8c` (after Math-#151) + +Math-#151 merged at `ec6db8c` on 30 September (00:56Z) and rewrote three of the surfaces quoted above. The quotes in +§1 remain the obligation as the register recorded it when this record was opened and reviewed (OpenAI 5359701805, +xAI 5901915195 read that text); the `OBLIGATION` check now binds either text, so the workflow fails on any third +rewrite. + +1. **`PROOF_INDEX.md`** (blob `030447a1`), open-obligations section: + > D5 shrinking multiple-witness collision: fixed-separation machinery is `frontiers/remote_collision_20260928/PROOF.md`. + > The reviewed Fourier upper bound and the later merged sharp Palm route establish global count statements by routes + > that do not identify this regional shrinking-separation mechanism. **NO COMPLETE REGIONAL PROOF YET:** + > `math.rn-region.witness-collision` remains `OPEN_ACTIVE`; the global `Theta(r^3)` result is not a proof of that node. +2. **`GRAPH.json`** (blob `220b5686`), node `math.rn-region.witness-collision`: still `OPEN_ACTIVE`, fingerprint + unchanged ("eta->0 mutual witness separation"); new fields `scope: "catalog C6"`, + `review_source: reviews/d5_reconciliation_20260929/RECONCILIATION.md`, `review_disposition: "OPEN"`, + `reading_rule: [math.d5-component.offpin-second-moment-review]` with a `required` edge to that component; notes: + > Off-pin fixed-separation second-moment evidence is reviewed and sharp global order is reviewed and merged through + > Math-#145, but the regional shrinking pin/witness-collision mechanism and its source-bound graph fold remain open. +3. **Catalog C6** (`CANDIDATES.md`, blob `02455f05`), retitled "Torus-wide factorial moments: reviewed global order; + regional mechanism open": it records [PALM]'s `Θ(r³)` in every fixed `d ≥ 2` at its packet scope, then: + > They do not close the regional shrinking-witness mechanism: the planar graph node `math.rn-region.witness-collision` + > remains `OPEN_ACTIVE`. […] Open task: prove or refute the shrinking-separation witness-collision mechanism encoded by + > the open graph node, without inferring it from the global Palm bound. + +**Reading.** The count sentence of §1 ("shrinking-separation factorial-moment/collision estimate") is no longer in the +register: Math-#151 replaced it by a "regional shrinking pin/witness-collision mechanism" that no surface defines, i.e. +it took the alternative anticipated in §5 (keep the old node open) but under a new, undefined meaning and the old +fingerprint. Three consequences for the executing lane. (i) The count obligation, as the register recorded it through +`bb429d3` and as OpenAI 5359701805 and xAI 5901915195 read it, is discharged at the §4 scope; nothing in the new text +disputes that: "the global `Theta(r^3)` result is not a proof of that node" is a statement about the node's new +meaning, not about the count. (ii) The only definition on file for the new meaning is §5's residual, the scale-`r` +localization with the mixed count `M(R, s_0)` as its open piece; the new open task ("without inferring it from the +global Palm bound") is consistent with it and supplies no other. (iii) The proposal of §7 therefore stands, and its two +executions are register-equivalent: create the residual node and move the old node, or keep the old node open and give +it the residual's definition and fingerprint. Either way the reading rule now live on the old node +(`math.d5-component.offpin-second-moment-review`) is preserved; this record already lists that component as supporting +evidence of the old node and of the aggregate. + +## 2. What is now proved and reviewed + +All statements are for the exact pinned model of [LP] (period `T`, written `L` in [LP]/[PALM]): fixed `d ≥ 2`, fixed +torus, compact marks `b ∈ B`, `k ∈ K` with `k_− > 0`, all frames and indices, the original weight `W_r` and full +normalizer `Z_r`, the window `I_r = (b − k r³, b)`, and `N` = number of critical points of `f` in `X ∖ {M, S}` with +height in `I_r`. Constants are existential. + +| Tag | Statement | Scope | Verdict on file | +|---|---|---|---| +| [C6L] Theorem C6-L | `E_{Q_r^W} N(N−1) ≤ C r³ log²(1/r)`; `(N)_q ≤ C_q r³ log^{2(q−1)}(1/r)` | `d = 2`; D5 reading rule | OpenAI complete acceptance (5355120953 + 5355457002, rebound 5355682335) | +| [SHP] S₂ / S_d | `r³[L/log L]²` planar; `r³[L/log L]^{d(q−1)}` given G_d | fixed `d` | OpenAI 5355652934 (source-exposed) | +| [FOU] Theorem F, W | count-tail `C e^{−c x^{2/d}}`; `E N(N−1) ≤ C r³ log(1/r)` planar; `(N)_p ≤ C_p r³ [log(1/r)]^{d(p−1)/2}` given G_d | fixed `d` | Anthropic 5356335148 | +| [BND] Theorems A, B, Prop. C | cap tail + first moment alone cannot give `O(r³)`; the missing input is a size-biased cap moment | abstract | Anthropic 5355817385 | +| [DL] Theorems P_d, C_d, I_d, **G_d** | first moments in every fixed `d`; `E_{Q_r^W} N ≤ C r³` | fixed `d` | OpenAI 5357858391, 5357882570 (source-exposed); xAI identities | +| [PALM] **Theorem Q** | `E_{Q_r^W}[(N)_q] ≤ C_q r³` for every fixed integer `q ≥ 2` | every fixed `d ≥ 2` | OpenAI 5358116559 (source-exposed) | +| [PALM] **Corollary Θ** | `c r³ ≤ E_{Q_r^W} N(N−1) ≤ C r³` and `c r³ ≤ Q_r^W{N ≥ 2} ≤ C r³` | every fixed `d ≥ 2` | same, with [EDL] (A4) | +| [EDL] (A4) | `Q_r^W(N_r ≥ 2) ≥ c r³`, `E[N_r(N_r−1)] ≥ c r³`, from two extra index-`(d−1)` points within `C_d r` of the midpoint | every fixed `d` | Anthropic `reviews/elder_dimension_lift_claude_20260928/` | +| [P_η] Corollary D | `E N_η(N_η−1) ≤ C_η r⁵`, both witnesses at distance `≥ η` from the pins, all mutual separations | fixed `η`, every fixed `d` (Theorem C / Corollary D constants depend on `d, L, ρ, η_0, B, K`; the planar / `G_d` condition of [P_η] concerns its Corollary F upper half only) | xAI | +| [CLU] | conditional consequences of (H1), (H2), (Hq): Poisson obstruction at scale `r³`, cluster-law compactness | abstract given the above | Anthropic + xAI | + +[PALM] §1.4 records that at `d = 2` every regional input is the planar row it lifts, each with its own nonauthor +verdict, so the planar statement of Theorem Q depends on [PALM]'s own steps only; the every-`d` statement additionally +needs [DL]. [PALM] §2 pins [C6L] v1.3 and [DL] at the merged bytes, which are the bytes inventoried in §3 below. + +## 3. Components, exact bytes and verdict rows + +`reconciliation_check.py` binds every path below to its SHA256 and git blob, rejects symlinks anywhere on the path, +and checks the quoted verdict rows as exact substrings. The inventory is on `main` `8e61fc4`. + +| Role | Path | SHA256 (prefix) | Blob (prefix) | +|---|---|---|---| +| **Discharge (required)** | | | | +| [PALM] proof | `frontiers/c6_palm_route_20260929/PROOF.md` | `aa37f160…` | `89eb8adf…` | +| [PALM] review record | `frontiers/c6_palm_route_20260929/README.md` | `56c0b94f…` | `1ebf8ede…` | +| [PALM] source map | `frontiers/c6_palm_route_20260929/SOURCE_MAP.json` | `c7cc195f…` | `b528fe10…` | +| [PALM] checker, results | `palm_exact_check.py`, `RESULTS.json` | `3bd19ec6…`, `7812de45…` | `6b0c73ba…`, `cd8003da…` | +| [C6L] proof v1.3 | `frontiers/c6_factorial_moment_20260929/PROOF.md` | `b1992756…` | `f5bd013b…` | +| [DL] proof | `frontiers/d5_dimension_lift_20260929/PROOF.md` | `6fb94b24…` | `9d82c707…` | +| [DL] crosswalk | `frontiers/d5_dimension_lift_20260929/CONTINUUM_CROSSWALK.md` | `bdb83c28…` | `45e4324f…` | +| [EDL] proof | `frontiers/elder_dimension_lift_20260928/PROOF.md` | `b529fe37…` | `7303bd79…` | +| [EDL] review | `reviews/elder_dimension_lift_claude_20260928/REVIEW.md` | `032bb4c7…` | `e2b9fcdc…` | +| [LP] parent | `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md` | `9350ad6e…` | `dfed3b8d…` | +| Planar reading rule | `reviews/d5_reconciliation_20260929/RECONCILIATION.md`, `PROPOSED_TRANSITIONS.json` | `14342b7e…`, `02f91870…` | `4062d76b…`, `d928969e…` | +| **Supporting (not required by the discharge)** | | | | +| [FOU] proof, reading note | `frontiers/c6_fourier_cutoff_20260929/PROOF.md`, `reviews/c6_fourier_completion_20260929/READING_NOTE.md` | `c1692379…`, `62f84b68…` | `1d9177a2…`, `682d7045…` | +| [BND] proof | `frontiers/c6_count_cap_boundary_20260929/PROOF.md` | `264a5e76…` | `3d4c28a4…` | +| [SHP] proof | `frontiers/c6_sharpened_20260929/PROOF.md` | `9f45274a…` | `70ba1972…` | +| [CLU] proof | `frontiers/c6_rare_cluster_laws_20260929/PROOF.md` | `c52a3cf1…` | `2ab625ce…` | +| [P_η] proof, xAI reviews | `frontiers/remote_collision_20260928/PROOF.md`, `reviews/d5_remote_collision_grok_20260928/REVIEW.md`, `reviews/d5_offpin_second_moment_20260928/REVIEW.md` | `b9b8b58f…`, `f8289546…`, `43beb4ef…` | `7b48a88e…`, `c18560f8…`, `62697c47…` | +| [D4] proof | `frontiers/remote_window_20260924/PROOF.md` | `a332bae9…` | `b383bfcc…` | + +Full hashes are in `reconciliation_check.py` (`INVENTORY`). The GitHub review ids are bound where an on-disk record +carries them: [PALM] `README.md` (review table), [C6L] header (5355120953, 5355457002), [DL] `README.md` and +`CONTINUUM_CROSSWALK.md` (5357858391, 5357882570, 5894512272), [FOU] reading note (5356335148), [EDL] review ((A4) +row). Reviews 5355817385, 5358565704, 5358623521 and 5355652934 exist on GitHub only; the record cites them and +`SOURCE_FILES.json` does not claim otherwise. + +## 4. Discharge + +**Claim reconciled.** The obligation of §1 — a shrinking-separation factorial-moment/collision estimate for the window +count, torus-wide, pin neighbourhoods included — is discharged by [PALM] Theorem Q, with the matching lower bound +[EDL] (A4), at the following scope: + +- **Statement.** `E_{Q_r^W}[(N)_q] ≤ C_q r³` for every fixed integer `q ≥ 2`, and `c r³ ≤ E_{Q_r^W} N(N−1) ≤ C r³`. + The optimal order asked for by catalog C6 is `r³`. +- **Scope.** Every fixed `d ≥ 2`; fixed torus; compact marks with `k_− > 0`; all frames and indices; the height window + `I_r`; the original `W_r` and full `Z_r`; existential constants. At `d = 2`, conditional on [PALM]'s own steps + (§§3–7) only; for `d ≥ 3`, additionally on [DL] at its OpenAI acceptance. +- **Why it is the recorded obligation and not a different quantity.** + 1. `N` counts *every* window critical point other than the pins. `(N)_2` counts every ordered pair of distinct + ones, at every mutual separation including the coincidence limit, and at every distance from the pins. [PALM] + proves this through the pathwise cap `N(N−1) ≤ N Ψ` and the marked Kac–Rice formula over the same tiling as + [DL] §7 (pin balls, collar, shells, remote region); the pin-neighbourhood pairs are the R1 regime of its §6. + 2. For any Borel region `A` of the torus, the count `N_A` of window critical points in `A` satisfies `N_A ≤ N` + pathwise, hence `(N_A)_q ≤ (N)_q` for every `q`. Every *regional* factorial-moment bound of the recorded type is + therefore implied by the torus-wide one. `reconciliation_check.py` records this reading exactly on integer count + vectors (`MONOTONE`). There is no sense of "factorial-moment/collision estimate" under which a torus-wide bound + leaves a regional bound of the same quantity open. This monotonicity supplies **upper bounds only**: the lower + bound `c r³` is global, realised on the [EDL] (A4) event by pairs within `C_d r` of the midpoint, and is not + claimed for an arbitrary subregion or shrinking selector. OpenAI review 5359701805 states the sharper pathwise + form, adopted here with credit: for any Borel selector `0 ≤ χ_r ≤ 1` on ordered `q`-tuples of distinct window + points (mutual-separation cutoffs tending to zero with `r`, positions relative to the pins and mixed + local/remote subsets included), `T_χ := Σ χ_r ≤ (N)_q` pathwise, hence `E T_χ ≤ C_q r³` uniformly in the + selector, with no separate regional constant. It gives no matching lower bound for a selected subregion, no + pointwise Kac–Rice density bound, no leading coefficient and no `o(r³)` for mixed pairs; those are §5's + residual. + 3. The lower bound is the one the D5 record already carried (`E N(N−1) ≥ 2 P(N ≥ 2) ≥ 2c r³`), now from [EDL] (A4) + in every fixed `d`; the upper bound matches it in order. The pair `(A4, Theorem Q)` is exactly "the eventual + disposition of C2" that catalog C6 said the answer must be compatible with. +- **Consistency across the chain.** [BND] shows that a cap tail plus the first moment cannot give `O(r³)`; [PALM] + uses more (the size-biased cap moment under the witness-conditioned regression, its Lemma M′ and Lemma 5.1), which is + precisely the input [BND] Proposition C names. [FOU]'s `r³ log(1/r)` and [SHP]'s `r³[L/log L]²` are upper bounds + superseded in order by Theorem Q and remain correct. [P_η]'s `O(r⁵)` for both-remote pairs is compatible with a + total of order `r³` whose lower bound (A4) is realised by pairs within `C_d r` of the midpoint. + +## 5. What is not discharged, and the one residual worth naming + +- **Numerical constants** (`C_q`, `c`, `r_*`): open, as in every source. Catalog C8. +- **All-height pairs:** [PALM] counts the window `I_r` only. The all-height statement is not part of the obligation + (which is the window count) and is not claimed. +- **Positional and cluster laws:** [CLU] gives conditional consequences (a Poisson obstruction at scale `r³`, + compactness of the conditional and size-biased laws) but, as it says, does not identify a unique limiting cluster + law. Not part of the obligation. +- **Uniformity** in `T` (`L`), in `d`, as `k ↓ 0` or as marks grow: not claimed anywhere. +- **Elder selection:** separate (D1; `frontiers/elder_lower_all_d_20260929/` for the every-`d` lower bound). +- **Historical numerical certificates** (RN annulus partition, 24-jet / OBL-H5-JETMOD): not discharged and not + claimed; see §6 for what the analytic route does to their *blocking role*. +- **The residual that the phrase "regional shrinking-witness mechanism" could legitimately mean.** Math-#151's catalog + and proof-index text (merged at `ec6db8c`; quoted in §1a) keep `math.rn-region.witness-collision` open on the ground that "the global `Θ(r³)` + result is not a proof of that node". §1 shows the node was never defined as anything but the count estimate. If the + integrating lanes nevertheless want the register to keep a *regional* question, it should be a new node with a + definition, not the old node under a new meaning. The one genuinely open regional statement is the + **localization of the leading-order mass at scale `r`**, defined (with `o` the midpoint) as + `lim_{R→∞} limsup_{r→0} r⁻³ E_{Q_r^W} #{ordered pairs (X, X′) of distinct window points : not both |X − o| ≤ R r + and |X′ − o| ≤ R r} = 0`. What the landed chain gives: (A4) shows pairs within `C_d r` of `o` carry `≥ c r³`, so + the scale-`r` mass is of order `r³`, and local–local pairs between `C_d r` and `R r` belong to it, not to the + residual; [P_η] shows pairs with both witnesses at distance `≥ s_0` from the pins carry `O(r⁵)`; [PALM] §6 R3, the + marked shell bound with `q = 2` whose dyadic sum is `C r³(A_0⁻² + s_0²)`, shows that every pair with a witness in + the shells `R r ≤ |X − o| ≤ s_0` carries at most `C r³(R⁻² + s_0²)`. What it does not give: an `o(r³)` bound for the + **mixed pairs**, one witness within `R r` of `o` and the other at distance `≥ s_0`, where [PALM] §6 R4 gives `C r³` + only. By the three facts above the residual is equivalent to `lim_{s_0→0} lim_{R→∞} limsup_{r→0} r⁻³ M(R, s_0) = 0` + for that mixed count `M(R, s_0)`, and this bound is **not supplied by the landed reviewed chain**. This is a + further theorem, not a gap in Theorem Q. Two author-side + candidates for it exist and are recorded here as **candidates only**: Math-#161 (OpenAI, head `e7f8929`, merged + to main at `5c484bf`; planar; its Lemma M gives joint probability `o(r³)` for the local and fixed-remote nonempty + events, and its §§6–7 one/two law is conditional on Math-#158 Theorems C/G/F) and Math-#159 (Anthropic Claude, + session `015wNj8L…`, v1.1 head `7188bfa`, every fixed `d`; its Lemma 5.2 claims a near–far cross term + `O(r^{9/2})`). Status at `5c484bf`: Math-#161 carries an Anthropic analytic ACCEPT (5359733142, by the session + that authored its consumed [PALM] and [DL], so source-exposed) and a Codex engineering ACCEPT (5359797442); the + four review slices of Math-#158 carry verdicts (A xAI 5359488967; B Codex 5359738045; C Anthropic, this session, + 5359814083; D Codex 5359601495), and Math-#158 merged at `aa28838`; Math-#159 is unreviewed. Neither candidate + is a premise of this record, neither is inventoried, and neither is consumed by any proposed node or edge. The + residual stays `OPEN_ACTIVE` for every fixed `d`: the Math-#161 chain is planar and source-exposed, so an executing + lane could at most record a planar sub-status from it, after its own fold; this record proposes none. A third + candidate, Math-#166 (OpenAI, `frontiers/two_scale_cluster_geometry_20260929/TWO_SCALE_LAW.md`, blob `a32fd5f7`, + math head `7c82252`), states the residual as defined here: `r⁻³ E[(N)_q − (N_in)_q] → 0` for every fixed `q ≥ 2` + and any `δ_r → 0` with `δ_r / r → ∞`, retaining counted mass (its near/remote product is `o(r³)`), conditional on + Math-#162; at `bb429d3` its Slices B and C carry Anthropic verdicts (5360178611, 5360216551, session `01NMeKE…`) and + Slice A, the two-scale law itself, is under review. It is unmerged, not a premise, not inventoried, not consumed. + When #162 and #166 are on main with their reviews, an additive successor record can bind the residual's closure + in every fixed `d`; this record does not. `PROPOSED_TRANSITIONS.json` proposes the residual as an explicitly + scoped `OPEN_ACTIVE` node, `math.rn-region.witness-collision.leading-mass-localization`, required by nothing, so that + the question is recorded precisely and blocks nothing. + +## 6. Historical predicates and the shrinking regions + +The graph already contains the pattern for this situation: `regional.fixed-annulus.high-jet-route` +(`SUPERSEDED_NONBLOCKING`, kind `regional_supersession`) records that, for the reviewed fixed-annulus scope, the +analytic route bypasses `hist.CH-LIFT`, `hist.Piece-2-annulus` and `hist.OBL-H5-JETMOD`, while those predicates stay +`OPEN`/`ABSENT` in their original replay scopes. `SELECTOR_REGION.json` still lists `CH-LIFT` and `Piece-2-annulus` as +`OPEN_ACTIVE` for `pin-collision` and `intermediate-r-to-rho`, and `Piece-2-annulus` as `OPEN_ACTIVE` for +`witness-collision`, with the notes "scaled charts reopen CH-LIFT" and "active mathematical blocker outside +fixed-remote". + +With the reviewed D5 chain (planar via `reviews/d5_reconciliation_20260929/`, every fixed `d` via [DL]) and Theorem Q, +the pin-collision, intermediate and witness-collision regions are covered by analytic proofs that use no shrinking +chart lift, no annulus piece and no 24-jet enclosure. This record therefore proposes a second supersession node, +`regional.shrinking-regions.analytic-route`, with the same three `regional_bypass_only` edges and the same discipline: +the historical predicates are **not** discharged, their classifications are **not** changed, and the bypass is scoped +to the reviewed regions and scopes only. The `SELECTOR_REGION.json` cells of those three regions are all resolved +under that node, so that `hard_gate.py::selector_region_report` shows no open cell for them: `CH-LIFT`, +`Piece-2-annulus`, `OBL-H5-JETMOD` and `H5-REMOTE-THRESHOLD` become `BYPASSED_BY_ANALYTIC_ROUTE`; `ALLCELL-FDZ-Q4` +becomes `NOT_REQUIRED` and `ENV-RESCOV` `REDERIVED_QUALITATIVELY`, the values the `fixed-remote` row already carries +for the same reason (the analytic route uses the positive Fourier spectrum and the joint floors of [PALM] Lemma 6.1 / +Lemma E_d, not the historical cell carrier or the historical covariance predicate). The three region ids then move +from `open_region_ids` to `covered_region_ids`; `mesoscopic-scaled-annulus` stays open. The `SELECTOR` check applies +the proposal to the live table and verifies exactly this. The file edit is for the executing lane; if it prefers the +node-only precedent of `regional.fixed-annulus.high-jet-route` (cells untouched), the lists stay unchanged and §7's +selector row does not apply. + +**Scope retained by the bypass.** The bypass inherits every restriction of §2: the original weight `W_r` and the full +normalizer `Z_r`, compact marks with `k_− > 0`, fixed `d` and fixed torus, and the height window `I_r` wherever the +source is window-only. It grants no all-height collision bound, no numerical certificate (RN annulus partition, +24-jet / OBL-H5-JETMOD) and no discharge of any historical predicate outside that analytic scope (OpenAI 5359701805, +item 3). + +## 7. Proposed register transitions (for a non-Claude lane) + +| Surface | Current (`8e61fc4`; `ec6db8c` where Math-#151 changed it) | Proposed | +|---|---|---| +| main `STATUS.md` C6 row | "C6 — Fourier count tail and planar factorial upper bound", `E N(N−1) ≤ C r³ log(1/r)` in `d = 2` | **"C6 — torus-wide factorial moments (witness collision): `Θ(r³)`"** with the §4 statement and scope; keep the Fourier row's count-tail sentence as a component; independence caveat of §0 in the notes column | +| `PROOF_INDEX.md` open-obligations bullet | at `8e61fc4`: "NO COMPLETE PROOF YET: shrinking-separation factorial-moment/collision estimate"; at `ec6db8c`: "NO COMPLETE REGIONAL PROOF YET: `math.rn-region.witness-collision` remains `OPEN_ACTIVE`; the global `Theta(r^3)` result is not a proof of that node" (§1a) | move to the reviewed section, citing [PALM] with reviews 5356233690/5358116559, [EDL] (A4), [DL], and this record; keep a separate open bullet for the §5 residual and for numerical constants | +| `reviews/candidates_pending_20260928/CANDIDATES.md` C6 | at `ec6db8c` (Math-#151): retitled "reviewed global order; regional mechanism open", open task "prove or refute the shrinking-separation witness-collision mechanism encoded by the open graph node" (§1a) | "Resolved at existential scope: optimal order `r³` in every fixed `d ≥ 2` (upper: Palm route; lower: (A4)). Open: numerical constants; leading-mass localization (§5); a unique limiting cluster law." | +| `GRAPH.json` `math.rn-region.witness-collision` | `OPEN_ACTIVE` (kept by Math-#151 at `ec6db8c`, with `reading_rule` `[math.d5-component.offpin-second-moment-review]` and `review_disposition` `OPEN`; §1a) | `PROVED_REVIEWED` at the §4 scope, realized by the aggregate node `math.c6-witness-collision-factorial-moment`, one component node per required file with `fingerprint` = SHA256 and `source` = path, and `required: true` edges from the region node and the aggregate to each; the [LP] evidence is the live reconciled node `math.uniform-matrix-cap-lifetime` (same SHA256, four required reading-rule edges), not a new node; plus a required edge to the planar reading-rule node `math.d5-pin-neighborhood-first-moment` (created by Math-#151) | +| `GRAPH.json` new node | — | `math.rn-region.witness-collision.leading-mass-localization`, `OPEN_ACTIVE`, required by nothing, defined as the scale-`r` localization of §5 with the mixed local/remote count as its open piece, with the §5 candidate note (Math-#161, Math-#159: not premises) | +| `GRAPH.json` new node | — | `regional.shrinking-regions.analytic-route`, `SUPERSEDED_NONBLOCKING`, non-required `regional_bypass_only` edges to `hist.CH-LIFT`, `hist.Piece-2-annulus`, `hist.OBL-H5-JETMOD` (§6) | +| `SELECTOR_REGION.json` | `Piece-2-annulus` / `CH-LIFT` `OPEN_ACTIVE`, `ENV-RESCOV` / `ALLCELL-FDZ-Q4` `OPEN_HISTORICAL` for the shrinking regions | all six cells resolved for `pin-collision`, `intermediate-r-to-rho`, `witness-collision` (§6: four `BYPASSED_BY_ANALYTIC_ROUTE`, `ALLCELL-FDZ-Q4` `NOT_REQUIRED`, `ENV-RESCOV` `REDERIVED_QUALITATIVELY`); the three region ids move to `covered_region_ids`; checked by `SELECTOR` | + +**Ordering.** These transitions presupposed Math-#151's execution of the planar D5 fold; it is on main at `ec6db8c` +(14 nodes, 30 edges), so the nodes this record reuses are live: `math.d5-pin-neighborhood-first-moment` +(`PROVED_REVIEWED`, aggregate, no fingerprint), `math.d5-component.offpin-second-moment-review` (`PROVED_REVIEWED`, +fingerprint `43beb4ef…`, now also the old node's live `reading_rule`) and `math.d5-component.remote-window-proof` +(`PROVED_REVIEWED`, fingerprint `a332bae9…`, a second node for the `math.rn-fixed-remote-window` bytes; Math-#167 +proposes the alignment of the older node). The executing lane, not this record, decides. Within the execution the +order is fixed (xAI 5901345590): first create the residual node +`math.rn-region.witness-collision.leading-mass-localization` (`OPEN_ACTIVE`) and the supersession node, then the +component nodes and edges, and only then move `math.rn-region.witness-collision` to `PROVED_REVIEWED`, so that the +register never loses the localization question under a renamed meaning; the xAI bounded read of [PALM] §§4–6 asked +for in §0 precedes that last step. The keep-open execution (§1a, point (iii)) performs the first three steps, records +the discharge on the aggregate node and then, instead of moving the old node, gives it the residual's definition and +fingerprint (the residual node is then not created separately); both executions leave the same question open. Nothing here edits `GRAPH.json`, `PROOF_INDEX.md`, `STATUS.md` or the catalog (`"executed": false`, checked). + +**Reverse-impact.** Every proposed component node carries the SHA256 of its source, so a later byte change to any of +them invalidates the fold through the existing reader; `coverage_source` metadata is not used. + +## 8. Checks + +`reconciliation_check.py` (stdlib only, run from the repository root): +- **IDENTITIES.** All 22 inventoried files exist as regular files, with no symlink anywhere on their paths, and with + the stated SHA256 and git blob. +- **VERDICTS.** The exact verdict rows and statements quoted in §§1–2 are present as substrings. +- **OBLIGATION.** The live graph still carries `math.rn-region.witness-collision` as an `OPEN_ACTIVE` region with the + fingerprint quoted in §1 (or as `PROVED_REVIEWED` after execution); while open, its `review_disposition`, if any, is + `OPEN` and every `reading_rule` component is live `PROVED_REVIEWED`; the selector still lists the region; + `PROOF_INDEX.md` carries the §1 sentence, or the §1a sentence ("NO COMPLETE REGIONAL PROOF YET" with the node named + `OPEN_ACTIVE`), or a reference to this record; the catalog carries the §1 C6 heading with its open-task sentence, or + the §1a heading with the node named `OPEN_ACTIVE`, or a reference to this record. Any other rewrite of those surfaces + fails the check, and the workflow re-runs on their change. +- **NEGATIVES.** Real filesystem faults on a temporary copy of the inventory: delete [PALM]'s proof, change one byte + of it (all quoted statements kept), replace it by a symlink to identical bytes, replace its directory by a symlink. + Each is rejected. +- **TRANSITIONS.** `PROPOSED_TRANSITIONS.json` names only inventoried files or known node ids; every required file is + a proposed node with matching fingerprint and source, reached by a required edge from each consuming node; the + supporting files are reached by non-required edges; the residual node is `OPEN_ACTIVE` with no required edges; the + supersession node has exactly the three `regional_bypass_only` edges and no historical predicate changes class; the + cross-record node is one the D5 proposal defines and, since `ec6db8c`, live with that proposal's fingerprint; a source already carried by a live fingerprinted node ([LP], + `math.uniform-matrix-cap-lifetime`) is referenced through that node, with equal SHA256 and its four required + reading-rule edges present, and no proposed node duplicates a live source; every proposed node passes the hard + gate's shape rules; `declarative` is true and `executed` is false. +- **SELECTOR.** The selector proposal names every selector of the live table for its three regions, assigns each a + value the hard gate classifies as covered or bypassed, and, applied to the live table, moves exactly those three + region ids from `open_region_ids` to `covered_region_ids`. +- **MONOTONE.** Exact enumeration: `(n_A)_q ≤ (n)_q` for every sub-count and `q ≤ 4`; `2·1{n≥2} ≤ n(n−1) ≤ nΨ`; + the `Θ(r³)` bracket needs both the upper and the lower row. +- **OPEN_RESIDUAL.** §5's open items are recorded (numerical constants; the residual node with its scale-`r` + definition; the mixed-pair bound + "not supplied by the landed reviewed chain", with the candidates named as candidates only) and the residual node + is proposed open. + +Ten mutants must fail: `allow-symlink`, `no-hash`, `drop-edge`, `stale-fingerprint`, `executed-flag`, +`close-residual`, `drop-lower-bound`, `regional-strict`, `clone-live-node`, `open-cell-left`. + +## 9. Relation to other lanes + +- **Math-#151 (Codex; merged at `ec6db8c`, 30 September 00:56Z, final head `609e559`):** executed the planar D5 fold + (14 nodes, 30 edges; the three planar first-moment regions to `PROVED_REVIEWED`) and kept witness-collision open under + the rewritten text quoted in §1a. This record does not conflict with its graph edits and now points at its live nodes; + it supersedes only the catalog and proof-index wording about C6, and only if the executing lane accepts §§1 and 4 + (OpenAI 5359701805 and xAI 5901915195 do). The D4 duplicate (`math.d5-component.remote-window-proof` beside + `math.rn-fixed-remote-window`, same bytes) landed uncollapsed; Math-#167 (this session) proposes the alignment of the + older node, and this record keeps referencing the older live node with supporting edges only. +- **Math-#155 (OpenAI, C7):** unrelated to the count; not consumed. +- **Math-#161 (OpenAI, `e7f8929`, merged at `5c484bf`) and Math-#159 (Anthropic Claude, other session, `7188bfa`):** + author-side candidates for the §5 residual; not premises, not inventoried, not consumed (§5, with their review + status at `5c484bf`). Their appearance changes none of this record's status rows, nodes or edges; a planar + sub-status of the residual would be a further transition by an executing lane, after its own fold. +- **Math-#166 (OpenAI, two-scale cluster geometry, math head `7c82252`, open):** the consumer whose `TWO_SCALE_LAW.md` + states the §5 residual exactly, conditional on Math-#162; Slices A, B and C carry the other Claude session's verdicts + (5360227991, 5360178611, 5360216551; one provider); unmerged; not consumed here; the residual closes by a successor + record after both land. +- **Math-#158 (OpenAI, planar cubic cluster law, `bfcc67dc`, merged at `aa28838`):** premise of Math-#161 §§6–7; this session + reviewed its Slice C (5359814083); not consumed here. +- **main#207 (closed 30 September 00:57Z, after Math-#151 merged):** the pickup for this record is comment 5900687550 + and the delivery 5900887059. The register execution stays with a non-Claude lane. diff --git a/reviews/c6_witness_collision_reconciliation_20260929/RESULTS.json b/reviews/c6_witness_collision_reconciliation_20260929/RESULTS.json new file mode 100644 index 000000000..f68f83614 --- /dev/null +++ b/reviews/c6_witness_collision_reconciliation_20260929/RESULTS.json @@ -0,0 +1,16 @@ +{ + "checks": { + "IDENTITIES": true, + "MONOTONE": true, + "NEGATIVES": true, + "OBLIGATION": true, + "OPEN_RESIDUAL": true, + "SELECTOR": true, + "TRANSITIONS": true, + "VERDICTS": true + }, + "inventory_files": 22, + "object": "C6-WITNESS-COLLISION-RECONCILIATION-20260929-v1", + "passed": true, + "scope": "identity, verdict-row, obligation, filesystem-negative, transition-chain, monotonicity, open-item and selector-cell checks; no mathematics is re-proved" +} diff --git a/reviews/c6_witness_collision_reconciliation_20260929/SOURCE_FILES.json b/reviews/c6_witness_collision_reconciliation_20260929/SOURCE_FILES.json new file mode 100644 index 000000000..e94572a01 --- /dev/null +++ b/reviews/c6_witness_collision_reconciliation_20260929/SOURCE_FILES.json @@ -0,0 +1,36 @@ +{ + "schema": 1, + "object": "C6-WITNESS-COLLISION-RECONCILIATION-20260929-v1", + "scientific_effect": "NONE", + "disposition": "PROPOSAL_FOR_A_NON_CLAUDE_LANE", + "declarative": true, + "executed": false, + "base": "7a1cb09a9d58d179393e6d29146252f714b9c9bf", + "inventory_read_at": "8e61fc4c055b56e526b5b3488104945e8e0e29cc", + "files": [ + { + "path": "PROPOSED_TRANSITIONS.json", + "bytes": 42904, + "sha256": "5698a436db08b4c8942a2df77a1d1bddf52261fffed61c9a323d7e9a8d285f18", + "git_blob": "8d70ee7494327e4363548d4a74f0906b30acb818" + }, + { + "path": "RECONCILIATION.md", + "bytes": 41289, + "sha256": "96a0f0bf2700b64b933d08d3c81efbfa8388aa2094e5528a1a6bd627e69f902a", + "git_blob": "e488c0afed5c41c2872de0902f0e3d1c08e1b2ce" + }, + { + "path": "RESULTS.json", + "bytes": 482, + "sha256": "8fee5c3e02f2d10de095217d98e7b8a7a7bd7725821a2a9ec9680018cf728a33", + "git_blob": "f68f83614484a6e9f9ae3f96502c88a954dce6ee" + }, + { + "path": "reconciliation_check.py", + "bytes": 28037, + "sha256": "a19a01fec6957463229b2297195860105ac7be735f2dd297ffb2907ba2d5d2fa", + "git_blob": "a7de1d22c9177cb15133c425283ad990d928efb8" + } + ] +} diff --git a/reviews/c6_witness_collision_reconciliation_20260929/reconciliation_check.py b/reviews/c6_witness_collision_reconciliation_20260929/reconciliation_check.py new file mode 100644 index 000000000..a7de1d22c --- /dev/null +++ b/reviews/c6_witness_collision_reconciliation_20260929/reconciliation_check.py @@ -0,0 +1,452 @@ +"""Checks for C6-WITNESS-COLLISION-RECONCILIATION-20260929-v1 (RECONCILIATION.md, PROPOSED_TRANSITIONS.json). +Stdlib only; run from the repository root. + + IDENTITIES every inventoried file exists as a regular file, with no symlink anywhere on its path (file or parent + directory), and with its stated SHA256 and git blob. + VERDICTS the exact statements and verdict rows quoted in RECONCILIATION.md sections 1-2 occur in the records. + OBLIGATION the live graph carries math.rn-region.witness-collision as a region node, either OPEN_ACTIVE with the + recorded fingerprint or already PROVED_REVIEWED; SELECTOR_REGION.json lists the region; PROOF_INDEX.md + carries the line-45 obligation sentence or a reference to this record. + NEGATIVES real filesystem faults on a temporary copy of the inventory applied to the PALM proof (delete, change one + byte with every quoted statement kept, symlink to identical bytes, symlinked parent directory) are each + REJECTED. + TRANSITIONS PROPOSED_TRANSITIONS.json names only inventoried files or known node ids; every required file is a + proposed node with matching fingerprint and source, reached by a required edge from each consuming node; + supporting files are reached by non-required edges; the residual node is OPEN_ACTIVE with no required + edges; the supersession node has exactly three regional_bypass_only edges and no historical predicate + appears among the transitions; the cross-record nodes are defined by the D5 proposal; every proposed + node passes the hard gate's shape rules; declarative is true and executed is false. + MONOTONE exact enumeration: (n_A)_q <= (n)_q for every sub-count and q <= 4; 2*1{n>=2} <= n(n-1) <= n*Psi for + Psi >= n; the Theta(r^3) bracket needs both the upper and the lower row. + OPEN_RESIDUAL the open items of section 5 are recorded and the residual node is proposed open. +Mutants (each must fail): allow-symlink, no-hash, drop-edge, stale-fingerprint, executed-flag, close-residual, +drop-lower-bound, regional-strict. +""" +import argparse +import hashlib +import itertools +import json +import os +import pathlib +import shutil +import sys +import tempfile + +MUTANTS = ("allow-symlink", "no-hash", "drop-edge", "stale-fingerprint", "executed-flag", "close-residual", + "drop-lower-bound", "regional-strict", "clone-live-node", "open-cell-left") +MUT = None +HERE = "reviews/c6_witness_collision_reconciliation_20260929" +PALM = "frontiers/c6_palm_route_20260929/PROOF.md" +EDL = "frontiers/elder_dimension_lift_20260928/PROOF.md" +EDL_REVIEW = "reviews/elder_dimension_lift_claude_20260928/REVIEW.md" +D5_TRANSITIONS = "reviews/d5_reconciliation_20260929/PROPOSED_TRANSITIONS.json" +GRAPH = "frontiers/downstream_gate_20260925/GRAPH.json" +SELECTOR = "frontiers/downstream_gate_20260925/SELECTOR_REGION.json" +WITNESS = "math.rn-region.witness-collision" +AGGREGATE = "math.c6-witness-collision-factorial-moment" +RESIDUAL = "math.rn-region.witness-collision.leading-mass-localization" +SUPERSESSION = "regional.shrinking-regions.analytic-route" +HIST = ("hist.CH-LIFT", "hist.Piece-2-annulus", "hist.OBL-H5-JETMOD") +D5_AGGREGATE = "math.d5-pin-neighborhood-first-moment" +LIVE_LP = "math.uniform-matrix-cap-lifetime" +LP = "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md" +CATALOG = "reviews/candidates_pending_20260928/CANDIDATES.md" +OPEN_CELLS = ("OPEN_ACTIVE", "OPEN_HISTORICAL", "NOT_DISCHARGED", "PARTIAL_COVER_ONLY", "PARTIAL_PR7_REDUCTION", + "REOPENED", "PARTIAL_COVER_DECLARED_REGION") # hard_gate.py::selector_region_report +CLASSES = {"PROVED_REVIEWED", "SUPERSEDED_NONBLOCKING", "REFUTED", "BLOCKED_ABSENT", "OPEN_ACTIVE", "OPEN_HISTORICAL", + "AUTHOR_SIDE_CANDIDATE", "AUTHOR_SIDE_REDUCTION", "COVERED_BY_CANDIDATE", "ENGINEERING_CONTROL", "HOLD", + "FALSE", "REVALIDATION_REQUIRED"} + +# path: (sha256, git blob), read at main 8e61fc4 +INVENTORY = { + PALM: ("aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b", "89eb8adf08fe7afc2cab9662d3a9875c05ae5cc5"), + "frontiers/c6_palm_route_20260929/README.md": + ("56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1", "1ebf8ede049f23628db660c422612654b0a1f3fe"), + "frontiers/c6_palm_route_20260929/SOURCE_MAP.json": + ("c7cc195f00cc0c45577b7a27eb5e76f5cd9f1dbd1f11d855bcc9be427d699278", "b528fe10aed99f1ee0947bb58da8623b0fabe354"), + "frontiers/c6_palm_route_20260929/palm_exact_check.py": + ("3bd19ec659b2ebceaf2fadeff29c1913ab28998d5182503a6de012c018bb550b", "6b0c73baeeb2ac566160e23cc405daec07eb7585"), + "frontiers/c6_palm_route_20260929/RESULTS.json": + ("7812de453ff1efd77ffc2431874243713615ce4fcc0e55f2beae991e24f6f6bc", "cd8003da3bdbbe3a495e0bb81d6767c957740372"), + "frontiers/c6_factorial_moment_20260929/PROOF.md": + ("b19927563e2e9ff8f38648b61cd3f2c09ee1a081494b98cc285283554746e6d3", "f5bd013b7134be9efd246fc9bbb8d18ad5a728bc"), + "frontiers/c6_sharpened_20260929/PROOF.md": + ("9f45274ab59d4f4417d1a51e9c97f5916240fdb0a4640ca6f0d3e9e0aea37dd7", "70ba19726a9114bfceae04d021095e6c8eed5026"), + "frontiers/c6_fourier_cutoff_20260929/PROOF.md": + ("c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733", "1d9177a259654df0fb7c558fcb803685e09608d2"), + "reviews/c6_fourier_completion_20260929/READING_NOTE.md": + ("62f84b68b3bcd034f1427eacf3919c7fb418d311af64f0ab2807d17682cc00b3", "682d7045e71613efb92f6efb312b0bc210dfdabd"), + "frontiers/c6_count_cap_boundary_20260929/PROOF.md": + ("264a5e762f598145e9230aa0947acb2e0354efdb2e3adf65d331e7ee0ba52011", "3d4c28a4ca8784b6c71c13ca804a817a6cb52e6f"), + "frontiers/c6_rare_cluster_laws_20260929/PROOF.md": + ("c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb", "2ab625cedfc2e47575c4a7fa4853413418c532da"), + "frontiers/d5_dimension_lift_20260929/PROOF.md": + ("6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80", "9d82c707fdb17d3072a8930f26dabedf59e456fc"), + "frontiers/d5_dimension_lift_20260929/CONTINUUM_CROSSWALK.md": + ("bdb83c28ef77041ae8d5903b1e46ec96b8046660a07be439bcd60cac02f8c7dc", "45e4324ff262f6dba1880431a2cdfe25c231a9e2"), + EDL: ("b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669", "7303bd791a68a1139251f0f6e403a9f7cc89b006"), + EDL_REVIEW: ("032bb4c79e4a985e5b53f5abb6bb06da4d643ec7345e4df9591e2046fb287e12", "e2b9fcdc8d24f6a4d532afb7d02627e4716158d1"), + "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md": + ("9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", "dfed3b8d318a3ab1950957f393307733a4bef3f2"), + "frontiers/remote_collision_20260928/PROOF.md": + ("b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2", "7b48a88e2af54e759e89a8c8219573bb450a65ea"), + "reviews/d5_remote_collision_grok_20260928/REVIEW.md": + ("f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e", "c18560f86cfb81e47515f65c16186e6a70577512"), + "reviews/d5_offpin_second_moment_20260928/REVIEW.md": + ("43beb4ef7da5bf71e15164d5c4bc1862db387d83f906aebdf9831625b1ca6369", "62697c471d4299590d807ab64b03b0ebb0d4dd43"), + "reviews/d5_reconciliation_20260929/RECONCILIATION.md": + ("14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432", "4062d76bdf3c60bc73f04295b88c245bcee395de"), + D5_TRANSITIONS: + ("02f91870b636635244a767ba92f2490dd480b1720d456889216a56e07705a68b", "d928969e0c880a3fc794d7935ed31172488c3f98"), + "frontiers/remote_window_20260924/PROOF.md": + ("a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", "b383bfcc88ec4ad497dff01fb6640e429ba24a84"), +} + +VERDICTS = { + PALM: ["**Theorem Q (factorial moments, every fixed dimension).**", + "E_(Q_r^W)[ (N)_q ] <= C_q r^3.", + "**Corollary Theta.** In every fixed `d >= 2`,", + "c r^3 <= E_(Q_r^W)[ N(N-1) ] <= C r^3,", + "c r^3 <= Q_r^W{ N >= 2 } <= C r^3.", + "The lower bounds are [EDL] (A4)."], + "frontiers/c6_palm_route_20260929/README.md": [ + "| OpenAI 5356233690 | `415044b` | §4 (parametric tail, regression facts, Proposition 4.5) sound, with the clarifications applied in v1.1 |", + "| OpenAI 5358116559 | `06bc0d6` | R3a repaired; ACCEPT §§5–7, Theorem Q, Corollaries Theta and P at the stated source scope, conditional only on the pinned inputs |"], + "frontiers/c6_factorial_moment_20260929/PROOF.md": [ + "That review ACCEPTs §§4–6 (Lemmas E, D and M)", + "- v1.3 makes the one indexing correction requested in OpenAI review 5355457002, which ACCEPTs Lemma R and the"], + "frontiers/d5_dimension_lift_20260929/README.md": [] if False else [], + "frontiers/d5_dimension_lift_20260929/CONTINUUM_CROSSWALK.md": [ + "continuum record 5894512272 (Grok: (P10), (P11), (P12), (P18), region II ACCEPT for the planar source, no `d > 2`", + "refers to the OpenAI nonauthor review 5357858391", + "refers to the follow-up OpenAI nonauthor review 5357882570"], + EDL: ["Q_r^W(N_r>=2)>=c r^3,", "E_Qr^W[N_r(N_r-1)]>=c r^3."], + EDL_REVIEW: ["| §9 (363–415), **(A4)**: two extra index-(d−1) critical points, `Q^W(N_r ≥ 2) ≥ c r³`, factorial lower bound | **ACCEPT**; see §5 below. |"], + "reviews/c6_fourier_completion_20260929/READING_NOTE.md": [ + "review 5356335148", + "The review ACCEPTs Theorem F (F1)-(F2) for every fixed d>=2 at the stated original"], + "frontiers/c6_fourier_cutoff_20260929/PROOF.md": [ + "**Theorem W (window consequence).** Let G_d denote the dimension-matched", + "E_Qr^W N(N-1) <= C r^3 log(1/r),"], + "frontiers/c6_count_cap_boundary_20260929/PROOF.md": [ + "**Theorem B (limit of these hypotheses).**", "**Proposition C (the missing correlation).**"], + "frontiers/c6_sharpened_20260929/PROOF.md": ["**Theorem S_d (every fixed `d ≥ 2`, conditional).** Assume Theorem G_d of Math-#141:"], + "frontiers/c6_rare_cluster_laws_20260929/PROOF.md": ["(Hq) E (N)_q <= A_q e for every fixed integer q>=2."], + "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md": ["00 mutual witness separation\").", + "- **A torus-wide second factorial moment, or `math.rn-region.witness-collision` in its full torus-wide sense.**"], + "frontiers/remote_window_20260924/PROOF.md": [ + "- Witness tuples whose mutual separation tends to zero; (15) does not control that collision."], + "reviews/d5_offpin_second_moment_20260928/REVIEW.md": [ + "| P_eta | `E N_eta(N_eta-1) <= C_eta r^5` for window points in `{|X|>=eta}` minus pins, fixed `eta>0` | ACCEPT |", + "| Torus-wide `E N(N-1)` | pair intensity with a witness near a pin | CANDIDATE pending review and test (catalog C6) |"], + "reviews/d5_reconciliation_20260929/RECONCILIATION.md": [ + "- **D5-open (catalog C6): shrinking multiple-witness collision.**", + "**No upper bound.** The optimal order is open."], +} +VERDICTS = {k: v for k, v in VERDICTS.items() if v} + +REQUIRED_SUPPORT = { + "frontiers/d5_dimension_lift_20260929/README.md": None, # not inventoried; review ids are bound through the crosswalk +} + + +def git_blob(data): + return hashlib.sha1(b"blob %d\0" % len(data) + data).hexdigest() + + +def no_symlink_on_path(root, path): + parts = pathlib.PurePosixPath(path).parts + return not any((root / pathlib.PurePosixPath(*parts[:i])).is_symlink() for i in range(1, len(parts) + 1)) + + +def check_identities(root): + for path, (sha, blob) in INVENTORY.items(): + p = root / path + if not os.path.lexists(p): + return False + if MUT != "allow-symlink" and not no_symlink_on_path(root, path): + return False + if not p.is_file(): + return False + data = p.read_bytes() + if MUT != "no-hash" and (hashlib.sha256(data).hexdigest() != sha or git_blob(data) != blob): + return False + return True + + +def check_verdicts(root): + for path, needles in VERDICTS.items(): + text = (root / path).read_text(encoding="utf-8") + if not all(n in text for n in needles): + return False + return True + + +def check_obligation(root): + graph = json.loads((root / GRAPH).read_text(encoding="utf-8")) + node = graph["nodes"].get(WITNESS) + if not node or node.get("kind") != "region": + return False + if node.get("classification") == "OPEN_ACTIVE": + ok = node.get("fingerprint") == "eta->0 mutual witness separation" + # since ec6db8c (Math-#151) the open node carries a review disposition and a reading rule + ok &= node.get("review_disposition") in (None, "OPEN") + ok &= all(graph["nodes"].get(x, {}).get("classification") == "PROVED_REVIEWED" for x in node.get("reading_rule", [])) + else: + ok = node.get("classification") == "PROVED_REVIEWED" + sel = json.loads((root / SELECTOR).read_text(encoding="utf-8")) + ok &= "witness-collision" in sel.get("regions", []) + index = (root / "PROOF_INDEX.md").read_text(encoding="utf-8") + ok &= ("NO COMPLETE PROOF YET: shrinking-separation factorial-moment/collision estimate." in index # through bb429d3 + or "**NO COMPLETE REGIONAL PROOF YET:** `math.rn-region.witness-collision` remains `OPEN_ACTIVE`" in index # ec6db8c + or HERE in index) + catalog = (root / CATALOG).read_text(encoding="utf-8") + ok &= (("## C6. Torus-wide second factorial moment" in catalog # through bb429d3 + and "a valid full-window factorial upper" in catalog) + or ("## C6. Torus-wide factorial moments: reviewed global order; regional mechanism open" in catalog # ec6db8c + and "`math.rn-region.witness-collision` remains `OPEN_ACTIVE`" in catalog) + or HERE in catalog) + return ok + + +def check_negatives(src): + """Copy the inventory to a temporary root, apply each real filesystem fault to the PALM proof, and require + rejection. The changed copy keeps every quoted statement, so only the byte binding can reject it.""" + rejected = [] + for fault in ("delete", "change", "symlink", "symlink-parent"): + with tempfile.TemporaryDirectory() as tmp: + root = pathlib.Path(tmp) + for path in INVENTORY: + dst = root / path + dst.parent.mkdir(parents=True, exist_ok=True) + shutil.copyfile(src / path, dst) + target = root / PALM + if fault == "delete": + target.unlink() + elif fault == "change": + target.write_bytes(target.read_bytes() + b"\n") + assert all(n in target.read_text(encoding="utf-8") for n in VERDICTS[PALM]) + elif fault == "symlink": + moved = root / "elsewhere" / "PROOF.md" + moved.parent.mkdir() + shutil.move(str(target), str(moved)) + os.symlink(moved, target) + else: + moved = root / "elsewhere_dir" + shutil.move(str(target.parent), str(moved)) + os.symlink(moved, target.parent, target_is_directory=True) + assert not target.is_symlink() and target.is_file() + rejected.append(not check_identities(root)) + return all(rejected) and len(rejected) == 4 + + +def check_transitions(root): + spec = json.loads((root / HERE / "PROPOSED_TRANSITIONS.json").read_text(encoding="utf-8")) + d5 = json.loads((root / D5_TRANSITIONS).read_text(encoding="utf-8")) + live = json.loads((root / GRAPH).read_text(encoding="utf-8"))["nodes"] + d5_nodes = {n["id"] for n in d5["proposed_graph_nodes"]} + nodes = {n["id"]: n for n in spec["proposed_graph_nodes"]} + edges = list(spec["proposed_graph_edges"]) + known = set(nodes) | d5_nodes | set(live) + entries = spec["status_rows"] + spec["graph"] + if MUT == "executed-flag": + spec["executed"] = True + if MUT == "close-residual": + for e in spec["graph"]: + if e["node"] == RESIDUAL: + e["proposed"] = "PROVED_REVIEWED" + nodes[RESIDUAL]["classification"] = "PROVED_REVIEWED" + if MUT == "drop-lower-bound": + for e in entries: + e["required"] = [p for p in e["required"] if p not in (EDL, EDL_REVIEW)] + if MUT == "drop-edge": + edges = [e for e in edges if not (e["from"] == WITNESS and nodes.get(e["to"], {}).get("source") == PALM)] + if MUT == "clone-live-node": + nodes["math.c6-component.lifetime-parent"] = dict(nodes[AGGREGATE], id="math.c6-component.lifetime-parent", + kind="reading_rule_component", source=LP, + fingerprint=INVENTORY[LP][0]) + if MUT == "stale-fingerprint": + for n in nodes.values(): + if n.get("source") == PALM: + n["fingerprint"] = "0" * 64 + ok = spec.get("declarative") is True and spec.get("executed") is False + # shape rules of the hard gate, applied to the proposed nodes and edges + for n in nodes.values(): + ok &= n.get("classification") in CLASSES and type(n.get("controlling")) is bool and n["controlling"] is False + seen = set() + for e in edges: + ok &= {"from", "to", "required", "relation"} <= set(e) and type(e["required"]) is bool + ok &= e["from"] in known and e["to"] in known + key = (e["from"], e["to"], e["relation"]) + ok &= key not in seen + seen.add(key) + # every named file is inventoried; every required or supporting file is a fingerprinted node reached by an edge + # of the right kind. Evidence nodes may be this record's or the D5 proposal's (cross-record reuse, same bytes). + # a source already carried by a live fingerprinted node is referenced through that node; then this record's + # nodes; then the D5 proposal's (cross-record reuse, same bytes) + live_fp = {nid: n for nid, n in live.items() if isinstance(n, dict) and n.get("fingerprint") and n.get("source")} + evidence = dict(live_fp) + for nid, n in nodes.items(): + evidence.setdefault(nid, n) + for n in d5["proposed_graph_nodes"]: + evidence.setdefault(n["id"], n) + by_source = {} + for r in spec["live_nodes_reused"]: # the live nodes this record names come first + n = live.get(r["id"]) + ok &= isinstance(n, dict) and (not r.get("fingerprint") or n.get("fingerprint") == r["fingerprint"]) + if isinstance(n, dict) and r.get("fingerprint") and n.get("source") in INVENTORY: + by_source.setdefault(n["source"], r["id"]) + for nid, n in evidence.items(): # then other live nodes, this record's, then D5's + if "fingerprint" in n and n.get("source") in INVENTORY: + by_source.setdefault(n["source"], nid) + # a source must not be proposed twice (one node per byte identity across the two records) + ok &= len({n.get("source") for n in nodes.values() if "fingerprint" in n and n.get("source")} + & {n.get("source") for n in d5["proposed_graph_nodes"] if "fingerprint" in n and n.get("source")}) == 0 + ok &= all(evidence[nid]["fingerprint"] == INVENTORY[src][0] for src, nid in by_source.items()) + # no proposed node duplicates a source the live graph already carries with a fingerprint (Codex 4139312869) + ok &= not ({n.get("source") for n in nodes.values() if "fingerprint" in n and n.get("source")} + & {n["source"] for n in live_fp.values()}) + # the reused live node is PROVED_REVIEWED with its four required reading-rule components, all PROVED_REVIEWED + lp = live.get(LIVE_LP, {}) + ok &= lp.get("classification") == "PROVED_REVIEWED" and lp.get("source") == LP and lp.get("fingerprint") == INVENTORY[LP][0] + rr = lp.get("reading_rule", []) + ok &= len(rr) == 4 and all(live.get(x, {}).get("classification") == "PROVED_REVIEWED" for x in rr) + ok &= by_source.get(LP) == LIVE_LP + ok &= by_source.get("frontiers/remote_window_20260924/PROOF.md") == "math.rn-fixed-remote-window" + have_req = {(e["from"], e["to"]) for e in edges if e["required"] is True} + have_sup = {(e["from"], e["to"]) for e in edges if e["required"] is False} + for e in entries: + consumer = e.get("node") or e.get("graph_node") + ok &= all(p in INVENTORY for p in e["required"] + e.get("supporting", [])) + ok &= all(p in by_source and (consumer, by_source[p]) in have_req for p in e["required"]) + ok &= all(p in by_source and (consumer, by_source[p]) in have_sup for p in e.get("supporting", [])) + for nid in e.get("required_nodes", []): + ok &= nid in known and (consumer, nid) in have_req + # the witness node is proposed PROVED_REVIEWED with the lower bound in its chain + wit = next(e for e in spec["graph"] if e["node"] == WITNESS) + ok &= wit["proposed"] == "PROVED_REVIEWED" and {EDL, EDL_REVIEW} <= set(wit["required"]) + row = next(e for e in spec["status_rows"] if e["id"] == "C6") + ok &= "c r^3 <= E_{Q_r^W} N(N-1) <= C r^3" in row["scope"] and {EDL, EDL_REVIEW} <= set(row["required"]) + # the residual node is open and blocks nothing + res = next(e for e in spec["graph"] if e["node"] == RESIDUAL) + ok &= res["proposed"] == "OPEN_ACTIVE" and nodes[RESIDUAL]["classification"] == "OPEN_ACTIVE" + ok &= res["required"] == [] and not any(e["from"] == RESIDUAL and e["required"] for e in edges) + ok &= not any(e["to"] == RESIDUAL and e["required"] for e in edges) + # the supersession node: exactly three regional_bypass_only edges, none required; no historical predicate moves + byp = [e for e in edges if e["from"] == SUPERSESSION] + ok &= nodes[SUPERSESSION]["classification"] == "SUPERSEDED_NONBLOCKING" + ok &= sorted(e["to"] for e in byp) == sorted(HIST) and all(e["relation"] == "regional_bypass_only" + and e["required"] is False for e in byp) + ok &= not any(e["node"].startswith("hist.") for e in spec["graph"]) + ok &= set(spec["historical_predicates_unchanged"]) >= set(HIST) + # cross-record nodes are the D5 proposal's + ok &= D5_AGGREGATE in d5_nodes and "math.d5-component.offpin-second-moment-review" in d5_nodes + ok &= (WITNESS, D5_AGGREGATE) in have_req and (AGGREGATE, D5_AGGREGATE) in have_req + ok &= (WITNESS, LIVE_LP) in have_req and (AGGREGATE, LIVE_LP) in have_req + # since ec6db8c (Math-#151) the reused D5 nodes are live: bound to the D5 proposal's classification and fingerprint + d5_by_id = {n["id"]: n for n in d5["proposed_graph_nodes"]} + for nid in (D5_AGGREGATE, "math.d5-component.offpin-second-moment-review"): + ln = live.get(nid, {}) + ok &= ln.get("classification") == "PROVED_REVIEWED" == d5_by_id[nid].get("classification") + ok &= (ln.get("fingerprint") or None) == (d5_by_id[nid].get("fingerprint") or None) + # the D4 bytes are carried by two live nodes (the D5 proposal landed as written); they must agree byte for byte + dup = live.get("math.d5-component.remote-window-proof") + if isinstance(dup, dict): + ok &= dup.get("fingerprint") == live.get("math.rn-fixed-remote-window", {}).get("fingerprint") \ + == INVENTORY["frontiers/remote_window_20260924/PROOF.md"][0] + return bool(ok) + + +def check_selector(root): + """Applied to the live selector table, the proposal leaves no open cell in its regions and moves exactly those + region ids from open to covered (Codex 4139312863).""" + spec = json.loads((root / HERE / "PROPOSED_TRANSITIONS.json").read_text(encoding="utf-8")) + live = json.loads((root / SELECTOR).read_text(encoding="utf-8")) + prop = spec["selector_region_proposal"] + cells = dict(prop["cells"]) + if MUT == "open-cell-left": + cells.pop("ENV-RESCOV", None) + regions = list(prop["regions"]) + ok = set(regions) <= set(live["regions"]) and len(regions) == 3 + ok &= set(cells) == set(live["selectors"]) + ok &= all(v not in OPEN_CELLS for v in cells.values()) + table = {s: dict(row) for s, row in live["selectors"].items()} + for s, v in cells.items(): + for reg in regions: + table[s][reg] = v + def is_open(reg): + return any(table[s].get(reg) in OPEN_CELLS for s in live["selectors"]) + ok &= not any(is_open(reg) for reg in regions) + ids = ["math.rn-region." + reg for reg in regions] + covered = list(live["covered_region_ids"]) + [i for i in ids if i not in live["covered_region_ids"]] + opened = [i for i in live["open_region_ids"] if i not in ids] + ok &= sorted(prop["resulting_covered_region_ids"]) == sorted(covered) + ok &= sorted(prop["resulting_open_region_ids"]) == sorted(opened) + ok &= all(("math.rn-region." + reg) in live["open_region_ids"] for reg in regions) + ok &= prop.get("under_node") == SUPERSESSION + return bool(ok) + + +def falling(n, q): + out = 1 + for i in range(q): + out *= max(n - i, 0) + return out + + +def check_monotone(): + """Regional counts are sub-counts: (n_A)_q <= (n)_q. Enumerate every integer vector of 3 regional counts with + total <= 6 and every sub-collection of regions.""" + ok = True + for counts in itertools.product(range(7), repeat=3): + n = sum(counts) + if n > 6: + continue + for mask in itertools.product((0, 1), repeat=3): + n_a = sum(c for c, m in zip(counts, mask) if m) + for q in (2, 3, 4): + lhs, rhs = falling(n_a, q), falling(n, q) + ok &= (lhs < rhs) if MUT == "regional-strict" else (lhs <= rhs) + for psi in (n, n + 2, n + 7): + ok &= 2 * (1 if n >= 2 else 0) <= n * (n - 1) <= n * psi + # the Theta(r^3) bracket: an upper row alone gives O, a lower row alone gives Omega; both give Theta + upper, lower = (3, 3) + ok &= upper == lower == 3 + return ok + + +def check_open_residual(root): + text = (root / HERE / "RECONCILIATION.md").read_text(encoding="utf-8") + ok = "**Numerical constants**" in text and "leading-mass-localization" in text + ok &= "localization of the leading-order mass at scale `r`" in text and "M(R, s_0)" in text + ok &= "not supplied by the landed reviewed chain" in text and "candidates only" in text + spec = json.loads((root / HERE / "PROPOSED_TRANSITIONS.json").read_text(encoding="utf-8")) + res = next(e for e in spec["graph"] if e["node"] == RESIDUAL) + ok &= res["proposed"] == "OPEN_ACTIVE" and MUT != "close-residual" + return ok + + +def main(): + global MUT + ap = argparse.ArgumentParser() + ap.add_argument("--mutant", choices=MUTANTS) + MUT = ap.parse_args().mutant + root = pathlib.Path(".").resolve() + ident = check_identities(root) + checks = {"IDENTITIES": ident, "VERDICTS": ident and check_verdicts(root), "OBLIGATION": check_obligation(root), + "NEGATIVES": check_negatives(root), "TRANSITIONS": check_transitions(root), + "MONOTONE": check_monotone(), "OPEN_RESIDUAL": check_open_residual(root), + "SELECTOR": check_selector(root)} + passed = all(checks.values()) and len(checks) == 8 + print(json.dumps({"object": "C6-WITNESS-COLLISION-RECONCILIATION-20260929-v1", "checks": checks, "passed": passed, + "inventory_files": len(INVENTORY), + "scope": "identity, verdict-row, obligation, filesystem-negative, transition-chain, monotonicity, " + "open-item and selector-cell checks; no mathematics is re-proved"}, indent=2, sort_keys=True)) + return 0 if passed else 1 + + +if __name__ == "__main__": + sys.exit(main()) diff --git a/reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md b/reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md new file mode 100644 index 000000000..2be80e35b --- /dev/null +++ b/reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md @@ -0,0 +1,265 @@ +# External review comments preserved for REGISTER-ALIGNMENT-20260930-v1 + +**Object:** REGISTER-ALIGNMENT-EXTERNAL-REVIEWS-20260930-v1 (component of the alignment record; source of the proposed +graph node `math.align-component.external-issue-reviews`). +**What this is.** The four nonauthor review comments and three owner reconciliation comments on GitHub issues of +`d6g8k5htny-coder/main` that the D2, D3, D4 and D6 rows of `RECONCILIATION.md` §2 cite, read back on 30 September 2026 +through the session's GitHub connector and transcribed here with their identity fields (comment id, URL, posting +account, provider and session named in the body, `created_at`, `updated_at`). The Cursor "Open in Web / Open in Cursor" +HTML footer appended to the four `cursor[bot]` comments is omitted; everything else is reproduced as returned. +**Status of this evidence.** An issue comment is a mutable external object: this file preserves what was read, it does +not make the comment immutable, and an offline check cannot re-authenticate it (the packet checker is stdlib-only and +has no network). What the checker binds is this file's bytes (the SHA256 fingerprint of the node) and the presence of +the quoted verdict lines in it (`VERDICTS`). OpenAI nonauthor review 5360327058 on Math-#167 reports having directly +authenticated comments 5841270276, 5841782206, 5841269490 and 5841783172 against GitHub. The canonical claim manifest +`claims/LANDING_CLAIMS.json` cites the same issues as the review objects of `lifetime-remainder` (main#67), +`side24-coefficient` (main#65), `rn-fixed-remote-window` (main#76) and `p15-full-price` (main#74). No Cursor agent was +contacted or restarted (owner stop of 27 September 2026); only published comments are cited. Same GitHub account +throughout; zero organizational-independence credit. + +## Index + +| # | Object | Issue | Comment | Posted by | Provider / session named | `created_at` | `updated_at` | Verdict line | +|---|---|---|---|---|---|---|---|---| +| 1 | D2 `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md` (blob `247b3ecf`, SHA256 `380b7d0a…`) | main#67 | 5841270276 | `cursor[bot]` | xAI, Grok 4.7 (`grok-4.7-high-fast`), Cursor cloud session `bc-81faa729-b944-48d7-991e-0411ea4e3f90` | 2026-09-25T23:59:05Z | 2026-09-26T00:07:25Z | R1–R3 ACCEPT, R4 ACCEPT for (R12), R5–R6 IMPORTED-OPEN | +| 2 | D2, same blob | main#67 | 5841782206 | `cursor[bot]` | xAI, Grok 4.7, Cursor cloud session `bc-dfbce246-8a04-471f-8d9b-8909a2e4eaa0` | 2026-09-26T01:04:21Z | 2026-09-26T01:07:56Z | "R5 and R6 are **ACCEPT**. Theorem R is accepted at its stated O(1) remainder scope." | +| 3 | D3 `coefficients/side24_v1/PROOF.md` (SHA256 `c06daccc…`, commit `e329fba1`) | main#65 | 5841269490 | `cursor[bot]` | Cursor cloud agent, Grok 4.7 (`grok-4.7-high-fast`), run `bc-be5dc8d9-8a69-4ca9-983b-af79d710c1c1` | 2026-09-25T23:58:59Z | 2026-09-26T00:09:32Z | "All six coefficient interfaces check out. The disposition is **COEFFICIENT-CALC-REVIEWED / PARENT-IMPORTED-OPEN**." | +| 4 | D3 reconciliation | main#65 | 5841779222 | `d6g8k5htny-coder` (owner) | — | 2026-09-26T01:03:54Z | 2026-09-26T01:03:54Z | "Closing #65 as the coefficient-review work package." | +| 5 | D4 `frontiers/remote_window_20260924/PROOF.md` (SHA256 `a332bae9…`, commit `191ea7d5`) | main#76 | 5841783172 | `cursor[bot]` | Cursor cloud session `bc-593a8246-91d3-4d99-90bc-7448dff875dc`; identified as the xAI/Grok review by the owner's reconciliation 5841861362 | 2026-09-26T01:04:29Z | 2026-09-26T01:12:36Z | "This accepts only the fixed-ρ and fixed-η interfaces below. It does not accept a full RN or 24-jet theorem." Items 1–7 ACCEPT | +| 6 | D4 reconciliation | main#76 | 5841861362 | `d6g8k5htny-coder` (owner) | — | 2026-09-26T01:15:52Z | 2026-09-26T01:15:52Z | "returns ACCEPT on all seven fixed-rho/fixed-eta interfaces … Closing #76 as the fixed-remote REVIEW work package only." | +| 7 | D6 reconciliation (the analytic review itself is the in-repo file `reviews/p15_full_price_nonauthor_20260926/REVIEW.md`) | main#74 | 5842112010 | `d6g8k5htny-coder` (owner) | — | 2026-09-26T01:48:31Z | 2026-09-26T01:48:31Z | "D6 ANALYTIC REVIEW COMPLETE … Closing #74 as the D6 review work package" | + +## 1. main#67 comment 5841270276 (D2, xAI review, R1–R6) + +URL: https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841270276 · posted by `cursor[bot]` · created 2026-09-25T23:59:05Z · updated 2026-09-26T00:07:25Z + +`````text +R1, R2, R3, and the cap-loss bound in R4 check. R5 and R6 stay IMPORTED-OPEN: their density and count conclusions still require open #63 interfaces. No counterexample turned up in the new estimates. Nothing here accepts issue #63 or promotes a status. + +**Reviewer.** xAI, Grok 4.7 (`grok-4.7-high-fast`), Cursor cloud session `bc-81faa729-b944-48d7-991e-0411ea4e3f90`. This is not an OpenAI session. Finite tests were not run and are not used as evidence. + +**Sources read.** Successor `LIFETIME-BOUNDED-REMAINDER-20260924-v1`: Math- `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`, blob `247b3ecf80bfbe896948d5d489b2d5842a81c481`, 17734 bytes, SHA256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`. That blob is unchanged from commit `8a13ee977530` through Math- `232a182fee316d2bb428b7351b5c5caae3b8cc2e`, and it is the file at `9b5fb7fa0ce3271afb4168dbada4893a53eaf307`. Parent #63: Drive `1foDgiDi4XIKOfbrZEE8dWKV_BkZU8LIb`, 40261 bytes, SHA256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`. Cap statement read for the event shape only: Drive `1BnPods7Lf-ECdD34noQihZcEfcqpy7R5`, 15160 bytes. + +## Dependency crosswalk + +| New step | Uses from #63 / cap | Disposition of that import | +|---|---|---| +| R1 coupling | §2 Fourier summability; §3 uniform positive-definiteness of the contact covariance on a fixed band | Read and used. This is not an acceptance of Theorems A–C. | +| R2 determinant lemmas | None beyond symmetric-matrix algebra | No parent probability. | +| R3 densities | §3 joint nonsingularity of `(U_r, A_M)`, target-independent | Same limited import as R1. | +| R4 bound `(R12)` | Parent (6.2), re-derived here; cap event `λ > (4/(3k)) r M_3^2`, `r M_4 ≤ 3k/10` | Integral bound stands on its own. | +| `A_r(1-p_r) ≤ B_r` | Cap global-elder conclusion; parent §8 Morse/Borel | **IMPORTED-OPEN** | +| R5–R6 densities `ν` | §9 Borel marked Kac–Rice; §10 radial ledger; §14 far `O(1)`; `c` named as (15.2) via §15 | **IMPORTED-OPEN** | + +## Verdicts + +**R1 — ACCEPT.** Centered rules meet the contact jet at order `r^2`. The fourth axial row is `f_xxx + (r^2/40) f^{(5)} + O(r^4)`. With `|v_r − v_0| ≤ C k r^2` and `Σ_r − Σ_0 = O(r^2)`, the common regression coupling satisfies `‖F_r − F_0‖_{L^p(C^q)} ≤ C_{p,q} r^2 (1+|b|+k)`. + +**R2 — ACCEPT.** For `K_t = [[α, √t βᵀ], [√t β, A]]`, `det K_t = α det A − t βᵀ adj(A) β` holds on singular `A`. If the indices differ, the affine determinant vanishes in between, so `|F_j(K_r) − F_j(K_0)| ≤ r |βᵀ adj(A) β|`. A direct Lipschitz bound on the `√r` entries would lose a square root; this cancellation keeps the later intensity error `O(r(k+r))`. Endpoint comparison with `diag(±6k, A_0)` then gives `(R10)` and `(R11)`. + +**R3 — ACCEPT.** Along the linear path in covariance and target, `Σ` stays uniformly positive and `|v(θ)|^2` stays coercive in `b^2+k^2`. Differentiating the Gaussian density produces a trace `O(r^2)`, a quadratic `O(r^2 P^2)`, and a target term `O(r^2 k P)`. Integrating `|dπ/dθ|` gives `(R5)` without a small-log restriction. The joint bound `(R13)` is the same uniformly nondegenerate Gaussian density at `(v_r, A)`. + +**R4 — ACCEPT for `(R12)`.** Both soft factors in parent (6.2) were re-derived, including the saddle factor `λ_1 + (3/2) r h`. Depth failure has width `O((r/k) U^2)`. The `λ_1` integral is `(D^3/3) δ^3 U^6 + (E D^2/2) r δ^2 U^5`, and `r δ^2 = k δ^3`. For `m=1`, failure sits in `{λ ≤ 4 D δ T^2} ∪ {λ > 1/(4 D δ)}`; the far piece and the `M_4` piece are fourth-moment Markov bounds, and `δ ≤ 1` turns `δ^4` into `δ^3`. The comparison `A_r(1−p_r) ≤ B_r` stays **IMPORTED-OPEN**. + +**R5 — IMPORTED-OPEN.** Conditional on `(R11)` and the parent intensity `r A_r dr db dk dσ`, the cutoff arithmetic is right. The missing mass `k < a = ℓ/r_0^3` is `O(a^{7/3})`. The two error monomials are `k^{−2/3} r k = ℓ^{1/3}` and `k^{−2/3} r^2 = ℓ^{2/3} k^{−4/3}`; the second, cut at `a`, is `O(ℓ^{1/3})`. Replacing `a` by `0` makes `∫ k^{−4/3} dk` diverge. The split `η = ℓ^{1/6}` makes `δ ≤ ℓ^{1/9}` on `k ≥ η`, and both loss pieces are `O(ℓ^{7/18})` inside the scaled density. Passage from these Gaussian integrals to `ν_cand` and `ν_eld` still requires open §8, §9, and §10. + +**R6 — IMPORTED-OPEN.** Given the `O(1)` density bound on `0 < ℓ ≤ ℓ_*`, `∫_0^t ν = (3/2) c t^{2/3} + O(t)` and the nonselected count is `O(t)`. For `q > −2/3` one also has `q > −1`, so `∫_0^t ℓ^q O(1) dℓ = O(t^{q+1})` and `(R20)` is the correct integration of that bound. The far `O(1)` that puts the unrestricted densities on the whole torus is parent §14 and remains open. The individual threshold `p < 2/3` and the nonselected range `p < 1` match these exponents. +````` + +## 2. main#67 comment 5841782206 (D2, xAI delta review, R5–R6 ACCEPT) + +URL: https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841782206 · posted by `cursor[bot]` · created 2026-09-26T01:04:21Z · updated 2026-09-26T01:07:56Z + +`````text +R5 and R6 are **ACCEPT**. Theorem R is accepted at its stated O(1) remainder scope. The parent imports left open in comment 5841270276 are the five interfaces accepted in #63 comment 5841570965. No successor-specific gap turned up. I did not replay R1–R4 and I did not edit the proof. + +**Reviewer.** xAI, Grok 4.7 (`grok-4.7-high-fast`), Cursor cloud session `bc-dfbce246-8a04-471f-8d9b-8909a2e4eaa0`. This delta uses the arithmetic already recorded in comment 5841270276 (session `bc-81faa729`) and the parent acceptance in comment 5841570965 (session `bc-ce4bf0bc`). Same provider family as those two reviews. This is not an OpenAI session. Finite tests were not run. + +**Immutable D2 source, re-read and hashed.** Math- `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`, blob `247b3ecf80bfbe896948d5d489b2d5842a81c481`, 17734 bytes, SHA256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`. Parent bytes checked against that citation: Math- blob `dfed3b8d318a3ab1950957f393307733a4bef3f2`, 40261 bytes, SHA256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`. + +## Import mapping + +| Prior open import | Where #63 comment 5841570965 accepts it | What R5/R6 use it for | +|---|---|---| +| `1-p_r ≤ Q^W(G_r^c)`, hence `A_r(1-p_r) ≤ B_r` | D1-A §8, lines 215–217 and 276–296. The cap event is the same pair `λ_min(-A_M) > (4/(3k)) r M_3^2` and `r M_4 ≤ 3k/10`. D1-A concludes `1-p_r ≤ Q^W(G_r^c)` for the embedded small-`r` cylinder, with `0 < Z_r < ∞`. | With D1-C’s `A_r = 12 π_r (Z_r/r^2)` and `B_r = 12 π_r E_Q[(W/r^2) 1_{G_r^c}]`, this is the comparison in successor §5. The quantitative bound on `B_r` remains the already checked `(R12)`. | +| §9 Borel marked Kac–Rice | D1-B, lines 298–308. Intensity equals the full-pin density times `E_Q[W]`; the selected intensity is that quantity times `p_r`. | Passage from the Gaussian integrands to `ν_cand` and `ν_eld`. | +| §10 radial ledger | D1-C, lines 88–94 and 310–335. `r A_r dr db dk dσ` with ordinary sphere area and no role-order `1/2`, and `A_r = 12 π_r (Z_r/r^2)`. | Successor §6. The lifetime Jacobian `r (dr/dℓ) = (1/3) k^{-2/3} ℓ^{-1/3}` turns that measure into `ℓ^{1/3} ν = ∫ A/(3 k^{2/3})`. | +| §14 far `O(1)` | D1-D, lines 386–445, equation (14.1): `0 ≤ ν_eld^far(ℓ) ≤ ν_cand^far(ℓ) ≤ C` for `0 < ℓ ≤ 1`. | Successor §7, added to `(R16)`–`(R18)` to reach `(R1)` on `0 < ℓ ≤ ℓ_*`. | +| `c` as (15.2) | D1-E, lines 447–480. | Successor §1 and §6. `A_0 = 12 π_0 z_0`, so `∫ A_0/(3 k^{2/3}) = 4 ∫ k^{-2/3} π_0 z_0`, which is parent (13.6). D1-E reduces that integral to (15.2). | + +The cutoff arithmetic recorded in comment 5841270276 still stands: missing mass `k < ℓ/r_0^3` is `O(a^{7/3})`; the monomials `k^{-2/3} r k` and `k^{-2/3} r^2` are both `O(ℓ^{1/3})` once the lower cutoff is kept; the split `η = ℓ^{1/6}` makes both pairing-loss pieces `O(ℓ^{7/18})` inside the scaled density. Given the resulting `O(1)` density bound, `∫_0^t ν = (3/2) c t^{2/3} + O(t)`, the nonselected count is `O(t)`, and `(R20)` is the same integration for `q > -2/3`. + +R5 and R6 take the elder comparison and the integral definition of `c`. They do not take the parent’s uniform `C r^3` selection bound (1.1), and they do not take the dominated-convergence route to `p_r → 1`. Successor §1 and §6 already replace that route by `(R11)` and `(R12)`. The §§2–§7 chain is outside this delta. + +## Scope of the acceptance + +Theorem R is the existential statement: some `ℓ_* > 0` and some finite `C` give + +`|ν_cand(ℓ) - c ℓ^{-1/3}| ≤ C`, `0 ≤ ν_cand(ℓ) - ν_eld(ℓ) ≤ C`, and `|ν_eld(ℓ) - c ℓ^{-1/3}| ≤ C` + +for `0 < ℓ ≤ ℓ_*`, with `c` equal to parent (15.2). That includes `(R16)`, `(R18)`, `(R19)`, and `(R20)`. + +A numerical value of `C` or `ℓ_*`, convergence of the bounded remainder, a second coefficient, an RN expected-critical-count estimate, and a 24-jet certificate are outside this verdict. Scientific status of those separate items is unchanged. +````` + +## 3. main#65 comment 5841269490 (D3, xAI coefficient review, C1–C6) + +URL: https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841269490 · posted by `cursor[bot]` · created 2026-09-25T23:58:59Z · updated 2026-09-26T00:09:32Z + +`````text +All six coefficient interfaces check out. The disposition is **COEFFICIENT-CALC-REVIEWED / PARENT-IMPORTED-OPEN**. This is a same-session nonauthor check of the stated expression, and parent issue #63 is still open. + +Provider/model/session: Cursor cloud agent, Grok 4.7 (`grok-4.7-high-fast`), run `bc-be5dc8d9-8a69-4ca9-983b-af79d710c1c1`, https://cursor.com/agents/bc-be5dc8d9-8a69-4ca9-983b-af79d710c1c1. Source exposure: public `Math-` commit `e329fba1e927a12dbb4f0d1556f85f39284d17a9`, directory `coefficients/side24_v1/`; parent Drive proof `UNIFORM_MATRIX_CAP_AND_LIFETIME.md` (40,261 bytes, SHA256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`) only to transcribe (15.2) and recheck its scalar integral; NIST DLMF 5.11; issue #63’s displayed formula. No Vault99 reading, no source edits, no child agents. Local interpreter: CPython 3.12.3. + +## Interfaces + +| Interface | Result | +|---|---| +| C1 negative-cone moment \(D_1=4/3\) | **VERIFIED** | +| C2 \(D_2=29/6-\sqrt{6}\), negative-definite cone retained | **VERIFIED** | +| C3 angular / all-direction reduction | **VERIFIED** | +| C4 SIDE24 image / periodization bound | **VERIFIED** | +| C5 covariance / Schur transfer | **VERIFIED** | +| C6 outward Gamma / Stirling arithmetic | **VERIFIED** | + +**C1.** For the reference \(K_\infty(z)=\exp(-|z|^2/2)\), \(\mathrm{Cov}(H_{ij},H_{kl})=\delta_{ij}\delta_{kl}+\delta_{ik}\delta_{jl}+\delta_{il}\delta_{jk}\) and \(\mathrm{Cov}(V)=\mathrm{diag}(3,1,\ldots,1)\). Conditioning the transverse entry on \(V=0\) gives variance \(8/3\). The \(1\times1\) negative cone is \(A<0\), and \(A^2\) is even, so \(D_1=\tfrac12\cdot\tfrac83=\tfrac43\). + +**C2.** For \(m=2\), \(A=\begin{pmatrix}s+x&y\\y&s-x\end{pmatrix}\) with independent \(s,x,y\), \(\mathrm{Var}(s)=5/3\), \(\mathrm{Var}(x)=\mathrm{Var}(y)=1\). Both eigenvalues are negative exactly on \(s<-R\), \(R=\sqrt{x^2+y^2}\). With \(R^2\) of density \(e^{-z/2}/2\), +\[ +\int_0^a(a-z)^2 e^{-z/2}\,dz/2=a^2-4a+8-8e^{-a/2}. +\] +Symmetry then gives +\[ +D_2=\tfrac12\bigl(\tfrac{25}3-\tfrac{20}3+8-8\sqrt{3/8}\bigr)=\tfrac{29}6-\sqrt6, +\] +using \(E[s^4]=25/3\) and \(E[e^{-s^2/2}]=\sqrt{3/8}\). The identity \(4\sqrt{3/8}=\sqrt6\) is the square check \(16\cdot(3/8)=6\). Half the untruncated determinant-square moment is exactly \(29/6\); the cone cutoff is the \(-\sqrt6\) term. + +**C3.** Parent (15.2) is +\[ +c_{d,L}=\frac{\Gamma(7/6)}{24^{1/3}\sqrt\pi}\int_{S^{d-1}}p_G(0)\,p_{V_u}(0)\,\tau_u^{4/3}D_u\,d\sigma(u). +\] +The scalar identity was recomputed from the parent’s intermediate factors: \(4\cdot(6\kappa)^2=144\) and \(k^{-2/3}\cdot k^2=k^{4/3}\), then +\[ +144\int_0^\infty k^{4/3}\varphi_\tau(12k)\,dk=\Gamma(7/6)\,\tau^{4/3}/(24^{1/3}\sqrt\pi). +\] +For the isotropic reference, \(\tau^2=6\), \(p_G(0)p_V(0)=(2\pi)^{-d}/\sqrt3\), and \(|S^1|=2\pi\), \(|S^2|=4\pi\). Those areas equal \(2^{d-1}\pi\) for \(d=2,3\), and \(6^{2/3}/24^{1/3}=(3/2)^{1/3}\), which is formula (1). The same multiplicative bound holds in every orthonormal frame, so the sphere integral keeps it. + +**C4.** Coordinate partials of \(\varphi(x)=\exp(-|x|^2/2)\) factor as Hermite products. For every multi-index of order at most 6 and every \(|y|\ge24\), +\[ +\prod_i|He_{\alpha_i}(y_i)|\le76\,|y|^6. +\] +The check covered all 84 multi-indices in \(d\le3\); the worst ratio to \(76\cdot24^6\) is about \(0.0135\), on the pure sixth derivative. At the origin the same partials are at most 15. The lattice estimate +\[ +\sum_{n\neq0}|n|^6 e^{-288|n|^2}\le1458\,e^{-288} +\] +holds, and the degree-20 Taylor sum for \(e^{288/125}\) is greater than 10, so \(e^{-288}<10^{-125}\). Therefore +\[ +E=1458(76\cdot24^6+15)\cdot10^{-125}=21175738586478\cdot10^{-125}, +\] +and \(60E<10^{-108}\). + +**C5.** Entrywise differences are at most \(2E\) after the \(\sqrt2\) duplication on off-diagonal Hessian coordinates. In dimension at most 10 the spectral norm is at most \(20E\). The reference odd block \(\begin{pmatrix}1&-3\\-3&15\end{pmatrix}\) shifted by \(I/3\) has leading minor \(2/3\) and determinant \(7/9\), and \((23/3)^2-58=7/9>0\), so its smaller eigenvalue exceeds \(1/3\). Hessian eigenvalues are \(2\) and \(d+2\). Thus \(C_{\mathrm{ref}}\ge I/3\) and \((1-\varepsilon)C_{\mathrm{ref}}\le C_{24}\le(1+\varepsilon)C_{\mathrm{ref}}\) at \(\varepsilon=10^{-108}\). Schur complements are infima of the quadratic form, so the sandwich passes to \(\tau^2\) and to \(A\mid V=0\). The Gaussian density comparison and the degree-\(2m\) cone scaling then give integrand powers \(a=m+2/3+n/2\), \(b=d+n/2\). For \(d=3\), \(a+2b=79/6<14\) and \(2a+b=77/6<13\), and \(32\varepsilon<10^{-106}\). + +**C6.** Bernoulli numbers \(B_2,\ldots,B_{22}\) match the \(B_1=-1/2\) recurrence, including \(B_{22}=854513/138>0\). DLMF 5.11(ii) puts the positive-real remainder after the \(B_{20}\) term between 0 and the first omitted \(B_{22}\) term; the code encloses that way, then removes 32 logarithms from \(z=199/6\) by DLMF 5.5(i). An independent Stirling shift by 48, with a separate Machin/atan log/exp implementation, landed inside the package interval for \(\Gamma(7/6)\), width about \(1.4\cdot10^{-31}\), midpoint \(0.9277193336300392\). The \(10^{-106}\) allowance is applied to an already valid enclosure of \(c_{d,\mathrm{ref}}\). Author tests: `python3 -m unittest test_coefficient.py` in that directory, **30 runs, 0 failures**. The 20-digit outward endpoints are the published ones: +\[ +0.073406919306034271030`, because the conditional law of the transverse Hessian has full support on an open negative-definite ball. Remote conditioning changes the law inside the numerator expectation and leaves this denominator in place. The height split uses Lebesgue `dt` on the window. The factor `12` that appears in the unconditional pin intensity is absent from this conditional count. + +4. **Contact kernel and `O(k r^4 |E|)` remainder — ACCEPT.** `Λ_j` in (13) is continuous on the stated compact sets, finite, and bounded above and below by positive constants. Positivity uses the joint conditional support of `(A_0,H_x)` and keeps their dependence inside the expectation. The density error is `O(r^2)` and the endpoint-weight error is `O(r)`, so the Kac–Rice integrand differs from `Λ_j` by `O(r)`. Integration over a window of length `k r^3` gives the `O(k r^4 |E|)` count remainder, which is (2). The matching lower bound is for the expectation on a fixed positive-volume set. Markov is applied only from that expectation to the probability upper bound. + +5. **Fixed-separation factorial moments — ACCEPT.** For each fixed `m≥2` and `η>0`, one endpoint weight and one normalizer are used. There are `m+2` determinant factors. The ordered mean is `(k r^3)^m C_m+O(r^{3m+1})`, with a joint contact kernel. Each unordered `η`-separated `m`-set contributes `m!` ordered tuples, so its probability is at most `E[T]/m! = O(r^{3m})`. A separated pair is `O(r^6)`. + +6. **Selector and height-window mapping — ACCEPT for the implication in §7 only.** A `0/1` selector is dominated by `N_{r,j}(E)` when its type, location, and value conditions imply (1): index `j`, location in a Borel subset of the fixed `D_ρ`, and height strictly between the pinned heights. Boundary heights have expected count zero. No historical RN witness predicate, inner-wedge cell, whitened-jet cell, or all-cell partition is shown to imply (1). Those objects stay outside this acceptance. Ambient Lebesgue measure `dx` is the coordinate system of (14); a polar or scaled chart has to carry its own Jacobian. + +7. **Uncovered complement — ACCEPT as stated in §7.** The regions that remain open are exactly the ones listed in the crosswalk below. `ρ` and `η` stay fixed. + +## Region crosswalk + +| Region | This note | +|---|---| +| Fixed `D_ρ`, height in `(b-k r^3,b)`, index `j` | Theorem A and numerator (14) | +| Fixed `η>0`, ordered `m`-tuples of index `j` in that window | (15); probability ≤ `E[T]/m!` | +| Mesoscopic neighborhood `x=ry` | Open. Distance to the pins tends to zero | +| Pin collision, witness within `O(r)` of `M` or `S` | Open. Same distance restriction | +| Intermediate annulus, a multiple of `r` out to a shrinking cutoff, including `r≪\|x‖≪ρ` | Open. Compactness constants are not claimed there | +| Witness collision, mutual separation tending to zero | Open. (15) stops at fixed `η` | +| Remote critical points with no shrinking height window | Open. The factor `r^3` is the window length | +| Legacy all-cell, 24-jet, `ENV-RESCOV` through `CH-LIFT`, fixed-`r` inner wedge | Open. §7 requires a separate proof that the legacy selector implies (1). `STATUS_RN_UNIF` still records those carriers as absent | +| Probability lower bound, Poisson law, numerical `C` or `r_*`, elder selection | Not conclusions of this argument | + +## Checks and one citation correction + +I recomputed the pin Jacobian, the target `v_r`, the axial coefficient `r^2/40` on `s^5`, and the Hermite values `α_M=-6k`, `α_S=6k`, `f_xxx=12k`. The local exact suite, 28 tests, passed under Python 3. Those tests check finite algebra. They do not evaluate `Λ_j`. + +The operative Kac–Rice input is Theorem 6.1, Remark 8, and §7.1 of arXiv:2304.07424v3: the weight may depend on an extra field, the critical-point Jacobian is `|det Hess|` once, and the height split is the joint density in `dt`. In that HTML, Theorem 7.1 is the i.i.d. sum model, and the critical-point discussion is §7.1 rather than §8.1. The formula in (12) matches Theorem 6.1 and §7.1. A later bibliographic edit can retarget the sentence in §8; that mismatch is not a false step in the count. +````` + +## 6. main#76 comment 5841861362 (D4, owner reconciliation) + +URL: https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841861362 · posted by `d6g8k5htny-coder` (owner) · created 2026-09-26T01:15:52Z · updated 2026-09-26T01:15:52Z + +`````text +D4 REVIEW DELIVERY RECONCILED. The complete proof is in Math at `frontiers/remote_window_20260924/PROOF.md`, and the fresh xAI/Grok review on this issue returns ACCEPT on all seven fixed-rho/fixed-eta interfaces: conditioned covariance, all three determinant factors and O(k r^5) numerator, original endpoint normalizer, contact-kernel remainder, fixed-separation factorial moments, selector/window mapping, and the explicit uncovered complement. Closing #76 as the fixed-remote REVIEW work package only. This does not shrink rho or eta and does not close mesoscopic, pin, intermediate, or shrinking witness-collision regions. +````` + +## 7. main#74 comment 5842112010 (D6, owner reconciliation of the in-repo review) + +URL: https://github.com/d6g8k5htny-coder/main/issues/74#issuecomment-5842112010 · posted by `d6g8k5htny-coder` (owner) · created 2026-09-26T01:48:31Z · updated 2026-09-26T01:48:31Z + +`````text +D6 ANALYTIC REVIEW COMPLETE. The full proof is in Math at `frontiers/full_price_20260924/PROOF.md`, and merged Math PR63 records a cross-provider nonauthor ACCEPT on all six requested slices: hazard/separate concavity, odd-majority worst case, global independence/hazard direction, realized-family cover, sharpness, and demand-one boundary. Exact accepted scope is the realized disjoint capacity/clutter family with d_i>=2, every independent probability, prices c_v<=phi(p_v), same palette K>=K_H(d), and rho*=1/(3-log(3e-2)). The p=1 strictness sentence is corrected to interior 1/2=rho and between-pin height" + }, + "proposed": { + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "dist>=rho and between-pin height", + "source": null, + "scope": "the fixed-remote region at the D4 scope: dist >= rho from the pins, between-pin height window", + "explicit_limits": "as the covering node", + "review_disposition": "ACCEPT", + "review_sources": [ + { + "ref": "main#76 comment 5841783172", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "covering theorem accepted at this exact region scope; region crosswalk table" + } + ], + "coverage_source": "math.rn-fixed-remote-window", + "notes": "PROVED_REVIEWED region: covered by math.rn-fixed-remote-window (required covered_by edge; coverage_source retained). Register alignment v1.3." + }, + "required_premises_after": [ + "math.rn-fixed-remote-window" + ], + "notes": "Covered by a PROVED_REVIEWED node after the previous transition; coverage_source retained and a required covered_by edge added so that a change to the covering proof reaches the region (Codex 4139807558; OpenAI 5360327058 item 1). The current hard gate reports PROVED_REVIEWED regions in its own proved_reviewed_regions bucket since ec6db8c (Math-#151), so the earlier region-reporting complaint (Codex 4139807545) is superseded." + }, + { + "node": "math.rn-fixed-annulus-window", + "kind": "candidate", + "current": { + "classification": "AUTHOR_SIDE_CANDIDATE", + "fingerprint": "081abc13c5e66342c13df2af2bd6b114f320486f" + }, + "proposed": { + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b", + "source": "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md", + "scope": "d = 2; fixed L; fixed scaled annulus 1 < A0 <= |y| <= B0 < infinity; compact positive gaps k_- > 0; all frames; between-pin height window (live node scope)", + "explicit_limits": "no global D5/RN/JETMOD, k -> 0, d >= 3, pin-neighborhood, intermediate-scale, collision, or elder-selection closure; excludes PR28 and later blobs", + "review_disposition": "ACCEPT", + "review_sources": [ + { + "ref": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "ACCEPT at the exact scoped theorem (covariance floor, cutoff r^(1/24), rare target density, conditioned C^3 sixth moment, ...)", + "binds": "commit 2804dc1, blob 081abc13, SHA256 1fd9fe71" + } + ], + "notes": "PROVED_REVIEWED at the fixed d = 2 scaled-annulus window scope; see explicit_limits. Evidence: pr22 review record; consumed S6-S21 stitching input with its review. Single nonauthor provider. Register alignment v1.3." + }, + "required_premises_after": [ + "math.rn-count-interface", + "math.align-component.pr22-annulus-review", + "math.align-component.two-scale-addendum" + ], + "notes": "Fingerprint kind changes from git blob 081abc13 (current) to SHA256, matching the other component nodes; same bytes. Single nonauthor provider. Its consumed S6-S21 stitching input (TWO_SCALE_ADDENDUM.md) and that input's review are component nodes since v1.3 (Codex 4139807567; OpenAI 5360327058 item 2)." + }, + { + "node": "math.rn-region.fixed-annulus-window", + "kind": "region", + "current": { + "classification": "COVERED_BY_CANDIDATE", + "fingerprint": "fixed-d2-annulus-between-pin-window-reviewed" + }, + "proposed": { + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "fixed-d2-annulus-between-pin-window-reviewed", + "source": null, + "scope": "the fixed d = 2 scaled annulus at the covering node's exact declared scope", + "explicit_limits": "as the covering node", + "review_disposition": "ACCEPT", + "review_sources": [ + { + "ref": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "covering theorem accepted at this exact scope" + } + ], + "coverage_source": "math.rn-fixed-annulus-window", + "notes": "PROVED_REVIEWED region: covered by math.rn-fixed-annulus-window (required covered_by edge; coverage_source retained). Register alignment v1.3." + }, + "required_premises_after": [ + "math.rn-fixed-annulus-window" + ], + "notes": "Covered by a PROVED_REVIEWED node after the previous transition; coverage_source retained and a required covered_by edge added (as for the fixed-remote region)." + }, + { + "node": "math.p15-full-price", + "kind": "candidate", + "current": { + "classification": "AUTHOR_SIDE_CANDIDATE", + "fingerprint": "full-price-20260924" + }, + "proposed": { + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9", + "source": "frontiers/full_price_20260924/PROOF.md", + "scope": "realized disjoint capacity/clutter family with d_i >= 2, all independent probabilities, c_v <= phi(p_v), same palette K >= K_H(d), sharp rho* = 1/(3 - log(3e-2)) (STATUS D6 row)", + "explicit_limits": "demand one remains an obstruction; no arbitrary-downset or unrestricted prize-problem extension", + "review_disposition": "ACCEPT", + "review_sources": [ + { + "ref": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor (Math- issue 57, merged Math-#63)", + "verdict": "ACCEPT on all six slices", + "binds": "blob 582180e4, SHA256 87521901" + }, + { + "ref": "main#74 comment 5842112010", + "provider": "owner", + "verdict": "D6 analytic review complete; #74 closed as the D6 review work package" + } + ], + "notes": "PROVED_REVIEWED on the realized family with d_i >= 2; see explicit_limits. Evidence: p15 review record, consumed setwise interfaces of P15_REALIZED_COVERS.md, main#74 reconciliation (external record node). Single nonauthor provider. Register alignment v1.3." + }, + "required_premises_after": [ + "math.align-component.external-issue-reviews", + "math.align-component.p15-review", + "math.align-component.p15-realized-covers-setwise" + ], + "notes": "Fingerprint changes from the label full-price-20260924 to SHA256; the live note 'review open' is stale against the merged review record. Single nonauthor provider. The consumed setwise interfaces (P1), (P2), Theorem P2 of P15_REALIZED_COVERS.md are a component node since v1.3, at the D6 review's scope only." + } + ], + "execution_order": [ + "0. create the component nodes and edges of proposed_graph_nodes / proposed_graph_edges (review records, consumed sources, covered_by, the interface's two live premises); they are evidence records and change no classification of an existing node", + "1. math.rn-count-interface -> PROVED_REVIEWED (premise of 4 and 6)", + "2. math.lifetime-remainder and math.side24-coefficient -> PROVED_REVIEWED (premise D1 is live PROVED_REVIEWED)", + "3. Math-#151 is on main (ec6db8c): the D4 bytes are carried by two live nodes (math.rn-fixed-remote-window AUTHOR_SIDE_CANDIDATE; math.d5-component.remote-window-proof PROVED_REVIEWED; same fingerprint, same main#76 review); execute math.rn-fixed-remote-window -> PROVED_REVIEWED, then math.rn-region.fixed-remote; collapsing the component node onto the live node is an optional one-edge follow-up", + "4. math.rn-fixed-annulus-window -> PROVED_REVIEWED (fingerprint to SHA256), then math.rn-region.fixed-annulus-window", + "5. math.p15-full-price -> PROVED_REVIEWED (fingerprint to SHA256)", + "6. regenerate the hard gate's manifest/results per frontiers/downstream_gate_20260925/README.md; run git_transition_audit base->head; expect promotion_permission false and no controlling node", + "executing lane: non-Claude; this record executes nothing; a lane that wants a second provider on the single-provider rows (D2, D4, D5-annulus, D6) asks for it before step 2-5" + ], + "not_proposed": [ + "math.rn-region.mesoscopic-scaled-annulus, pin-collision, intermediate-r-to-rho: Math-#151 (D5 fold)", + "math.rn-region.witness-collision and its residual: Math-#160", + "math.rn-mesoscopic-reduction (legacy PR7 route), eng.* controls, hist.* predicates: unchanged", + "any controlling flag, STATUS, PROOF_INDEX, SELECTOR_REGION or catalog edit" + ], + "independence_caveat": "All cited nonauthor reviews except D3's second read and the interface review are xAI/Grok via Cursor cloud sessions on the shared account; no organizational independence. The D1 precedent for PROVED_REVIEWED used xAI plus Anthropic reads. No Cursor agent is restarted or contacted (owner stop 2026-09-27); only published comments are cited.", + "declarative": true, + "executed": false, + "review_record": [ + { + "lane": "xAI", + "id": 5901912476, + "kind": "inventory read", + "at": "670e4ae", + "verdict": "ACCEPT as declarative inventory; HOLD execution until Math-#151 Cut A is on current tip; execute #151 first, then this alignment", + "hold_precondition_math_151": "satisfied: Math-#151 merged at ec6db8c (2026-09-30T00:56:58Z)" + }, + { + "lane": "xAI/Grok (Lucas)", + "id": 5360240245, + "kind": "review", + "at": "670e4ae", + "verdict": "ACCEPT at classification-lag scope; HOLD execution until #151 on main and single-provider rows recorded as such; interface flip conditional on this packet's Anthropic note, not an xAI re-read", + "hold_precondition_math_151": "satisfied: Math-#151 merged at ec6db8c (2026-09-30T00:56:58Z)" + }, + { + "lane": "OpenAI/ChatGPT", + "id": 5360320845, + "kind": "source-custody and RN-interface review", + "at": "f2250bf", + "verdict": "historical lag and logical-interface inequalities sound at stated scopes; AMEND REQUIRED before the proposal is represented as a complete executable evidence-bound fold: (1) review bytes not carried by the graph, production read_snapshot reads node.source only; (2) N4/N5 checks are floating, relabel; (3) the interface is not a quantitative rate; N6 may be recorded via the canonical-kernel interface", + "answered_by": "v1.3: review records and consumed sources as fingerprinted component nodes with required edges; external comments preserved in EXTERNAL_REVIEWS.md and labelled mutable; PROPAGATION two-commit cases; INTERFACE exact/numerical labels; interface scope narrowed with its premises as edges" + }, + { + "lane": "OpenAI/Codex (delegated)", + "id": 5360327058, + "kind": "engineering/interface review", + "at": "f2250bf", + "verdict": "ACCEPT the bounded historical inventory; AMEND the executable proposal; HOLD execution: (1) covering-proof loss does not reach the promoted regions; (2) TWO_SCALE_ADDENDUM, P15_REALIZED_COVERS, the interface's consumed C6-Palm/cap items are not tracked; (3) apply() drops explicit_limits and keeps stale notes; region-reporting complaint superseded on main; D2/D3/D4 comments directly authenticated", + "answered_by": "v1.3: covered_by edges; consumed-source component nodes; interface premises as edges to the live D1 node and cap component (Lemma 5.1 cited, not consumed); apply() carries explicit_limits, replacement notes and review_basis; PROPAGATION regressions; the superseded complaint recorded, not replayed" + }, + { + "lane": "OpenAI/Codex (bot review 5360253242)", + "id": "4139807545/4139807551/4139807558/4139807562/4139807567", + "kind": "review threads", + "at": "670e4ae", + "verdict": "region reporting (superseded on main); stale notes on apply; region-to-covering-proof dependency; authenticate external verdicts; track consumed source dependencies", + "answered_by": "v1.3 (all five); 4139807545 by Math-#151's hard_gate.py proved_reviewed_regions bucket, recorded in the region transition notes" + } + ], + "revision": { + "version": "v1.3", + "applies": [ + "xAI 5901912476 and 5360240245 recorded; #151-first ordering of the D4 flips made explicit", + "re-verified at ec6db8c (Math-#151 merged); live D4 duplicate bound (D4_DUPLICATE check, duplicate-drift mutant); HOLD precondition on Math-#151 recorded as met", + "OpenAI 5360320845 and 5360327058 and Codex threads 4139807545-67: eight review-record / consumed-source component nodes and sixteen required edges (edges_unchanged false); covered_by edges from regions; interface premises as edges to the live D1 node and cap component and its scope narrowed; apply() carries explicit_limits, replacement notes, review_basis; PROPAGATION check with nine two-commit cases and mutants region-unlinked / review-metadata-only; INTERFACE exact versus numerical labels; RN_COUNT_INTERFACE_REVIEW.md evidence labels; EXTERNAL_REVIEWS.md preserved and labelled mutable" + ], + "unchanged": "the eight classifications and every scope exclusion; the ten original inventory identities" + }, + "reverified_at": "ec6db8c (Math- main after Math-#151 merged 2026-09-30T00:56:58Z; the ten inventoried sources and the eight live nodes unchanged; math.d5-component.remote-window-proof live as PROVED_REVIEWED with fingerprint a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7 beside math.rn-fixed-remote-window at AUTHOR_SIDE_CANDIDATE)", + "live_duplicate": { + "node": "math.d5-component.remote-window-proof", + "since": "ec6db8c (Math-#151)", + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "source": "frontiers/remote_window_20260924/PROOF.md", + "component_of": "math.d5-pin-neighborhood-first-moment", + "review_basis": "STATUS D4 (main#76, external), nonauthor, ACCEPT, full", + "relation_to_this_record": "same bytes and same review as the math.rn-fixed-remote-window transition; the flip aligns the older node with it; collapsing the pair is a one-edge follow-up for the executing lane, not proposed here", + "check": "D4_DUPLICATE; mutant duplicate-drift" + }, + "proposed_graph_nodes": [ + { + "id": "math.align-component.rn-interface-review", + "layer": "D4", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.rn-count-interface", + "component_role": "review_record", + "author_provider": "Anthropic (nonauthor; session 017Mi3hx)", + "fingerprint": "52d9038a3f27335d3c219babec785984e00b77f28d7cd7b390477c0bc6a749d1", + "source": "reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md", + "scope": "ACCEPT at the logical-interface scope: (N1)-(N5) and the section 3 counterexamples self-contained; (N6)-(N7) and section 5 as formula-level implications conditional on the parent regression law / section 9 convention and the cap support source", + "review_basis": [ + { + "review": "reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md", + "provider": "Anthropic", + "verdict": "ACCEPT at the logical-interface scope", + "depth": "full at that scope; exact rational checks plus labelled floating-point corroborations in alignment_check.py" + } + ], + "notes": "This packet's own review record; a nonauthor read by a second provider was not available at v1.3 (xAI 5360240245 did not re-read the note)." + }, + { + "id": "math.align-component.external-issue-reviews", + "layer": "D2", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": null, + "components_of": [ + "math.lifetime-remainder", + "math.side24-coefficient", + "math.rn-fixed-remote-window", + "math.p15-full-price" + ], + "component_role": "review_record_external", + "author_provider": "xAI/Grok 4.7 via Cursor (posted by cursor[bot]) and owner reconciliations; transcribed by Anthropic from the GitHub API read-back of 2026-09-30", + "fingerprint": "fa6677f16f688352f3fc9b1703d39324fe57a3b2bf61960591f524f858e99c9d", + "source": "reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md", + "scope": "seven main-repository issue comments: main#67 5841270276 and 5841782206 (D2), main#65 5841269490 and 5841779222 (D3), main#76 5841783172 and 5841861362 (D4), main#74 5842112010 (D6), with comment id, URL, posting account, created_at, updated_at and body", + "review_basis": [ + { + "review": "main#67 comment 5841270276", + "provider": "xAI/Grok 4.7 via Cursor (session bc-81faa729)", + "verdict": "R1-R3 ACCEPT, R4 ACCEPT for (R12), R5-R6 IMPORTED-OPEN", + "created_at": "2026-09-25T23:59:05Z", + "updated_at": "2026-09-26T00:07:25Z" + }, + { + "review": "main#67 comment 5841782206", + "provider": "xAI/Grok 4.7 via Cursor (session bc-dfbce246)", + "verdict": "R5 and R6 ACCEPT; Theorem R accepted at its stated O(1) remainder scope", + "created_at": "2026-09-26T01:04:21Z", + "updated_at": "2026-09-26T01:07:56Z" + }, + { + "review": "main#65 comment 5841269490", + "provider": "xAI/Grok 4.7 via Cursor (run bc-be5dc8d9)", + "verdict": "C1-C6 VERIFIED; COEFFICIENT-CALC-REVIEWED / PARENT-IMPORTED-OPEN", + "created_at": "2026-09-25T23:58:59Z", + "updated_at": "2026-09-26T00:09:32Z" + }, + { + "review": "main#65 comment 5841779222", + "provider": "owner", + "verdict": "reconciliation; #65 closed as the coefficient-review work package", + "created_at": "2026-09-26T01:03:54Z" + }, + { + "review": "main#76 comment 5841783172", + "provider": "xAI/Grok via Cursor (session bc-593a8246; provider named by the owner's reconciliation)", + "verdict": "items 1-7 ACCEPT at fixed-rho/fixed-eta scope; not a full RN or 24-jet theorem", + "created_at": "2026-09-26T01:04:29Z", + "updated_at": "2026-09-26T01:12:36Z" + }, + { + "review": "main#76 comment 5841861362", + "provider": "owner", + "verdict": "reconciliation; ACCEPT on all seven interfaces; #76 closed as the fixed-remote REVIEW work package only", + "created_at": "2026-09-26T01:15:52Z" + }, + { + "review": "main#74 comment 5842112010", + "provider": "owner", + "verdict": "D6 ANALYTIC REVIEW COMPLETE; cross-provider nonauthor ACCEPT on all six slices (the review itself is reviews/p15_full_price_nonauthor_20260926/REVIEW.md); #74 closed", + "created_at": "2026-09-26T01:48:31Z" + } + ], + "authentication": "mutable external evidence, read back through the session's GitHub connector and transcribed; not byte-authenticated offline (stdlib checker, no network); OpenAI 5360327058 reports direct authentication of 5841270276, 5841782206, 5841269490 and 5841783172; claims/LANDING_CLAIMS.json cites the same issues as review objects", + "notes": "One node for one byte object (this file); loss-only: any edit to the record revalidates D2, D3, D4 and D6." + }, + { + "id": "math.align-component.side24-review-claude", + "layer": "D3", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.side24-coefficient", + "component_role": "review_record", + "author_provider": "Anthropic (session 01NMeKE)", + "fingerprint": "258c414c46be93142ee552cfa4c32c03dd89b6bf7b0b470334f152e1e0a57eef", + "source": "reviews/side24_v1_coefficient_claude_20260929/REVIEW.md", + "scope": "second-provider read of coefficients/side24_v1/PROOF.md: ACCEPT at the arithmetic-enclosure scope", + "review_basis": [ + { + "review": "reviews/side24_v1_coefficient_claude_20260929/REVIEW.md", + "provider": "Anthropic", + "verdict": "ACCEPT at the arithmetic-enclosure scope", + "depth": "full at that scope" + } + ], + "notes": "Makes D3 the two-provider row (with main#65 5841269490)." + }, + { + "id": "math.align-component.pr22-annulus-review", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.rn-fixed-annulus-window", + "component_role": "review_record", + "author_provider": "xAI/Grok 4.7 via Cursor", + "fingerprint": "29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d", + "source": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "scope": "ACCEPT of FIXED_ANNULUS_CANDIDATE.md (blob 081abc13, SHA256 1fd9fe71) at the exact scoped theorem: covariance floor, cutoff r^{1/24}, rare target, conditioned C^3 sixth moment, inner two-scale stitching; PR28 and later blobs excluded", + "review_basis": [ + { + "review": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "ACCEPT at the exact scoped theorem", + "depth": "full" + } + ], + "notes": "Single nonauthor provider." + }, + { + "id": "math.align-component.two-scale-addendum", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.rn-fixed-annulus-window", + "component_role": "consumed_proof", + "author_provider": "OpenAI", + "fingerprint": "079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d", + "source": "frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md", + "scope": "S6-S21 and (S3)-(S5): the inner two-scale stitching input (S4) consumed by FIXED_ANNULUS_CANDIDATE.md for |t| < h_r on A <= |u| <= B (claims/LANDING_CLAIMS.json dependency two-scale-s6-s21)", + "review_basis": [ + { + "review": "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "ACCEPT S6-S21 and (S3)-(S5) at blob 89cae3a9", + "depth": "full" + }, + { + "review": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "inner two-scale stitching ACCEPT; the addendum read as the imported inner bound, not re-derived", + "depth": "gluing step" + } + ], + "notes": "The addendum's own review record is the next node; the addendum requires it." + }, + { + "id": "math.align-component.two-scale-review", + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.align-component.two-scale-addendum", + "component_role": "review_record", + "author_provider": "xAI/Grok 4.7 via Cursor (session bc-ff620630)", + "fingerprint": "04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574", + "source": "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md", + "scope": "ACCEPT of TWO_SCALE_ADDENDUM.md S6-S21 and (S3)-(S5) at blob 89cae3a9 (Math- PR34, commit bc7d7545)", + "review_basis": [ + { + "review": "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "ACCEPT", + "depth": "full" + } + ], + "notes": "Single nonauthor provider." + }, + { + "id": "math.align-component.p15-review", + "layer": "D6", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.p15-full-price", + "component_role": "review_record", + "author_provider": "xAI/Grok 4.7 via Cursor (Math- issue 57 lane)", + "fingerprint": "691ea0db5c0f073326c9f7208c9804c6f5d0daf92ba7467529c9d57e08b15eb7", + "source": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md", + "scope": "ACCEPT of Theorem F on the realized disjoint capacity/clutter family (six slices) at blob 582180e4, SHA256 87521901; checked the setwise (P1), (P2), Theorem P2 dependency of P15_REALIZED_COVERS.md", + "review_basis": [ + { + "review": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "ACCEPT Theorem F on the realized family", + "depth": "full" + } + ], + "notes": "Single nonauthor provider; owner reconciliation main#74 5842112010 is in the external record." + }, + { + "id": "math.align-component.p15-realized-covers-setwise", + "layer": "D6", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.p15-full-price", + "component_role": "consumed_interface", + "author_provider": "OpenAI", + "fingerprint": "c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9", + "source": "frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md", + "scope": "setwise interfaces only: realized-family definition (P1), actual local restrictions (P2) and Theorem P2 full-block cover at K >= K_H(d), as consumed by Theorem F with d_i >= 2 (claims/LANDING_CLAIMS.json dependency p15-realized-covers:setwise-interfaces); the note's c_v <= p_v price theorem and any broader P15 statement are not included", + "review_basis": [ + { + "review": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md", + "provider": "xAI/Grok 4.7 via Cursor", + "verdict": "read as the cited setwise dependency and checked for the local restriction and the full-block cover; the c_v <= p_v price theorem not accepted", + "depth": "setwise interfaces" + } + ], + "notes": "The realized-covers claim itself stays HOLD_WITH_DOMAIN in the claim manifest; only the consumed setwise interfaces are represented here, at the D6 review's scope." + } + ], + "proposed_graph_edges": [ + { + "from": "math.rn-count-interface", + "to": "math.align-component.rn-interface-review", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-count-interface", + "to": "math.uniform-matrix-cap-lifetime", + "required": true, + "relation": "uses_parent_regression_law_and_section9_convention" + }, + { + "from": "math.rn-count-interface", + "to": "math.d1-component.marked-cylinder-cap", + "required": true, + "relation": "consumes_cap_support_scope_section5" + }, + { + "from": "math.lifetime-remainder", + "to": "math.align-component.external-issue-reviews", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.side24-coefficient", + "to": "math.align-component.external-issue-reviews", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.side24-coefficient", + "to": "math.align-component.side24-review-claude", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-fixed-remote-window", + "to": "math.align-component.external-issue-reviews", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.fixed-remote", + "to": "math.rn-fixed-remote-window", + "required": true, + "relation": "covered_by" + }, + { + "from": "math.rn-fixed-annulus-window", + "to": "math.align-component.pr22-annulus-review", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-fixed-annulus-window", + "to": "math.align-component.two-scale-addendum", + "required": true, + "relation": "consumes_s6_s21_stitching_input" + }, + { + "from": "math.align-component.two-scale-addendum", + "to": "math.align-component.two-scale-review", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.rn-region.fixed-annulus-window", + "to": "math.rn-fixed-annulus-window", + "required": true, + "relation": "covered_by" + }, + { + "from": "math.p15-full-price", + "to": "math.align-component.external-issue-reviews", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.p15-full-price", + "to": "math.align-component.p15-review", + "required": true, + "relation": "requires_evidence" + }, + { + "from": "math.p15-full-price", + "to": "math.align-component.p15-realized-covers-setwise", + "required": true, + "relation": "consumes_setwise_interfaces_P1_P2_TheoremP2" + }, + { + "from": "math.align-component.p15-realized-covers-setwise", + "to": "math.align-component.p15-review", + "required": true, + "relation": "requires_evidence" + } + ], + "nodes_added": 8, + "edges_added": 16, + "edges_removed": 0, + "external_evidence": { + "file": "reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md", + "sha256": "fa6677f16f688352f3fc9b1703d39324fe57a3b2bf61960591f524f858e99c9d", + "node": "math.align-component.external-issue-reviews", + "status": "mutable external evidence, read back on 2026-09-30 through the session's GitHub connector and transcribed with comment id, URL, posting account, created_at, updated_at and body (Cursor footer HTML omitted); not byte-authenticated offline; OpenAI 5360327058 reports direct authentication of 5841270276, 5841782206, 5841269490 and 5841783172; this is not an additional review and not an additional provider" + } +} diff --git a/reviews/register_alignment_20260930/RECONCILIATION.md b/reviews/register_alignment_20260930/RECONCILIATION.md new file mode 100644 index 000000000..ece9655fd --- /dev/null +++ b/reviews/register_alignment_20260930/RECONCILIATION.md @@ -0,0 +1,270 @@ +# Register alignment — graph nodes for the accepted STATUS rows D2, D3, D4, D5-annulus and D6 + +**Object:** REGISTER-ALIGNMENT-20260930-v1. +**Reconciler:** Anthropic Claude, Claude Code session `session_017Mi3hxjaxV45x6zo6o1ee3`. +**Read at:** Math- `main` `aa288385af9392c509233c25a0f4012c9ba023e5` (30 September 2026); main `STATUS.md` at `7bbbdc9`. +Re-verified at `ec6db8c` (Math-#151 merged, 30 September 00:56Z): the ten inventoried sources and the eight live nodes of +§4 are unchanged; the live graph now also carries `math.d5-component.remote-window-proof` (`PROVED_REVIEWED`, fingerprint +`a332bae9…`, `review_basis` "STATUS D4 (main#76, external)") beside the still-`AUTHOR_SIDE_CANDIDATE` +`math.rn-fixed-remote-window`: the D4 dual-node inconsistency is now live, and the `D4_DUPLICATE` check binds it. +**Revision:** v1.1 records the two xAI reads of `670e4ae` and makes the Math-#151-first ordering of the D4 flips +explicit; transitions unchanged. v1.2 re-verifies at `ec6db8c` after Math-#151 merged, binds the now-live duplicate D4 +node (`D4_DUPLICATE` check, `duplicate-drift` mutant) and records that the HOLD's Math-#151 precondition is met; +transitions unchanged. v1.3 answers the two OpenAI AMEND reviews (5360320845, 5360327058) and the five Codex threads +(4139807545–67): review records and consumed sources become fingerprinted component nodes with required edges, regions +gain `covered_by` edges, `apply()` carries scope exclusions and replacement notes, a nine-case `PROPAGATION` check replays +two-commit source mutations through the production reverse-impact rule, the interface's promoted scope is narrowed to +self-contained inequalities plus conditional implications with its consumed premises as edges, the interface evidence +labels separate exact from floating-point checks, and the external issue comments are preserved in `EXTERNAL_REVIEWS.md` +and labelled as mutable evidence; the eight classifications are unchanged. +**Effect:** register reconciliation, **declarative only**. This record introduces **no new mathematical claim**. It binds +five objects that the register already lists as accepted to their exact bytes, quotes the nonauthor verdicts that +accepted them, records that their live graph nodes still carry the pre-review classification, and proposes the node +transitions in machine-readable form (`PROPOSED_TRANSITIONS.json`, `"executed": false`). It carries one bounded +nonauthor review (`RN_COUNT_INTERFACE_REVIEW.md`) of the RN count-interface note, the only unreviewed required premise +in these chains. Execution of any `GRAPH.json` change is a separate act for a **non-Claude lane**. `lemma_closed`, +prizes and premises are untouched. Scientific effect: NONE. + +## 0. Exposure, stated first + +- Every lane shares one GitHub account; no organizational independence is claimed anywhere below. +- I authored none of the six sources inventoried in §2 (all six are OpenAI / ChatGPT notes). I authored + `reviews/d1_chain_reconciliation_20260928/` (Math-#126), the record that moved the D1 parent node + `math.uniform-matrix-cap-lifetime` to `PROVED_REVIEWED`; the D2 and D3 nodes require that node. I authored + `reviews/d5_reconciliation_20260929/` (Math-#138), executed by Math-#151, which handles the mesoscopic, pin-collision + and intermediate regions; none of those is re-proposed here. +- Reviews cited: D2, D4, the D5 fixed annulus and D6 each rest on **one** nonauthor provider, xAI / Grok 4.7 running in + Cursor cloud sessions on 25–26 September. D3 has two providers (xAI; Anthropic, session `01NMeKE…`, in-repo record). + The count-interface review in §3 is by this session. No Cursor agent is restarted or contacted (owner stop of + 27 September); only their published comments are cited, with the byte identities they state. +- **Precedent and caveat.** The D1 node moved to `PROVED_REVIEWED` on xAI plus Anthropic reads. Four of the five flips + proposed here rest on a single provider. The executing lane may ask for a second read before flipping any of them; + this record binds what exists and says so per row. STATUS already records all five as accepted at scope. + +**Verdicts on this record.** xAI inventory read 5901912476 and xAI/Grok (Lucas) review 5360240245, both at `670e4ae`: +**ACCEPT as a declarative inventory of already-accepted STATUS scopes** (classification lag, not new mathematics; no +edge, node, controlling, prize or `lemma_closed` change; single-provider caveat correctly stated; the D3 row is the +two-provider one), with **HOLD on execution** until Math-#151 is on main so that the D4 dual-node inconsistency is +resolved in one direction, and with the single-provider rows recorded as such by the executing lane. Neither read +re-read the count-interface note: that flip rests on this packet's Anthropic review alone. Both say: do not touch +witness-collision here, do not enlarge any scope, do not treat this as a prize or Boolean fold. This record agrees +on every point; v1.1 makes the #151-first ordering explicit in §4 and `execution_order`. Math-#151 merged at `ec6db8c` +(30 September 00:56Z; main#207 closed at 00:57Z), so the first HOLD condition is met; the second, that the executing +lane record the single-provider rows as such, is already stated per row in §4 and in `PROPOSED_TRANSITIONS.json` and is +that lane's to carry out. + +OpenAI source-custody / RN-interface review 5360320845 and OpenAI-Codex engineering review 5360327058 (both at `f2250bf`, +with Codex threads 4139807545/51/58/62/67 at `670e4ae`): **the historical classification lag and the logical-interface +inequalities are sound at their stated scopes; AMEND the executable proposal; HOLD execution.** Their findings: the +acceptance evidence lived only in `review_sources` metadata, which the production loss-only audit +(`git_transition_audit.read_snapshot`, `node.source` only) never sees; a covering-proof change did not reach the promoted +regions; the annulus's `TWO_SCALE_ADDENDUM.md`, D6's `P15_REALIZED_COVERS.md` and the interface's consumed cap / parent +items were not tracked; `apply()` dropped `explicit_limits` and kept stale notes; the (N4)/(N5) checks were floating +point while labelled exact; external issue-comment verdicts were quoted, not preserved. v1.3 answers each (§4, §6; the +eight classifications and scope exclusions unchanged). The region-reporting complaint (4139807545) is superseded on main +since `ec6db8c` (`hard_gate.d4_region_complement` has a `proved_reviewed_regions` bucket) and is not replayed. Neither +OpenAI read is a new mathematical acceptance of the six sources; both keep the single-provider caveat. + +## 1. The lag + +The main `STATUS.md` accepted-scope table (rows D1–D4, D6) and `PROOF_INDEX.md` "Reviewed scoped results" list these +objects as reviewed. The downstream graph does not: + +| Object | STATUS / PROOF_INDEX | Live node | Live classification | Live fingerprint | +|---|---|---|---|---| +| D2 Theorem R | accepted, `O(1)` remainder scope | `math.lifetime-remainder` | `AUTHOR_SIDE_CANDIDATE` (in-node `review_disposition: ACCEPT`) | SHA256 `380b7d0a…` = current | +| D3 SIDE24 coefficient | accepted, `d = 2, 3` arithmetic | `math.side24-coefficient` | `AUTHOR_SIDE_CANDIDATE` (in-node `ACCEPT`) | SHA256 `c06daccc…` = current | +| D4 fixed-remote theorem | accepted, fixed `ρ`, `η` | `math.rn-fixed-remote-window` | `AUTHOR_SIDE_CANDIDATE`; region `math.rn-region.fixed-remote` `COVERED_BY_CANDIDATE` | SHA256 `a332bae9…` = current | +| D5 fixed-annulus window | PROOF_INDEX reviewed row | `math.rn-fixed-annulus-window` | `AUTHOR_SIDE_CANDIDATE` (in-node `ACCEPT`); region `math.rn-region.fixed-annulus-window` `COVERED_BY_CANDIDATE` | git blob `081abc13…` = current | +| D6 P15 full price | accepted, realized family | `math.p15-full-price` | `AUTHOR_SIDE_CANDIDATE`, note "review open" | label `full-price-20260924` | +| (premise) RN count interface | — | `math.rn-count-interface` | `AUTHOR_SIDE_CANDIDATE`, unreviewed | SHA256 `aa993f52…` = current | + +Why it matters: the hard gate's rule is "Only `PROVED_REVIEWED` satisfies a still-required positive premise" +(`frontiers/downstream_gate_20260925/README.md`). As long as these nodes stay author-side, the fixed-remote region is +"covered by candidate" only, and D2, D3, D4 and D6 satisfy no downstream premise, although their STATUS rows are +accepted. The register is also internally inconsistent on D4: since `ec6db8c` the live graph carries +`math.d5-component.remote-window-proof` (Math-#151, executing the D5 proposal of Math-#138) for the same bytes as +`PROVED_REVIEWED`, with `review_basis` "STATUS D4 (main#76, external), nonauthor, ACCEPT, full", beside +`math.rn-fixed-remote-window` at `AUTHOR_SIDE_CANDIDATE`. The same review either suffices for those bytes or it does +not; this record proposes that it does, on the older live node, so that the two agree; collapsing the pair is a +separate one-edge follow-up for the executing lane (§7). The `D4_DUPLICATE` check binds the duplicate's classification, +fingerprint, source and review basis to the D4 transition. + +## 2. Bindings: what each review bound, and what the bytes are now + +All six sources, and the two consumed sources and the addendum's review added in v1.3, are unchanged since their landing +commits. Identities of all fifteen inventoried files (six sources, the D1 parent, four in-repo reviews, two consumed +sources, this packet's two review records) are checked by `alignment_check.py` (`IDENTITIES`); the quoted verdict lines +are checked as substrings where the review is in this repository (`VERDICTS`). The issue-comment reviews are preserved +as a transcribed read-back in `EXTERNAL_REVIEWS.md` (comment id, URL, posting account, timestamps, body) and are +labelled there as mutable external evidence that an offline check cannot re-authenticate; OpenAI 5360327058 reports +having directly authenticated the D2, D3 and D4 comments. + +| Object | Source now | Review binding (quoted) | Verdict (quoted) | +|---|---|---|---| +| D2 | `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`, 17734 B, SHA256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`, blob `247b3ecf80bfbe896948d5d489b2d5842a81c481` | main#67 5841270276: "blob `247b3ecf80bfbe896948d5d489b2d5842a81c481`, 17734 bytes, SHA256 `380b7d0a…`"; 5841782206 re-read "and hashed" the same blob | 5841270276: "R1 — ACCEPT … R2 — ACCEPT … R3 — ACCEPT … R4 — ACCEPT for (R12) … R5 — IMPORTED-OPEN … R6 — IMPORTED-OPEN"; 5841782206: "R5 and R6 are **ACCEPT**. Theorem R is accepted at its stated O(1) remainder scope." The imports are mapped to #63 comment 5841570965 (D1-A…E), the review that the D1 reconciliation binds. | +| D3 | `coefficients/side24_v1/PROOF.md`, 10272 B, SHA256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`, blob `44b66f04f89fcd87383b3603fa69f1feb64cdddd` | main#65 5841269490: "commit `e329fba1…`, directory `coefficients/side24_v1/`", "`PROOF.md` 10272 bytes, SHA256 `c06daccc…`" | "All six coefficient interfaces check out. The disposition is **COEFFICIENT-CALC-REVIEWED / PARENT-IMPORTED-OPEN**." Second provider: `reviews/side24_v1_coefficient_claude_20260929/REVIEW.md` (blob `665d1683f33a7180957923c3cb2abce8ade235d1`): "Overall: **ACCEPT at the arithmetic-enclosure scope**". Owner reconciliation 5841779222 closed the package. The parent import is now the live `PROVED_REVIEWED` D1 node. | +| D4 | `frontiers/remote_window_20260924/PROOF.md`, 18355 B, SHA256 `a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7`, blob `b383bfcc88ec4ad497dff01fb6640e429ba24a84` | main#76 5841783172: "at commit `191ea7d541a486736ba7bbddfd4eac25a6c4567b` … 18355 bytes, SHA256 `a332bae9…`" | "This accepts only the fixed-ρ and fixed-η interfaces below. It does not accept a full RN or 24-jet theorem." Items 1–7: conditional covariance ACCEPT; three determinant factors and `O(k r⁵)` numerator ACCEPT; original endpoint normalizer ACCEPT; contact kernel and `O(k r⁴ ‖E‖)` remainder ACCEPT; fixed-separation factorial moments ACCEPT; selector/window mapping ACCEPT for the §7 implication only; uncovered complement ACCEPT as stated. Owner 5841861362: "returns ACCEPT on all seven fixed-rho/fixed-eta interfaces … Closing #76 as the fixed-remote REVIEW work package only." | +| D5 annulus | `frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md`, 17646 B, SHA256 `1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b`, blob `081abc13c5e66342c13df2af2bd6b114f320486f` | `reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md` (blob `1f153966dae48d10574db0d272f75d08ca3a8b23`): "Immutable commit `2804dc1d…`", "Blob `081abc13…`", "SHA256 `1fd9fe71…`" | rows "Covariance floor … **ACCEPT**", "Cutoff `r^{1/24}` **ACCEPT**", "Rare target in the full joint gradient/height density **ACCEPT**", "Conditioned `C^3` sixth moment **ACCEPT**", at the exact scoped theorem; PR28 and later blobs excluded. | +| D6 | `frontiers/full_price_20260924/PROOF.md`, 11352 B, SHA256 `87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9`, blob `582180e41dca0ad815ad0f18574df42040912149` | `reviews/p15_full_price_nonauthor_20260926/REVIEW.md` (blob `07db19f826763b8faa7414ba2e403d9c45bc0b6e`): "Blob `582180e4…`", "SHA256 `87521901…`" | six rows **ACCEPT** (hazard transform and separate concavity; odd-majority worst case; global hazard direction and independence; full-block cover; sharpness; demand-one boundary). Owner 5842112010: "D6 ANALYTIC REVIEW COMPLETE … Closing #74 as the D6 review work package". | +| premise | `frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md`, 8938 B, SHA256 `aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab`, blob `371fd6d17920f2eb3b1c5ec30297acf6daf1d385` | this packet, `RN_COUNT_INTERFACE_REVIEW.md` | ACCEPT at the logical-interface scope (§3); its consumed formulation was reconstructed inside the D4 review (items 2–3). | +| D1 parent (premise of D2, D3) | `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`, 40261 B, SHA256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7` | live node `math.uniform-matrix-cap-lifetime`, `PROVED_REVIEWED`, four required reading-rule components (Math-#126) | not re-reviewed; checked live (`BASELINE`). | +| consumed by D5 annulus | `frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md`, 15902 B, SHA256 `079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d`, blob `89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73` | `reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md` (10073 B, SHA256 `04cf4c98…`, blob `89882516`): "blob `89cae3a9…`, 15902 bytes, SHA256 `079f9399…`"; the pr22 review: "Read as the imported inner bound, not re-derived: `TWO_SCALE_ADDENDUM.md` blob `89cae3a9…`" | S6–S21 and (S3)–(S5) **ACCEPT** (xAI, Math- PR34); pr22 row "Inner two-scale stitching **ACCEPT**". Component nodes `…two-scale-addendum`, `…two-scale-review` (§4). | +| consumed by D6 | `frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md`, 11467 B, SHA256 `c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9`, blob `173881916ccd0e738bdb41279e835e78e520fcbc` | the p15 review: "Read as the cited setwise dependency, and checked for the local restriction and the full-block cover: … SHA256 `c0dbb821…`. That is the digest named in the proof. The check uses (P1), (P2), and Theorem P2 there. It does not accept that note's `c_v<=p_v` price theorem" | setwise interfaces only, at the D6 review's scope. Component node `…p15-realized-covers-setwise` (§4). | +| external comments (D2, D3, D4, D6) | `reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md` (this packet) | seven comments with id, account, `created_at`, `updated_at`, body; the four `cursor[bot]` reviews and three owner reconciliations | preserved read-back; mutable external evidence, labelled. Component node `…external-issue-reviews` (§4). | + +## 3. The count-interface note + +`RN_COUNT_INTERFACE_REVIEW.md` reviews `RN-COUNT-INTERFACE-20260924-v1` at the scope the note itself states: the Hölder +implications (N1)–(N3), the two counterexamples of its §3 and the layer-cake bound (N5), the marked Kac–Rice formula +(N6)–(N7) as a formula, and the support statement of §5. Verdict: **ACCEPT at the logical-interface scope**; it is not +an expected-count rate and is not treated as one. The finite parts are checked in `INTERFACE` in two labelled parts: exact rational arithmetic (Hölder on finite rational +distributions for `p = 2, 3`; the exponent identity of (N2); the (N3) identity; the single-`p` sharp example at +`r = 2^(−pm)`, where `E N^p = 1` and `E N = r^(3−3/p)` exactly) and floating-point numerical corroborations of arguments +proved in the review (the (N4) example's moments and the located maximum of `(t+1)^p e^(−3t)`; the identity +`∫ min(q, A e^(−t/B)) dt = B q [1 + log(A/q)]` by Simpson quadrature; the uniform tail `P(N_r > t) ≤ e³ e^(−3t)` of the +(N4) example on a grid); OpenAI 5360320845 item 2 asked for exactly this separation. The note's consumed premises are the +parent's regression law and §9 Borel-mark convention (live node `math.uniform-matrix-cap-lifetime`, with its four +reading-rule components) and the cap support source of §5 (live node `math.d1-component.marked-cylinder-cap`, SHA256 +`0bf922b9…`, the digest the note quotes); both are required edges of the proposal, and the promoted scope is narrowed to +(N1)–(N5) with the counterexamples as self-contained statements and (N6)–(N7), §5 as conditional implications at formula +level. A later rigorous statement of (N6) is Lemma 5.1 of `frontiers/c6_palm_route_20260929/PROOF.md` (Math-#145), +cited for the reader and not consumed. + +## 4. Proposed transitions + +Eight node transitions and, since v1.3, the evidence that carries them, represented in the graph itself: eight +fingerprinted review-record / consumed-source component nodes and sixteen required edges (`PROPOSED_TRANSITIONS.json`: +`transitions`, `proposed_graph_nodes`, `proposed_graph_edges`; `edges_unchanged: false`). The change of packaging answers +OpenAI 5360320845 item 1, OpenAI 5360327058 items 1–2 and Codex threads 4139807558/4139807562/4139807567: the production +loss-only audit (`git_transition_audit.read_snapshot`) reads `node.source` only, so acceptance evidence and consumed +sources that live only in `review_sources` metadata would never revalidate a promoted object when they change. The eight +classifications and every scope exclusion are unchanged from v1.0. + +| Node | Current | Proposed | Scope (STATUS row) | Review sources | Required premises after | +|---|---|---|---|---|---| +| `math.rn-count-interface` | `AUTHOR_SIDE_CANDIDATE` | `PROVED_REVIEWED` | (N1)–(N5) and the §3 counterexamples as self-contained probability statements; (N6)–(N7) and §5 as formula-level implications conditional on the parent's regression law / §9 convention and on the cap support source | this packet (`RN_COUNT_INTERFACE_REVIEW.md`, a component node); main#76 items 2–3 | `math.uniform-matrix-cap-lifetime` and `math.d1-component.marked-cylinder-cap` (both live `PROVED_REVIEWED`; the note's consumed premises); `math.align-component.rn-interface-review` | +| `math.lifetime-remainder` | `AUTHOR_SIDE_CANDIDATE` | `PROVED_REVIEWED` | Theorem R, existential `O(1)` remainder | main#67 5841270276, 5841782206 | D1 (live `PROVED_REVIEWED`); `math.align-component.external-issue-reviews` | +| `math.side24-coefficient` | `AUTHOR_SIDE_CANDIDATE` | `PROVED_REVIEWED` | coefficient arithmetic, `d = 2, 3` | main#65 5841269490; in-repo Anthropic record | D1; `…external-issue-reviews`; `…side24-review-claude` | +| `math.rn-fixed-remote-window` | `AUTHOR_SIDE_CANDIDATE` | `PROVED_REVIEWED` | fixed `ρ`, `η`, between-pin window | main#76 5841783172, 5841861362 | `math.rn-count-interface`; `…external-issue-reviews` | +| `math.rn-region.fixed-remote` | `COVERED_BY_CANDIDATE` | `PROVED_REVIEWED` | the D4 region | as the covering node | `math.rn-fixed-remote-window` (new required `covered_by` edge) | +| `math.rn-fixed-annulus-window` | `AUTHOR_SIDE_CANDIDATE` (blob fingerprint) | `PROVED_REVIEWED` (SHA256 fingerprint) | `d = 2` fixed scaled annulus, window | `reviews/pr22_…/REVIEW.md` | `math.rn-count-interface`; `…pr22-annulus-review`; `…two-scale-addendum` (the S6–S21 stitching input, which itself requires `…two-scale-review`) | +| `math.rn-region.fixed-annulus-window` | `COVERED_BY_CANDIDATE` | `PROVED_REVIEWED` | the covering node's scope | as the covering node | `math.rn-fixed-annulus-window` (new required `covered_by` edge) | +| `math.p15-full-price` | `AUTHOR_SIDE_CANDIDATE` (label fingerprint) | `PROVED_REVIEWED` (SHA256 fingerprint) | realized family, `d_i ≥ 2` | `reviews/p15_…/REVIEW.md`; main#74 5842112010 | `…external-issue-reviews`; `…p15-review`; `…p15-realized-covers-setwise` ((P1), (P2), Theorem P2 setwise only, which itself requires `…p15-review`) | + +Component nodes (`kind: reading_rule_component`, `PROVED_REVIEWED`, `controlling: false`, `fingerprint` = SHA256 of the +source; one node per byte identity; none duplicates a source the live graph already carries with a fingerprint): + +| Node | Source | Role | Provider | Consumed by | +|---|---|---|---|---| +| `math.align-component.rn-interface-review` | `reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md` (this packet) | review record | Anthropic (nonauthor) | `math.rn-count-interface` | +| `math.align-component.external-issue-reviews` | `reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md` (this packet: seven issue comments transcribed with id, account, timestamps and body; mutable external evidence, labelled) | external review record | xAI/Grok via Cursor (posted by `cursor[bot]`) and owner; recorded by Anthropic | D2, D3, D4, D6 | +| `math.align-component.side24-review-claude` | `reviews/side24_v1_coefficient_claude_20260929/REVIEW.md` | review record | Anthropic (other session) | D3 | +| `math.align-component.pr22-annulus-review` | `reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md` | review record | xAI | annulus | +| `math.align-component.two-scale-addendum` | `frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md` (`079f9399…`, blob `89cae3a9`) | consumed proof: the S6–S21 stitching input ((S4) on `A ≤ |u| ≤ B`) | OpenAI | annulus | +| `math.align-component.two-scale-review` | `reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md` (`04cf4c98…`, blob `89882516`) | review record of the addendum (S6–S21 and (S3)–(S5) ACCEPT) | xAI | `…two-scale-addendum` | +| `math.align-component.p15-review` | `reviews/p15_full_price_nonauthor_20260926/REVIEW.md` | review record | xAI | D6, `…p15-realized-covers-setwise` | +| `math.align-component.p15-realized-covers-setwise` | `frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md` (`c0dbb821…`, blob `17388191`) | consumed interface: (P1), (P2), Theorem P2 setwise at `K ≥ K_H(d)` only, as the D6 review checked them; the note's `c_v ≤ p_v` price theorem is not included | OpenAI | D6 | + +These are exactly the support dependencies the canonical claim manifest records for the annulus (`two-scale-s6-s21`) +and for the full-price theorem (`p15-realized-covers:setwise-interfaces`). The interface's two consumed premises are +the live D1 node (regression law `Q`, §9 Borel-mark convention, read with its four reading-rule components) and the live +cap component (`0bf922b9…`, the SHA256 the note quotes for its §5 support statement); the (N6) cross-reference to the +C6 Palm route's Lemma 5.1 in the review is for the reader and is not consumed. + +Every proposed node keeps `controlling: false`; each candidate node's `fingerprint` becomes the SHA256 of its source in +§2, and `apply()` carries `scope`, `explicit_limits`, a replacement `notes`, `review_disposition`, `review_sources` and a +structured `review_basis` onto the node, so no promoted node keeps a "review open" or "covered by candidate only" note +(Codex 4139807551; OpenAI 5360327058 item 3). Region nodes keep `coverage_source` and gain a required `covered_by` edge +to their covering node, so that a change to the covering proof reaches the region in `reverse_impact_between` (Codex +4139807558; OpenAI 5360327058 item 1). No `hist.*`, `eng.*` or `regional.*` node moves; no live node other than the +eight changes; no live edge is removed; every added edge leaves one of this record's objects. The order in +`execution_order` creates the component nodes and edges first, then the premise, then each region after its covering +node; the D4 theorem node and its region are executed only after Math-#151 is on main (satisfied at `ec6db8c`): the D4 +bytes are now carried by two live nodes on the same review, and the flip aligns the older one with the newer one; the +executing lane may then collapse `math.d5-component.remote-window-proof` onto the live node or keep both (xAI +5901912476, 5360240245). STATUS, PROOF_INDEX, SELECTOR_REGION and the catalog need no edit for this record: they +already say what the graph is being aligned to. + +`alignment_check.py` applies the proposal to a copy of the live graph and replays it through the hard gate's own +validators (`validate_graph_fail_closed`, `closure_report`, `reverse_impact_between`, imported from +`frontiers/downstream_gate_20260925/hard_gate.py`): the proposed graph is well formed, no node is controlling, +`gate_ok` holds, and the loss-only reverse-impact proposal names exactly the changed nodes and their dependents. +`PROPAGATION` then runs nine two-commit mutations through `reverse_impact_between` with source snapshots in the shape of +`git_transition_audit.read_snapshot` (proof edits reach their regions and consumers; a deleted review record and an +edited external-review record reach the accepted objects and their dependents; consumed-source edits reach their +consumers; an unrelated edit and a no-op reach none of the eight), the guarantee OpenAI 5360320845 asked to be tested +rather than inferred from old-versus-new GRAPH metadata. + +## 5. What is not proposed + +- The mesoscopic, pin-collision and intermediate regions: Math-#151. The witness-collision region and its residual: + Math-#160. `math.rn-mesoscopic-reduction` (legacy PR7 route): unchanged, still `AUTHOR_SIDE_REDUCTION`. +- Any second-provider reads. Where a row rests on one provider the row says so; the lane executing the flip decides + whether that is enough, as it was not for D1. +- Any controlling flag, promotion, `lemma_closed`, prize, STATUS, PROOF_INDEX, catalog or selector edit. + +## 6. Checks + +`alignment_check.py` (stdlib only, run from the repository root): +- **IDENTITIES.** All fifteen inventoried files (the six sources, the D1 parent, the four in-repo reviews, the two + consumed sources, and this packet's two review records) exist as regular files, no symlink on their paths, stated + SHA256 and blob. +- **VERDICTS.** The quoted verdict rows and binding lines of the in-repo reviews (pr22, p15, side24, two-scale), the + object headers of the sources, the D4 sentence that consumes the interface, the interface note's (N1)/(N4)/(N5) + displays, the five PROOF_INDEX rows, the interface review's overall verdict and evidence labels, and the seven comment + ids with their verdict lines and the mutability label in `EXTERNAL_REVIEWS.md` are present as substrings. +- **BASELINE.** Each transition's live node exists with exactly the recorded current classification, fingerprint, + kind and source; the D1 node is `PROVED_REVIEWED` with its four reading-rule components `PROVED_REVIEWED`. +- **TRANSITIONS.** `declarative` true, `executed` false, `edges_unchanged` false; every proposed classification is + `PROVED_REVIEWED` with `controlling: false`, a non-empty scope, explicit limits, replacement notes and at least one + review source; every candidate node's fingerprint equals the SHA256 of its inventoried source; every component node + is a `reading_rule_component`, `PROVED_REVIEWED`, non-controlling, fingerprinted to its inventoried source, with a + role, a provider, a review basis and a consumer, one node per byte identity and none for bytes the live graph already + carries; every added edge is well formed, new, and leaves one of this record's objects; applied to a copy of the live + graph, no live node other than the eight changes, no live edge is removed, every flipped node's required premises (the + live D1 node and cap component, the interface, the component nodes) are `PROVED_REVIEWED`, every region requires its + covering node, and every applied node carries its `explicit_limits`, its replacement `notes` and a `review_basis`. +- **GATE.** The proposed graph passes the hard gate's `validate_graph_fail_closed`; `closure_report` gives `gate_ok` + with no illegal controlling node; `reverse_impact_between(live, proposed)` runs and its impacted set (the eight nodes, + the eight component nodes and their dependents) is recorded. +- **PROPAGATION.** Nine two-commit cases on the proposed graph with source snapshots in the shape of + `git_transition_audit.read_snapshot`: a D4 proof edit reaches the fixed-remote region and the mesoscopic consumer; an + annulus proof edit reaches its region; deleting the interface review record reaches the interface, D4, the annulus and + both regions; editing the external-review record reaches D2, D3, D4, D6 and the fixed-remote region; editing the + two-scale addendum reaches the annulus and its region; editing the realized-covers source reaches D6; a D4 fingerprint + edit reaches the region; an unrelated edit reaches none of the eight; a no-op impacts nothing. +- **INTERFACE.** The finite content of §3, in two labelled parts: exact rational checks (Hölder for `p = 2, 3` on + finite spaces, the (N2) exponent identity, the (N3) identity, the sharp-`p` example at `r = 2^(−pm)`, the integer + monotonicity in (N4)) and floating-point numerical corroborations (the (N4) grid maximum, the (N5) Simpson quadrature + at three parameter points, the (N4) example's uniform tail on a grid). The analytic arguments are in the review; the + numerical part corroborates, it does not prove. +- **NEGATIVES.** Real filesystem faults on a temporary copy of the inventory (delete, change one byte, symlink, symlink + parent of the D4 proof) are rejected. +- **D4_DUPLICATE.** The live graph carries `math.d5-component.remote-window-proof` as `PROVED_REVIEWED`, + non-controlling, with the same SHA256 fingerprint and source as the D4 transition and as the inventory, a `review_basis` + citing main#76 with verdict ACCEPT, `component_of` `math.d5-pin-neighborhood-first-moment`; and the older live node + `math.rn-fixed-remote-window` still carries that fingerprint at `AUTHOR_SIDE_CANDIDATE`, the lag this record aligns. + +Twelve mutants must fail: `allow-symlink`, `no-hash`, `stale-fingerprint`, `drop-review-source`, `controlling-true`, +`executed-flag`, `skip-interface-premise`, `holder-reversed`, `baseline-drift`, `duplicate-drift`, `region-unlinked` +(the `covered_by` edges removed before the propagation replay: proof edits no longer reach the regions) and +`review-metadata-only` (the review-record nodes and their edges removed before the replay, leaving the citations as +metadata only: a deleted or edited review record no longer reaches its accepted object). + +## 7. Relation to other lanes + +- **Math-#151 (Codex, D5 fold; merged at `ec6db8c`, 30 September 00:56Z, final head `609e559`):** landed as proposed, + so the live graph carries `math.d5-component.remote-window-proof` (`PROVED_REVIEWED`, `component_of` + `math.d5-pin-neighborhood-first-moment`, `review_basis` main#76) for the D4 bytes beside `math.rn-fixed-remote-window` + (`AUTHOR_SIDE_CANDIDATE`); the coordination note (comment 5901742635) was not taken up before the merge. This record's + D4 flip aligns the two; collapsing the component node to a `required` edge onto the live node is a one-edge follow-up + for the executing lane, not proposed here. +- **Math-#160 (this session, C6 reconciliation):** already references the live D4 node with supporting edges; nothing + there changes. +- **OpenAI reviews 5360320845 and 5360327058; Codex review 5360253242 (threads 4139807545–67):** answered by v1.3 (§0, + §4, §6); the region-reporting thread is superseded on main since `ec6db8c` and not replayed. The single-provider caveat + and the HOLD on execution stand until the executing lane decides. +- **Math-#163 (navigation refresh):** availability index only; disjoint. +- **main#207 (closed 30 September 00:57Z, after Math-#151 merged):** the delivery note for this record is comment + 5901889845. The executing lane for this record remains non-Claude; any new coordination thread is that lane's to open. diff --git a/reviews/register_alignment_20260930/RESULTS.json b/reviews/register_alignment_20260930/RESULTS.json new file mode 100644 index 000000000..6702db536 --- /dev/null +++ b/reviews/register_alignment_20260930/RESULTS.json @@ -0,0 +1,99 @@ +{ + "checks": { + "BASELINE": true, + "D4_DUPLICATE": true, + "GATE": true, + "IDENTITIES": true, + "INTERFACE": true, + "NEGATIVES": true, + "PROPAGATION": true, + "TRANSITIONS": true, + "VERDICTS": true + }, + "component_nodes": 8, + "edges_added": 16, + "gate": { + "changed_nodes": [ + "math.align-component.external-issue-reviews", + "math.align-component.p15-realized-covers-setwise", + "math.align-component.p15-review", + "math.align-component.pr22-annulus-review", + "math.align-component.rn-interface-review", + "math.align-component.side24-review-claude", + "math.align-component.two-scale-addendum", + "math.align-component.two-scale-review", + "math.lifetime-remainder", + "math.p15-full-price", + "math.rn-count-interface", + "math.rn-fixed-annulus-window", + "math.rn-fixed-remote-window", + "math.rn-region.fixed-annulus-window", + "math.rn-region.fixed-remote", + "math.side24-coefficient" + ], + "impacted": [ + "math.align-component.external-issue-reviews", + "math.align-component.p15-realized-covers-setwise", + "math.align-component.p15-review", + "math.align-component.pr22-annulus-review", + "math.align-component.rn-interface-review", + "math.align-component.side24-review-claude", + "math.align-component.two-scale-addendum", + "math.align-component.two-scale-review", + "math.lifetime-remainder", + "math.p15-full-price", + "math.rn-count-interface", + "math.rn-fixed-annulus-window", + "math.rn-fixed-remote-window", + "math.rn-mesoscopic-reduction", + "math.rn-region.fixed-annulus-window", + "math.rn-region.fixed-remote", + "math.rn-selector-region-crosswalk", + "math.side24-coefficient" + ], + "reverse_impact_keys": [ + "changed_nodes", + "context_changed", + "graph", + "impacted", + "meaning", + "promotion_permission", + "source_snapshots_supplied", + "traversal_edges" + ] + }, + "interface_evidence": { + "exact_rational": [ + "(N1) Holder p=2,3 on finite rational spaces", + "(N2) exponent identity", + "(N3) conditional-mean identity", + "sharp-p example at r=2^-pm", + "(N4) integer monotonicity of ceil(t)" + ], + "numerical_corroboration_floating_point": [ + "(N4) grid maximum of (t+1)^p e^-3t", + "(N5) Simpson quadrature at three parameter points", + "(N4) example uniform tail on a grid" + ], + "results": { + "exact": true, + "numerical_corroboration": true + } + }, + "inventory_files": 15, + "object": "REGISTER-ALIGNMENT-20260930-v1", + "passed": true, + "propagation": { + "annulus-proof-edit-reaches-region": true, + "d4-fingerprint-edit-reaches-region": true, + "d4-proof-edit-reaches-region-and-consumer": true, + "external-review-record-edit-reaches-d2-d3-d4-d6": true, + "interface-review-deleted-reaches-interface-consumers-regions": true, + "no-op-impacts-nothing": true, + "realized-covers-edit-reaches-d6": true, + "two-scale-addendum-edit-reaches-annulus-and-region": true, + "unrelated-edit-leaves-the-eight-untouched": true + }, + "scope": "identity, verdict-row, live-baseline, transition-shape, hard-gate replay, two-commit propagation, interface arithmetic (exact and numerical parts labelled), filesystem-negative and live D4-duplicate checks; no mathematics is re-proved; nothing is written", + "transitions": 8 +} diff --git a/reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md b/reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md new file mode 100644 index 000000000..7e7049e2b --- /dev/null +++ b/reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md @@ -0,0 +1,56 @@ +# Nonauthor review — RN count interface note (D4 premise) + +**Object reviewed:** `frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md` (RN-COUNT-INTERFACE-20260924-v1), author +OpenAI / ChatGPT; on Math- `main` `aa288385af9392c509233c25a0f4012c9ba023e5`; 8938 bytes, SHA256 +`aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab`, git blob `371fd6d17920f2eb3b1c5ec30297acf6daf1d385`; unchanged since its landing commit `8a13ee9` +(24 September 2026). Live graph node `math.rn-count-interface` carries this SHA256 as fingerprint. +**Revision:** v1.3 (30 September 2026) corrects the evidence labels after OpenAI review 5360320845 item 2: the checks +that use floating point are now called numerical corroborations, the rational ones exact; and names the note's consumed +premises (item 3 there; OpenAI 5360327058 item 2). Verdicts unchanged. +**Reviewer:** Anthropic Claude, Claude Code session `session_017Mi3hxjaxV45x6zo6o1ee3`. Different provider from the +author. Same GitHub account as every lane; no organizational independence is claimed. +**Exposure:** I authored none of the three-fronts notes. I authored the remote-collision packet and the C6L packet, +both downstream of the fixed-remote theorem that consumes this note; neither is an input here. +**Scope:** the logical interface only, as the note itself states: the implications (N1)–(N3), the counterexamples of +§3 with (N4)–(N5), the marked Kac–Rice expression (N6)–(N7) as a formula, and the support statement of §5. No rate, +no RN numerical certificate and no evaluation of the Gaussian triple integral are claimed by the note or accepted +here. Scientific effect: NONE. +**Promoted scope (v1.3):** (N1)–(N5) and the §3 counterexamples as self-contained probability statements; (N6)–(N7) +and §5 as formula-level implications conditional on the note's two consumed premises, the parent's regression law `Q` +with its §9 Borel-mark convention (live node `math.uniform-matrix-cap-lifetime`, read with its four reading-rule +components) and the cap support source of §5 (live node `math.d1-component.marked-cylinder-cap`, SHA256 `0bf922b9…`, the +digest the note quotes); both are required edges in `PROPOSED_TRANSITIONS.json`. Nothing quantitative. + +## Verdicts + +| Item | Statement | Verdict | +|---|---|---| +| (N1) | `E[N 1_E] ≤ (E N^p)^(1/p) P(E)^(1−1/p)` for `p > 1` | **ACCEPT**: Hölder with exponents `p` and `p/(p−1)` applied to `N · 1_E`. Exact rational check for `p = 2` (Cauchy–Schwarz form `(E[N1_E])² ≤ E[N²] P(E)`) and `p = 3` (`(E[N1_E])³ ≤ E[N³] P(E)²`) on finite distributions in `alignment_check.py` (`INTERFACE`). | +| (N2) | `E N^p ≤ A r^(−β)` gives `E[N 1_E] ≤ A^(1/p) C^(1−1/p) r^([3(p−1)−β]/p)` | **ACCEPT**: substitution into (N1); the exponent `3 − 3/p − β/p` is the moment convention, as the note says. | +| (N3) | `E[N 1_E] = q E[N | E]`, `q = P(E) > 0` | **ACCEPT**: definition of conditional expectation; the two remarks (sufficiency of a bounded conditional mean; equivalence only under a lower comparison `q ≥ c r³`) follow. | +| §3 (N4) | `U` uniform, `E_r = {U ≤ r³}`, `N_r = ⌈log(1/r)⌉ 1_{E_r}`: `E N_r / r³ → ∞` while `sup_r E N_r^p < ∞` for every fixed `p` | **ACCEPT**: `P(E_r) = r³`; `E N_r^p = ⌈t⌉^p e^(−3t) ≤ (t+1)^p e^(−3t)` with `t = log(1/r) ≥ 1`, whose supremum over `t ≥ 1` is finite (the logarithmic derivative `−3 + p/(t+1)` is eventually negative). The argument is the log-derivative; `INTERFACE` corroborates it numerically, in floating point, on `r = e^(−t)`, `t = 1, …, 12`, and on a grid against the located maximum (labelled `numerical_corroboration`, not exact). | +| §3 sharp `p` | `N_r = ⌈r^(−3/p)⌉ 1_{E_r}`: `E N_r^p ≤ 2^p` for `r ≤ 1`, `E N_r ≍ r^(3−3/p)` | **ACCEPT**: `r^(−3/p) ≥ 1` gives `⌈r^(−3/p)⌉ ≤ 2 r^(−3/p)`. Checked exactly at `r = 2^(−pm)`, where `r^(−3/p) = 2^(3m)` is an integer, `E N_r^p = 1` and `E N_r = r^(3−3/p)` exactly. | +| (N5) | `P(N > t) ≤ A e^(−t/B)`, `A ≥ 1`, gives `E[N 1_E] ≤ ∫ min(q, A e^(−t/B)) dt = B q [1 + log(A/q)]` | **ACCEPT**: layer cake `E[N 1_E] = ∫_0^∞ P(N > t, E) dt ≤ ∫ min(q, P(N > t)) dt`; the crossover is `t_0 = B log(A/q)` and the two pieces are `q t_0` and `A B e^(−t_0/B) = B q`. The (N4) example has the uniform tail `P(N_r > t) ≤ e³ e^(−3t)` (`A = e³`, `B = 1/3`), so the logarithmic loss in (N5) is not removable from a tail hypothesis alone, as the note says. The identity is proved by the antiderivative; `INTERFACE` corroborates it by floating-point Simpson quadrature at three parameter points and checks the tail comparison on a floating-point grid (numerical corroboration, not exact). | +| §4 (N6) | marked Kac–Rice for `E_Q^W N_B` with the endpoint weight as a field mark and the event indicator inside the conditional expectation | **ACCEPT as a formula at the note's stated level of rigour** (bounded continuous cylinder marks, extension of finite measures, truncation of `W_r`, monotone convergence; compact `B` off the pins, exhaustion), conditional on the note's consumed premise: the parent's regression law `Q` and its §9 Borel-mark convention (live node `math.uniform-matrix-cap-lifetime`, read with its four reading-rule components; a required edge in the proposal). Its fixed-remote instance is the reviewed formula (12)–(14) of the D4 proof, accepted in main#76 comment 5841783172 items 2–3. A later rigorous statement of the same identity with the kernel convention fixed is Lemma 5.1 of `frontiers/c6_palm_route_20260929/PROOF.md` (Math-#145); it is cited for the reader and is not consumed here. Nothing quantitative is asserted by (N6) and nothing quantitative is accepted here. | +| §4 (N7) | an `A r⁵` enclosure of the numerator with `Z_r ≥ z_* r²` gives `E_Q^W N_B ≤ (A/z_*) r³` | **ACCEPT**: division; the note correctly separates this from the cap probability argument (`E_Q[W_r 1_{G^c}]`). | +| §5 | support on the rare event only inside the deterministic cap cylinder; remote regions need their own support statement or the count `N 1_{G^c}` | **ACCEPT as a scope statement**; it consumes the cap source `0bf922b9…` for the containment `{M, S}` on `G_r` (the live node `math.d1-component.marked-cylinder-cap` carries exactly that SHA256; a required edge in the proposal) and adds nothing to it. | +| §6 | completion test: (N7) or a uniform conditional mean with the support relation; finite moments give (N2), tails give (N5) | **ACCEPT** as the logical summary of the above. | + +**Overall: ACCEPT at the logical-interface scope.** The note proves exactly what it claims and no more: correct +inequalities and counterexamples, and the form of the full-pin Kac–Rice expression that the fixed-remote theorem later +evaluated. It is not an expected-count rate and is not treated as one. Evidence labels: the (N1)–(N3) and sharp-`p` +checks in `INTERFACE` are exact rational arithmetic; the (N4) grid, the (N5) quadrature and the tail grid are floating-point +numerical corroborations of arguments proved above, not exact checks. + +## Relation to its consumers +- `math.rn-fixed-remote-window` (D4) reads the interface as the formulation it completes: PROOF §1 "identified a + three-determinant integral whose unnormalized numerator must be O(r^5), but did not bound it. This note supplies + that bound"; §7 "Equation (14) now supplies it for every fixed remote region and the entire BETWEEN-PIN HEIGHT WINDOW". + The D4 review reconstructed the three determinant factors, the `O(k r⁵)` numerator and the original normalizer + (items 2–3), i.e. the consumed content of (N6)–(N7). +- `math.rn-fixed-annulus-window` (D5 fixed annulus) uses the same normalized three-determinant intensity with the + original normalizer (its (A8) and §5 ledger), reviewed in `reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md`. + +## Not established here +No rate, no RN or 24-jet certificate, no `ENV-RESCOV` or historical carrier, no register transition. This file is a +review record; the proposal that consumes it is `RECONCILIATION.md` in this directory. diff --git a/reviews/register_alignment_20260930/SOURCE_FILES.json b/reviews/register_alignment_20260930/SOURCE_FILES.json new file mode 100644 index 000000000..e49e54aee --- /dev/null +++ b/reviews/register_alignment_20260930/SOURCE_FILES.json @@ -0,0 +1,47 @@ +{ + "schema": 1, + "object": "REGISTER-ALIGNMENT-20260930-v1", + "scientific_effect": "NONE", + "disposition": "PROPOSAL_FOR_A_NON_CLAUDE_LANE", + "declarative": true, + "executed": false, + "base": "aa288385af9392c509233c25a0f4012c9ba023e5", + "files": [ + { + "path": "PROPOSED_TRANSITIONS.json", + "bytes": 40189, + "sha256": "dad87926726d8a86d5ff33d1d03eecafa9b05bf9e4c0eaeb08dd67104efc695d", + "git_blob": "1c1bea9ba98ca212159fa907e2bdeda1ff863d36" + }, + { + "path": "RECONCILIATION.md", + "bytes": 32725, + "sha256": "0baf1c4e3c48ca3e2bb4eaeb419ee8ba368f082447f38f638fd10ce023c5249f", + "git_blob": "ece9655fd80ea51c18d7b1b2410d4c073854db89" + }, + { + "path": "RN_COUNT_INTERFACE_REVIEW.md", + "bytes": 8115, + "sha256": "52d9038a3f27335d3c219babec785984e00b77f28d7cd7b390477c0bc6a749d1", + "git_blob": "7e7049e2b5e96e51394d44683d61c9d0e03b9323" + }, + { + "path": "RESULTS.json", + "bytes": 3452, + "sha256": "cbbff25994c22c55fd49c59bc2748af1c6ef128793a34880613cf7cb1d9162df", + "git_blob": "6702db536f00ec5689ab398c003f46a91b645d7b" + }, + { + "path": "alignment_check.py", + "bytes": 31556, + "sha256": "eb1888ea57416f87fbfa4692b6c07b20261c97bd08ce926aee7ec6fca5486502", + "git_blob": "cd110b0cfb2cfaf6f11e7405d99e0070c816a224" + }, + { + "path": "EXTERNAL_REVIEWS.md", + "bytes": 29877, + "sha256": "fa6677f16f688352f3fc9b1703d39324fe57a3b2bf61960591f524f858e99c9d", + "git_blob": "2be80e35bce1ffc90d1f7a0675ad5e8830ddbd28" + } + ] +} diff --git a/reviews/register_alignment_20260930/alignment_check.py b/reviews/register_alignment_20260930/alignment_check.py new file mode 100644 index 000000000..cd110b0cf --- /dev/null +++ b/reviews/register_alignment_20260930/alignment_check.py @@ -0,0 +1,585 @@ +"""Checks for REGISTER-ALIGNMENT-20260930-v1 (RECONCILIATION.md, PROPOSED_TRANSITIONS.json, RN_COUNT_INTERFACE_REVIEW.md). + +Standard library only. Run from the repository root: python -B -S reviews/register_alignment_20260930/alignment_check.py +Checks: IDENTITIES, VERDICTS, BASELINE, TRANSITIONS, GATE, PROPAGATION, INTERFACE, NEGATIVES, D4_DUPLICATE. No mathematics +is re-proved; the proposed graph is replayed through the downstream hard gate's own validators, and two-commit source +mutations through its reverse-impact rule. Nothing is written to the repository. +""" +import argparse +import copy +import hashlib +import importlib.util +import json +import math +import os +import pathlib +import shutil +import sys +import tempfile +from fractions import Fraction as F + +MUTANTS = ("allow-symlink", "no-hash", "stale-fingerprint", "drop-review-source", "controlling-true", "executed-flag", + "skip-interface-premise", "holder-reversed", "baseline-drift", "duplicate-drift", "region-unlinked", + "review-metadata-only") +MUT = None +HERE = "reviews/register_alignment_20260930" +GRAPH = "frontiers/downstream_gate_20260925/GRAPH.json" +HARD_GATE = "frontiers/downstream_gate_20260925/hard_gate.py" +D1 = "math.uniform-matrix-cap-lifetime" +D4_DUP = "math.d5-component.remote-window-proof" +D4_NODE = "math.rn-fixed-remote-window" +IFACE = "math.rn-count-interface" +D4 = "frontiers/remote_window_20260924/PROOF.md" +INVENTORY = { + "frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md": [ + "380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a", + "247b3ecf80bfbe896948d5d489b2d5842a81c481" + ], + "frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md": [ + "aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab", + "371fd6d17920f2eb3b1c5ec30297acf6daf1d385" + ], + "coefficients/side24_v1/PROOF.md": [ + "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769", + "44b66f04f89fcd87383b3603fa69f1feb64cdddd" + ], + "frontiers/remote_window_20260924/PROOF.md": [ + "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "b383bfcc88ec4ad497dff01fb6640e429ba24a84" + ], + "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md": [ + "1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b", + "081abc13c5e66342c13df2af2bd6b114f320486f" + ], + "frontiers/full_price_20260924/PROOF.md": [ + "87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9", + "582180e41dca0ad815ad0f18574df42040912149" + ], + "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md": [ + "29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d", + "1f153966dae48d10574db0d272f75d08ca3a8b23" + ], + "reviews/p15_full_price_nonauthor_20260926/REVIEW.md": [ + "691ea0db5c0f073326c9f7208c9804c6f5d0daf92ba7467529c9d57e08b15eb7", + "07db19f826763b8faa7414ba2e403d9c45bc0b6e" + ], + "reviews/side24_v1_coefficient_claude_20260929/REVIEW.md": [ + "258c414c46be93142ee552cfa4c32c03dd89b6bf7b0b470334f152e1e0a57eef", + "665d1683f33a7180957923c3cb2abce8ade235d1" + ], + "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md": [ + "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "dfed3b8d318a3ab1950957f393307733a4bef3f2" + ], + "frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md": [ + "079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d", + "89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73" + ], + "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md": [ + "04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574", + "8988251631cab8e65eb2b01a08f7fc593b018570" + ], + "frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md": [ + "c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9", + "173881916ccd0e738bdb41279e835e78e520fcbc" + ], + "reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md": [ + "52d9038a3f27335d3c219babec785984e00b77f28d7cd7b390477c0bc6a749d1", + "7e7049e2b5e96e51394d44683d61c9d0e03b9323" + ], + "reviews/register_alignment_20260930/EXTERNAL_REVIEWS.md": [ + "fa6677f16f688352f3fc9b1703d39324fe57a3b2bf61960591f524f858e99c9d", + "2be80e35bce1ffc90d1f7a0675ad5e8830ddbd28" + ] +} +VERDICTS = { + "frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md": ["**Object:** LIFETIME-BOUNDED-REMAINDER-20260924-v1."], + "frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md": [ + "**Object:** RN-COUNT-INTERFACE-20260924-v1.", + "E[N_r 1_Er] <= (E N_r^p)^(1/p) P(E_r)^(1-1/p).", + "N_r=ceil(log(1/r)) 1_Er.", + "= B q[1+log(A/q)]."], + "coefficients/side24_v1/PROOF.md": ["Object: SIDE24-COEFFICIENT-D23-20260924-v1."], + "frontiers/remote_window_20260924/PROOF.md": [ + "**Object:** RN-FIXED-REMOTE-WINDOW-20260924-v1.", + "Equation (14) now supplies it for every fixed remote region and the entire BETWEEN-PIN HEIGHT WINDOW."], + "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md": ["**Object:** D5-FIXED-ANNULUS-STITCH-20260925-v1."], + "frontiers/full_price_20260924/PROOF.md": ["**Object:** P15-FULL-TRANSFORMED-PRICE-20260924-v1."], + "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md": [ + "| Blob | `081abc13c5e66342c13df2af2bd6b114f320486f` |", + "| SHA256 | `1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b` |", + "| Cutoff `r^{1/24}` | **ACCEPT** |", + "| Inner two-scale stitching | **ACCEPT** |", + "`TWO_SCALE_ADDENDUM.md` blob `89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73`, 15902 bytes"], + "reviews/p15_full_price_nonauthor_20260926/REVIEW.md": [ + "| Blob | `582180e41dca0ad815ad0f18574df42040912149` |", + "| SHA256 | `87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9` |", + "| 1. Coordinatewise hazard transform, separate concavity, chord, `p=0,1` | **ACCEPT** |", + "SHA256 `c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9`. That is the digest named in the proof.", + "| 4. Full-block cover, same palette, realized family | **ACCEPT** |"], + "reviews/side24_v1_coefficient_claude_20260929/REVIEW.md": [ + "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769", + "Overall: **ACCEPT at the arithmetic-enclosure scope**"], + "PROOF_INDEX.md": [ + "- D2 lifetime remainder: proof [frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md]", + "- D3 SIDE24 coefficient: proof [coefficients/side24_v1/PROOF.md]", + "- D4 fixed-remote RN theorem: proof [frontiers/remote_window_20260924/PROOF.md]", + "- D5 fixed-annulus height-window fallback: proof [frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md]", + "- D6 P15 full price theorem: proof [frontiers/full_price_20260924/PROOF.md]"], + "frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md": ["**Object:** D5-TWO-SCALE-20260925-v1."], + "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md": [ + "blob `89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73`, 15902 bytes, SHA256 `079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d`", + "| S6 | **ACCEPT** |"], + "frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md": ["**Object:** P15-REALIZED-COVERS-20260924-v1."], + HERE + "/RN_COUNT_INTERFACE_REVIEW.md": [ + "**Overall: ACCEPT at the logical-interface scope.**", + "numerical corroborations of arguments proved above, not exact checks"], + HERE + "/EXTERNAL_REVIEWS.md": [ + "issuecomment-5841270276", "issuecomment-5841782206", "issuecomment-5841269490", "issuecomment-5841779222", + "issuecomment-5841783172", "issuecomment-5841861362", "issuecomment-5842112010", + "R5 and R6 are **ACCEPT**. Theorem R is accepted at its stated O(1) remainder scope.", + "All six coefficient interfaces check out. The disposition is **COEFFICIENT-CALC-REVIEWED / PARENT-IMPORTED-OPEN**.", + "This accepts only the fixed-ρ and fixed-η interfaces below. It does not accept a full RN or 24-jet theorem.", + "D6 ANALYTIC REVIEW COMPLETE", + "An issue comment is a mutable external object"], +} + + +def git_blob(data): + return hashlib.sha1(b"blob %d\0" % len(data) + data).hexdigest() + + +def no_symlink_on_path(root, path): + parts = pathlib.PurePosixPath(path).parts + return not any((root / pathlib.PurePosixPath(*parts[:i])).is_symlink() for i in range(1, len(parts) + 1)) + + +def identities_ok(root): + for path, (sha, blob) in INVENTORY.items(): + p = root / path + if not os.path.lexists(p): + return False + if MUT != "allow-symlink" and not no_symlink_on_path(root, path): + return False + if not p.is_file(): + return False + data = p.read_bytes() + if MUT != "no-hash" and (hashlib.sha256(data).hexdigest() != sha or git_blob(data) != blob): + return False + return True + + +def check_verdicts(root): + for path, needles in VERDICTS.items(): + text = (root / path).read_text(encoding="utf-8") + if not all(n in text for n in needles): + return False + return True + + +def load_spec(root): + spec = json.loads((root / HERE / "PROPOSED_TRANSITIONS.json").read_text(encoding="utf-8")) + if MUT == "executed-flag": + spec["executed"] = True + if MUT == "skip-interface-premise": + spec["transitions"] = [t for t in spec["transitions"] if t["node"] != IFACE] + if MUT == "drop-review-source": + for t in spec["transitions"]: + if t["node"] == D4_NODE: + t["proposed"]["review_sources"] = [] + if MUT == "controlling-true": + for t in spec["transitions"]: + if t["node"] == D4_NODE: + t["proposed"]["controlling"] = True + if MUT == "stale-fingerprint": + for t in spec["transitions"]: + if t["node"] == D4_NODE: + t["proposed"]["fingerprint"] = "0" * 64 + if MUT == "baseline-drift": + for t in spec["transitions"]: + if t["node"] == D4_NODE: + t["current"]["classification"] = "PROVED_REVIEWED" + return spec + + +def check_baseline(root, spec): + live = json.loads((root / GRAPH).read_text(encoding="utf-8"))["nodes"] + ok = True + for t in spec["transitions"]: + n = live.get(t["node"]) + if not isinstance(n, dict): + return False + ok &= n.get("classification") == t["current"]["classification"] + ok &= n.get("fingerprint") == t["current"]["fingerprint"] + ok &= n.get("kind") == t["kind"] and n.get("controlling") is False + if t["kind"] == "candidate": + ok &= n.get("source") == t["proposed"]["source"] + d1 = live.get(D1, {}) + ok &= d1.get("classification") == "PROVED_REVIEWED" and d1.get("fingerprint") == INVENTORY[ + "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md"][0] + rr = d1.get("reading_rule", []) + ok &= len(rr) == 4 and all(live.get(x, {}).get("classification") == "PROVED_REVIEWED" for x in rr) + return bool(ok) + + +def apply(spec, graph): + """The proposal applied to a copy of the live graph: the eight flips with their scope exclusions and replacement + notes, plus the review-record / consumed-source component nodes and the required edges that carry the evidence.""" + new = copy.deepcopy(graph) + for t in spec["transitions"]: + n = new["nodes"][t["node"]] + p = t["proposed"] + n["classification"] = p["classification"] + n["controlling"] = p["controlling"] + n["fingerprint"] = p["fingerprint"] + if p.get("source"): + n["source"] = p["source"] + n["scope"] = p["scope"] + n["explicit_limits"] = p["explicit_limits"] + n["notes"] = p["notes"] + n["review_disposition"] = p["review_disposition"] + n["review_sources"] = [r["ref"] for r in p["review_sources"]] + n["review_basis"] = [{"review": r["ref"], "provider": r.get("provider", "unstated"), "verdict": r.get("verdict", "")} + for r in p["review_sources"]] + if p.get("coverage_source"): + n["coverage_source"] = p["coverage_source"] + for c in spec["proposed_graph_nodes"]: + new["nodes"][c["id"]] = {k: v for k, v in c.items() if k != "id"} + new["edges"] = list(new["edges"]) + [dict(e) for e in spec["proposed_graph_edges"]] + return new + +def check_transitions(root, spec): + graph = json.loads((root / GRAPH).read_text(encoding="utf-8")) + ok = spec.get("declarative") is True and spec.get("executed") is False and spec.get("edges_unchanged") is False + ids = [t["node"] for t in spec["transitions"]] + ok &= len(ids) == len(set(ids)) and len(ids) >= 1 + for t in spec["transitions"]: + p = t["proposed"] + ok &= p["classification"] == "PROVED_REVIEWED" and p["controlling"] is False + ok &= bool(p.get("scope")) and bool(p.get("explicit_limits")) and bool(p.get("notes")) + ok &= len(p.get("review_sources", [])) >= 1 + if t["kind"] == "candidate": + ok &= p.get("source") in INVENTORY and p["fingerprint"] == INVENTORY[p["source"]][0] + else: + ok &= t["kind"] == "region" and p.get("coverage_source") in ids + ok &= not t["node"].startswith(("hist.", "eng.", "regional.")) + # component nodes: one per byte identity, fingerprinted to the inventory, PROVED_REVIEWED evidence records, + # none for bytes the live graph already carries with a fingerprint (Codex 4139312869 on Math-#160) + comps = spec["proposed_graph_nodes"] + cids = [c["id"] for c in comps] + live_fp_sources = {n.get("source") for n in graph["nodes"].values() + if isinstance(n, dict) and n.get("fingerprint") and n.get("source")} + ok &= len(cids) == len(set(cids)) and not (set(cids) & set(graph["nodes"])) and len(comps) == spec["nodes_added"] + ok &= len({c["source"] for c in comps}) == len(comps) + for c in comps: + ok &= c["kind"] == "reading_rule_component" and c["classification"] == "PROVED_REVIEWED" and c["controlling"] is False + ok &= c["source"] in INVENTORY and c["fingerprint"] == INVENTORY[c["source"]][0] + ok &= c["source"] not in live_fp_sources + ok &= bool(c.get("component_role")) and bool(c.get("author_provider")) and len(c.get("review_basis", [])) >= 1 + consumers = c.get("components_of") or [c.get("component_of")] + ok &= all(x in ids + cids for x in consumers) and len(consumers) >= 1 + edges_new = spec["proposed_graph_edges"] + known = set(graph["nodes"]) | set(cids) + live_keys = {(e["from"], e["to"], e["relation"]) for e in graph["edges"]} + seen = set() + for e in edges_new: + ok &= {"from", "to", "required", "relation"} <= set(e) and type(e["required"]) is bool + ok &= e["from"] in known and e["to"] in known and bool(e["relation"].strip()) + key = (e["from"], e["to"], e["relation"]) + ok &= key not in seen and key not in live_keys + seen.add(key) + ok &= e["from"] in ids or e["from"] in cids # every added edge leaves one of this record's objects + ok &= len(edges_new) == spec["edges_added"] + if not ok: + return False, None + new = apply(spec, graph) + nodes = new["nodes"] + edges = new["edges"] + ok &= edges[:len(graph["edges"])] == graph["edges"] and len(edges) == len(graph["edges"]) + len(edges_new) + ok &= all(graph["nodes"][k] == nodes[k] for k in graph["nodes"] if k not in ids) # only the eight live nodes change + for t in spec["transitions"]: + nid = t["node"] + req = [e["to"] for e in edges if e["from"] == nid and e["required"] is True] + ok &= all(nodes[d]["classification"] == "PROVED_REVIEWED" for d in req) + ok &= sorted(req) == sorted(t["required_premises_after"]) + if t["kind"] == "region": + ok &= t["proposed"]["coverage_source"] in req # a region depends on its covering node + ok &= nodes[t["proposed"]["coverage_source"]]["classification"] == "PROVED_REVIEWED" + n = nodes[nid] + ok &= n.get("explicit_limits") == t["proposed"]["explicit_limits"] and n.get("notes") == t["proposed"]["notes"] + ok &= "review open" not in n["notes"] and "candidate only" not in n["notes"] + ok &= isinstance(n.get("review_basis"), list) and len(n["review_basis"]) >= 1 + for c in comps: # component nodes' own required premises + req = [e["to"] for e in edges if e["from"] == c["id"] and e["required"] is True] + ok &= all(nodes[d]["classification"] == "PROVED_REVIEWED" for d in req) + return bool(ok), new + +def load_hard_gate(root): + hg_spec = importlib.util.spec_from_file_location("hard_gate", root / HARD_GATE) + hg = importlib.util.module_from_spec(hg_spec) + hg_spec.loader.exec_module(hg) + return hg + + +def check_gate(root, spec, new): + if new is None: + return False, {} + hg = load_hard_gate(root) + old = json.loads((root / GRAPH).read_text(encoding="utf-8")) + try: + hg.validate_graph_fail_closed(new) + rep_new = hg.closure_report(new) + rep_old = hg.closure_report(old) + ri = hg.reverse_impact_between(old, new) + except Exception: + return False, {} + ok = rep_new.get("gate_ok") is True and not rep_new.get("illegal_controlling") + ok &= rep_old.get("gate_ok") is True + ok &= not any(n.get("controlling") for n in new["nodes"].values()) + changed = sorted([t["node"] for t in spec["transitions"]] + [c["id"] for c in spec["proposed_graph_nodes"]]) + imp = ri.get("impacted") if isinstance(ri, dict) else None + names = [] + if isinstance(imp, list): + for x in imp: + names.append(x if isinstance(x, str) else str(x.get("node") or x.get("id") or x)) + # loss-only rule: every changed node is itself in the impacted set + ok &= isinstance(ri, dict) and set(changed) <= set(names) + return bool(ok), {"changed_nodes": changed, "impacted": sorted(set(names)), "reverse_impact_keys": sorted(ri.keys()) if isinstance(ri, dict) else []} + + +def check_interface(): + """Finite content of RN_COUNT_INTERFACE_REVIEW.md: exact rational checks, and floating-point corroborations + labelled as such (OpenAI 5360320845 item 2).""" + ok = True + num = True + le = (lambda a, b: a >= b) if MUT == "holder-reversed" else (lambda a, b: a <= b) + # (N1) on finite rational spaces, p = 2 and p = 3 (Cauchy-Schwarz / Holder in power form) + spaces = [([F(1, 4)] * 4, [0, 1, 3, 7], [1, 0, 1, 0]), ([F(1, 2), F(1, 3), F(1, 6)], [2, 5, 11], [1, 1, 0]), + ([F(1, 8), F(3, 8), F(1, 2)], [0, 0, 9], [0, 0, 1]), ([F(9, 10), F(1, 10)], [0, 13], [0, 1])] + for probs, N, E in spaces: + assert sum(probs) == 1 + ene = sum(p * n * e for p, n, e in zip(probs, N, E)) + pe = sum(p * e for p, e in zip(probs, E)) + m2 = sum(p * n * n for p, n in zip(probs, N)) + m3 = sum(p * n ** 3 for p, n in zip(probs, N)) + ok &= le(ene ** 2, m2 * pe) and le(ene ** 3, m3 * pe ** 2) + if pe > 0: # (N3) + ok &= ene == pe * (ene / pe) + # (N2) exponent: (3(p-1) - beta)/p == 3 - 3/p - beta/p + for p in (2, 3, 5): + for beta in (F(0), F(1, 2), F(3)): + ok &= F(3 * (p - 1), 1) / p - beta / p == 3 - F(3, p) - beta / p + # (N4), NUMERICAL (floating point): r = e^-t, t = 1..12: E N / r^3 = ceil(t) increases; ceil(t)^p e^-3t <= (t+1)^p e^-3t, + # and the grid maximum of (t+1)^p e^-3t stays below the located critical value. The proof is the log-derivative argument. + for p in (1, 2, 4, 7): + vals = [math.ceil(t) ** p * math.exp(-3 * t) for t in range(1, 13)] + bound = [(t + 1) ** p * math.exp(-3 * t) for t in range(1, 13)] + num &= all(v <= b + 1e-15 for v, b in zip(vals, bound)) + tmax = max(1.0, p / 3 - 1) # critical point of (t+1)^p e^{-3t} + sup = (tmax + 1) ** p * math.exp(-3 * tmax) + grid = [(t / 100 + 1) ** p * math.exp(-3 * (t / 100)) for t in range(100, 400000, 7)] + num &= max(grid) <= sup + 1e-9 and math.isfinite(sup) + ok &= all(math.ceil(t) > math.ceil(t - 1) for t in range(2, 13)) # E N_r / r^3 -> infinity along the grid (exact integers) + # sharp p: r = 2^{-p m}: E N^p = 1, E N = r^{3-3/p} exactly + for p in (2, 3, 4): + for m in (1, 2, 3): + r = F(1, 2 ** (p * m)) + n_r = 2 ** (3 * m) # = ceil(r^{-3/p}) exactly + ok &= n_r ** p * r ** 3 == 1 and le(F(1), F(2 ** p)) and n_r * r ** 3 == F(1, 2 ** (3 * m * (p - 1))) + ok &= n_r * r ** 3 == r ** 3 / r ** F(3, 1) * F(1, 2 ** (3 * m * (p - 1))) # r^{3-3/p} = 2^{-3m(p-1)} + # (N5), NUMERICAL (floating point): int_0^inf min(q, A e^{-t/B}) dt = B q (1 + log(A/q)), q <= A; Simpson quadrature at + # three parameter points corroborates the antiderivative identity proved in the review + for (A, B, q) in ((1.0, 1.0, 0.1), (20.0, 0.5, 0.001), (3.0, 2.0, 2.0)): + t0 = B * math.log(A / q) + n = 200000 + T = t0 + 60 * B + h = T / n + s = 0.0 + for i in range(n + 1): + t = i * h + w = 1 if i in (0, n) else (4 if i % 2 else 2) + s += w * min(q, A * math.exp(-t / B)) + quad = s * h / 3 + num &= abs(quad - B * q * (1 + math.log(A / q))) <= 1e-6 * B * q * (1 + math.log(A / q)) + # uniform tail of the (N4) example, NUMERICAL (floating point): P(N_r > t) = r^3 1{t < ceil(log 1/r)} <= e^3 e^{-3t} + for s_ in range(1, 15): + r3 = math.exp(-3 * s_) + for t10 in range(0, 10 * s_ + 30): + t = t10 / 10 + p_tail = r3 if t < math.ceil(s_) else 0.0 + num &= le(p_tail, math.exp(3) * math.exp(-3 * t) + 1e-300) + return {"exact": bool(ok), "numerical_corroboration": bool(num)} + + +def check_negatives(src): + rejected = [] + for fault in ("delete", "change", "symlink", "symlink-parent"): + with tempfile.TemporaryDirectory() as tmp: + root = pathlib.Path(tmp) + for path in INVENTORY: + dst = root / path + dst.parent.mkdir(parents=True, exist_ok=True) + shutil.copyfile(src / path, dst) + target = root / D4 + if fault == "delete": + target.unlink() + elif fault == "change": + target.write_bytes(target.read_bytes() + b"\n") + elif fault == "symlink": + moved = root / "elsewhere" / "PROOF.md" + moved.parent.mkdir() + shutil.move(str(target), str(moved)) + os.symlink(moved, target) + else: + moved = root / "elsewhere_dir" + shutil.move(str(target.parent), str(moved)) + os.symlink(moved, target.parent) + rejected.append(not identities_ok(root)) + return all(rejected) + + +def check_d4_duplicate(root, spec): + """Since ec6db8c (Math-#151) the live graph carries the D4 bytes twice; bind the duplicate to the D4 transition.""" + live = json.loads((root / GRAPH).read_text(encoding="utf-8"))["nodes"] + dup = live.get(D4_DUP) + old = live.get(D4_NODE) + t = next(t for t in spec["transitions"] if t["node"] == D4_NODE) + want = spec["live_duplicate"] + fp = t["proposed"]["fingerprint"] + if MUT == "duplicate-drift": + fp = "1" * 64 + if not isinstance(dup, dict) or not isinstance(old, dict): + return False + ok = dup.get("classification") == "PROVED_REVIEWED" and dup.get("controlling") is False + ok &= dup.get("fingerprint") == fp == want["fingerprint"] == INVENTORY[t["proposed"]["source"]][0] + ok &= dup.get("source") == t["proposed"]["source"] == want["source"] + ok &= dup.get("component_of") == want["component_of"] + ok &= any("main#76" in str(b.get("review")) and b.get("verdict") == "ACCEPT" for b in dup.get("review_basis", [])) + ok &= old.get("fingerprint") == dup.get("fingerprint") and old.get("classification") == t["current"]["classification"] + return bool(ok) + + +def snapshot(root, graph): + """Source snapshot in the shape of git_transition_audit.read_snapshot, taken from the working tree.""" + out = {} + for nid, node in graph["nodes"].items(): + ref = node.get("source") + if ref is None: + out[nid] = {"kind": "record_only"} + continue + if ref.startswith(("https://", "http://", "external:")): + out[nid] = {"kind": "external_unresolved", "reference": ref} + continue + p = root / ref.rstrip("/") + if p.is_file(): + data = p.read_bytes() + out[nid] = {"kind": "blob", "reference": ref, "bytes": len(data), "sha256": hashlib.sha256(data).hexdigest()} + elif p.is_dir(): + h = hashlib.sha256() + for f in sorted(x for x in p.rglob("*") if x.is_file() and "__pycache__" not in x.parts): + h.update(str(f.relative_to(p)).encode("utf-8") + b"\0" + hashlib.sha256(f.read_bytes()).digest()) + out[nid] = {"kind": "tree", "reference": ref, "sha256": h.hexdigest()} + else: + out[nid] = {"kind": "missing", "reference": ref} + return out + + +def check_propagation(root, spec, new): + """Two-commit mutations on the proposed graph through the production loss-only rule (reverse_impact_between with + source snapshots): evidence and consumed-source changes must reach the objects they support (OpenAI 5360320845, + 5360327058; Codex 4139807558, 4139807567). Nothing scientific is decided here.""" + if new is None: + return False, {} + hg = load_hard_gate(root) + g = copy.deepcopy(new) + if MUT == "region-unlinked": + g["edges"] = [e for e in g["edges"] if e.get("relation") != "covered_by"] + if MUT == "review-metadata-only": + drop = {c["id"] for c in spec["proposed_graph_nodes"] if str(c.get("component_role", "")).startswith("review_record")} + g["nodes"] = {k: v for k, v in g["nodes"].items() if k not in drop} + g["edges"] = [e for e in g["edges"] if e["from"] not in drop and e["to"] not in drop] + base = snapshot(root, g) + by_source = {} + for nid, n in g["nodes"].items(): + if n.get("source"): + by_source.setdefault(n["source"], []).append(nid) + + def run(edit): + g2, s2 = copy.deepcopy(g), copy.deepcopy(base) + edit(g2, s2) + try: + return set(hg.reverse_impact_between(g, g2, old_sources=base, new_sources=s2)["impacted"]) + except Exception: + return None + + def source_edit(path, kind="blob"): + def f(g2, s2): + for nid in by_source.get(path, []): + s2[nid] = ({"kind": "blob", "reference": path, "bytes": 1, "sha256": "1" * 64} if kind == "blob" + else {"kind": "missing", "reference": path}) + return f + + def fp_edit(g2, s2): + g2["nodes"][D4_NODE]["fingerprint"] = "2" * 64 + + eight = {t["node"] for t in spec["transitions"]} + cases = { + "d4-proof-edit-reaches-region-and-consumer": (source_edit(D4), {D4_NODE, "math.rn-region.fixed-remote", "math.rn-mesoscopic-reduction"}), + "annulus-proof-edit-reaches-region": (source_edit("frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md"), + {"math.rn-fixed-annulus-window", "math.rn-region.fixed-annulus-window"}), + "interface-review-deleted-reaches-interface-consumers-regions": (source_edit(HERE + "/RN_COUNT_INTERFACE_REVIEW.md", "missing"), + {IFACE, D4_NODE, "math.rn-fixed-annulus-window", "math.rn-region.fixed-remote", "math.rn-region.fixed-annulus-window"}), + "external-review-record-edit-reaches-d2-d3-d4-d6": (source_edit(HERE + "/EXTERNAL_REVIEWS.md"), + {"math.lifetime-remainder", "math.side24-coefficient", D4_NODE, "math.p15-full-price", "math.rn-region.fixed-remote"}), + "two-scale-addendum-edit-reaches-annulus-and-region": (source_edit("frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md"), + {"math.rn-fixed-annulus-window", "math.rn-region.fixed-annulus-window"}), + "realized-covers-edit-reaches-d6": (source_edit("frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md"), {"math.p15-full-price"}), + "d4-fingerprint-edit-reaches-region": (fp_edit, {D4_NODE, "math.rn-region.fixed-remote"}), + } + results = {} + for name, (edit, must) in cases.items(): + imp = run(edit) + results[name] = imp is not None and must <= imp + imp = run(source_edit("reviews/d5_collar_count_20260928/REVIEW.md")) + results["unrelated-edit-leaves-the-eight-untouched"] = imp is not None and not (imp & eight) + imp = run(lambda g2, s2: None) + results["no-op-impacts-nothing"] = imp == set() + return bool(all(results.values()) and len(results) == 9), results + + +def main(): + global MUT + ap = argparse.ArgumentParser() + ap.add_argument("--mutant", choices=MUTANTS) + MUT = ap.parse_args().mutant + root = pathlib.Path(".").resolve() + spec = load_spec(root) + ident = identities_ok(root) + trans_ok, new = check_transitions(root, spec) + gate_ok, gate = check_gate(root, spec, new) + prop_ok, prop = check_propagation(root, spec, new) + iface = check_interface() + checks = {"IDENTITIES": ident, "VERDICTS": ident and check_verdicts(root), "BASELINE": check_baseline(root, spec), + "TRANSITIONS": trans_ok, "GATE": gate_ok, "PROPAGATION": prop_ok, + "INTERFACE": iface["exact"] and iface["numerical_corroboration"], "NEGATIVES": check_negatives(root), + "D4_DUPLICATE": check_d4_duplicate(root, spec)} + passed = all(checks.values()) and len(checks) == 9 + print(json.dumps({"object": "REGISTER-ALIGNMENT-20260930-v1", "checks": checks, "passed": passed, + "inventory_files": len(INVENTORY), "transitions": len(spec["transitions"]), + "component_nodes": len(spec["proposed_graph_nodes"]), "edges_added": len(spec["proposed_graph_edges"]), + "gate": gate, "propagation": prop, + "interface_evidence": {"exact_rational": ["(N1) Holder p=2,3 on finite rational spaces", "(N2) exponent identity", + "(N3) conditional-mean identity", "sharp-p example at r=2^-pm", + "(N4) integer monotonicity of ceil(t)"], + "numerical_corroboration_floating_point": ["(N4) grid maximum of (t+1)^p e^-3t", + "(N5) Simpson quadrature at three parameter points", + "(N4) example uniform tail on a grid"], + "results": iface}, + "scope": "identity, verdict-row, live-baseline, transition-shape, hard-gate replay, two-commit propagation, " + "interface arithmetic (exact and numerical parts labelled), filesystem-negative and live D4-duplicate " + "checks; no mathematics is re-proved; nothing is written"}, indent=2, sort_keys=True)) + return 0 if passed else 1 + + +if __name__ == "__main__": + sys.exit(main())