From fd4f5e506977527983c96871ee912ee55a31d81c Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 11 Nov 2026 11:32:41 +0000 Subject: [PATCH 1/2] feat(research): prove fixed-basis idle coalescing obstruction --- research/fixed-basis-idle-coalescing/PROOF.md | 104 +++++++++++ .../fixed-basis-idle-coalescing/README.md | 127 +++++++++++++ .../fixed-basis-idle-coalescing/SOURCES.json | 30 +++ .../fixed-basis-idle-coalescing/TASK.json | 90 +++++++++ .../fixed-basis-idle-coalescing/VERIFY.json | 34 ++++ .../fixed-basis-idle-coalescing/verify.py | 176 ++++++++++++++++++ 6 files changed, 561 insertions(+) create mode 100644 research/fixed-basis-idle-coalescing/PROOF.md create mode 100644 research/fixed-basis-idle-coalescing/README.md create mode 100644 research/fixed-basis-idle-coalescing/SOURCES.json create mode 100644 research/fixed-basis-idle-coalescing/TASK.json create mode 100644 research/fixed-basis-idle-coalescing/VERIFY.json create mode 100644 research/fixed-basis-idle-coalescing/verify.py diff --git a/research/fixed-basis-idle-coalescing/PROOF.md b/research/fixed-basis-idle-coalescing/PROOF.md new file mode 100644 index 0000000000..83d9c93164 --- /dev/null +++ b/research/fixed-basis-idle-coalescing/PROOF.md @@ -0,0 +1,104 @@ +# A fixed independent idle family reduces to coordinates + +## Contract + +Let F be any field, V=F^n with named coordinate basis e_1,...,e_n, +and let stages s=1,...,m have coordinate masks M_s contained in {1,...,n}. +Write U_s=span{e_i : i in M_s}. Fix integers 0<=q_s<=|M_s|. + +Choose one basis v_1,...,v_n of V for the entire schedule. A feasible +allocation chooses J_s contained in {1,...,n}, with |J_s|=q_s and +v_j in U_s for every j in J_s. Put I_j={s:j in J_s} and d_j=|I_j|. +Directions are independent globally, not merely separately at each stage. +A direction's scalar multiple represents the same line. No direction changes +between its uses. Choosing a different basis for a different allocation is +allowed. All basis setup, scalar mixing and transport costs are optimistically +zero. Eligibility uses only the output direction's support, so imposing +additional right-vector or physical restrictions can only shrink this model. + +The coordinate model is the special case v_j=e_j. Its schedules have exactly +q_s distinct idle coordinates in M_s at each stage. Neither model preserves +a prescribed HOST action or imposes chronological barriers on coalescing. + +## Theorem + +For every feasible fixed-basis allocation there is a coordinate allocation +and a permutation pi of {1,...,n} with + + I'_{pi(j)} = I_j for every j. + +In particular, the two models have exactly the same feasible multisets of +idle stage sets, and exactly the same feasible idle-degree multisets. +They have the same minimum sum_j f(d_j) for every real-valued function +f on {0,...,m}. No concavity or monotonicity assumption is needed for +this equality. More generally any objective invariant under relabeling the +directions has the same attainable values in both models. + +The same reduction holds for a globally independent family of at most n +directions. Extend the family to a basis and give every added direction +the empty stage set. The permutation argument then applies to the original +family as an injection into the coordinate indices. + +## Proof + +Let B have columns v_j in the coordinate basis. Since det B is nonzero, +the determinant expansion has a nonzero summand. There is a permutation pi +such that B_{pi(j),j} is nonzero for every j. A nonzero sum must have a +nonzero summand over every field, including characteristic two. Thus pi(j) +belongs to the support of v_j. + +If j belongs to J_s, all coordinates in the support of v_j belong to M_s, +because v_j belongs to U_s. Hence pi(j) belongs to M_s. Set +J'_s={pi(j):j in J_s}. The permutation is injective, so |J'_s|=q_s, +and J'_s is contained in M_s. This is a feasible coordinate allocation. +Moreover pi(j) belongs to J'_s exactly when j belongs to J_s, proving +the equality of stage sets and of degrees. + +This constructs one inclusion of feasible multiset collections. The reverse +inclusion holds because the coordinate basis is itself an allowed fixed +basis. Objective equality follows by relabeling. All allocation domains are +finite at the stage-set level, even when F is infinite, so every nonempty +set of attainable objective values has a minimum. Coordinate feasibility +also follows directly from 0<=q_s<=|M_s|. This proves the theorem. + +The support-matching fact is classical. Equivalently, every subset of the +independent columns has support union of size at least its cardinality, +and Hall's marriage theorem supplies the injection. The new contribution +is the degree-preserving reduction for this idle-coalescing question. + +## Application to the connected eighteen-stage root + +CubeJerry's [#7002](https://github.com/CrocSwap/integer-mult-bounds/pull/7002) +defines a coordinate-role relaxation in +[IDLE-COALESCING.md](../connected-l18-root-caller/IDLE-COALESCING.md). +It optimistically allows any two eligible coordinates to be hosted at a stage, +leaves the other mask coordinates idle, and coalesces all occurrences of a +coordinate for free. Its costs depend on idle degrees alone. Set +q_s=|M_s|-2 in the theorem. + +Consequently, allowing an arbitrary fixed common basis, or a fixed globally +independent subset, cannot lower that relaxation's optimum. The predecessor's +stated coordinate optimum and fixed-profile failure therefore apply to this +larger subclass as a corollary. This is a new applicability step. The +predecessor's numerical optimum, transcendental bounds and complete invoice +are cited premises; this package does not recompute or certify them. + +The proof maps optimistic allocations, not physical operators. It need not +map the HOSTs or retain a source's original endpoint. This causes no gap in +the lower-bound use: every admitted fixed-basis allocation maps to a feasible +member of the already optimistic coordinate relaxation. A map in the other +direction with physical HOSTs would require a separate construction. + +## Boundary + +Three directions e_1,e_2,e_1+e_2 in F_2^2 are dependent and cannot receive +distinct coordinate anchors. The matching proof therefore cannot cover +arbitrary dependent families, even if every individual stage uses independent +directions. This observation does not prove that dependent directions save +cost. A basis that changes between stages, changing a direction's identity, +also falls outside the contract. No theorem about either extension is claimed. + +Noncoordinate common bases are thus insufficient on their own. A route +around this obstruction must change at least one premise, for example use +dependent directions across the complete schedule, rotate the basis, or +change masks, idle counts, native profile or the degree-only tariff. diff --git a/research/fixed-basis-idle-coalescing/README.md b/research/fixed-basis-idle-coalescing/README.md new file mode 100644 index 0000000000..955171372d --- /dev/null +++ b/research/fixed-basis-idle-coalescing/README.md @@ -0,0 +1,127 @@ +# Fixed common bases cannot improve idle coalescing + +This contribution is produced by Nick Petalas. Claim type: scoped written +proof with exact finite corroboration. No new kappa. + +For coordinate stage masks over every field, allowing one arbitrary fixed +common basis gives exactly the same feasible idle-degree multisets as the +coordinate basis. Match each basis vector to a distinct coordinate in its +support. Replacing its idle uses by that coordinate preserves every stage +and every degree. The result also covers fixed globally independent +subfamilies. [PROOF.md](PROOF.md) gives the contract and proof. + +This settles a subclass of the noncoordinate-direction gap in CubeJerry's +[#7002](https://github.com/CrocSwap/integer-mult-bounds/pull/7002). Its +coordinate-role idle-coalescing obstruction now applies to arbitrary fixed +common bases under the same degree-only tariff. The predecessor's coordinate +optimum and numerical shortfall are cited inputs, not replayed results. + +The equality holds for every common function of idle degree, including its +concave rank-power tariff. It does not require concavity. The theorem does +not cover dependent direction families, a basis that changes between stages, +changed masks or idle counts, or a changed native/caller contract. Those are +possible routes beyond the obstruction, rather than proved improvements. + +## Evidence and reproduction + +From the repository root, use standard-library CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/fixed-basis-idle-coalescing/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -O -B research/fixed-basis-idle-coalescing/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/fixed-basis-idle-coalescing +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/fixed-basis-idle-coalescing --check-source-history +``` + +Any CPython 3.12 interpreter may replace that absolute interpreter path. +The direct marker is `PASS_FIXED_BASIS_IDLE_COALESCING`; the runner also +reports `PASS_REGISTERED_RESEARCH_PACKAGE`. The verifier writes nothing. +Each execution emits a generated JSON receipt containing the exact census +counts and SHA256 hashes of all six package files. + +The checker enumerates 85,833 square matrices and checks 31,617 bases and +1,251,947 eligible stage/subset pairs. Its domains are F2 in dimensions one +through four and F3 in dimensions one through three. For each basis it compares +an augmenting-path matching with all supported permutations. It then tests +every coordinate mask and every eligible subset of directions. A separate +five-stage noncoordinate fixture checks the complete degree vector. Six +invalid input controls reject, and two boundary controls expose dependence +and the need to match within support. Explicit exceptions keep every check +active under optimized execution. The universal theorem comes from the +written determinant argument, not extrapolation from these finite domains. + +## Scope and provenance + +Base is canonical main `e54523517d0f03e58352e647c403a5af3e525a57`, priority +revision 8. The selected record still names conditional #7000. SOURCES.json +pins #7002's README and IDLE-COALESCING.md as historical mathematical context. +They are not executable inputs. The standalone verifier imports no predecessor +code or data and does not repeat a predecessor census or invoice check. +TASK.json declares a changed joint-query-controller scope, a local allocation +obstruction rather than a completed producer/consumer program. + +The card's first binding-only command passed. Live open PRs, active +Discussions, recent account contributions, local claims, merged searches and +all-main README searches were checked before the +[CLAIM](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19540656). +The cached overlap helper reports incomplete sparse-local coverage; absence +of a search hit is not a novelty certificate. The related open packages below +construct normalized schedules; this theorem concerns all fixed globally +independent families and imports neither schedule nor numerical comparison. + +Native implementation, HOST compatibility, paid basis changes, chronological +transport, dirty restoration, ordinary costs, precision/tape, stock, compiler, +supplier admission and the full multiplication theorem remain outside scope. +No numerical frontier, selected files or predecessor files are changed. The +selected cold replay, Lean, Docker, independent human review and formal proof +kernel are unrun. The application to #7002 uses its published coordinate +obstruction as a premise without independently validating that result. + +## Related open work + +- Rohan Arun's [#7098](https://github.com/CrocSwap/integer-mult-bounds/pull/7098) + constructs and prices a noncoordinate projector relocation for #7002. + This proof gives a fixed globally independent family obstruction, without + recomputing that schedule or its price. +- Rohan Arun's [#7106](https://github.com/CrocSwap/integer-mult-bounds/pull/7106) + extends the normalized projector scheduling work. Its construction enforces + compatibility on overlapping intervals. This theorem requires global + independence across the whole schedule, a stricter premise. No numerical + agreement or disagreement is claimed. + +## Open next questions + +- Can a globally dependent family of directions lower a fully specified idle + bill while each stage still has independent idle directions? Start with + three lines in a two-dimensional coordinate space and a short mask sequence. + A favorable allocation and the actual paid preparation/restoration are + missing. The matching theorem does not decide this case. +- Can changing the basis between stages improve a complete connected-root + caller after paying conversion and HOST compatibility costs? Start with + two explicit bases and one transition. No legal conversion or favorable + complete bill is supplied here. + +Structured relevance, first steps and blockers appear in TASK.json. + +## Credit and engineering + +Credit CubeJerry, Jerry Chen, #7002 for the connected-root question and +coordinate coalescing relaxation; DreamingOfClouds #6937 for the connected +mask lineage, and the retained #6936/#6912 native/root authors. The support +matching fact is classical determinant expansion or Hall matching. The new +step is its stage-set-preserving application, not the predecessor optimum. +Independent human and formal proof-kernel review are unclaimed. Apache-2.0. + +The investigation playbook guided the work. Build the Lever supplied a +standalone checker; Prove It Works required all eligible stage subsets and +the chronological degree fixture. Power of Ten bounds dimensions by four, +fields by three, matching paths by dimension, and census domains explicitly. +All functions have fewer than sixty lines and there is no recursion, dynamic +code execution, subprocess, network or shared mutable state. Python allocation +is a managed-runtime deviation: matrices have at most sixteen entries, +permutation lists at most twenty-four entries and vector tables at most +eighty-one entries under the enforced entry-point caps. Runtime allocator +internals are not inspected. Receipt files are limited to 128 KiB each. +Warning-strict normal and optimized commands are registered diagnostics. +Ruff and mypy were unavailable on PATH. No repository-wide diagnostic policy +was changed for this isolated package. diff --git a/research/fixed-basis-idle-coalescing/SOURCES.json b/research/fixed-basis-idle-coalescing/SOURCES.json new file mode 100644 index 0000000000..ba10b04da5 --- /dev/null +++ b/research/fixed-basis-idle-coalescing/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/connected-l18-root-caller/IDLE-COALESCING.md", + "usage": "provenance", + "git_blob": "91df672c3d5f4b56321e7b07ad98f011949484e3", + "sha256": "ba9d8e2caf41b18352e01edc69a3a47c1e1385f6b4ae3b2ab8c681b3bd44f5ad" + }, + { + "path": "research/connected-l18-root-caller/README.md", + "usage": "provenance", + "git_blob": "6ef3bae7d8fb6081f7c6441d04a5d929cbd7016b", + "sha256": "349341634d97c3f105bdc5003de1a2e7252a31fc52e25dc7bdfd39550586ccbd" + } + ] +} diff --git a/research/fixed-basis-idle-coalescing/TASK.json b/research/fixed-basis-idle-coalescing/TASK.json new file mode 100644 index 0000000000..13e42bd04f --- /dev/null +++ b/research/fixed-basis-idle-coalescing/TASK.json @@ -0,0 +1,90 @@ +{ + "schema_version": 1, + "task_id": "joint-query-controller", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "joint-query-controller", + "question": "Can a changed query demand or caller remove real work while satisfying native chronology and restoration?", + "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": "Choose an exact caller and a new demand/interface hypothesis. Read the scoped #5617/#5631/#5649/#5747 and #5720/#5745 objections before rebuilding an excluded schedule. Compare the complete matched source/consumer protocols including all retained helper outputs. For an active-mode injection, first check #5745: its canonical delivery claim repays the eight removed centre jobs. Audit that exact claim or change its channel/feedback hypothesis; do not repeat the same free-injection search. Stop if the full favorable budget fails or the required restored output is unobservable.", + "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": [ + "query demand", + "active mode", + "5720", + "5745", + "5747", + "caller" + ], + "existing_checks": [ + { + "scope": "PR #4166: author-checked installed producer/service/return/bridge connection; native-component comparison loses.", + "evidence": "research/qq16-caller-install/README.md", + "remaining": "Complete matched physical protocol bill, or changed source-compatible demand/circuit; no affordable supplier yet.", + "status": "author-checked", + "source_commit": "0b082d22a0e9a442d264ab0633e35ef26c790630", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "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": "Fixed globally independent idle directions reduce to coordinate allocations with the identical multiset of complete stage sets over every field.", + "scope_change_reason": "A local allocation obstruction for the noncoordinate coalescing question of PR7002, rather than the card's complete changed producer/consumer program.", + "bottleneck_link": "Rules out fixed common noncoordinate bases as a way around the cited connected-root idle invoice; changing basis, dependence or another contract is needed.", + "budget_minutes": 60, + "stop_rule": "Ship the first support-matching proof and bounded finite corroboration; do not extend to dependent or rotating directions.", + "outcome": "completed", + "evidence": "PROOF.md and verify.py; generated hash-bound receipts on stdout.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can globally dependent directions improve a fully specified idle allocation?", + "why_it_matters": "This changes the global independence premise of the obstruction.", + "first_step": "Use three lines in a two-dimensional space and a short coordinate-mask sequence, retaining stagewise independence.", + "blocked_by": "No favorable allocation with paid preparation and dirty restoration is supplied." + }, + { + "question": "Can stage-dependent bases improve a complete connected-root caller?", + "why_it_matters": "A fixed common basis cannot reduce the optimistic degree bill.", + "first_step": "Specify two bases and one paid transition, with HOST compatibility.", + "blocked_by": "No legal conversion and favorable full invoice is known here." + } + ] +} diff --git a/research/fixed-basis-idle-coalescing/VERIFY.json b/research/fixed-basis-idle-coalescing/VERIFY.json new file mode 100644 index 0000000000..8182600134 --- /dev/null +++ b/research/fixed-basis-idle-coalescing/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": 120, + "checks": "Every F2 matrix through dimension four and F3 matrix through dimension three; all supported permutations, coordinate masks, eligible subsets, degree fixture and rejection controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Repeat identical explicit checks under optimization; all acceptance checks must remain active." + } + ] +} diff --git a/research/fixed-basis-idle-coalescing/verify.py b/research/fixed-basis-idle-coalescing/verify.py new file mode 100644 index 0000000000..cebfff5bce --- /dev/null +++ b/research/fixed-basis-idle-coalescing/verify.py @@ -0,0 +1,176 @@ +#!/usr/bin/env python3 +"""Corroborate support matching and degree-preserving idle allocation.""" + +from hashlib import sha256 +from itertools import permutations, product +from pathlib import Path +import json + + +def need(condition, message): + if not condition: + raise ValueError(message) + + +def validate(columns, prime): + need(prime in (2, 3), "finite checker supports F2 and F3") + n = len(columns) + need(1 <= n <= 4, "checker dimension must be between one and four") + need(all(len(v) == n for v in columns), "square column matrix required") + need(all(type(x) is int and 0 <= x < prime for v in columns for x in v), + "canonical field entries required") + return n + + +def rank(columns, prime): + n = len(columns) + rows = [list(row) for row in zip(*columns)] + pivot = 0 + for col in range(n): + found = next((r for r in range(pivot, n) if rows[r][col]), None) + if found is None: + continue + rows[pivot], rows[found] = rows[found], rows[pivot] + inv = pow(rows[pivot][col], -1, prime) + rows[pivot] = [x * inv % prime for x in rows[pivot]] + for r in range(pivot + 1, n): + coefficient = rows[r][col] + rows[r] = [(a - coefficient * b) % prime + for a, b in zip(rows[r], rows[pivot])] + pivot += 1 + return pivot + + +def support_matching(columns, prime): + """Bounded augmenting paths; map each column to a nonzero support row.""" + n = validate(columns, prime) + need(rank(columns, prime) == n, "directions must form a basis") + owner = [-1] * n + for start in range(n): + queue = [start] + seen = {start} + parent = [-1] * n + endpoint = None + for position in range(n): + if position == len(queue) or endpoint is not None: + break + col = queue[position] + for row in range(n): + if not columns[col][row] or parent[row] != -1: + continue + parent[row] = col + if owner[row] == -1: + endpoint = row + break + if owner[row] not in seen: + seen.add(owner[row]) + queue.append(owner[row]) + need(endpoint is not None, "basis has no support matching") + row = endpoint + for _ in range(n): + col = parent[row] + previous = next((r for r in range(n) if owner[r] == col), -1) + owner[row] = col + if previous == -1: + break + row = previous + else: + raise ValueError("augmenting path exceeds dimension") + return tuple(owner.index(col) for col in range(n)) + + +def check_basis(columns, prime): + n = len(columns) + matching = support_matching(columns, prime) + oracle = [perm for perm in permutations(range(n)) + if all(columns[j][perm[j]] for j in range(n))] + need(matching in oracle, "matching disagrees with determinant support") + supports = [sum(1 << i for i, x in enumerate(v) if x) for v in columns] + checks = 0 + for mask in range(1 << n): + eligible = sum(1 << j for j, s in enumerate(supports) if s & ~mask == 0) + for subset in range(1 << n): + if subset & ~eligible: + continue + mapped = sum(1 << matching[j] for j in range(n) if subset >> j & 1) + need(mapped & ~mask == 0, "mapped idle direction leaves stage mask") + need(mapped.bit_count() == subset.bit_count(), "idle count changed") + checks += 1 + return checks + + +def census(n, prime): + vectors = tuple(product(range(prime), repeat=n)) + matrices = bases = stage_checks = 0 + for columns in product(vectors, repeat=n): + matrices += 1 + if rank(columns, prime) != n: + continue + bases += 1 + stage_checks += check_basis(columns, prime) + expected_bases = 1 + for i in range(n): + expected_bases *= prime ** n - prime ** i + need(matrices == prime ** (n * n), "matrix enumeration is incomplete") + need(bases == expected_bases, "basis enumeration disagrees with GL order") + return {"field": prime, "dimension": n, "matrices": matrices, + "bases": bases, "stage_subset_checks": stage_checks} + + +def controls(): + invalid = [(((1, 0), (1, 0)), 2), (((1, 0),), 2), + (((1, 0), (0, 1)), 5), (((2, 0), (0, 1)), 2), + (((True, 0), (0, 1)), 2), ((), 2)] + rejected = 0 + for columns, prime in invalid: + try: + support_matching(columns, prime) + except ValueError: + rejected += 1 + need(rejected == len(invalid), "malformed input accepted") + # Three dependent directions cannot have distinct coordinate anchors in F2^2. + supports = (1, 2, 3) + need(not any(all(supports[j] >> rows[j] & 1 for j in range(3)) + for rows in permutations(range(2), 3)), "dependent boundary") + # An injective assignment must also use nonzero entries. + columns = ((1, 0), (1, 1)) + need(not columns[0][1], "wrong-support control must leave a singleton mask") + return {"rejections": rejected, "boundary_controls": 2} + + +def schedule_fixture(): + columns = ((1, 0, 0), (1, 1, 0), (0, 1, 1)) + matching = support_matching(columns, 2) + masks = (1, 3, 7, 6, 7) + idles = ((0,), (0, 1), (1, 2), (2,), (0, 2)) + mapped = tuple(tuple(matching[j] for j in stage) for stage in idles) + for mask, stage, coordinates in zip(masks, idles, mapped): + need(all(all(not x or mask >> i & 1 for i, x in enumerate(columns[j])) + for j in stage), "fixture has an ineligible direction") + need(all(mask >> i & 1 for i in coordinates), "fixture translation failed") + degrees = tuple(sum(j in stage for stage in idles) for j in range(3)) + translated = tuple(sum(matching[j] in stage for stage in mapped) for j in range(3)) + need(degrees == translated == (3, 2, 3), "chronological degrees changed") + return {"matching": matching, "degrees": degrees, "stages": len(masks)} + + +def main(): + results = [census(n, p) for p, top in ((2, 4), (3, 3)) + for n in range(1, top + 1)] + fixture = schedule_fixture() + checked_controls = controls() + directory = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", "verify.py") + hashes = {} + for name in names: + path = directory / name + need(path.stat().st_size <= 131072, "package file exceeds receipt read cap") + hashes[name] = sha256(path.read_bytes()).hexdigest() + receipt = {"status": "PASS_FIXED_BASIS_IDLE_COALESCING", "censuses": results, + "schedule": fixture, "controls": checked_controls, "sha256": hashes, + "scope": "finite corroboration; universal theorem is in PROOF.md"} + print(json.dumps(receipt, sort_keys=True)) + + +if __name__ == "__main__": + main() From 8292d2eedd141472d7e5b3f7f760fa9f2aa49d70 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:30:49 +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")