From c5de3d6b23c229d5106ef7e12c81ba65fd7cdfe8 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 11 Nov 2026 21:42:03 +0000 Subject: [PATCH 1/2] feat(research): price an exact three-term Gram design on A_3 The Gram-class price model of p104-duality-ceiling-flag-note leaves A_3 outside its scope. Write an exact three-term design with total price 8, compare it with the natural dual-basis design at 9, and enumerate the 1812 three-term designs over the 14 canonical equality patterns. --- .../gram-class-a3-three-term-design/PROOF.md | 101 ++++++++ .../gram-class-a3-three-term-design/README.md | 99 ++++++++ .../SOURCES.json | 30 +++ .../gram-class-a3-three-term-design/TASK.json | 86 +++++++ .../VERIFY.json | 34 +++ .../gram-class-a3-three-term-design/verify.py | 233 ++++++++++++++++++ 6 files changed, 583 insertions(+) create mode 100644 research/gram-class-a3-three-term-design/PROOF.md create mode 100644 research/gram-class-a3-three-term-design/README.md create mode 100644 research/gram-class-a3-three-term-design/SOURCES.json create mode 100644 research/gram-class-a3-three-term-design/TASK.json create mode 100644 research/gram-class-a3-three-term-design/VERIFY.json create mode 100644 research/gram-class-a3-three-term-design/verify.py diff --git a/research/gram-class-a3-three-term-design/PROOF.md b/research/gram-class-a3-three-term-design/PROOF.md new file mode 100644 index 0000000000..b6cb1d524d --- /dev/null +++ b/research/gram-class-a3-three-term-design/PROOF.md @@ -0,0 +1,101 @@ +# Proof note: an exact three-term Gram-class design on A_3 + +Model, quoted from DreamingOfClouds' `research/p104-duality-ceiling-flag-note` +(Theorem O, section 2, and the A_2 toy, section 4). Let `V = {x in Q^(n+1) : +sum_i x_i = 0}` and `Pi = I - J/(n+1)` the orthogonal projector onto V. The A_n +lines are the pairs `(i,j)`, `i < j`; the line `(i,j)` is orthogonal to `x` iff +`x_i = x_j`. The even-inner-product mask of the line set is `N = I`, so for +`u, w in V` the price of a term is + +```text +rho(u,w) = rank_F2 N[S_u, T_w] = |Sep(u) cap Sep(w)|, +Sep(x) = {(i,j) : x_i != x_j}. +``` + +A Gram-class design is a finite family `(u_k, w_k)` in `V x V` with +`sum_k u_k w_k^T = Pi`; its cost is `sum_k rho(u_k, w_k)`. This package fixes +n = 3: four coordinates, six lines, `Pi_4 = I - J/4`. Labels are [P] written +proof, [C] exact computation in `verify.py`. + +## 1. The written design [P+C] + +Set + +```text +u_1 = (0, 0, 1, -1) w_1 = (-1/2, 1/2, 1/2, -1/2) +u_2 = (0, 1, -1, 0) w_2 = ( 1/2, 1/2, -1/2, -1/2) +u_3 = (1, -1, 1, -1) w_3 = ( 3/4, -1/4, -1/4, -1/4) +``` + +Every coordinate vector has coordinate sum zero, so `u_k, w_k in V`, and +`sum_k u_k w_k^T = Pi_4` holds identically over the rationals [C]. The three +prices are 3, 3 and 2 [C]: + +| k | Sep(u_k) | Sep(w_k) | intersection | price | +|---|---|---|---|---| +| 1 | 5 pairs | 4 pairs | `(0,2),(0,3),(1,2),(1,3)` | 3 | +| 2 | 5 pairs | 4 pairs | `(0,2),(0,3),(1,2),(1,3)` | 3 | +| 3 | 4 pairs | 3 pairs | `(0,1),(0,3)` | 2 | + +Total cost 8. (The check recomputes the separations from the vectors; the table +is descriptive.) + +## 2. The natural dual-basis design costs 9 [P+C] + +Let `u_k = e_k - e_4` for `k = 1,2,3` and let `w_k` be the dual basis of V +with respect to the dot product, `w_k = e_k - (1/4) 1`. Then `u_k . w_l = +delta_kl` and `sum_k u_k w_k^T` is the orthogonal projector of V = col(U), so +the design is exact [C]. + +Price: `u_k` has entry 1 at k, -1 at 4 and 0 elsewhere, so `Sep(u_k)` is the +set of pairs meeting `{k,4}`, of size `2n-1 = 5`. `w_k` has entry `3/4` at k and +`-1/4` at the other three coordinates, so `Sep(w_k)` is the set of pairs meeting +`k`, of size `n = 3`. The pairs meeting both `k` and `{4}` are exactly the pairs +meeting `k`, so `rho(u_k,w_k) = 3` and the total cost is `3 * 3 = 9`. The same +count gives `n^2` for general n. Hence the written design of section 1 improves +the dual-basis design inside the same model by one unit. + +## 3. Every design has at least three terms [P] + +`Pi_4` has rank 3, and each term `u_k w_k^T` has rank at most 1. So a Gram-class +design needs at least three terms. No lower bound on the cost beyond +`cost >= number of terms >= 3` is claimed. + +## 4. The declared finite family [C] + +Take the primitive integer vectors in `[-3,3]^4` with coordinate sum zero and +positive first nonzero entry, and keep the lexicographically first vector of +each equality pattern. There are 14 patterns; the list is fixed by the check +(`candidate_vectors`). Enumerate all ordered triples, solve `Pi_4 = U W^T` for +`W` exactly (the solution is unique when `U` has full rank), and price the +result. Of the `14^3 = 2744` triples, 1812 have full-rank `U` and an exact +solution; every one of the 1812 has cost at least 8, and the written design of +section 1 is one of the minimisers [C]. + +Because the family keeps one representative per equality pattern, this is not a +search over all rational carriers. A design with different carriers in the same +pattern can have a different price, so the enumeration does not prove that 8 is +the Gram-class minimum. + +## 5. Rejection controls [C] + +The check requires that (i) adding 1/2 to one entry of `w_1` destroys the +projector identity, (ii) replacing `u_1` by the zero vector destroys it, and +(iii) the three `u_k` of the written design are linearly independent. It also +requires the dual-basis design to be exact at cost 9 and the A_2 control below +to be exact at cost 4, so a broken cost or identity check fails loudly. + +## 6. A_2 control [C] + +`u_1 = (0,1,-1)`, `w_1 = (1,0,-1)`, `u_2 = (1,-2,1)`, `w_2 = (2/3,-1/3,-1/3)` +give `sum_k u_k w_k^T = Pi_3` with prices 3 and 1, total 4. This reproduces the +A_2 Gram value reported by the predecessor's section 4; it is a control for this +package's price code and is not claimed as new. + +## Scope + +Nothing here is a lower bound over all Gram-class designs, a statement about +A_n for n >= 4, a kappa change, a physical word, or a supplier admission. The +exact A_3 minimum remains open. The model, definitions and A_2 value are the +predecessor's; this package adds the explicit A_3 design, the dual-basis price +comparison and the bounded enumeration. diff --git a/research/gram-class-a3-three-term-design/README.md b/research/gram-class-a3-three-term-design/README.md new file mode 100644 index 0000000000..4e9aa0ada7 --- /dev/null +++ b/research/gram-class-a3-three-term-design/README.md @@ -0,0 +1,99 @@ +# An exact three-term Gram-class design on the A_3 line system + +This contribution was produced by Nick Petalas. Apache-2.0. + +DreamingOfClouds' [P104 duality and Gram-floor note](../../research/p104-duality-ceiling-flag-note/README.md) +defines a Gram-class price model on line systems and shows at A_2 that the +naive transfer "Gram price at least the identity-decoder price" is false: the +Gram value there is 4 (section 4 of [THEOREM.md](../../research/p104-duality-ceiling-flag-note/THEOREM.md)). +That note states A_4 and every n >= 3 as outside its scope. This package adds +the next explicit data point. + +**Result.** On the A_3 line system (four coordinates, six lines, mask N = I) +there is an exact three-term Gram-class design + +```text +u_1 = (0, 0, 1, -1) w_1 = (-1/2, 1/2, 1/2, -1/2) +u_2 = (0, 1, -1, 0) w_2 = ( 1/2, 1/2, -1/2, -1/2) +u_3 = (1, -1, 1, -1) w_3 = ( 3/4, -1/4, -1/4, -1/4) +``` + +with `sum_k u_k w_k^T = Pi_4 = I - J/4` over the rationals and term prices +**3, 3, 2**, for a total price **8**. The natural dual-basis design of the same +shape, `u_k = e_k - e_4` with `w_k = e_k - (1/4) 1`, is exact and costs +**3 + 3 + 3 = 9**, so the written design is strictly cheaper inside the same +model. + +The declared finite family of three-term designs whose carriers are the 14 +canonical representatives of the equality patterns on four coordinates (1812 +full-rank triples) has minimum price **8**, attained by the written design. This +is a bounded enumeration, not a lower bound over all designs. + +Claim type: exact finite certificate (a written design with exact rational +identity and prices) plus a bounded exhaustive enumeration of a declared finite +family. **Not** claimed: the exact minimum over all Gram-class designs, any +lower bound beyond the trivial three terms forced by rank, a new kappa, or a +supplier admission. + +## Why the price rule is the predecessor's + +For the A_n line system the even-inner-product mask is `N = I`, so the F2 +mask-rank price of a term collapses to the number of lines on which both +carriers are non-constant. See section 4 of the predecessor's `THEOREM.md`, +which fixes this rule and the A_2 example; this package uses that rule only and +does not re-check the predecessor's proofs. The A_2 value 4 is reproduced here +as a control, not claimed as new. + +## Reproduction + +From the repository root, using CPython 3.12 and the standard library: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/gram-class-a3-three-term-design/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -O -B research/gram-class-a3-three-term-design/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/gram-class-a3-three-term-design +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/gram-class-a3-three-term-design --check-source-history +``` + +The verifier checks the written identity over the rationals, the three term +prices, the dual-basis comparison, the A_2 control, the 1812-design enumeration +and three rejection controls. It prints a JSON receipt bound to the package +file hashes. + +## Limitations + +The enumeration is over one canonical representative per equality pattern, not +over all rational carriers. The exact Gram-class minimum on A_3 is therefore +open; 8 is an upper bound. The model is the scalar Gram price model with the +F2 mask-rank rule and says nothing about a physical word, caller, compiler, +native implementation, precision or restoration. No kappa changes. + +## Open next questions + +1. What is the exact Gram-class minimum on A_3? A lower-bound technique must + handle arbitrary rational carriers, not equality patterns. Start with the + four-term case, where the W factor has a one-parameter freedom + `W = W_0 + q r^T`; a useful first step is an exhaustive price-multiset case + analysis for totals below 8. Blocked by: no continuous lower-bound argument + is known for this cost. +2. Is the A_n Gram-class cost `n^2` for every n, or does the A_3 value 8 + (against the dual-basis 9) start a systematic `n^2 - 1` family? Start by + generalising the written pattern to n >= 4 and pricing it. Blocked by: the + general pattern is not constructed. +3. Does the A_2 gap (Gram 4 against identity decoder 3) persist for some + n >= 3, and at which n does a Gram design match the identity decoder? Start + with n = 3 and the identity decoder cost 4. Blocked by: question 1. + +## Related open work + +No open PR is known to study the A_n Gram-class cost for n >= 3. The +predecessor's package is merged with its own A_4 note left open; this package +does not audit it. + +## Credit + +The model, the A_2 value 4 and the F2 mask-rank price rule are +DreamingOfClouds' (`research/p104-duality-ceiling-flag-note`). The A_2 control +reproduces their number. The explicit A_3 design, the dual-basis price +comparison and the bounded enumeration are new. Independent human or formal +review is unclaimed. diff --git a/research/gram-class-a3-three-term-design/SOURCES.json b/research/gram-class-a3-three-term-design/SOURCES.json new file mode 100644 index 0000000000..3f446a69bf --- /dev/null +++ b/research/gram-class-a3-three-term-design/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/p104-duality-ceiling-flag-note/THEOREM.md", + "usage": "provenance", + "git_blob": "90d1e224b6a4183a2d0004e3d11af8da4d5e5433", + "sha256": "720b9b803d07e5217f5ca6b5511ec2727a74413034773ccab587cf20777a67dc" + }, + { + "path": "research/p104-duality-ceiling-flag-note/README.md", + "usage": "provenance", + "git_blob": "d5fe91d99174118343bd23651690dd301c8e991a", + "sha256": "79f37525b4e765eb2c1a685fcf7aba0494c59f783b9ab3fd507800e03c3060bf" + } + ] +} diff --git a/research/gram-class-a3-three-term-design/TASK.json b/research/gram-class-a3-three-term-design/TASK.json new file mode 100644 index 0000000000..63ac02d8fc --- /dev/null +++ b/research/gram-class-a3-three-term-design/TASK.json @@ -0,0 +1,86 @@ +{ + "schema_version": 1, + "task_id": "complex-new-helper-inventory", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "complex-new-helper-inventory", + "question": "Can a changed helper inventory earn productive credit that survives completion, compilation and the actual caller?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "A source-bound arbitrary-input identity and legal producer/consumer boundary with the complete paid and productive target invoice, including restoration, ownership, native alignment and extra charges. Price under the actual current model; historical ceiling.py assumptions must be established before use. A favorable optimistic relaxation keeps a route open but is not a completed supplier. A scoped local result remains useful; expansion requires the family-level budget gate.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Specify all arbitrary inputs, owned fields, restored outputs and a physically legal consumer. Compare complete P and T, including target debits and precision/stock costs. #5599 is a positive control for target refinement, not permission to split every helper for free. #5614 is a hypothetical compiler budget, not an emitted 145-split word. Stop at the first unpaid boundary or a failing optimistic full bill.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "productive helper", + "target refinement", + "5599", + "5614" + ], + "existing_checks": [ + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Explicit exact three-term Gram-class design on the A_3 line system of the p104-duality-ceiling-flag-note Gram model, its price 8 against the natural dual-basis design price 9, and a bounded enumeration of the 1812 three-term designs over the 14 canonical equality-pattern representatives (minimum 8).", + "scope_change_reason": "The card asks for a changed helper inventory with a complete signed bill. This package answers the small grammatical sub-question that the cited Gram model leaves open at A_3: the predecessor note states A_4 and every n >= 3 as outside its scope. It supplies an explicit design and a price comparison in that model, not a supplier, caller or kappa claim.", + "bottleneck_link": "Side result: it tests the F2 mask-rank price rule used for the P104 Gram-class floors on the next line system after the A_2 counterexample. It does not move the binding complex or BIT budget.", + "budget_minutes": 60, + "stop_rule": "Stop after one exact design and one declared finite enumeration; no lower bound over all carriers, no physical word, no kappa.", + "outcome": "partial", + "evidence": "README.md and PROOF.md give the model, the identity and the price count. verify.py checks the rational identity, prices 3/3/2, the dual-basis cost 9, the A_2 control 4, all 1812 enumerated designs and three rejection controls; it prints a hash-bound receipt.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "What is the exact Gram-class minimum on A_3?", + "why_it_matters": "8 is only an upper bound; the exact value decides whether the A_2 gap widens at the next line system.", + "first_step": "Run the price-multiset case analysis for totals below 8, beginning with the four-term designs where W = W_0 + q r^T has one free direction.", + "blocked_by": "No continuous lower-bound argument is known for this cost; equality patterns do not determine prices." + }, + { + "question": "Is the A_n Gram-class cost n^2 for every n, or does A_3 start an n^2 - 1 family?", + "why_it_matters": "A general formula would settle the A_n side of the Gram-class model rather than one case.", + "first_step": "Generalise the written three-term pattern to n >= 4 and price it; compare with the dual-basis n^2.", + "blocked_by": "The general pattern is not constructed." + }, + { + "question": "Does the A_2 gap (Gram 4 against identity decoder 3) persist for some n >= 3?", + "why_it_matters": "This decides whether the A_2 toy is an anomaly or the start of a systematic failure of the naive transfer.", + "first_step": "Compare the identity decoder cost n+1 with the best explicit Gram design at n = 3 and n = 4.", + "blocked_by": "Depends on the exact A_3 minimum above." + } + ] +} diff --git a/research/gram-class-a3-three-term-design/VERIFY.json b/research/gram-class-a3-three-term-design/VERIFY.json new file mode 100644 index 0000000000..b735e35f1f --- /dev/null +++ b/research/gram-class-a3-three-term-design/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": 300, + "checks": "Exact rational A_3 design identity and prices, dual-basis cost 9, A_2 control 4, 1812-design enumeration, rejection controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 300, + "checks": "The same exact checks under optimized Python with assertions active." + } + ] +} diff --git a/research/gram-class-a3-three-term-design/verify.py b/research/gram-class-a3-three-term-design/verify.py new file mode 100644 index 0000000000..a26cb76354 --- /dev/null +++ b/research/gram-class-a3-three-term-design/verify.py @@ -0,0 +1,233 @@ +"""Exact three-term Gram-class design on the A_3 line system. + +Model (the price rule of DreamingOfClouds' p104-duality-ceiling-flag-note, +section 4, specialised to A_n): + V = {x in Q^(n+1) : sum_i x_i = 0}, Pi = I - J/(n+1) the orthogonal + projector onto V. The A_n lines are the pairs (i,j), i < j; the line (i,j) + is orthogonal to x iff x_i = x_j, and the even-inner-product mask is N = I, + so a term (u,w) with u,w in V has price rank_F2 N[S,T] = |S cap T| where + Sep(x) = {(i,j) : x_i != x_j}. A Gram-class design is Pi = sum_k u_k w_k^T. + +This verifier checks, exactly over the rationals: + 1. the written three-term A_3 design sums to Pi_4; + 2. its three prices are 3, 3, 2, total 8; + 3. the natural dual-basis A_3 design sums to Pi_4 and costs 15; + 4. a two-term A_2 design sums to Pi_3 and costs 4 (the predecessor's value, + reproduced as a control, not claimed as new); + 5. exhaustive enumeration of the declared finite family: every three-term + design whose U columns are the canonical primitive representatives of the + 14 distinct equality patterns with entries in [-3,3] (1812 designs total) + has cost at least 8, and the written design is one of the minimisers. +Rejection controls: perturbing one design entry breaks the projector identity, +and a zero carrier does not produce a design. +""" + +import hashlib +import json +import sys +from fractions import Fraction +from itertools import product +from pathlib import Path + +N3 = 4 # A_3 has 4 coordinates and 6 lines + + +def projector(n): + return [[Fraction(int(i == j)) - Fraction(1, n) for j in range(n)] + for i in range(n)] + + +def seps(x): + n = len(x) + return frozenset((i, j) for i in range(n) for j in range(i + 1, n) + if x[i] != x[j]) + + +def price(u, w): + return len(seps(u) & seps(w)) + + +def design_matrix(terms, n): + return [[sum(u[i] * w[j] for u, w in terms) for j in range(n)] + for i in range(n)] + + +def same(a, b): + return all(a[i][j] == b[i][j] for i in range(len(a)) for j in range(len(a))) + + +def require(ok, message): + if not ok: + raise SystemExit("FAIL: " + message) + + +def det(a): + n = len(a) + a = [[Fraction(x) for x in row] for row in a] + d = Fraction(1) + for c in range(n): + p = next((r for r in range(c, n) if a[r][c] != 0), None) + if p is None: + return Fraction(0) + if p != c: + a[c], a[p] = a[p], a[c] + d = -d + d *= a[c][c] + pv = a[c][c] + for r in range(c + 1, n): + if a[r][c] != 0: + f = a[r][c] / pv + a[r] = [x - f * y for x, y in zip(a[r], a[c])] + return d + + +def inverse(a): + n = len(a) + m = [[Fraction(x) for x in row] + [Fraction(int(i == j)) for j in range(n)] + for i, row in enumerate(a)] + for c in range(n): + p = next(r for r in range(c, n) if m[r][c] != 0) + m[c], m[p] = m[p], m[c] + pv = m[c][c] + m[c] = [x / pv for x in m[c]] + for r in range(n): + if r != c and m[r][c] != 0: + f = m[r][c] + m[r] = [x - f * y for x, y in zip(m[r], m[c])] + return [row[n:] for row in m] + + +def solve_design(combo): + """Return the unique W with Pi = U W^T for an N x m full-rank U.""" + n = N3 + m = len(combo) + u = [[Fraction(combo[k][i]) for k in range(m)] for i in range(n)] + pi = projector(n) + utu = [[sum(u[a][i] * u[a][j] for a in range(n)) for j in range(m)] + for i in range(m)] + if det(utu) == 0: + return None + inv = inverse(utu) + # W = Pi U (U^T U)^-1 + pu = [[sum(pi[i][a] * u[a][k] for a in range(n)) for k in range(m)] + for i in range(n)] + w = [[sum(pu[i][a] * inv[a][k] for a in range(m)) for k in range(m)] + for i in range(n)] + terms = [(combo[k], [w[i][k] for i in range(n)]) for k in range(m)] + if not same(design_matrix(terms, n), pi): + return None + return w + + +def candidate_vectors(n, bound): + """Canonical primitive representative of each equality pattern.""" + reps = {} + for v in product(range(-bound, bound + 1), repeat=n): + if sum(v) != 0 or all(x == 0 for x in v): + continue + g = 0 + for x in v: + g = __import__("math").gcd(g, abs(x)) + if g > 1: + continue + first = next(x for x in v if x != 0) + if first < 0: + continue + reps.setdefault(seps(v), tuple(v)) + return sorted(reps.values()) + + +def enumerate_family(bound=3): + vecs = candidate_vectors(N3, bound) + best = None + witness = None + designs = 0 + for combo in product(vecs, repeat=3): + w = solve_design(combo) + if w is None: + continue + designs += 1 + terms = [(combo[k], [w[i][k] for i in range(N3)]) for k in range(3)] + cost = sum(price(u, ww) for u, ww in terms) + if best is None or cost < best: + best, witness = cost, (combo, w) + return len(vecs), designs, best, witness + + +def main(): + check = {} + + # 1-2. The written A_3 design. + a3 = [ + ((Fraction(0), Fraction(0), Fraction(1), Fraction(-1)), + (Fraction(-1, 2), Fraction(1, 2), Fraction(1, 2), Fraction(-1, 2))), + ((Fraction(0), Fraction(1), Fraction(-1), Fraction(0)), + (Fraction(1, 2), Fraction(1, 2), Fraction(-1, 2), Fraction(-1, 2))), + ((Fraction(1), Fraction(-1), Fraction(1), Fraction(-1)), + (Fraction(3, 4), Fraction(-1, 4), Fraction(-1, 4), Fraction(-1, 4))), + ] + pi4 = projector(4) + require(same(design_matrix(a3, 4), pi4), "A_3 design does not sum to Pi_4") + prices = [price(u, w) for u, w in a3] + require(prices == [3, 3, 2], "A_3 prices changed: %r" % (prices,)) + require(sum(prices) == 8, "A_3 total price is not 8") + check["a3_design"] = {"prices": prices, "total": sum(prices)} + + # 3. The natural dual-basis design u_k = e_k - e_4, w_k the dual basis. + dual = [] + for k in range(3): + u = [Fraction(int(i == k)) - Fraction(int(i == 3)) for i in range(4)] + w = [Fraction(int(i == k)) - Fraction(1, 4) for i in range(4)] + dual.append((tuple(u), tuple(w))) + require(same(design_matrix(dual, 4), pi4), "dual-basis design is not exact") + dual_prices = [price(u, w) for u, w in dual] + require(dual_prices == [3, 3, 3], "dual-basis prices changed: %r" % (dual_prices,)) + check["dual_basis"] = {"prices": dual_prices, "total": sum(dual_prices)} + require(sum(prices) < sum(dual_prices), "written design does not improve 9") + + # 4. A_2 control: the predecessor's Gram value 4, reproduced. + a2 = [ + ((Fraction(0), Fraction(1), Fraction(-1)), + (Fraction(1), Fraction(0), Fraction(-1))), + ((Fraction(1), Fraction(-2), Fraction(1)), + (Fraction(2, 3), Fraction(-1, 3), Fraction(-1, 3))), + ] + require(same(design_matrix(a2, 3), projector(3)), "A_2 control is not exact") + a2_prices = [price(u, w) for u, w in a2] + require(sum(a2_prices) == 4, "A_2 control is not 4: %r" % (a2_prices,)) + check["a2_control"] = {"prices": a2_prices, "total": sum(a2_prices)} + + # 5. Declared finite family. + nvec, designs, best, witness = enumerate_family(3) + require(nvec == 14, "candidate patterns changed: %d" % nvec) + require(designs == 1812, "design count changed: %d" % designs) + require(best == 8, "finite-family minimum changed: %r" % (best,)) + check["family"] = {"patterns": nvec, "designs": designs, "minimum": best} + wu, ww = witness + require([price(wu[k], [ww[i][k] for i in range(4)]) for k in range(3)] + == [3, 3, 2], "family minimiser prices changed") + + # Rejection controls. + bad = [list(t) for t in a3] + bad[0] = (bad[0][0], (bad[0][1][0] + Fraction(1, 2),) + bad[0][1][1:]) + require(not same(design_matrix(bad, 4), pi4), + "perturbed design still equals the projector") + zero = [(tuple([Fraction(0)] * 4), a3[0][1])] + a3[1:] + require(not same(design_matrix(zero, 4), pi4), + "zero-carrier control still equals the projector") + require(det([[Fraction(x) for x in v] for v in (a3[0][0], a3[1][0], a3[2][0])]) != 0, + "written U is not full rank") + check["controls"] = ["perturbed_entry", "zero_carrier", "u_full_rank"] + + package = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "SOURCES.json", "TASK.json", "VERIFY.json", + "verify.py") + hashes = {name: hashlib.sha256((package / name).read_bytes()).hexdigest() + for name in names} + receipt = {"status": "PASS_GRAM_CLASS_A3_THREE_TERM_DESIGN", "checks": check, + "sources_sha256": hashes} + print(json.dumps(receipt, sort_keys=True)) + + +if __name__ == "__main__": + main() From 2c67b21e0a1bba858ad1880fd53f5cab540f3f6d Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:46:50 +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")