From bf8ab572a32a9f540835373f02b178c346ed25e4 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 11 Nov 2026 09:07:40 +0000 Subject: [PATCH 1/2] feat(research): exclude mixed cubic and quintic Clifford sectors --- research/two-cyclotomic-no-mixing/PROOF.md | 135 ++++++++++ research/two-cyclotomic-no-mixing/README.md | 120 +++++++++ .../two-cyclotomic-no-mixing/SOURCES.json | 36 +++ research/two-cyclotomic-no-mixing/TASK.json | 91 +++++++ research/two-cyclotomic-no-mixing/VERIFY.json | 34 +++ research/two-cyclotomic-no-mixing/verify.py | 250 ++++++++++++++++++ 6 files changed, 666 insertions(+) create mode 100644 research/two-cyclotomic-no-mixing/PROOF.md create mode 100644 research/two-cyclotomic-no-mixing/README.md create mode 100644 research/two-cyclotomic-no-mixing/SOURCES.json create mode 100644 research/two-cyclotomic-no-mixing/TASK.json create mode 100644 research/two-cyclotomic-no-mixing/VERIFY.json create mode 100644 research/two-cyclotomic-no-mixing/verify.py diff --git a/research/two-cyclotomic-no-mixing/PROOF.md b/research/two-cyclotomic-no-mixing/PROOF.md new file mode 100644 index 0000000000..c5a6ba43f2 --- /dev/null +++ b/research/two-cyclotomic-no-mixing/PROOF.md @@ -0,0 +1,135 @@ +# Cubic and quintic sectors cannot mix + +This proof was produced by Nick Petalas. Apache-2.0. + +## Statement and credit + +Let M be a positive integer. Let U be a unitary Clifford on M qubits, +with every entry in Q(i), and suppose the actual matrix on the entire bank +satisfies + + (U² + U + I)(U⁴ + U³ + U² + U + I) = 0. + +Then exactly one of the two factors is zero. Consequently U has exact order +three or five, and its binary Pauli symplectic matrix S satisfies + + rank(S-I) = 2 in the cubic case, + rank(S-I) = 4 in the quintic case. + +Its native B-block rank is at most min(M,4), and at most min(M,2) in +the cubic case. The quintic case requires M >= 2. + +The new implication is the exclusion of mixed sectors under the product +relation. This settles the explicit Phi3/Phi5 test in Open next question 2 of +[Nick Petalas's #6192](https://github.com/CrocSwap/integer-mult-bounds/pull/6192). +The pure-factor defect formulas above are cited consequences of that package, +not new formulas or an audit. Ross Richardson's +[#4081](https://github.com/CrocSwap/integer-mult-bounds/pull/4081) +supplies the earlier cubic Clifford trace gate and its Pauli-character method. +Cyclotomic irreducibility and the character calculation are classical tools; +no literature-wide priority claim is made for them. + +## Spectral multiplicities + +For odd n, the fields Q(i,zeta_n) and Q(zeta_(4n)) coincide: primitive roots +of coprime orders 4 and n generate the same compositum. Classical cyclotomic +irreducibility gives + + [Q(i,zeta_n):Q(i)] = phi(4n)/2 = phi(n). + +See [Romyar Sharifi, Abstract Algebra, Theorem 6.6.11](https://www.math.ucla.edu/~sharifi/notes/algebra-ch06.html) +for the irreducibility theorem over Q. The displayed degree argument gives +the extension to Q(i); it is also the field argument retained in #6192. +In particular Phi3 and Phi5 remain irreducible over Q(i), with degrees +two and four. + +Their product is squarefree. The assumed annihilation therefore decomposes +the Q(i)[X]-module into copies of the two simple modules. Equivalently, there +are nonnegative integers a,b, not both zero, such that + + characteristic_polynomial(U) = Phi3^a Phi5^b, + 2a + 4b = 2^M, + Tr(U) = -a-b. + +The trace follows because the sum of the primitive roots is -1 for each +of the primes three and five. In particular the trace cannot vanish. +This is a spectral statement about the actual whole-bank matrix and its +actual global phase, rather than a relation modulo phase or on a subspace. + +## Clifford trace restriction + +Here is the short Pauli argument from Richardson's trace gate. Label +Hermitian Paulis by v in F2^(2M). Clifford conjugation has the form + + U P_v U* = epsilon(v) P_(Sv), epsilon(v) in {+1,-1}. + +On K=ker(S-I), the sign epsilon is a character. To see this, conjugate +P_v P_w for v,w in K. Its Pauli multiplication phase is the same before +and after conjugation, so epsilon(v+w)=epsilon(v)epsilon(w). Thus the trace +of conjugation on the matrix space is either zero or |K|. The same map is +represented by U tensor conjugate(U), with trace |Tr(U)|². Hence + + |Tr(U)|² is zero or a power of two. + +Since a+b is a positive integer, (a+b)² being a power of two forces a+b +itself to be a power of two. Unique prime factorization proves this last +step, including that the exponent of the square is even. + +## The new no-mixing step + +Suppose a>0 and b>0. From 2a+4b=2^M one obtains + + 2^(M-2) < a+b < 2^(M-1). + +The left strict inequality is equivalent to 2a>0; the right one is +equivalent to 2b>0. There is no power of two strictly between these two +consecutive powers. This contradicts the Clifford trace restriction. +Thus ab=0. If b=0, the minimal polynomial is Phi3, so Phi3(U)=0; +if a=0, it is Phi5, so Phi5(U)=0. The two alternatives cannot both hold +because the polynomials are coprime and the bank has positive dimension. +This proves the new implication at every M without finite extrapolation. + +The rank consequences now follow directly from #6192's pure-factor theorem: +its exponent a in phi(n)=2^a is one at n=3 and two at n=5. This use of the +letter a in the cited theorem is separate from the cubic multiplicity above. +The native B block is a submatrix of S-I, so its rank has the stated cap. +No mixed-product rank or native implementation theorem is assumed. + +## Boundary examples and exact checks + +The checker uses the cubic Clifford + + C3 = (-I + iX + iY + iZ)/2 + +and the four-by-four quintic matrix displayed in #6192's proof, denoted C5. +The matrices serve as positive fixtures, not as new constructions. It checks +unitarity, the polynomial relations, exact orders and all Pauli generator +images using Gaussian rational arithmetic. No predecessor verifier is run. + +Two eight-dimensional examples explain the scope of the implication: + +* diag(C3,C3,C5) is Gaussian rational and unitary, satisfies the product + relation, and satisfies neither individual relation. Its multiplicities + are (a,b)=(2,1), trace -3 and squared trace 9. It fails the Pauli-normalizer + test, so unitarity and the coefficient field alone do not suffice. +* C3 tensor C5 is a Gaussian-rational Clifford of exact order fifteen. + It fails the product relation. Thus order dividing fifteen alone cannot + replace the stated annihilator hypothesis. + +An arithmetic control at dimension twelve, a=b=2, passes the trace test +despite having two sectors. This is only a control for the power-of-two +dimension argument; no twelve-dimensional Clifford construction is claimed. + +The finite census enumerates every nonnegative solution of 2a+4b=2^M for +1 <= M <= 18. It tests the trace square as an integer and checks that +exactly the pure endpoints pass. The written proof supplies the unbounded +quantifiers. The matrix examples do not classify other cyclotomic products. + +## Limitations + +There is no emitted physical caller, productive-target credit, full paid bill, +dirty-helper contract, precision/tape realization, supplier admission or new +kappa here. The selected result and its five inherited assumptions are +unchanged. Several factors, other degree pairs, restricted-input relations, +different coefficient fields and approximate identities are not covered. +Independent human and formal proof-kernel review are unclaimed. diff --git a/research/two-cyclotomic-no-mixing/README.md b/research/two-cyclotomic-no-mixing/README.md new file mode 100644 index 0000000000..a5591c33c8 --- /dev/null +++ b/research/two-cyclotomic-no-mixing/README.md @@ -0,0 +1,120 @@ +# Cubic and quintic response sectors cannot mix + +This contribution was produced by Nick Petalas. Apache-2.0. +Claim type: scoped written proof with exact finite corroboration. +Independent human and formal proof-kernel review are unclaimed. + +Let U be a unitary Clifford on M qubits with entries in Q(i). If the actual +whole-bank matrix satisfies `(Phi3 Phi5)(U)=0`, then exactly one of Phi3(U) +and Phi5(U) is zero. The operator has exact order three or five. By the cited +pure-factor theorem of [#6192](https://github.com/CrocSwap/integer-mult-bounds/pull/6192), +its Pauli symplectic defect has rank two or four, respectively, and its +native B rank is at most min(M,4). This product relation cannot create an +unbounded-native-rank response family. No new kappa is claimed. + +The new step answers the explicit Phi3/Phi5 test in #6192's Open next +question 2. It does not recheck the primitive-factor theorem. The +[proof](PROOF.md) derives `2a+4b=2^M` and `Tr(U)=-a-b`. A nonzero integer +Clifford trace has magnitude a power of two. If both sectors occur, +`2^(M-2) 0 and value & (value - 1) == 0 + + +def multiplicity_census(): + cases = mixed = admissible = 0 + for qubits in range(1, MAX_QUBITS + 1): + dimension = 1 << qubits + for quintic in range(dimension // 4 + 1): + cubic = (dimension - 4 * quintic) // 2 + require(2 * cubic + 4 * quintic == dimension, "dimension equation") + trace_magnitude = cubic + quintic + trace_test = power_of_two(trace_magnitude * trace_magnitude) + endpoint = cubic == 0 or quintic == 0 + require(trace_test == endpoint, "mixed multiplicity passed trace gate") + if not endpoint: + require(dimension < 4 * trace_magnitude < 2 * dimension, + "strict consecutive-power bracket") + mixed += 1 + admissible += int(trace_test) + cases += 1 + return {"maximum_qubits": MAX_QUBITS, "multiplicity_pairs": cases, + "mixed_pairs_excluded": mixed, "pure_pairs_admitted": admissible} + + +def fixtures(): + cubic = tuple(tuple((F(r, 2), F(i, 2)) for r, i in row) for row in ( + ((-1, 1), (1, 1)), ((-1, 1), (-1, -1)))) + # The explicit quintic matrix is credited to #6192; it is a test fixture. + quintic = tuple(tuple((F(r, 2), F(i, 2)) for r, i in row) for row in ( + ((0, -1), (0, -1), (0, -1), (0, -1)), + ((0, -1), (0, 1), (0, -1), (0, 1)), + ((1, 0), (-1, 0), (-1, 0), (1, 0)), + ((1, 0), (1, 0), (-1, 0), (-1, 0)))) + return {"pure_cubic": cubic, "pure_quintic": quintic, + "mixed_nonclifford": direct_sum((cubic, cubic, quintic)), + "order_fifteen_clifford": tensor(cubic, quintic)} + + +def matrix_checks(): + rows = [] + expected = {"pure_cubic": (True, False, True, True), + "pure_quintic": (False, True, True, True), + "mixed_nonclifford": (False, False, True, False), + "order_fifteen_clifford": (False, False, False, True)} + for name, matrix in fixtures().items(): + images = clifford_generator_images(matrix) + actual = (vanishes(PHI3, matrix), vanishes(PHI5, matrix), + vanishes(PRODUCT, matrix), all(images)) + require(actual == expected[name], "matrix hypothesis control: " + name) + power = identity(len(matrix)) + exact_order = 0 + for exponent in range(1, 16): + power = multiply(power, matrix) + if power == identity(len(matrix)): + exact_order = exponent + break + require(exact_order == {"pure_cubic": 3, "pure_quintic": 5, + "mixed_nonclifford": 15, + "order_fifteen_clifford": 15}[name], "exact order") + trace = ZERO + for i in range(len(matrix)): + trace = plus(trace, matrix[i][i]) + require(trace[1] == 0 and trace[0].denominator == 1, "integer real trace") + rows.append({"name": name, "dimension": len(matrix), "trace": int(trace[0]), + "exact_order": exact_order, "phi3_zero": actual[0], + "phi5_zero": actual[1], "product_zero": actual[2], + "pauli_generator_tests": images}) + return rows + + +def algebra_controls(): + product = [0] * 7 + for i, a in enumerate(PHI3): + for j, b in enumerate(PHI5): + product[i + j] += a * b + require(tuple(product) == PRODUCT, "polynomial convolution") + require(not power_of_two(0) and not power_of_two(9), "trace rejection controls") + require(power_of_two(1) and power_of_two(16), "trace acceptance controls") + # Non-qubit dimension permits both multiplicities through the trace test. + require(2 * 2 + 4 * 2 == 12 and power_of_two((2 + 2) ** 2), + "power-of-two dimension premise control") + for size in (0, 9): + try: + identity(size) + except ValueError as exc: + require(str(exc) == "matrix capacity", "wrong boundary rejection") + else: + raise ValueError("matrix capacity was not enforced") + return {"convolution": 1, "trace_predicate_controls": 4, + "nonqubit_arithmetic_control": 1, "capacity_rejections": 2} + + +def receipt(): + package = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", "verify.py") + hashes = {} + for name in names: + data = (package / name).read_bytes() + require(len(data) <= 100000, "package file capacity") + hashes[name] = sha256(data).hexdigest() + return {"claim_type": "scoped proof with finite exact corroboration", + "census": multiplicity_census(), "matrices": matrix_checks(), + "controls": algebra_controls(), "package_sha256": hashes, + "python": platform.python_version()} + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("--emit", action="store_true", help="print the computed hash-bound receipt") + args = parser.parse_args() + result = receipt() + if args.emit: + print(json.dumps(result, sort_keys=True, indent=2)) + else: + print(json.dumps(result["census"], sort_keys=True)) + print("PASS_TWO_CYCLOTOMIC_NO_MIXING") + + +if __name__ == "__main__": + main() From 745809813a2a8dc0b3f2d878b6636bceae4599e0 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:58:48 +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")