From 49774d39cfd982bf707f33b9277d3f4eabf94582 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 18 Nov 2026 21:15:53 +0000 Subject: [PATCH 1/2] feat(research): prove two-prime Hadamard column completion --- .../two-prime-column-completion/README.md | 124 +++++++++++++++ .../two-prime-column-completion/SOURCES.json | 30 ++++ .../two-prime-column-completion/TASK.json | 95 +++++++++++ .../two-prime-column-completion/VERIFY.json | 34 ++++ .../two-prime-column-completion/verify.py | 149 ++++++++++++++++++ 5 files changed, 432 insertions(+) create mode 100644 research/two-prime-column-completion/README.md create mode 100644 research/two-prime-column-completion/SOURCES.json create mode 100644 research/two-prime-column-completion/TASK.json create mode 100644 research/two-prime-column-completion/VERIFY.json create mode 100644 research/two-prime-column-completion/verify.py diff --git a/research/two-prime-column-completion/README.md b/research/two-prime-column-completion/README.md new file mode 100644 index 0000000000..1c9d65a78f --- /dev/null +++ b/research/two-prime-column-completion/README.md @@ -0,0 +1,124 @@ +# One-column completion over two-prime odd alphabets + +This scoped proof was produced by Nick Petalas. Apache-2.0. + +Let `m = p^a q^b`, where `p, q` are distinct odd primes and `a, b` are positive. +Let `A` be an `n`-by-`(n-1)` matrix with entries in the `m`th roots of unity +and `A* A = nI`. If `3 <= n < pq` and either prime divides `n`, the unique +normalized missing column uses only `m`th roots. It preserves every supplied +column. For example, at alphabet order 15 this covers row counts 5, 6, 9, 10, +and 12 in addition to 3. + +The proof gives a separate sufficient condition at any `n >= 3`. Project each +entry to one prime-power component in its unique factorization into a +`p^a`th root and a `q^b`th root. If that projection preserves column +orthogonality, the missing column uses the original alphabet. + +## Proof + +Write `P = p^a` and `Q = q^b`. By symmetry, use the projection `pi` that sends +`x y` to `x` for `x` a `P`th root and `y` a `Q`th root. Denote the +projected matrix by `B = pi(A)`. + +**Orthogonality below `pq`.** For any two distinct columns of `A`, their +inner product is a vanishing sum of `n` roots with repetitions allowed. +Lam and Leung show that every such sum over this alphabet splits into +rotated prime cycles. If there are `r` `p`-cycles and `s` `q`-cycles, then +`n = pr + qs`. When `p` divides `n`, it divides `s`. A positive `s` +would give `n >= pq`, so all cycles have length `p`. The projection sends +each rotated `p`-cycle to a rotated `p`-cycle, which still sums to zero. +The projection commutes with phase inversion, so these are exactly the +off-diagonal column inner products of `B`. The diagonal entries stay +`n` because each projected entry has modulus one. +[Lam and Leung, Theorem 3.3 and Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=7) + +**Removing the sign.** Use the normalized missing columns +`w = (nI - AA*) e_1` and `v = (nI - BB*) e_1` from PR #5865. +That result gives `w_i` among the `2m`th roots and, because `B` uses an +odd prime-power alphabet with `n >= 3`, it gives `v_i` among the `P`th roots. +Thus `w_i = eps x y` for `eps` equal to 1 or -1 and roots `x, y` of orders +dividing `P, Q`, respectively. [PR #5865](../cyclotomic-column-completion/PROOF.md) + +Let `X, Y` represent primitive roots of orders `P, Q`. The ring of integers +generated by these roots has the presentation +`Z[X,Y]/(Phi_P(X), Phi_Q(Y))`. The monic relations give a basis of +`phi(P) phi(Q)` powers, and these powers are independent over the rationals +because the roots generate the cyclotomic field of degree +`phi(PQ) = phi(P) phi(Q)`. + +Reduce coefficients modulo `q` and send `Y` to 1. This gives a ring map +to `F_q[X]/(Phi_P(X))` because `Phi_Q(1) = q`. It sends each entry of +`A` to the same residue as the corresponding entry of `B`, including +after conjugation since conjugation inverts the roots. The column formulas +therefore give the same residue for `w_i` and `v_i`. + +In the residue ring the class of `X` generates a group of odd order dividing +`P`, since `X^P = 1`. The element `-1` has order two because the +ring has odd characteristic. The residues of the `P`th roots and their +negatives lie in disjoint cosets. The equal residues of `w_i` and `v_i` +force `eps = 1`. This proves the sufficient condition and, with the first +step, the row-count theorem. + +## Exact examples + +The first fixture has row and column indices `(r,s)` and `(j,k)` +in `{0,1,2}^2`. Its entry is +`zeta_3^(rj+sk+sj) zeta_5^(sj)`. If two column indices differ in `j`, +the sum over `r` vanishes. With equal `j` and different `k`, the sum over +`s` vanishes. Both arguments survive projection to the third roots. +The cross ratio on rows `(0,0),(0,1)` and columns `(0,0),(1,0)` +has order 15, so the mixed phases cannot all be removed by row and +column scalings into either prime-power alphabet. + +The verifier uses integer power bases modulo the two cyclotomic polynomials. +It checks 6 mixed fixtures, all 86 single-column erasures, and all 1,574 +recovered entries and their opposite signs. The fixtures include order 225 +and a 25-row order-15 example for which the sufficient condition applies +outside the automatic row-count range. The two projection controls use +an eight-term sum of one 3-cycle and one 5-cycle, and the 15-row partial +Fourier tensor. The latter retains a collision under either projection +and marks where the automatic projection argument can fail. It has an +original-alphabet completion. + +## Reproduce + +Run from the repository root with CPython 3.12.15 and its standard library. + +```sh +python3.12 -I -W error -B research/two-prime-column-completion/verify.py +python3.12 -I -W error -O -B research/two-prime-column-completion/verify.py +python3.12 -B scripts/research_package.py --package research/two-prime-column-completion +python3.12 -B scripts/check_research_commit.py --package research/two-prime-column-completion --check-source-history +``` + +The direct checks print `PASS_TWO_PRIME_COLUMN_COMPLETION`. The verifier uses +fixed inputs of at most 25 rows and 25 columns. Its coefficient tables have +at most 120 entries and its exponents are reduced modulo fixed prime powers. +Python allocates these bounded objects and dispatches their operations at +runtime. No runtime source files, external dependencies, or generated files +are needed. Both registered modes keep the mathematical checks active. + +## Scope and credit + +This is an exact algebraic result for one missing column. Physical execution, +precision for inexact inputs, a paid supplier and independent human and +formal proof-kernel review remain open. No selected cold replay, Lean or +Docker run was needed for the scoped claim. It yields no new κ. + +Credit David Ganz for the prime-order setting and pilot recovery application +in PRs #2849 and #2855. PR #5865 supplies the normalized column formula, the +doubled-alphabet result, the prime-power sign result and the open odd-composite +question. Lam and Leung supply the two-prime decomposition of vanishing sums. +The new step combines a complex orthogonality-preserving projection with +reduction at the discarded prime. [Atlas B097](../pure-math-atlas-400/volumes/02-geometry.md#b097) +· [PR #2855](https://github.com/CrocSwap/integer-mult-bounds/pull/2855) +· [Advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19718465) + +## Open next questions + +- Resolve the mixed-cycle case at `m = 15, n = 8`. This is the first + row count where both cycle lengths fit in one vanishing column product. + Start by dephasing the first column and enumerating the remaining columns' + pairwise differences, whose multiplicities must decompose into one + 3-cycle and one 5-cycle. The root-sum control alone gives no compatible + partial matrix. diff --git a/research/two-prime-column-completion/SOURCES.json b/research/two-prime-column-completion/SOURCES.json new file mode 100644 index 0000000000..4b1a8b1b78 --- /dev/null +++ b/research/two-prime-column-completion/SOURCES.json @@ -0,0 +1,30 @@ +{ + "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/cyclotomic-column-completion/PROOF.md", + "usage": "provenance", + "git_blob": "5023cdde8762720467f708b28dabda0f0532064e", + "sha256": "b194084e203a70574397eeafae053af8e9e49d9e519aacfa112f039da2499674" + }, + { + "path": "research/pure-math-atlas-400/volumes/02-geometry.md", + "usage": "provenance", + "git_blob": "baef1e69c08c7cbd4dfd020862870fa5161afc86", + "sha256": "39fc97bdfa29337b79d1308e35df41e867ce2102d44755fd407aa09ff8352b39" + } + ] +} diff --git a/research/two-prime-column-completion/TASK.json b/research/two-prime-column-completion/TASK.json new file mode 100644 index 0000000000..7fcc4e615e --- /dev/null +++ b/research/two-prime-column-completion/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": "Exact one-column completion for partial Butson matrices over p^a q^b when either prime divides the row count below pq, or when a prime-power projection preserves column orthogonality.", + "scope_change_reason": "PR #5865 asks for the missing odd-composite case of an algebraic recovery interface. This work answers a row-count subcase without a selected-caller binding.", + "bottleneck_link": "An algebraic side result on exact phase recovery. No supplier or kappa improvement follows.", + "budget_minutes": 60, + "stop_rule": "Package the first verified same-alphabet theorem beyond the odd prime-power case.", + "outcome": "completed", + "evidence": "README.md proves the projection criterion and its row-count corollary. verify.py checks six mixed fixtures, all their 86 erasures and all 1574 recovered entries and their opposite signs, plus two projection controls. CPython 3.12.15 with the standard library.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Does every partial matrix at m=15 and n=8 admit original-alphabet completion?", + "why_it_matters": "This is the first dimension at that alphabet where one vanishing column product can use both prime cycles.", + "first_step": "Dephase the first column and use the one-3-cycle and one-5-cycle multiplicity constraint on all pairwise column differences.", + "blocked_by": "Mixed cycles can spoil prime-power projection. A root-sum example is not a compatible partial matrix." + } + ] +} diff --git a/research/two-prime-column-completion/VERIFY.json b/research/two-prime-column-completion/VERIFY.json new file mode 100644 index 0000000000..807e154f99 --- /dev/null +++ b/research/two-prime-column-completion/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Check exact mixed-alphabet column recovery, modular sign separation, and the mixed-cycle and boundary projection controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "-O", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Check exact mixed-alphabet column recovery, modular sign separation, and the mixed-cycle and boundary projection controls." + } + ] +} diff --git a/research/two-prime-column-completion/verify.py b/research/two-prime-column-completion/verify.py new file mode 100644 index 0000000000..f44c327017 --- /dev/null +++ b/research/two-prime-column-completion/verify.py @@ -0,0 +1,149 @@ +#!/usr/bin/env python3 +"""Check the two-prime completion proof on fixed exact examples.""" + +from itertools import combinations, product + + +def require(condition, message): + if not condition: + raise ArithmeticError(message) + + +def powers(prime, order): + """Sparse monomial residues modulo the prime-power cyclotomic polynomial.""" + step = order // prime + degree = order - step + residues = [((exponent, 1),) for exponent in range(degree)] + for offset in range(step): + residues.append(tuple((offset + j * step, -1) for j in range(prime - 1))) + return degree, tuple(residues) + + +def evaluate(phases, bases): + """Sum roots in the tensor product of the two integral power bases.""" + (x_degree, x_powers), (y_degree, y_powers) = bases + coefficients = [[0] * y_degree for _ in range(x_degree)] + for x, y in phases: + for i, a in x_powers[x % len(x_powers)]: + for j, b in y_powers[y % len(y_powers)]: + coefficients[i][j] += a * b + return tuple(map(tuple, coefficients)) + + +def pairing(left, right, bases): + differences = ((a - c, b - d) for (a, b), (c, d) in zip(left, right, strict=True)) + return evaluate(differences, bases) + + +def orthogonal_columns(matrix, bases): + zero = evaluate((), bases) + return all(pairing(left, right, bases) == zero + for left, right in combinations(zip(*matrix, strict=True), 2)) + + +def project(matrix, keep=0): + return tuple(tuple((x, 0) if keep == 0 else (0, y) for x, y in row) + for row in matrix) + + +def normalized_column(partial, bases): + n = len(partial) + column = [] + for index, row in enumerate(partial): + gram_row = pairing(row, partial[0], bases) + coefficients = [list(-value for value in power_row) for power_row in gram_row] + coefficients[0][0] += n if index == 0 else 0 + column.append(tuple(map(tuple, coefficients))) + return tuple(column) + + +def reduce_at_q(coefficients, q): + return tuple(sum(row) % q for row in coefficients) + + +def check_erasures(matrix, bases, q): + projected = project(matrix) + require(orthogonal_columns(matrix, bases), "mixed fixture is not orthogonal") + require(orthogonal_columns(projected, bases), "fixture loses projected orthogonality") + n = len(matrix) + entries = 0 + for erased in range(n): + partial = tuple(row[:erased] + row[erased + 1:] for row in matrix) + column = normalized_column(partial, bases) + projected_column = normalized_column(project(partial), bases) + x0, y0 = matrix[0][erased] + for index, row in enumerate(matrix): + x, y = row[erased] + expected = evaluate(((x - x0, y - y0),), bases) + require(column[index] == expected, "reconstruction changed the erased phase") + require(projected_column[index] == evaluate(((x - x0, 0),), bases), + "projected reconstruction changed the retained prime-power phase") + residue = reduce_at_q(projected_column[index], q) + require(reduce_at_q(column[index], q) == residue, "reduction mismatch") + opposite = tuple(-value % q for value in reduce_at_q(expected, q)) + require(residue != opposite, "the opposite sign also passed reduction") + entries += 1 + return n, entries + + +def mixed_fixture(p, p_power): + """Fourier blocks with a column-block-dependent row phase.""" + indices = tuple(product(range(p), repeat=2)) + matrix = tuple( + tuple(((p_power // p) * (r * j + s * k) + s * j, s * j) + for j, k in indices) + for r, s in indices + ) + # At rows (0,0),(0,1) and columns (0,0),(1,0), the cross ratio + # has exponent one in each component, even after row and column gauges. + require(matrix[0][0] == matrix[0][p] == matrix[1][0] == (0, 0), + "mixed cross-ratio normalization changed") + require(matrix[1][p] == (1, 1), "fixture lacks a primitive mixed cross ratio") + return matrix + + +def check_projection_boundaries(): + bases = powers(3, 3), powers(5, 5) + mixed_cycles = tuple((i, 0) for i in range(3)) + tuple((0, j) for j in range(5)) + require(evaluate(mixed_cycles, bases) == evaluate((), bases), + "the two mixed cycles must vanish together") + collapsed = tuple((x, 0) for x, _ in mixed_cycles) + require(evaluate(collapsed, bases) == evaluate(((0, 0),) * 5, bases), + "the five-cycle should contribute five after projection") + + indices = tuple(product(range(3), range(5))) + partial = tuple(tuple((r * j, s * k) for j, k in indices[:-1]) for r, s in indices) + require(orthogonal_columns(partial, bases), "boundary partial Fourier matrix is invalid") + zero = evaluate((), bases) + for kept_part, discarded_phase in ((0, (0, 1)), (1, (1, 0))): + columns = tuple(zip(*project(partial, keep=kept_part), strict=True)) + left = columns[0] + right = columns[indices.index(discarded_phase)] + require(pairing(left, right, bases) != zero, + "discarded prime did not collapse two columns") + + +def main(): + fixtures = ( + (3, 5, 3, 5), + (3, 5, 9, 5), + (3, 5, 3, 25), + (3, 5, 9, 25), + (5, 7, 5, 7), + (5, 3, 5, 3), + ) + erasures = 0 + entries = 0 + for p, q, p_power, q_power in fixtures: + bases = powers(p, p_power), powers(q, q_power) + fixture_erasures, fixture_entries = check_erasures(mixed_fixture(p, p_power), bases, q) + erasures += fixture_erasures + entries += fixture_entries + check_projection_boundaries() + print("PASS_TWO_PRIME_COLUMN_COMPLETION") + print(f"{len(fixtures)} mixed fixtures, {erasures} erasures, {entries} recovered entries") + print("All opposite signs reject modulo q. Mixed-cycle and pq-row controls pass.") + + +if __name__ == "__main__": + main() From 7dc85513e8ee9b771a5856f027cf199936f85af0 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 18 Nov 2026 21:18:40 +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")