From 179415f83d64ebbb80a95d2ddaf62c7b3a305b43 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Fri, 13 Nov 2026 16:50:10 +0000 Subject: [PATCH 1/2] feat(research): prove the sharp four-wire parity suffix envelope --- research/four-wire-parity-suffix/README.md | 194 +++++++++++++ research/four-wire-parity-suffix/SOURCES.json | 36 +++ research/four-wire-parity-suffix/TASK.json | 89 ++++++ research/four-wire-parity-suffix/VERIFY.json | 38 +++ research/four-wire-parity-suffix/verify.py | 256 ++++++++++++++++++ 5 files changed, 613 insertions(+) create mode 100644 research/four-wire-parity-suffix/README.md create mode 100644 research/four-wire-parity-suffix/SOURCES.json create mode 100644 research/four-wire-parity-suffix/TASK.json create mode 100644 research/four-wire-parity-suffix/VERIFY.json create mode 100644 research/four-wire-parity-suffix/verify.py diff --git a/research/four-wire-parity-suffix/README.md b/research/four-wire-parity-suffix/README.md new file mode 100644 index 0000000000..a34451d071 --- /dev/null +++ b/research/four-wire-parity-suffix/README.md @@ -0,0 +1,194 @@ +# The sharp four-wire forward-suffix envelope + +This is a scoped algebraic proof with exact finite corroboration. For the +retained triangular Toeplitz parity compiler on any complex symbol +`f(z)=1+bz+az²+cz³`, the maximum forward-suffix infinity norm is exactly + +```text +M(a,b,c) = 1 + max(|a|+|b|+|c|, + |b|+|a-b²|+max(|c|,|c-ab|)). +``` + +The maximum includes both endpoints and every complete-shear cut of every +legal order of the two disjoint children. Consequently, for every real +`eta >= 0`, + +```text +sup_{|a|+|b|+|c| <= eta} M(a,b,c) = 1+eta+eta². +``` + +Equality holds exactly when `a=c=0` and `|b|=eta`. The statement has no +small-tail or sign restriction. It solves the explicit four-wire optimization +suggested in [#4831](https://github.com/CrocSwap/integer-mult-bounds/pull/4831), +whose all-depth theorem concerns only binomial symbols. + +For `00`, equality forces `t=eta` and +`B(A+B)=t²`. Since both `B` and `A+B` are at most `t`, this forces +`B=t`, hence `A=C=0`. Conversely, for every complex `b` of modulus `eta`, +the formula gives `M(0,b,0)=1+eta+eta²`. If `eta=0`, all coefficients vanish +and the same classification holds. This proves the sharp envelope and all +its extremizers. The comparison with #4731 follows by subtracting the +geometric-series envelope. No predecessor scientific executable is replayed. + +## Exact finite corroboration + +The standard-library verifier constructs the literal root and child macros +by truncated Gaussian-rational polynomial division. It executes both child +orders, multiplies the prefix and suffix matrices at every cut, and compares +the maximum with the separate closed formula. It also checks the bound and +the extremizer criterion for every fixture. Matrix entries are exact pairs +of rational real and imaginary parts. + +Norms are exact sums of square roots of rationals, reduced to rational +multiples of squarefree radicals. Equality compares these canonical sums; +ordering uses outward rational intervals built with integer square roots. +Unresolved ordering raises an error after 256 fractional bits. No binary +floating-point comparison or tolerance decides acceptance. + +The complete fixture grid uses zero and the five phases +`1,-1,i,-i,(3+4i)/5` at amplitudes `1/4,1/2`, independently for `a,b,c`. +Thus it includes non-real inputs whose derived coefficients have irrational +moduli. All 1,331 grid fixtures and 13,310 order-labelled cuts pass; exactly +11 fixtures attain their own tail envelope, and 605 give a larger maximum +under even-first execution than under odd-first execution. These cut counts +retain duplicated matrices at different chronological cuts. Ten controls +pass, including the two invalid-coefficient cases. Controls reject omitted +Schur and root-left macros, wrong chronology, endpoint-only bounds, applying +the binomial value to all symbols, omitting the necessary child order, and +invalid coefficients. Separate arithmetic controls exercise irrational +comparison and exact Pythagorean modulus equality. + +From the repository root, with CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -X dev -B research/four-wire-parity-suffix/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -X dev -B research/four-wire-parity-suffix/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/four-wire-parity-suffix +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/four-wire-parity-suffix --check-source-history +``` + +Another CPython 3.12 executable may replace the local interpreter path. +The expected marker is `PASS_FOUR_WIRE_PARITY_SUFFIX`. The script writes +nothing and emits a generated receipt binding the five package-file hashes. +The registered replay runs normal and optimized warning-strict checks. +Universal complex claims rely on the written proof, rather than finite +extrapolation. Independent human and formal proof-kernel review are unclaimed. + +## Limits and code constraints + +The result concerns exactly four wires and complete-shear boundaries. It +does not bound cuts inside a dirty-shear implementation, arbitrary larger +symbols, rounded arithmetic, complete Gaussian stages, tape costs or the +selected supplier. All five framework assumptions remain at their existing +strength. No selected cold replay, Lean or Docker was run. + +The verifier has no recursion, dynamic imports, subprocesses or network +access. Every function is under 60 lines. The fixed grid has 1,331 fixtures, +two four-macro words per fixture and five cuts per word. Matrices are always +four by four. Radical factorization accepts integers at most `2^40`, uses at +most `2^20` trial divisors and at most 41 divisions per divisor. Exact norm +ordering makes at most five interval refinements. Python's managed allocation +and arbitrary-precision temporaries are a documented Power of Ten deviation; +this is a bounded finite checker, with no public unbounded input interface. +Internal helpers consume only the fixed grid and fixed four-wire structures. +Warning-strict and optimized runs are the available interpreter diagnostics. + +## Open next questions + +1. Determine the sharp forward-suffix envelope for general eight-wire symbols. + This would give the next precision-interface bound beyond this theorem. + Start with the child-cut row formulas and preserve correlations between + the even child and its inverse. A finite candidate grid would not prove + the complex optimum, and binomial optimality at larger sizes is unclaimed. +2. Bind one actual four-wire shear implementation to this macro envelope. + Start with its complete literal gate sequence and rounding convention. + Internal gates, coefficient delivery and the complete physical bill + remain additional obligations. + +## Sources and credit + +This contribution was produced by Nick Petalas. Apache-2.0. + +The source question is #4831's explicit four-wire optimization. That package's +binomial values, all-depth recurrence and attaining family remain credited +predecessor results. Brian / JoyboyBrian #4731 supplies the common macro-cut +contract and four-operator envelope. Vlado Vojdanovski #1673 supplies the +parity compiler, retained by Cinna Davis #4100. James Reed #4699 supplies +one-level tail accounting; Ryanson Jonathan and unpaidmoon #4371 supply +the earlier conditioning question. The new contribution is the full complex +four-wire formula, its sharp uniform upper bound and its extremizers. + +Canonical base is `e54523517d0f03e58352e647c403a5af3e525a57`, priority +revision 8, selected #7000 unchanged. The catalogue's older selected context +was recognized; current selected source bindings passed. [TASK.json](TASK.json) +records the changed scope from audit to an original precision-interface lemma. +[SOURCES.json](SOURCES.json) pins historical provenance only. Direct replay +requires this package alone; no predecessor numerical claim is rechecked. +The [advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19595240) +states this same scope. Live PR, main-branch README, merged-work and local +reservation checks found no resolving general four-wire suffix formula. +This textual overlap search does not cover unpublished work or every diff. diff --git a/research/four-wire-parity-suffix/SOURCES.json b/research/four-wire-parity-suffix/SOURCES.json new file mode 100644 index 0000000000..2a99e1345a --- /dev/null +++ b/research/four-wire-parity-suffix/SOURCES.json @@ -0,0 +1,36 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/triangular-parity-binomial-suffix/README.md", + "usage": "provenance", + "git_blob": "40be9dc4c7cf7a8e0b1e4f29267adeecdb4bddd8", + "sha256": "9c92249119c31c97b970975ef28ea8a23263acd8e5d5b95f083b71af93b2d5f1" + }, + { + "path": "research/triangular-parity-uniform-prefix/README.md", + "usage": "provenance", + "git_blob": "6e64fb48fbd33b9742f0ba81de77bfb661b80403", + "sha256": "dd0259414df08b5b462cec450df5a0618c30ba112ddf87b2acbb2e39a1c69414" + }, + { + "path": "research/unconditional-batched-crt/vendor/SHALLOW-TOEPLITZ.md", + "usage": "provenance", + "git_blob": "bc4349b2daea548ffa09e1f38a31f1df86b0b7be", + "sha256": "b384b93f3fb4a8c97da2e617ebc14d55cebb0a739070e7f8dbb66f63e24e9310" + } + ] +} diff --git a/research/four-wire-parity-suffix/TASK.json b/research/four-wire-parity-suffix/TASK.json new file mode 100644 index 0000000000..39505da0d4 --- /dev/null +++ b/research/four-wire-parity-suffix/TASK.json @@ -0,0 +1,89 @@ +{ + "schema_version": 1, + "task_id": "uniform-transfer-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "uniform-transfer-audit", + "question": "Can one of the selected record's five inherited assumptions be proved at its actual caller?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "Identify the proposition and what would change downstream; do not equate a finite replay with a universal proof.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Choose one assumption ID (native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery), one quantified implication and exact dependency closure. Check current handoffs, including #5625 row reentry and #5707 root-prefix lowering, without treating their partial scope as the whole theorem. Prove or falsify that implication with a caller-bound argument; stop at the chosen obligation. Finite tests or root digits do not discharge an all-size statement.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "existing_checks": [ + { + "scope": "PR #4100: proposed unconditional construction and finite checks, without independent acceptance.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Independent proof audit of one caller-bound all-size implication; all other premises remain explicit.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Prove the exact forward-suffix infinity norm for every complex four-wire triangular parity symbol and the sharp 1+eta+eta^2 envelope with all extremizers.", + "scope_change_reason": "Take the explicit four-wire optimization in PR4831 Open next questions. This is an original scoped precision-interface result, not an audit, predecessor replay or discharge of a selected framework assumption.", + "bottleneck_link": "Sharper macro-suffix norms constrain error amplification under the retained precision_tape interface; internal gates, an actual caller and its complete paid bill remain separate.", + "budget_minutes": 60, + "stop_rule": "Ship this first exact four-wire formula and sharp envelope after bounded exact corroboration. Leave general eight-wire and gate-level questions open.", + "outcome": "completed", + "evidence": "README contains the universal complex proof; verify.py enumerates every literal macro cut for its complete fixed Gaussian-rational grid and runs semantic controls.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "What is the sharp general eight-wire forward-suffix envelope?", + "why_it_matters": "It extends the one-sided precision budget beyond this exact four-wire theorem.", + "first_step": "Derive correlated child-cut row formulas and test them against exact candidate symbols.", + "blocked_by": "Independent norm products lose correlations and a finite grid cannot prove the complex optimum." + }, + { + "question": "Can an actual four-wire shear implementation use this macro envelope?", + "why_it_matters": "A macro bound alone does not price internal rounding or physical work.", + "first_step": "Bind one literal shear sequence and rounding convention.", + "blocked_by": "Internal gate bounds, coefficient delivery and the complete physical bill remain missing." + } + ] +} diff --git a/research/four-wire-parity-suffix/VERIFY.json b/research/four-wire-parity-suffix/VERIFY.json new file mode 100644 index 0000000000..e5a5490ea3 --- /dev/null +++ b/research/four-wire-parity-suffix/VERIFY.json @@ -0,0 +1,38 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-X", + "dev", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact Gaussian-rational macro execution, all-cut endpoint identities, radical norm formula, sharp envelope, extremizers and semantic controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-X", + "dev", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact Gaussian-rational macro execution, all-cut endpoint identities, radical norm formula, sharp envelope, extremizers and semantic controls." + } + ] +} diff --git a/research/four-wire-parity-suffix/verify.py b/research/four-wire-parity-suffix/verify.py new file mode 100644 index 0000000000..fc2577271a --- /dev/null +++ b/research/four-wire-parity-suffix/verify.py @@ -0,0 +1,256 @@ +#!/usr/bin/env python3 +"""Exact four-wire parity suffix corroboration. + +Produced by Nick Petalas. Apache-2.0. +""" + +from fractions import Fraction as F +from hashlib import sha256 +from itertools import product +import json +from math import isqrt +from pathlib import Path + +ZERO = (F(0), F(0)) +ONE = (F(1), F(0)) + + +def require(condition, message): + if not condition: + raise AssertionError(message) + + +def add(x, y): + return (x[0] + y[0], x[1] + y[1]) + + +def sub(x, y): + return (x[0] - y[0], x[1] - y[1]) + + +def mul(x, y): + return (x[0] * y[0] - x[1] * y[1], + x[0] * y[1] + x[1] * y[0]) + + +def radical(integer): + """Return c,d with sqrt(integer)=c*sqrt(d), d squarefree.""" + if not 0 <= integer <= 2 ** 40: + raise ValueError("radicand capacity") + coefficient, residual, remainder = 1, 1, integer + if not remainder: + return 0, 1 + for divisor in range(2, isqrt(integer) + 1): + if divisor * divisor > remainder: + break + exponent = 0 + for _ in range(41): + if remainder % divisor: + break + remainder //= divisor + exponent += 1 + coefficient *= divisor ** (exponent // 2) + if exponent % 2: + residual *= divisor + if remainder > 1: + residual *= remainder + require(coefficient * coefficient * residual == integer, + "exact radical decomposition") + return coefficient, residual + + +def magnitude(z): + square = z[0] * z[0] + z[1] * z[1] + coefficient, residual = radical(square.numerator * square.denominator) + return () if not coefficient else ((residual, F(coefficient, square.denominator)),) + + +def total(*expressions): + terms = {} + for expression in expressions: + for radicand, coefficient in expression: + terms[radicand] = terms.get(radicand, F(0)) + coefficient + return tuple(sorted((r, c) for r, c in terms.items() if c)) + + +def compare(x, y): + difference = total(x, tuple((r, -c) for r, c in y)) + if not difference: + return 0 + for bits in (16, 32, 64, 128, 256): + lower = upper = F(0) + scale = 2 ** bits + for radicand, coefficient in difference: + square = radicand * scale * scale + floor = isqrt(square) + ceiling = floor + (floor * floor != square) + lo, hi = F(floor, scale), F(ceiling, scale) + lower += coefficient * (lo if coefficient > 0 else hi) + upper += coefficient * (hi if coefficient > 0 else lo) + if lower > 0: + return 1 + if upper < 0: + return -1 + raise ArithmeticError("exact comparison did not separate within capacity") + + +def largest(expressions): + require(1 <= len(expressions) <= 16, "finite maximum capacity") + answer = expressions[0] + for expression in expressions[1:]: + if compare(expression, answer) > 0: + answer = expression + return answer + + +def identity(): + return tuple(tuple(ONE if i == j else ZERO for j in range(4)) + for i in range(4)) + + +def multiply(a, b): + rows = [] + for i in range(4): + row = [] + for j in range(4): + value = ZERO + for k in range(4): + value = add(value, mul(a[i][k], b[k][j])) + row.append(value) + rows.append(tuple(row)) + return tuple(rows) + + +def norm(matrix): + return largest(tuple(total(*(magnitude(z) for z in row)) for row in matrix)) + + +def elementary(updates): + rows = [list(row) for row in identity()] + for target, source, coefficient in updates: + rows[target][source] = add(rows[target][source], coefficient) + return tuple(map(tuple, rows)) + + +def compiler(a, b, c, even_first): + """Derive the literal parity macros by truncated polynomial division.""" + for z in (a, b, c): + if len(z) != 2 or any(not isinstance(x, F) or abs(x) > 2 for x in z): + raise ValueError("bounded Gaussian-rational coefficient required") + even, odd = (ONE, a), (b, c) + quotient = [ZERO, ZERO] + for i in range(2): + quotient[i] = odd[i] + for j in range(1, i + 1): + quotient[i] = sub(quotient[i], mul(even[j], quotient[i - j])) + schur = sub(even[1], mul(odd[0], quotient[0])) + right = elementary(((2, 1, quotient[0]),)) + left = elementary(((1, 0, quotient[0]), (3, 0, quotient[1]), + (3, 2, quotient[0]))) + children = (elementary(((2, 0, even[1]),)), + elementary(((3, 1, schur),))) + return (right, *children[::1 if even_first else -1], left) + + +def cut_products(word): + prefixes = [identity()] + for gate in word: + prefixes.append(multiply(gate, prefixes[-1])) + suffixes = [identity()] * 5 + for i in range(3, -1, -1): + suffixes[i] = multiply(suffixes[i + 1], word[i]) + return tuple(zip(prefixes, suffixes)) + + +def predicted(a, b, c): + endpoint = total(magnitude(a), magnitude(b), magnitude(c)) + residual = sub(c, mul(a, b)) + schur = sub(a, mul(b, b)) + transported = total(magnitude(b), magnitude(schur), + largest((magnitude(c), magnitude(residual)))) + return total(magnitude(ONE), largest((endpoint, transported))) + + +def target(a, b, c): + coefficients = (ONE, b, a, c) + return tuple(tuple(coefficients[i - j] if i >= j else ZERO + for j in range(4)) for i in range(4)) + + +def fixture(a, b, c): + expected = target(a, b, c) + maxima = [] + for order in (True, False): + cuts = cut_products(compiler(a, b, c, order)) + for prefix, suffix in cuts: + require(multiply(suffix, prefix) == expected, "all-input endpoint at cut") + maxima.append(largest(tuple(norm(q) for _, q in cuts))) + observed = largest(tuple(maxima)) + require(compare(observed, predicted(a, b, c)) == 0, + "exact full-complex per-symbol formula") + tail = total(magnitude(a), magnitude(b), magnitude(c)) + require(all(r == 1 for r, _ in tail), "rational fixture tail") + t = sum((v for _, v in tail), F(0)) + envelope = ((1, 1 + t + t * t),) + equality = compare(observed, envelope) == 0 + require(compare(observed, envelope) <= 0, "tail-budget envelope") + require(equality == (a == ZERO and c == ZERO), "complete extremizer criterion") + return 10, equality, compare(maxima[0], maxima[1]) > 0 + + +def controls(): + half, quarter = (F(1, 2), F(0)), (F(1, 4), F(0)) + word = compiler(ZERO, half, ZERO, True) + expected = target(ZERO, half, ZERO) + require(cut_products((word[0], word[1], identity(), word[3]))[-1][0] + != expected, "missing Schur child detected") + require(cut_products((*word[:3], identity()))[-1][0] + != expected, "missing root left macro detected") + require(cut_products((*word[1:], word[0]))[-1][0] + != expected, "wrong chronology detected") + require(compare(predicted(ZERO, half, ZERO), norm(expected)) > 0, + "endpoint-only bound rejected") + require(compare(predicted(half, ZERO, ZERO), ((1, F(7, 4)),)) < 0, + "binomial value is not every symbol's exact value") + require(fixture(sub(ZERO, quarter), half, ZERO)[2], + "odd-first-only schedule misses the maximum") + require(compare(magnitude((F(1), F(1))), ((1, F(7, 5)),)) > 0, + "nonrational square root comparison") + require(compare(magnitude((F(3, 5), F(4, 5))), magnitude(ONE)) == 0, + "Pythagorean modulus equality") + rejected = 0 + for bad in ((3, F(0)), (F(3), F(0))): + try: + compiler(bad, ZERO, ZERO, True) + except ValueError: + rejected += 1 + require(rejected == 2, "coefficient type and capacity failures") + return 10 + + +def main(): + phases = ((F(1), F(0)), (F(-1), F(0)), (F(0), F(1)), + (F(0), F(-1)), (F(3, 5), F(4, 5))) + values = (ZERO,) + tuple(mul((scale, F(0)), phase) + for scale in (F(1, 4), F(1, 2)) for phase in phases) + cuts = equalities = order_gaps = fixtures = 0 + for a, b, c in product(values, repeat=3): + count, equality, gap = fixture(a, b, c) + fixtures += 1 + cuts += count + equalities += equality + order_gaps += gap + controls_count = controls() + require(fixtures == 11 ** 3 and cuts == 10 * fixtures, "complete finite grid") + require(equalities == len(values), "every and only binomial extremizer") + files = sorted(Path(__file__).resolve().parent.iterdir()) + hashes = {p.name: sha256(p.read_bytes()).hexdigest() for p in files if p.is_file()} + print(json.dumps({"status": "PASS_FOUR_WIRE_PARITY_SUFFIX", "fixtures": fixtures, + "cuts": cuts, "extremizers": equalities, + "order_sensitive_fixtures": order_gaps, + "controls": controls_count, "errors": 0, + "sha256": hashes}, sort_keys=True)) + + +if __name__ == "__main__": + main() From 97da28d5e0a39a14b0f8e06bb5871409b27ee3f6 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:47:14 +0000 Subject: [PATCH 2/2] fix(ci): sync CI verification doc and historical replay-gap verifier --- docs/ci-verification.md | 19 +++++- .../historical-selected-replay-gap/README.md | 6 +- .../SOURCES.json | 60 +++++++++--------- .../VERIFY.json | 31 +-------- .../historical-selected-replay-gap/verify.py | 63 ++++++++++++++----- 5 files changed, 100 insertions(+), 79 deletions(-) diff --git a/docs/ci-verification.md b/docs/ci-verification.md index 63ba3e9aa8..52b62d0481 100644 --- a/docs/ci-verification.md +++ b/docs/ci-verification.md @@ -1,8 +1,25 @@ # CI verification -## Current selected-family replay: #6030 +## Current selected-family replay: #7000 with #7001 The [selected record](../certificates/selected-result.json) binds conditional +κ = 0.00363005817 to the [application review](research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md), +[validation receipts](research/pr-intake-evidence/pr7000-application/VALIDATION.json), +and [explicit source closure](../certificates/frontier7000-source.json). +`make frontier7000-verify` follows that exact-source selected replay. The review +reuses eleven authenticated preceding executions and records seven fresh serial +application, scalar and complete native-catalogue executions. The earlier +monolithic timeout is retained separately and is not completed coverage. +Consult the receipts for exact commands, source heads and limits. + +The five inherited framework assumptions remain. No complete uniform word, +literal multiplier execution, independent human proof or formal-kernel proof +is asserted. Routine research submissions do not need to rerun this +selected-family replay. The sections below preserve historical checkpoints. + +## Historical selected-family replay: #6030 + +The [historical checkpoint](../certificates/checkpoints/frontier6030.json) binds conditional κ = 0.003125804 to the [proof review](research/pr-intake-evidence/pr6030-audit/PROOF-REVIEW.md), [validation receipts](research/pr-intake-evidence/pr6030-audit/VALIDATION.json), and [explicit source closure](../certificates/frontier6030-source.json). diff --git a/research/historical-selected-replay-gap/README.md b/research/historical-selected-replay-gap/README.md index 55d8cc3b49..36d9a873ca 100644 --- a/research/historical-selected-replay-gap/README.md +++ b/research/historical-selected-replay-gap/README.md @@ -69,7 +69,11 @@ python3 -B scripts/research_package.py --package research/historical-selected-re The direct command prints `PASS_HISTORICAL_SELECTED_REPLAY_GAP`. A registered replay prints `PASS_REGISTERED_RESEARCH_PACKAGE`. Both require Git history -containing the two inspected commits. +containing the two inspected commits and the source and manifest objects at +`2485805a6d47f36ea83ddde6327d453ac82d44dc`. The verifier uses a temporary +sparse checkout of that commit, checks the declared source digests there, and +uses its planner and manifest inventory. The recorded rejections and selection +therefore remain reproducible after later changes to the live Makefile or CI guide. ## Open next questions diff --git a/research/historical-selected-replay-gap/SOURCES.json b/research/historical-selected-replay-gap/SOURCES.json index c1010eec95..62bb8b3950 100644 --- a/research/historical-selected-replay-gap/SOURCES.json +++ b/research/historical-selected-replay-gap/SOURCES.json @@ -4,13 +4,13 @@ "files": [ { "path": "Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "0d683a06b9e7ee162496108ce9a7c5d2ee94fccf", "sha256": "4f2d4f2dcd15139ec82658a975f85ed300897385f85799218539f4c8d60567da" }, { "path": "certificates/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "eccafa830c16170c36faf93045ddf1f638f7bcd4", "sha256": "4c0b9d37e1034b2076e30a70f8e514416298c462d9ee98bc87fe6556b14df786" }, @@ -22,7 +22,7 @@ }, { "path": "docs/ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "63ba3e9aa8bdc5e942b56e34244b92b16f854085", "sha256": "c7d3027e9ad8bcbff68f07aa9576b30fb2f3c76c44d876d40c7fdbf4a3e2228a" }, @@ -34,163 +34,163 @@ }, { "path": "research/clifford-state-performance/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "6f98a0061a5104dfab82c9e806f819b41811f684", "sha256": "396d0f08df24952248140d5c65c51b8c902ef1c580892ff7ea182890530f67ee" }, { "path": "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "5e0f92af463ec12c5e1dcc3effd44081a88af647", "sha256": "07a9daeaf2bda308a92e9a4684f13d5fc766c7772d74801fceb7f4599fdab226" }, { "path": "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "9e13266bf85e627f1b7dc225e9530ea69fd2c7f0", "sha256": "421e1211fb1897c45621dc6801c276e53f2e6f335583c9c9049e535f87c0a3b1" }, { "path": "research/community-batch932-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "cc4d03eb59b9ab3f952735f7e88ff18c2d15d7af", "sha256": "184629cac91a5cfaca50330a88596008b824221433867dcf8117539c913c284a" }, { "path": "research/community-batch970-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8b9f4111badf7de5d97684799560b55110e9da79", "sha256": "23188ed920e38a54006cb883e181585620821c63bf7e8b5e05d32719417cc37e" }, { "path": "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "a5300d4e7a5381a3f443fc54c768ca6f0f236d68", "sha256": "3c820fb30e1b4d9bcfc6a7ab524375e5b2abd66b940af2c509146104f0bcd79c" }, { "path": "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "d7ff6d777b01d69b6ce84caf25d3b7e4a4d2f211", "sha256": "6b185a9902652f893f3ebd8ada92d2f11b6de6533a9a4d11718a8a4496101128" }, { "path": "research/community-hyperplane599-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "546f37d326d10a99910ae8f908e71ef768524d98", "sha256": "65099d764bfcc39bda5e4d9966783611b094c3522dbdd1435cd498d657a8ef8e" }, { "path": "research/community-k492-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "e538481e4cb16ed936d3195f2dfb5b5a9ca0a76b", "sha256": "2c0f4fa5bc150d05658af2e7c54c4d2c337dd52b7efd3d69530ae73bcbdf452a" }, { "path": "research/community-reconciliation92-audit/MANIFEST.json", - "usage": "input", + "usage": "provenance", "git_blob": "2a2e93685173d5f13cbb5abe740f5d90352e0228", "sha256": "5f501f3c118131e7d069f30ad77186eb2ad6961f9680a0ef105f4514ed41808a" }, { "path": "research/partial-swap-digest/baseline.py", - "usage": "input", + "usage": "provenance", "git_blob": "a2f0190704db83bd8ef48e46e723c49b925804fe", "sha256": "81e9af92cdf38243a540cdcff2062778e449467848d444da37a9553c12ca4c34" }, { "path": "research/r420-two-sided-basis/SOURCES.json", - "usage": "input", + "usage": "provenance", "git_blob": "5d718e11e62f4bcadecf1e02d6b61f87dbe190b0", "sha256": "d9810b0d139c5a1211fd2c1f0d142187cc1fca30026e1e7bc4f9ecfacf1596d1" }, { "path": "research/skip-clones/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8d1bb3b9c8189e35e5d8bfdfa632d7473e8be0d5", "sha256": "0b68e63e35a97ce6b0cdb6e291b88ebaa8f2dd4afb70b2498f10ee89428258dc" }, { "path": "research/split-skip/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "2ab610b6ea2edd2865fda793ef2168b0c76afb4f", "sha256": "7c2b4646a3ecfef6f881da5c43e4bd0fa9a4d1b00548b8ab458d897e16735134" }, { "path": "scripts/historical-ci-inputs/Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "aff68409021c9d401a6f8013b9dfd7dbcc30f2a8", "sha256": "ea8830dd79da493e2d75baf753d733ff7efbcf2b4794afe41fae0ac8f3055646" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "65db599ab0b1dea0312c4ca048e0bd0f44c3736f", "sha256": "96ea543e6c707424afe247e77bd86c82152f90fc76a0773c4232145da5cdf8d1" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "34820a8f24678f918f4d0e7a35380d8013fc3495", "sha256": "628391b6abfbc8674ceec1751867a4392f2cc0b5b66886243e139af86cf355ac" }, { "path": "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "c755b76e0d44ba4917aa94440ebe54daefce5b2a", "sha256": "d7fd929726b326aeeaf0a3996475adec88eee9aac09ae0bebeeaa0bc1fc8f199" }, { "path": "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "7f3c012504187917a728b9fe87043f0fc8cd006a", "sha256": "a854022e0e1d5d4db4d60e586be3ea56005013ef14a1fc06d02bc06e8529c4b0" }, { "path": "scripts/historical-ci-inputs/partial-swap-context.json", - "usage": "input", + "usage": "provenance", "git_blob": "ad65114886bf34a4fd27e79f3be502389e689faa", "sha256": "833a9642f33aeab2ffea17ec9c6b82e0a953f90192b2c82e10bef21538dccba9" }, { "path": "scripts/historical-ci-inputs/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "52075f2463f60af5e16571347f24274fce73a1ea", "sha256": "f3c4be597b2f2136da4ae2cc80c7454f63c90aa01f84e5b8131cee4dd55de815" }, { "path": "scripts/partial_swap/shared.py", - "usage": "input", + "usage": "provenance", "git_blob": "44a0e454c70f9c4b98e258b8443612e6a119904b", "sha256": "5a0646a50b9f3e8ea55168620a78e8853b0ab810517cefc8cfb8696aedee278a" }, { "path": "scripts/replay_historical_check.py", - "usage": "input", + "usage": "provenance", "git_blob": "1e92fff2782970ef71378f594f2350d245a4db26", "sha256": "5467619c78183d3adc82b0cb55af28e5c1a01fca2b0588677816244b53e2bafd" }, { "path": "scripts/research_package.py", - "usage": "input", + "usage": "provenance", "git_blob": "091b4c8f58bac9a9580d76025b887dc5c873d05f", "sha256": "e1256016e7f51827d04fa2179255989f639ae1d97afaa9c16265f85a0c6abd70" }, { "path": "scripts/run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "a96ab35b315ce492e7fbbfd6c5ae211aa066b541", "sha256": "49eb56dd0fc0d8d8ffdb209970a7adf2176223580646f575d5c22e59543b381c" }, { "path": "scripts/verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "6882a4700e410dec569b51ae2eaf1a19cc019195", "sha256": "d6b305eac5b9bdb8172c469ad30a1655a60fa0aceac8b1bf610e1b73f51babd8" }, { "path": "tests/test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "343b24abf6719b81805eba5a84c74e57634c8288", "sha256": "3a5470d0b139828b90e19bf9583ddeafcd69f8e34f2824664eb3a2958a52e34d" } diff --git a/research/historical-selected-replay-gap/VERIFY.json b/research/historical-selected-replay-gap/VERIFY.json index 98553e72ed..ab7efa3471 100644 --- a/research/historical-selected-replay-gap/VERIFY.json +++ b/research/historical-selected-replay-gap/VERIFY.json @@ -4,36 +4,7 @@ "python": "3.12", "requirements": [], "inputs": [ - "Makefile", - "certificates/partial-swap-network.json", - "docs/ci-verification.md", - "research/clifford-state-performance/SOURCE.json", - "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "research/community-batch932-audit/CONTENT-COVERAGE.json", - "research/community-batch970-audit/CONTENT-COVERAGE.json", - "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "research/community-hyperplane599-audit/SOURCE.json", - "research/community-k492-audit/SOURCE.json", - "research/community-reconciliation92-audit/MANIFEST.json", - "research/partial-swap-digest/baseline.py", - "research/r420-two-sided-basis/SOURCES.json", - "research/skip-clones/SOURCE.json", - "research/split-skip/SOURCE.json", - "scripts/historical-ci-inputs/Makefile", - "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "scripts/historical-ci-inputs/partial-swap-context.json", - "scripts/historical-ci-inputs/partial-swap-network.json", - "scripts/partial_swap/shared.py", - "scripts/replay_historical_check.py", - "scripts/research_package.py", - "scripts/run_isolated_tests.py", - "scripts/verify_selected_result.py", - "tests/test_isolated_test_runner.py" + "scripts/research_package.py" ], "commands": [ { diff --git a/research/historical-selected-replay-gap/verify.py b/research/historical-selected-replay-gap/verify.py index 83b995941a..9d266c5a4e 100644 --- a/research/historical-selected-replay-gap/verify.py +++ b/research/historical-selected-replay-gap/verify.py @@ -6,8 +6,10 @@ """ import hashlib import importlib.util +import json import subprocess import sys +import tempfile from pathlib import Path ROOT = Path(__file__).resolve().parents[2] @@ -61,31 +63,47 @@ def require(ok, message): raise SystemExit(message) -def load_checker(): - path = ROOT / "scripts/replay_historical_check.py" - spec = importlib.util.spec_from_file_location("historical_selected_replay_gap_checker", path) +def load_module(path): + spec = importlib.util.spec_from_file_location(path.stem, path) module = importlib.util.module_from_spec(spec) spec.loader.exec_module(module) return module +def checkout_snapshot(snapshot, sources, runner, env): + paths = [runner.canonical_relative_path(row["path"]) for row in sources["files"]] + git = ["git", "-c", "maintenance.auto=false", "-c", "gc.auto=0", + "-c", "core.autocrlf=false"] + subprocess.run([*git, "clone", "--quiet", "--shared", "--no-tags", "--no-checkout", + "--", str(ROOT), str(snapshot)], cwd=ROOT, env=env, check=True) + subprocess.run([*git, "update-ref", "--no-deref", "HEAD", INSPECTED], + cwd=snapshot, env=env, check=True) + # The pinned planner reads omitted manifests from the sparse HEAD/index. + patterns = "".join(f"/{path.as_posix()}\n" for path in paths) + subprocess.run([*git, "sparse-checkout", "set", "--no-cone", "--stdin"], + cwd=snapshot, env=env, input=patterns.encode("utf-8"), check=True) + subprocess.run([*git, "read-tree", "-mu", "HEAD"], cwd=snapshot, env=env, check=True) + for path, row in zip(paths, sources["files"], strict=True): + require(hashlib.sha256((snapshot / path).read_bytes()).hexdigest() == row["sha256"], + "historical checkout source digest changed: " + path.as_posix()) + + def entries(checker): for name, config in checker.CONFIG.items(): for entry in [config, *config.get("additional_inputs", [])]: yield name, entry -def reject(checker, entry): +def reject(root, checker, entry): try: - checker.authenticated_input(ROOT, entry) + checker.authenticated_input(root, entry) except ValueError as exc: return str(exc) raise SystemExit("historical input was admitted: " + entry["path"]) -def main(): - require(not sys.flags.optimize, "assertions must stay enabled") - checker = load_checker() +def check_snapshot(root, env): + checker = load_module(root / "scripts/replay_historical_check.py") selected = [entry for name, entry in entries(checker) if name == "tooling-ledger" and entry["path"] == SELECTED_PATH] require(len(selected) == 1, "selected-result checker overlay is not unique") @@ -94,7 +112,7 @@ def main(): require(entry["accepted_live_sha256"] == [SELECTED_ACCEPTED], "accepted selected-checker successors changed") frozen = (checker.INPUTS / entry["input"]).read_bytes() - live = (ROOT / SELECTED_PATH).read_bytes() + live = (root / SELECTED_PATH).read_bytes() require(hashlib.sha256(frozen).hexdigest() == SELECTED_PIN, "frozen selected checker bytes changed") require(hashlib.sha256(live).hexdigest() == SELECTED_LIVE, "live selected checker digest changed") require(SELECTED_LIVE not in (SELECTED_PIN, SELECTED_ACCEPTED), "live checker was already admitted") @@ -102,7 +120,7 @@ def main(): # live successor, not a broken comparison. require(SELECTED_PIN in (SELECTED_PIN, *entry["accepted_live_sha256"]), "pin membership control failed") - require(reject(checker, entry) == REJECTIONS[SELECTED_PATH][1], + require(reject(root, checker, entry) == REJECTIONS[SELECTED_PATH][1], "selected checker rejection text changed") counts = {path: 0 for path in REJECTIONS} @@ -110,7 +128,7 @@ def main(): for _name, item in entries(checker): if item["path"] not in REJECTIONS: continue - message = reject(checker, item) + message = reject(root, checker, item) counts[item["path"]] += 1 messages.setdefault(item["path"], message) for path, (count, message) in REJECTIONS.items(): @@ -118,20 +136,31 @@ def main(): require(messages[path] == message, "rejection text changed for " + path) require(sum(counts.values()) == 19, "rejection total changed") ci = [item for _name, item in entries(checker) if item["path"] == CI_PATH] - require(len(ci) == 1 and hashlib.sha256((ROOT / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, + require(len(ci) == 1 and hashlib.sha256((root / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, "selected CI note digest changed") diff = subprocess.check_output( - ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=ROOT, text=True) + ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=root, env=env, text=True) changed = sorted(name for name in diff.splitlines() if name) require(changed == CHANGED, "inspected commit diff changed") - sys.path.insert(0, str(ROOT / "scripts")) - from research_package import plan_details - details = plan_details(ROOT, set(changed)) + planner = load_module(root / "scripts/research_package.py") + details = planner.plan_details(root, set(changed)) require([row["package"] for row in details] == PLAN_PACKAGES, "helper plan selection changed") matched = {name for row in details for names in row["causes"].values() for name in names} require(sorted(set(changed) - matched) == UNMATCHED, "unmatched plan paths changed") - require(plan_details(ROOT, set()) == [], "empty change set selected a package") + require(planner.plan_details(root, set()) == [], "empty change set selected a package") + + +def main(): + require(not sys.flags.optimize, "assertions must stay enabled") + sources = json.loads(Path(__file__).with_name("SOURCES.json").read_bytes()) + require(sources["base_commit"] == INSPECTED, "historical checkout base changed") + runner = load_module(ROOT / "scripts/research_package.py") + env = runner.git_source_env() + with tempfile.TemporaryDirectory(prefix="historical-selected-replay-") as temporary: + snapshot = Path(temporary) / "snapshot" + checkout_snapshot(snapshot, sources, runner, env) + check_snapshot(snapshot, env) print("PASS_HISTORICAL_SELECTED_REPLAY_GAP") print("selected_checker_live=" + SELECTED_LIVE) print("rejections=19 distinct_paths=7 plan_packages=9")