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/even-one-edge-maximizer/README.md b/research/even-one-edge-maximizer/README.md new file mode 100644 index 0000000000..e8c47ff23f --- /dev/null +++ b/research/even-one-edge-maximizer/README.md @@ -0,0 +1,108 @@ +# Inequivalent even maximizers with one matrix-unit edge + +At pattern dimension `k=3` and matching number `ν=1`, two complete binary +projector pools attain the maximum joint-image dimension `n=4` and have +inequivalent actions. The new pool has two unordered pairs whose product has +trace one. The published maximizer has four. This is a scoped construction over +`F₂`. + +## Model and construction + +Write `P=xyᵀ` with `yᵀx=1`. Its pattern is the off-diagonal part of `P`. +For a pattern space `H`, the complete pool consists of all rank-one idempotents +whose patterns belong to `H \ {0}`. An edge `{i,j}` is present when `H` contains +`Eᵢⱼ` or `Eⱼᵢ`. The matching number is the maximum number of disjoint edges. +Equivalence of actions means simultaneous conjugacy by an invertible map on the +joint image, with the projectors allowed to be relabelled. + +Use coordinates `a,b,f,g`, with corresponding unit vectors denoted by the same +letters. Take these four pairs of factors. + +| Projector | Image `x` | Covector `y` | +| --- | --- | --- | +| `P` | `a` | `a+b` | +| `Q` | `a+b` | `b` | +| `R` | `a+f` | `a+g` | +| `S` | `a+b+g` | `b+f` | + +Each pairing `yᵀx` is one. Put `H=span(E_ab, off(R), off(S))`. The patterns of +`P` and `Q` both equal `E_ab`. Partition the coordinates into `(a,b)` and +`(f,g)`. On the first two rows and last two columns, the patterns of `R` and +`S` restrict to `a gᵀ` and `(a+b) fᵀ`. In the reverse rectangle they restrict to +`f aᵀ` and `g bᵀ`. Both pairs of restrictions are independent. Every +pattern outside `span(E_ab)` therefore has a nonzero entry in each of the two +disjoint rectangles. It follows that `k=3` and `E_ab` is the sole matrix unit. + +The only lifts of `E_ab` are `P` and `Q`. Indeed, the side conditions `x_a=1` +and `y_b=1` force all the other bits except `x_b,y_a` to vanish, and exactly one +of those two bits must be one. In the coset of `off(R)` modulo `span(E_ab)`, +the two nonzero cross rectangles uniquely fix `x` and `y` over `F₂`, yielding +`R`. The coset of `off(S)` gives `S` by the same argument. In the sum coset the +first rectangle has rank two, since `a` and `a+b` are independent. It cannot +be a rectangle of an outer product. This exhausts the nonzero pattern space. + +The four images form a basis because `a` and `a+b` span the first two +coordinates and the other images have distinct fresh coordinates `f,g`. +The covectors are also a basis. Every nonzero invariant subspace must therefore +contain at least one of the four images, obtained by applying a projector to a +nonzero element of the subspace. Define an arrow `i → j` if `P_j x_i = x_j`. +The closed walk `P → R → S → Q → R → P` reaches all four images from each of its +vertices. Thus the action is irreducible, with `n=4`. The even maximum at these +parameters is four by the matching bound and its attainment in #7707. + +## Inequivalence + +For distinct projectors `P_i=x_i y_iᵀ` and `P_j=x_j y_jᵀ`, +`tr(P_i P_j)=(y_iᵀ x_j)(y_jᵀ x_i)`. The integer count of unordered pairs +with trace one is unchanged by simultaneous conjugation and relabelling. +The pairing matrix for the new pool, with entries `y_iᵀ x_j` and order +`P,Q,R,S`, is + +```text +1 0 1 0 +0 1 0 1 +1 1 1 0 +0 1 1 1 +``` + +The trace-one pairs are `{P,R}` and `{Q,S}`. For the published maximizer, +#7707 uses `P,Q` with the two links `(b+f)(a+f)ᵀ` and `(b+g)(a+g)ᵀ`. +Each link has trace-one product with each of `P,Q`. The two links have +trace-zero product, as do `P,Q`. Its count is four, which separates the two +actions even under arbitrary linear changes of basis on the joint image. + +## Reproduce + +Run these from the repository root with CPython 3.12.15 and its standard library. + +```sh +python3.12 -B research/even-one-edge-maximizer/verify.py +python3.12 -B -O research/even-one-edge-maximizer/verify.py +python3.12 -B scripts/research_package.py --package research/even-one-edge-maximizer +python3.12 -B scripts/check_research_commit.py --package research/even-one-edge-maximizer --check-source-history +``` + +The verifier scans all 120 width-four rank-one idempotents for the new pattern +space, checks all 15 nonzero starting vectors and reports the two trace-one +pairs. The written proof uses the published upper bound as a premise. + +## Open next questions + +- What are all action classes at `(k,ν,n)=(3,1,4)`? Start by enumerating spans + of `E_ab` and two realized pattern classes at width four, then classify + their complete pools up to conjugacy. Higher ambient widths require a + separate reduction. +- Can the new alphabet realize a rank-saving paid word? Start by specifying + a saturated exponent relation lattice and the full ambient endpoint. A + word, dirty-state restoration, native implementation and the complete + recursive invoice remain open. This construction supplies no new saving. + +## Credit + +The new construction and proof were produced by Nick Petalas. Ali Romman’s +[PR #7707](https://github.com/CrocSwap/integer-mult-bounds/pull/7707) supplies +its even-maximizer question, the baseline construction and the sharp value. +His [PR #7692](https://github.com/CrocSwap/integer-mult-bounds/pull/7692) +supplies the matching theorem and the two lifts of a matrix unit used in the +baseline. [TASK.json](TASK.json) identifies the exact predecessor proofs. +The new package is Apache-2.0. diff --git a/research/even-one-edge-maximizer/SOURCES.json b/research/even-one-edge-maximizer/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/even-one-edge-maximizer/SOURCES.json @@ -0,0 +1,18 @@ +{ + "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" + } + ] +} diff --git a/research/even-one-edge-maximizer/TASK.json b/research/even-one-edge-maximizer/TASK.json new file mode 100644 index 0000000000..e7307df0ce --- /dev/null +++ b/research/even-one-edge-maximizer/TASK.json @@ -0,0 +1,89 @@ +{ + "schema_version": 1, + "task_id": "bit-new-register-model", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "bit-new-register-model", + "question": "Can an explicitly larger or nonabelian register model escape the scoped three-register obstruction?", + "starting_points": [ + "docs/research/research-family-status.md", + "research/bit-three-register-lower-bound/README.md", + "certificates/selected-result.json", + "research/bit-gl3-mixed-targets-length10/README.md", + "docs/research/community-efficient1000-review.md" + ], + "methods": [ + "Construct the smallest exact identity in a newly specified legal operation alphabet.", + "Derive a target-specific relaxation bound for that same explicit alphabet." + ], + "acceptance_gate": "Name the changed hypothesis, all counted roles and a uniform identity; finite column tests alone do not certify it. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "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": "First compare the alphabet, role count and length with the fully replayed #1974 census and #2027 mixed-root tariff. Identify a changed premise and a legal native implementation; then price one smallest completed instance before searching larger words.", + "bottleneck_link": "A small-width completed saving changes the bit primitive; a finite-address identity alone is insufficient.", + "allowed_variations": [ + "Choose a fixed larger register count or a specified nonabelian operation family." + ], + "scope_change_triggers": [ + "Remaining inside the already-excluded three-register abelian model.", + "Repeating the two-register GL3 census or a covered three-register length without changing a hypothesis; a formal group-algebra word without native conversion is a partial result." + ], + "overlap_terms": [ + "three-register", + "nonabelian", + "group algebra" + ] + }, + "scope_status": "changed", + "actual_scope": "Construct an inequivalent complete F2 projector pool for (k, matching number, joint-image dimension) = (3, 1, 4).", + "scope_change_reason": "Takes the first open question in PR #7707 at the smallest one-edge even maximum. The scope is classification of scalar alphabets before an endpoint word or native implementation.", + "bottleneck_link": "Inequivalent joint-image actions give different scalar alphabets for future binary endpoint-word searches at the same pattern and matching dimensions.", + "budget_minutes": 60, + "stop_rule": "Stop after the first inequivalent complete irreducible maximizer passes the exact width-four check.", + "outcome": "completed", + "evidence": "The written construction and trace comparison are in README.md. verify.py checks all 120 width-four rank-one idempotents and all 15 nonzero starting vectors in the new action, on CPython 3.12.15 with its standard library.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Which simultaneous-conjugacy classes occur at (k, matching number, joint-image dimension) = (3, 1, 4)?", + "why_it_matters": "A complete list would show which actions need separate word tests at the same dimension bound.", + "first_step": "At width four, form all spans of one matrix unit and two realized pattern classes, then classify their complete pools.", + "blocked_by": "Higher ambient widths need a separate reduction and are outside this construction." + }, + { + "question": "Does the new alphabet admit a rank-saving paid word?", + "why_it_matters": "A complete irreducible action is only a candidate scalar alphabet.", + "first_step": "Specify a saturated exponent relation lattice and test a full ambient diagonal endpoint.", + "blocked_by": "Word chronology, dirty restoration, native realization and the complete recursive invoice remain open." + } + ], + "predecessors": [ + { + "pr": 7707, + "author": "aliromman", + "commit": "57e24923b609d2588b83321f530fa2a1e75ed364", + "proof": "https://github.com/aliromman/integer-mult-bounds/blob/57e24923b609d2588b83321f530fa2a1e75ed364/research/edge-matching-even-attainment/PROOF.md", + "sha256": "688efc2cd7c19e43c49193e94c1759c515dd79afbc4d832d62b27726f411daac", + "use": "Even maximum, open classification question and published comparison action. No runtime dependency." + }, + { + "pr": 7692, + "author": "aliromman", + "commit": "c2870a38841f515db7203a0761cd77f014f7fb7a", + "proof": "https://github.com/aliromman/integer-mult-bounds/blob/c2870a38841f515db7203a0761cd77f014f7fb7a/research/edge-matching-image-bound/PROOF.md", + "sha256": "0e49106713d5b0dfe50bf193737edc0fa4ee7862eb6696b43a53ddf5e06bc026", + "use": "Matching bound and the two-lift edge pair. No runtime dependency." + } + ], + "advance_claim": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19718509" +} diff --git a/research/even-one-edge-maximizer/VERIFY.json b/research/even-one-edge-maximizer/VERIFY.json new file mode 100644 index 0000000000..9a753186d4 --- /dev/null +++ b/research/even-one-edge-maximizer/VERIFY.json @@ -0,0 +1,28 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 10, + "checks": "One matrix unit, exact complete pool, full-image irreducibility and trace-one pair count for the new witness." + }, + { + "argv": [ + "{python}", + "-B", + "-O", + "{package}/verify.py" + ], + "timeout_seconds": 10, + "checks": "One matrix unit, exact complete pool, full-image irreducibility and trace-one pair count for the new witness." + } + ] +} diff --git a/research/even-one-edge-maximizer/verify.py b/research/even-one-edge-maximizer/verify.py new file mode 100644 index 0000000000..dd59470400 --- /dev/null +++ b/research/even-one-edge-maximizer/verify.py @@ -0,0 +1,76 @@ +#!/usr/bin/env python3 +"""Check the complete width-four witness and its trace invariant over F2.""" + +from itertools import combinations, product + +WIDTH = 4 +CARDINALITY = 1 << WIDTH +# The low-to-high bits represent a, b, f, g. +PROJECTORS = ((1, 3), (3, 2), (5, 9), (11, 6)) + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def pairing(image, covector): + return (image & covector).bit_count() % 2 + + +def off_pattern(image, covector): + pattern = 0 + for row in range(WIDTH): + if image & (1 << row): + entries = covector & ~(1 << row) + pattern |= entries << (WIDTH * row) + return pattern + + +def span(generators): + vectors = {0} + for generator in generators: + vectors |= {vector ^ generator for vector in vectors} + return vectors + + +def reaches_all_images(start, images): + reached = {start} + for _ in range(len(PROJECTORS)): + reached |= { + image for image, covector in PROJECTORS + if any(pairing(vector, covector) for vector in reached) + } + return images <= reached + + +def main(): + patterns = span(tuple(off_pattern(*projector) for projector in PROJECTORS)) + require(len(patterns) == 8, "expected pattern dimension three") + units = {pattern for pattern in patterns if pattern.bit_count() == 1} + require(units == {1 << 1}, "expected the single unit E_ab") + + factors = range(1, CARDINALITY) + idempotents = tuple((x, y) for x, y in product(factors, repeat=2) if pairing(x, y)) + pool = {pair for pair in idempotents if off_pattern(*pair) in patterns - {0}} + require(len(idempotents) == 120, "incorrect width-four idempotent inventory") + require(pool == set(PROJECTORS), "complete pool differs from the four displayed lifts") + + images = {image for image, _ in pool} + require(len(span(images)) == CARDINALITY, "joint image is not the full width-four space") + for vector in factors: + require(reaches_all_images(vector, images), f"nonspanning orbit at {vector}") + + reciprocal = { + (i, j) for i, j in combinations(range(len(PROJECTORS)), 2) + if pairing(PROJECTORS[i][0], PROJECTORS[j][1]) + and pairing(PROJECTORS[j][0], PROJECTORS[i][1]) + } + require(reciprocal == {(0, 2), (1, 3)}, "unexpected trace-one pairs") + print("PASS_EVEN_ONE_EDGE_MAXIMIZER") + print(f"{len(idempotents)} idempotents scanned, {len(patterns) - 1} nonzero patterns, " + f"{len(pool)} lifts, {len(factors)} spanning orbits, {len(reciprocal)} trace-one pairs") + + +if __name__ == "__main__": + main() 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")