From 168b7d4ec9a92cf83e3e142b13fb86ed44629a01 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 23:25:59 +0000 Subject: [PATCH 1/2] feat(research): bound forward slack for exact-sum Gaussian rounding --- .../README.md | 125 ++++++++++++++++++ .../SOURCES.json | 24 ++++ .../TASK.json | 95 +++++++++++++ .../VERIFY.json | 34 +++++ .../verify.py | 82 ++++++++++++ 5 files changed, 360 insertions(+) create mode 100644 research/gaussian-exact-sum-forward-slack/README.md create mode 100644 research/gaussian-exact-sum-forward-slack/SOURCES.json create mode 100644 research/gaussian-exact-sum-forward-slack/TASK.json create mode 100644 research/gaussian-exact-sum-forward-slack/VERIFY.json create mode 100644 research/gaussian-exact-sum-forward-slack/verify.py diff --git a/research/gaussian-exact-sum-forward-slack/README.md b/research/gaussian-exact-sum-forward-slack/README.md new file mode 100644 index 0000000000..3fe489cbb6 --- /dev/null +++ b/research/gaussian-exact-sum-forward-slack/README.md @@ -0,0 +1,125 @@ +# Forward radial slack for exact-sum Gaussian rounding + +Any injective rounding of the ideal Gaussian pair that preserves the sum +and has Euclidean error at most one must have forward outward norm slack at +least $\sqrt5-\sqrt3$. Eight inputs in the sum-one fiber suffice. Below +that threshold they have six distinct legal outputs. At equality they have +an explicit matching, so the bound is sharp on these eight inputs. + +This is a scoped proof with an exact finite witness. It gives a necessary +bound on the whole Gaussian-integer domain for the exact-sum contract. +Global attainment remains open. The proof uses injectivity, exact sum and +the error cap. It applies to maps with arbitrary behavior outside the eight +inputs and makes no assumption about the inverse or powers of the map. + +## Proof + +Let $x,y\in\mathbb Z[i]$, $s=x+y$, and $d=x-y$. The ideal positive +Gaussian pair is +$$ +C_+(x,y)=((s+id)/2,(s-id)/2). +$$ +The norm on a pair is $\|(x,y)\|=\sqrt{|x|^2+|y|^2}$. Its forward +outward slack under a map $F$ is +$\sup_z\max(0,\|F(z)\|-\|z\|)$. + +Restrict to $s=1$. Write $x=a+ib$, so $y=1-x$, and let +$$ +N(a,b)=a^2+(1-a)^2+2b^2. +$$ +This is the squared pair norm. The first ideal output has coordinates +$(1/2-b,a-1/2)$. An exact-sum output is determined by its first +coordinate $c+ie$. Its squared pair error is twice the squared +distance from $c+ie$ to the first ideal output. Each real coordinate +of that ideal output is a half-integer. Thus error at most one holds +exactly at the four candidates +$$ +(c,e)\in\{-b,1-b\}\times\{a-1,a\}. +$$ +Every candidate has error exactly one. + +The following table exhausts $N(a,b)\le5$. The output column lists the +possible squared norms before imposing a radial bound. + +| Input squared norm | First input coordinates | Inputs | Output squared norms | +| ---: | --- | ---: | --- | +| 1 | $a\in\{0,1\}, b=0$ | 2 | $1,3$ | +| 3 | $a\in\{0,1\}, b\in\{-1,1\}$ | 4 | $1,3,5,7$ | +| 5 | $a\in\{-1,2\}, b=0$ | 2 | $3,9$ | + +Set $\alpha=\sqrt5-\sqrt3$. Below $\alpha$, a norm-one input +cannot reach squared norm 3 because $\sqrt3-1>\alpha$. +An input of squared norm 3 cannot reach 5 or 7, and an input of squared +norm 5 cannot reach 9 because $3-\sqrt5>\alpha$. To see the two strict +inequalities, square the equivalent positive comparisons +$2\sqrt3>1+\sqrt5$ and $3+\sqrt3>2\sqrt5$. They reduce to +$3>\sqrt5$ and $3\sqrt3>4$, respectively. + +The union of all allowed outputs is contained in $N(c,e)\le3$. This set +has six points by the first two rows of the table. Eight inputs cannot +map injectively into six outputs. The matching below attains the threshold +on this finite domain. It lists the first input and first output +coordinates. In both cases the second Gaussian integer is one minus +the first. + +| $(a,b)$ | $(c,e)$ | +| --- | --- | +| $(-1,0)$ | $(0,-1)$ | +| $(0,-1)$ | $(1,-1)$ | +| $(0,0)$ | $(0,0)$ | +| $(0,1)$ | $(-1,0)$ | +| $(1,-1)$ | $(2,0)$ | +| $(1,0)$ | $(1,0)$ | +| $(1,1)$ | $(0,1)$ | +| $(2,0)$ | $(1,1)$ | + +The eight outputs are distinct and obey the candidate formula, with two +edges from squared norm 3 to 5 and the rest weakly inward. Hence +$\alpha$ is also the exact optimum on this part of the sum-one fiber. + +## Reproduce + +Run from the repository root with CPython 3.12 and its standard library. + +~~~sh +python3.12 -B scripts/research_package.py --package research/gaussian-exact-sum-forward-slack +python3.12 -B scripts/check_research_commit.py --package research/gaussian-exact-sum-forward-slack --check-source-history +python3.12 -W error -B research/gaussian-exact-sum-forward-slack/verify.py +python3.12 -W error -O -B research/gaussian-exact-sum-forward-slack/verify.py +~~~ + +The verifier enumerates all eight inputs and checks the scaled error +directly in Gaussian-integer coordinates. The input scan covers +$-2\le a,b\le2$, which contains $N\le5$. Each possible first output +coordinate is within one of its half-integer center, so the output scan +over $[-3,3]^2$ includes every error-one candidate. All 32 edges have +error one. The verifier finds 16 strict edges to six distinct outputs and +four threshold ties. It checks every edge of the displayed matching and +uses integer comparisons to isolate the strict and tied cases. The +expected status is PASS_GAUSSIAN_EXACT_SUM_FORWARD_SLACK. + +## Open next questions + +Can an all-size exact-sum matching attain $\alpha$, or does a different +finite set in the sum-one fiber force more? First test complete +neighborhoods beyond squared norm five at the exact threshold. A finite +matching is only a local positive control. The existing square-to-swap +construction gives a global upper bound $\sqrt{19}-\sqrt{13}$. A +physical caller contract would also need to specify the inverse, +ordered stages and implementation cost. +[#7570 proof](https://github.com/CubeJerry/integer-mult-bounds/blob/053c42c68165cf24fd4e8bc33c2b20d6ac3d399b/research/sharp-order-four-gaussian-rounding/proof/PROOF.md) + +## Credit + +This contribution was produced by Nick Petalas. Ali Romman's #6509 supplies +the ideal pair and exact-sum rounding contract. Jerry Chen's #7570 uses +fixed-sum fibers in the square-to-swap class and leaves the forward bound +without that identity open. His #7571 gives finite Hall bounds for the +larger class of maps with no sum constraint. His #7572 treats affine +periods and the bounded-center family. The argument here uses the sum-one +fiber and the displayed finite table. Independent human and formal +proof-kernel review are unclaimed. Apache-2.0. +[#6509](https://github.com/CrocSwap/integer-mult-bounds/pull/6509), +[#7570](https://github.com/CrocSwap/integer-mult-bounds/pull/7570), +[#7571](https://github.com/CrocSwap/integer-mult-bounds/pull/7571), +[#7572](https://github.com/CrocSwap/integer-mult-bounds/pull/7572) diff --git a/research/gaussian-exact-sum-forward-slack/SOURCES.json b/research/gaussian-exact-sum-forward-slack/SOURCES.json new file mode 100644 index 0000000000..8946a9b88a --- /dev/null +++ b/research/gaussian-exact-sum-forward-slack/SOURCES.json @@ -0,0 +1,24 @@ +{ + "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/conservative-gaussian-rounding/PROOF.md", + "usage": "input", + "git_blob": "b7047476aaa5e2bb149c92a8a40a9b2ab444ef73", + "sha256": "122eff335674d8de1bcba47d28feb0c420be62b2b6d4e84f91c4292383753380" + } + ] +} diff --git a/research/gaussian-exact-sum-forward-slack/TASK.json b/research/gaussian-exact-sum-forward-slack/TASK.json new file mode 100644 index 0000000000..9f12bd3323 --- /dev/null +++ b/research/gaussian-exact-sum-forward-slack/TASK.json @@ -0,0 +1,95 @@ +{ + "schema_version": 1, + "task_id": "formal-interface-lemma", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "formal-interface-lemma", + "question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/gate-operand-parity-lean/README.md", + "research/staged544-certified-endpoint/README.md", + "research/unconditional-batched-crt/README.md" + ], + "methods": [ + "Formalize a missing boundary lemma identified by the selected review.", + "Audit a formal theorem-to-certificate binding independently." + ], + "acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.", + "scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse." + }, + "first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.", + "bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.", + "allowed_variations": [ + "Narrow to one formal lemma or one theorem-to-certificate binding." + ], + "scope_change_triggers": [ + "Formalizing already-covered arithmetic and claiming the full multiplication theorem." + ], + "overlap_terms": [ + "hyperplane end", + "formal interface", + "Lean binding", + "3807", + "3857", + "4100", + "gate-operand-parity-lean", + "staged544-certified-endpoint", + "unconditional-batched-crt" + ], + "existing_checks": [ + { + "scope": "PR #3807: scoped gate-operand parity formalization.", + "evidence": "research/gate-operand-parity-lean/README.md", + "remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.", + "status": "author-checked", + "source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3857: certified real-power moment/endpoint arithmetic.", + "evidence": "research/staged544-certified-endpoint/README.md", + "remaining": "Uniform algorithmic implications, not another endpoint digit.", + "status": "author-checked", + "source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4100: compact-switch formalization proposed as future validation.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Audit the statement and assumptions before a formal proof campaign.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Forward outward norm slack for injective exact-sum Gaussian-pair rounding with error at most one.", + "scope_change_reason": "PR #7570 leaves the exact-sum forward bound without the square identity open. This is a standalone precision lemma, outside actual-caller formalization.", + "bottleneck_link": "Exact-sum precision is one candidate contract for a native Gaussian pair. This result prices a necessary outward norm allowance at that boundary. Caller use and the selected supplier budget are outside its scope.", + "budget_minutes": 60, + "stop_rule": "Stop at the first exact finite witness that supplies a new necessary bound.", + "outcome": "completed", + "evidence": "README.md proves the obstruction. The normal and optimized verifiers check all 32 error-one edges, six distinct strict neighbors, four exact threshold ties and the eight-edge attaining finite matching.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Is sqrt(5)-sqrt(3) attainable by a global exact-sum map?", + "why_it_matters": "Attainment would identify the smallest forward norm allowance for this precision contract.", + "first_step": "Check complete neighborhoods in the sum-one fiber at the exact threshold beyond squared norm five.", + "blocked_by": "The finite matching gives only a local construction. The available global upper bound has a stronger square identity." + } + ] +} diff --git a/research/gaussian-exact-sum-forward-slack/VERIFY.json b/research/gaussian-exact-sum-forward-slack/VERIFY.json new file mode 100644 index 0000000000..3054be4848 --- /dev/null +++ b/research/gaussian-exact-sum-forward-slack/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [ + "research/conservative-gaussian-rounding/PROOF.md" + ], + "commands": [ + { + "argv": [ + "{python}", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 30, + "checks": "Complete sum-one error edges, strict Hall deficit and exact-threshold matching." + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 30, + "checks": "Complete sum-one error edges, strict Hall deficit and exact-threshold matching." + } + ] +} diff --git a/research/gaussian-exact-sum-forward-slack/verify.py b/research/gaussian-exact-sum-forward-slack/verify.py new file mode 100644 index 0000000000..c3fff4044f --- /dev/null +++ b/research/gaussian-exact-sum-forward-slack/verify.py @@ -0,0 +1,82 @@ +#!/usr/bin/env python3 +"""Check the complete sum-one witness using integer error and norm arithmetic.""" + +from collections import Counter +from itertools import product +import json + + +def require(condition: bool, message: str) -> None: + if not condition: + raise ValueError(message) + + +def norm_squared(first: tuple[int, int]) -> int: + real, imag = first + return real**2 + (1 - real)**2 + 2 * imag**2 + + +def twice_error_squared(first: tuple[int, int], output: tuple[int, int]) -> int: + real, imag = first + out_real, out_imag = output + return (2 * out_real - (1 - 2 * imag))**2 + (2 * out_imag - (2 * real - 1))**2 + + +def jump_at_most(before: int, after: int, numerator: int, denominator: int) -> bool: + """Compare sqrt(after) - sqrt(before) to numerator/denominator.""" + remainder = (after - before) * denominator**2 - numerator**2 + return remainder <= 0 or remainder**2 <= 4 * numerator**2 * denominator**2 * before + + +def verify() -> dict[str, int | str]: + require(not jump_at_most(3, 5, 1, 2), "threshold must exceed 1/2") + require(jump_at_most(3, 5, 51, 100), "threshold must be at most 51/100") + + expected_shells = {1: {1: 2, 3: 2}, 3: {1: 1, 3: 1, 5: 1, 7: 1}, 5: {3: 2, 9: 2}} + inputs = [first for first in product(range(-2, 3), repeat=2) if norm_squared(first) <= 5] + require(Counter(map(norm_squared, inputs)) == {1: 2, 3: 4, 5: 2}, "input shells") + strict_edges = set() + tied_edges = set() + total_edges = 0 + output_box = tuple(product(range(-3, 4), repeat=2)) + for first in inputs: + before = norm_squared(first) + outputs = Counter() + for output in output_box: + error = twice_error_squared(first, output) + if error > 2: + continue + require(error == 2, f"unexpected sub-unit error for {first}, {output}") + after = norm_squared(output) + outputs[after] += 1 + if after <= before: + strict_edges.add((first, output)) + elif (before, after) == (3, 5): + tied_edges.add((first, output)) + else: + require(not jump_at_most(before, after, 51, 100), f"unclassified edge {first}, {output}") + require(outputs == expected_shells[before], f"output shells for {first}") + total_edges += outputs.total() + + strict_neighbors = {output for _, output in strict_edges} + require(len(strict_neighbors) == 6 < len(inputs), "strict Hall deficit") + require((total_edges, len(strict_edges), len(tied_edges)) == (32, 16, 4), "edge counts") + + matching = ((0, -1), (1, -1), (0, 0), (-1, 0), (2, 0), (1, 0), (0, 1), (1, 1)) + require(len(set(matching)) == len(inputs), "matching must be injective") + matching_edges = set(zip(inputs, matching, strict=True)) + require(matching_edges <= strict_edges | tied_edges, "matching contains a forbidden edge") + require(len(matching_edges & tied_edges) == 2, "two exact threshold edges") + return { + "status": "PASS_GAUSSIAN_EXACT_SUM_FORWARD_SLACK", + "inputs": len(inputs), + "error_one_edges": total_edges, + "strict_edges": len(strict_edges), + "strict_neighbors": len(strict_neighbors), + "threshold_edges": len(tied_edges), + "matching_edges": len(matching_edges), + } + + +if __name__ == "__main__": + print(json.dumps(verify(), sort_keys=True)) From 317fecee459888f4e4fecd8ca62adeb7583f696d Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 23:29:35 +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")