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/c3-weight3-plus-plus-charpoly/README.md b/research/c3-weight3-plus-plus-charpoly/README.md new file mode 100644 index 0000000000..ac3e8b75a5 --- /dev/null +++ b/research/c3-weight3-plus-plus-charpoly/README.md @@ -0,0 +1,113 @@ +# Characteristic polynomial of the 44-dimensional centre block + +This finite exact certificate answers Open next question 2 of +[PR #7062](https://github.com/CrocSwap/integer-mult-bounds/pull/7062), +at `d2d59844d7a1f3f739d7add8eeec0d740a3aeca8`. On sign character 7 of +sector `c=3`, the `(u,v)=(+1,+1)` space has characteristic polynomial + +```text +x^10 (x^2 - 36) (x^2 - 4)^5 + (x^3 - 12x + 8)^2 (x^3 - 12x - 8)^2 P_+(x) P_-(x) + +P_±(x) = x^5 ± 4x^4 - 60x^3 ∓ 176x^2 + 640x ± 768. +``` + +This is the monic polynomial of `A_3` on the specified block. The two +cubic factors and two quintic factors are given as a product identity. +The multiplicities of 0, 2, −2, 6 and −6 are 10, 5, 5, 1 and 1. + +## Certificate + +Use the historical eight-by-112 query in [SOURCES.json](SOURCES.json). +Write `r_q` for its column at the nine-bit address label `q`. On a basis +vector with query coordinate `i` and address `a`, the term of `4 A_3` at +`q` multiplies by `r_q r_q^T` on the query coordinate. On the address +it applies `a → a XOR q` if the binary dot product `q·3` is one, +and multiplies by `(-1)^(q·a)` otherwise. The operator definition and +Bell identity come from the retained centre-query work. + +Use the four sign flips at odd coordinates 1, 3, 5 and 7. The prescribed +eigenvalues for character 7 are `−1, −1, −1, +1`. The other generators +are `u = (0 2)(4 6)` with minus signs on 0 and 2, and +`v = (0 4)(2 6)` with minus signs on 0 and 4. Both have prescribed +eigenvalue `+1`. Each signed coordinate action induces an address action +by its action on the projective query columns. The verifier derives the +unique linear extension from the spanning port labels, checks it at all +112 labels, and checks that it is orthogonal and fixes sector 3. +It checks that the six signed actions commute and square to the identity. + +Multiplying each generator by its prescribed sign turns the equations into +fixed-vector equations. For every address-coordinate orbit, start at the +least index and give it coefficient +1. The 64 subset products of the six +generators force every other coefficient in the orbit. If two products +force opposite coefficients at one index, the whole orbit is zero over +`Q`. Otherwise the signed orbit vector spans the solutions on that orbit. +Disjoint supports make these vectors independent. This accounts for all +4,096 ambient indices. The checker finds 44 surviving orbits, each of +support eight, and 508 discarded orbits. + +Apply the Bell formula to each surviving vector and read the resulting +coordinates at the 44 least indices. Reconstruct each image from these +coordinates and compare all 4,096 entries. The 180,224 exact coefficient +comparisons establish the restriction, including its vanishing outside the +basis supports. The compressed integer matrix `M` represents `4 A_3`. +Faddeev–LeVerrier computes its characteristic coefficients by repeated exact +matrix multiplication and trace division. The verifier compares every +coefficient with the displayed product after scaling coefficient number +`j` by `4^j`. It also checks the zero Cayley–Hamilton residual and +rejects a sector-1 substitution for the same basis. + +The verifier emits the coefficients in descending order and a generated +hash-bound receipt. SHA256 of the compact JSON matrix is +`b8996e800aec3655bc44e962f8271e33c8188c4b5e99c7fe6167a4376cfc2617`. +The scientific replay uses the Python standard library and writes nothing. + +## Reproduce + +Run from the repository root. Substitute a local CPython 3.12 executable +for the absolute path on another machine. + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/c3-weight3-plus-plus-charpoly/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/c3-weight3-plus-plus-charpoly/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/c3-weight3-plus-plus-charpoly +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/c3-weight3-plus-plus-charpoly --check-source-history +``` + +Expected scientific marker is `PASS_C3_WEIGHT3_PLUS_PLUS_CHARPOLY`. +The metadata and committed-byte commands need Git history. The direct +verifier needs the pinned query at its declared relative path. + +## Scope and credit + +This contribution was produced by Nick Petalas. Credit unpaidmoon for +[PR #7062](https://github.com/CrocSwap/integer-mult-bounds/pull/7062)'s +explicit question and its adjacent 12-dimensional result, and +[PR #6965](https://github.com/CrocSwap/integer-mult-bounds/pull/6965)'s +choice of sign character and joint involutions. JoyboyBrian supplied the +sign-character handoff. Ali Romman's PRs #4958 and #4720 supply the query +and Bell action. Krzysztof Wojt's one-slot annihilator and the doubled +representation from #1719 retain their original credit. Signed-orbit +bases and the trace recurrence are standard. New work is Apache-2.0. + +The formal-interface-lemma card is scoped here to one historical finite +spectral calculation. The selected source-binding orientation passed at +`e54523517d0f03e58352e647c403a5af3e525a57`. The result has no new κ or +supplier admission. The other sectors, larger tensor widths, native caller +costs and the full multiplication theorem remain outside this calculation. +No predecessor scientific verifier, selected cold replay, Lean or Docker +was run. Independent human and formal proof-kernel review are unclaimed. + +The verifier's finite sizes are fixed by the authenticated query, 64 subset +products per orbit, the 4,096-index ambient action and the 44-dimensional +restriction. It is iterative and uses explicit checks under optimized +Python. Managed Python allocates containers and exact integers during +replay. The fixed dimensions bound the number of live entries. + +## Open next questions + +Does one signed coordinate symmetry transport this 44-dimensional block to +each of the three other weight-3 `(+1,+1)` blocks? First test the induced +action of the sector stabilizer on the character and the two involutions. +The present certificate imposes character 7 only, and the dimensions alone +do not imply equal polynomials. diff --git a/research/c3-weight3-plus-plus-charpoly/SOURCES.json b/research/c3-weight3-plus-plus-charpoly/SOURCES.json new file mode 100644 index 0000000000..963d085f6f --- /dev/null +++ b/research/c3-weight3-plus-plus-charpoly/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/centre-polynomial-cache-limits/frozen/work/centre-encoding-campaign-20261014/lanes/circuit-interface/INTERFACE.json", + "usage": "input", + "git_blob": "4201e9a04c12273b919e2cae60a6b6482c8150f3", + "sha256": "5c6c51fbffc07a683e922f17532fd90262ae9e23cc3560a696002073dd234ef3" + }, + { + "path": "research/c3-centre-sign-split/PROOF.md", + "usage": "provenance", + "git_blob": "8da44a79e0e3f7d3cfcd7ebb8c46cc46146a9869", + "sha256": "6d9446760eb90201b96a73c78a04fdc0320c0c3973dc9d96f05a7fd135a45558" + } + ] +} diff --git a/research/c3-weight3-plus-plus-charpoly/TASK.json b/research/c3-weight3-plus-plus-charpoly/TASK.json new file mode 100644 index 0000000000..31b395c984 --- /dev/null +++ b/research/c3-weight3-plus-plus-charpoly/TASK.json @@ -0,0 +1,107 @@ +{ + "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 characteristic polynomial of A_3 on the 44-dimensional (+1,+1) joint space in weight-3 character 7.", + "scope_change_reason": "Open next question 2 of PR7062 specifies a finite polynomial on a historical doubled centre block.", + "bottleneck_link": "Algebraic side result about the historical centre decoder. There is no new caller or recursive invoice.", + "budget_minutes": 60, + "stop_rule": "Stop after verifying the polynomial on the named joint space.", + "outcome": "completed", + "evidence": "44 signed orbit vectors with support 8 each, 180224 exact ambient coefficient comparisons, the monic degree-44 polynomial, and a rejecting sector-1 substitution.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Does a signed coordinate symmetry transport the 44-dimensional block to each other weight-3 (+1,+1) block?", + "why_it_matters": "An intertwiner would transfer the polynomial without a new determinant.", + "first_step": "Test the stabilizer action on character 7 and on the two joint involutions.", + "blocked_by": "The current certificate imposes only character 7." + } + ], + "predecessors": [ + { + "pr": 7062, + "head": "d2d59844d7a1f3f739d7add8eeec0d740a3aeca8", + "role": "Open next question 2 and the adjacent 12-dimensional computation." + }, + { + "pr": 6965, + "head": "8647094c8c6a65bc6d0211e4a16f1a1c69ce0b07", + "role": "Sign-character and joint-space definitions." + } + ] +} diff --git a/research/c3-weight3-plus-plus-charpoly/VERIFY.json b/research/c3-weight3-plus-plus-charpoly/VERIFY.json new file mode 100644 index 0000000000..697b48a4c1 --- /dev/null +++ b/research/c3-weight3-plus-plus-charpoly/VERIFY.json @@ -0,0 +1,36 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [ + "research/centre-polynomial-cache-limits/frozen/work/centre-encoding-campaign-20261014/lanes/circuit-interface/INTERFACE.json" + ], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Rebuild the 44-dimensional block and exact characteristic polynomial, then reject substitution of sector 1." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Rebuild the 44-dimensional block and exact characteristic polynomial, then reject substitution of sector 1." + } + ] +} diff --git a/research/c3-weight3-plus-plus-charpoly/verify.py b/research/c3-weight3-plus-plus-charpoly/verify.py new file mode 100644 index 0000000000..41ac128600 --- /dev/null +++ b/research/c3-weight3-plus-plus-charpoly/verify.py @@ -0,0 +1,240 @@ +#!/usr/bin/env python3 +"""Exact spectral certificate for one joint space in centre sector 3.""" + +from hashlib import sha256 +from itertools import combinations +import json +from pathlib import Path + +WIDTH = 512 +DIMENSION = 8 * WIDTH +QUERY = Path( + "research/centre-polynomial-cache-limits/frozen/work/" + "centre-encoding-campaign-20261014/lanes/circuit-interface/INTERFACE.json" +) +QUERY_HASH = "5c6c51fbffc07a683e922f17532fd90262ae9e23cc3560a696002073dd234ef3" + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def parity(bits): + return bits.bit_count() % 2 + + +def load_query(root): + raw = (root / QUERY).read_bytes() + require(sha256(raw).hexdigest() == QUERY_HASH, "unexpected query bytes") + record = json.loads(raw) + rows, ports = record["R"], record["ports"] + require(len(rows) == 8 and len(set(ports)) == len(ports) == 112, "query shape") + require(all(0 < port < WIDTH and parity(port) for port in ports), "query labels") + columns = tuple(tuple(int(row.get(str(i), 0)) for row in rows) for i in range(112)) + return tuple(zip(ports, columns, strict=True)) + + +def projective(column): + first = next((value for value in column if value), 0) + require(first in (-1, 1), "invalid projective column") + return tuple(first * value for value in column) + + +def address_action(query, permutation, signs): + lookup = {projective(column): port for port, column in query} + require(len(lookup) == len(query), "duplicate projective column") + span = {0: 0} + for port, column in query: + signed = projective(tuple(signs[i] * column[permutation[i]] for i in range(8))) + require(signed in lookup, "missing signed column") + image = lookup[signed] + if port in span: + require(span[port] == image, "port action is not linear") + else: + span.update({key ^ port: value ^ image for key, value in span.items()}) + require(len(span) == WIDTH and span[3] == 3, "action does not fix sector 3") + require(len(set(span.values())) == WIDTH, "noninvertible address action") + for first in range(9): + for second in range(9): + image_dot = parity(span[1 << first] & span[1 << second]) + require(image_dot == (first == second), "nonorthogonal address action") + return tuple(span[address] for address in range(WIDTH)) + + +def generators(query): + identity = tuple(range(8)) + specs = [(identity, 1 << digit, -1 if digit != 7 else 1) for digit in (1, 3, 5, 7)] + specs += [((2, 1, 0, 3, 6, 5, 4, 7), 5, 1), ((4, 1, 6, 3, 0, 5, 2, 7), 17, 1)] + actions = [] + for permutation, mask, eigenvalue in specs: + signs = tuple((-1) ** ((mask >> i) & 1) for i in range(8)) + addresses = address_action(query, permutation, signs) + destinations = tuple(permutation[i] * WIDTH + a for i in range(8) for a in addresses) + weights = tuple(eigenvalue * signs[i] for i in range(8) for _ in range(WIDTH)) + actions.append(tuple(zip(destinations, weights, strict=True))) + return tuple(actions) + + +def check_generators(actions): + for action in actions: + for index, (image, sign) in enumerate(action): + require(action[image] == (index, sign), "generator is not an involution") + for left, right in combinations(actions, 2): + for (i, left_sign), (j, right_sign) in zip(left, right, strict=True): + left_right, sign_j = left[j] + right_left, sign_i = right[i] + require( + (left_right, sign_j * right_sign) == (right_left, sign_i * left_sign), + "generators do not commute", + ) + + +def orbit_basis(actions): + seen = set() + basis = [] + discarded = 0 + for seed in range(DIMENSION): + if seed in seen: + continue + orbit = [(seed, 1)] + for action in actions: + orbit += [(action[index][0], value * action[index][1]) for index, value in orbit] + values = dict(orbit) + require(not seen.intersection(values) and min(values) == seed, "bad orbit partition") + seen.update(values) + if any(values[index] != value for index, value in orbit): + discarded += 1 + continue + for action in actions: + for index, value in values.items(): + destination, sign = action[index] + require(values.get(destination) == sign * value, "basis violates an equation") + basis.append(values) + require(len(seen) == DIMENSION, "incomplete orbit partition") + return tuple(basis), discarded + + +def bell_image(query, vector, sector=3): + image = [0] * DIMENSION + coordinates = tuple((divmod(index, WIDTH), weight) for index, weight in vector.items()) + for port, column in query: + translation = parity(port & sector) + support = tuple((i, scalar) for i, scalar in enumerate(column) if scalar) + for (i, address), weight in coordinates: + if translation: + target_address = address ^ port + sign = 1 + else: + target_address = address + sign = (-1) ** parity(port & address) + coefficient = sign * column[i] * weight + for j, entry in support: + image[j * WIDTH + target_address] += coefficient * entry + return image + + +def restriction(query, basis, sector=3): + roots = tuple(min(vector) for vector in basis) + columns = [] + for vector in basis: + image = bell_image(query, vector, sector) + coordinates = tuple(image[root] for root in roots) + reconstructed = [0] * DIMENSION + for value, basis_vector in zip(coordinates, basis, strict=True): + for index, weight in basis_vector.items(): + reconstructed[index] = value * weight + require(image == reconstructed, "Bell image leaves the joint space") + columns.append(coordinates) + return tuple(zip(*columns, strict=True)) + + +def charpoly(matrix): + """Faddeev-LeVerrier, descending coefficients of det(xI - matrix).""" + size = len(matrix) + residual = [[int(i == j) for j in range(size)] for i in range(size)] + coefficients = [1] + for degree in range(1, size + 1): + columns = tuple(zip(*residual, strict=True)) + residual = [ + [sum(a * b for a, b in zip(row, col, strict=True)) for col in columns] + for row in matrix + ] + coefficient, remainder = divmod(-sum(residual[i][i] for i in range(size)), degree) + require(remainder == 0, "characteristic coefficient is not integral") + coefficients.append(coefficient) + for i in range(size): + residual[i][i] += coefficient + require(all(not any(row) for row in residual), "Cayley-Hamilton residual") + return coefficients + + +def multiply(left, right): + product = [0] * (len(left) + len(right) - 1) + for i, a in enumerate(left): + for j, b in enumerate(right): + product[i + j] += a * b + return product + + +def claimed_polynomial(): + # Descending coefficients for A_3. The matrix represents 4 A_3. + factors = ( + (1,) + (0,) * 10, + (1, 0, -36), + *((1, 0, -4),) * 5, + *((1, 0, -12, 8),) * 2, + *((1, 0, -12, -8),) * 2, + (1, 4, -60, -176, 640, 768), + (1, -4, -60, 176, 640, -768), + ) + polynomial = [1] + for factor in factors: + polynomial = multiply(polynomial, factor) + return polynomial + + +def wrong_sector_control(query, basis): + try: + restriction(query, basis, sector=1) + except ValueError as error: + require(str(error) == "Bell image leaves the joint space", "wrong failure") + else: + raise ValueError("sector-1 substitution should fail") + + +def main(): + package = Path(__file__).resolve().parent + root = package.parents[1] + query = load_query(root) + actions = generators(query) + check_generators(actions) + basis, discarded = orbit_basis(actions) + require(len(basis) == 44 and all(len(vec) == 8 for vec in basis), "wrong basis") + matrix = restriction(query, basis) + coefficients = claimed_polynomial() + scaled = [coefficient * 4**degree for degree, coefficient in enumerate(coefficients)] + require(charpoly(matrix) == scaled, "characteristic polynomial differs") + wrong_sector_control(query, basis) + result = { + "status": "PASS_C3_WEIGHT3_PLUS_PLUS_CHARPOLY", + "ambient_addresses": DIMENSION, + "basis_vectors": len(basis), + "discarded_orbits": discarded, + "basis_support": len(basis[0]), + "full_coefficients_checked": len(basis) * DIMENSION, + "charpoly_A3_descending": coefficients, + "charpoly_4A3_descending": scaled, + "matrix_sha256": sha256(json.dumps(matrix, separators=(",", ":")).encode()).hexdigest(), + "wrong_sector_rejected": True, + "package_sha256": { + name: sha256((package / name).read_bytes()).hexdigest() + for name in ("README.md", "SOURCES.json", "TASK.json", "VERIFY.json", "verify.py") + }, + "query_sha256": QUERY_HASH, + } + print(json.dumps(result, indent=2)) + + +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")