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/bit-terminal-two-for-one/PROOF.md b/research/bit-terminal-two-for-one/PROOF.md new file mode 100644 index 0000000000..d49af4cb43 --- /dev/null +++ b/research/bit-terminal-two-for-one/PROOF.md @@ -0,0 +1,124 @@ +# Sharp terminal capacity with changed unmarked arrivals + +This theorem concerns a binary rank relaxation. It constructs synthetic source +libraries. It neither implements a native operation nor changes the selected frontier. + +## Model + +Work over F_2. An old terminal basis of W consists of n unmarked vectors +u_1,...,u_n, b base vectors a_1,...,a_b, and s singleton vectors p_1,...,p_s. +Write U=span(u), B=span(a), and m=b+s. A marked payload changes from v to v+d_v. +The fixed allowed difference libraries obey + +* d_a belongs to U+B for each of the b base positions; +* d_pi belongs to U+span(p_i) for each singleton position. + +These are containment hypotheses. Libraries may be proper subspaces. At most h +of the n unmarked arrivals may change arbitrarily within W. All n+m final +arrivals must form a basis of W. Let U' span the n final unmarked arrivals. +Return stock is the dimension of the span of the marked differences in W/U'. +Reconstruction from the final basis is free. The model promises no chronological +program, restored named output or paid realization. + +## Upper bound, credited context + +ToikY's [PR #7258 NEXT.md](https://github.com/ToikY/integer-mult-bounds/blob/90a63fbefcf79c3e0c0453ef0741dff8517b6167/research/bit-fixed-payload-quotient-bound/NEXT.md) +gives the b=12, s=10 instance of this dimension bound. Its literal library census +and prices are cited results, not verified here. The short argument below fixes +the exact abstraction for the new sharpness theorem. + +Let k count singleton differences whose image in W/U is p_i. Their new marked +arrivals vanish in W/U, since p_i+p_i=0. Other marked arrivals have joint quotient +rank at most b+s-k. The h changed unmarked arrivals add at most h quotient +dimensions. Full terminal rank implies k<=h. + +All differences have rank at most b+k modulo U. Both U and U' have dimension n +and share the n-h unchanged unmarked basis vectors. Thus dim(U/(U intersect U'))<=h. +For every subspace X of W, + + dim((X+U')/U') <= dim((X+U)/U) + dim(U/(U intersect U')). + +Indeed, project (X+U+U')/U' onto (X+U+U')/(U+U'). Its kernel has dimension +dim(U/(U intersect U')); its image is a quotient of (X+U)/U. Apply this to the +span of the differences. Return stock is at most b+k+h, hence min(m,b+2h). + +F_2 matters. Over F_3 even a lone marked position with d=p has a nonzero new +arrival 2p, without any changed unmarked arrival. + +## New attaining construction + +For every even b>=0, every n,s>=0 and 0<=h<=n, the upper bound + + maximum return stock = min(b+s, b+2h) + +is attained with the fixed maximal libraries U+B and U+span(p_i). The same +libraries serve every budget h. Only the chosen payloads and unmarked arrivals +vary. There is no stronger universal bound from these dimension and singleton +containment hypotheses alone. + +For one unmarked vector u and two singleton vectors p,q, choose + + old unmarked u -> new unmarked p+q + marked p -> new marked u with d_p=p+u + marked q -> new marked q+u with d_q=u. + +Both differences belong to their fixed singleton libraries. The new arrivals +(p+q,u,q+u) are a basis. From their values (x,y,z), recover + + u=y, q=z+y, p=x+z+y. + +Modulo U'=span(p+q), the differences p+u and u are independent. In an equality +alpha(p+u)+beta u=gamma(p+q), the q coefficient forces gamma=0, then the p +coefficient forces alpha=0, and finally beta=0. One changed unmarked arrival +therefore earns two independent difference directions. + +For one remaining singleton p, use u->p and p->u, with d_p=p+u. This earns one +direction modulo the new unmarked span. Leave other singletons and unmarked +arrivals unchanged. Use min(h,floor(s/2)) disjoint three-vector gadgets, followed +by the two-vector gadget only when s is odd and budget remains. They earn exactly +min(s,2h) directions. Disjoint supports make both the endpoint bases and quotient +directions combine by direct sum. + +For every pair of base vectors a,c, choose d_a=c and d_c=a+c. New arrivals are +a+c and a. Both difference and arrival pairs are bases. These disjoint blocks earn +all b base directions with no unmarked changes and no intersection with the +singleton gadgets. This proves the formula. + +## The 523+22 shape and its boundary + +For n=523, b=12 and s=10, the synthetic construction has terminal rank 545 and +return stocks 12,14,16,18,20,22 at budgets h=0,1,2,3,4,5. All 523 new unmarked +arrivals remain independent. No extra arrival slot is used. + +It can retain the base support partition 3+3+2+4 reported by #7258. A three-vector +base block uses differences (c,d,a+c) on (a,c,d). New arrivals are +(a+c,c+d,a+c+d); both triples have determinant one. The two-vector block above +and its direct sum handle sizes two and four. The partition itself therefore +cannot exclude the synthetic attainment. + +Five changed unmarked arrivals suffice for stock 21 or 22 in this abstraction, +and four cannot suffice. This proves sharpness of the source's dimension-only +necessary condition. It does not assert that five actual BIT arrivals have these +payloads, that actual singleton libraries contain the required u components, or +that free basis reconstruction has an affordable legal caller. Those are the next +discriminating constraints. This package does not enumerate the source's 523 ports +or recheck its stock values. + +## Finite corroboration and implementation bounds + +The verifier checks every constructed endpoint and quotient stock by binary +elimination. Small instances also use an independent span-cardinality oracle. +It enumerates every unmarked replacement and allowed difference in ten complete +small maximal-singleton models. These are complete finite certificates for their +declared domains; the written direct-sum argument supplies the all-size scoped proof. + +Every loop has a finite domain. Ambient dimension is at most 545; rank calls have +at most 1,090 rows. Span sets have at most 64 elements in the construction checks +and 32 in the complete models. The largest complete model has 16,384 assignments. The construction +sweep fixes n<=4, b in {0,2,4,6,12}, s<=10, h<=n, then checks six 545-dimensional +witnesses. Functions stay below 60 lines. Explicit exceptions keep checks active +under optimized Python. Python integer, container, JSON and hashing allocation is +a managed-runtime deviation from fixed steady-state allocation; the finite +dimensions above bound live mathematical state. No recursion, dynamic code, +external process or third-party dependency is used. Warning-strict execution +supplies interpreted diagnostics. diff --git a/research/bit-terminal-two-for-one/README.md b/research/bit-terminal-two-for-one/README.md new file mode 100644 index 0000000000..e7367124a2 --- /dev/null +++ b/research/bit-terminal-two-for-one/README.md @@ -0,0 +1,70 @@ +# Sharp two-for-one terminal exchange + +Scoped written proof with exact finite corroboration, produced by Nick Petalas. + +In the binary terminal-rank relaxation with n unmarked arrivals, b base marked +directions, s singleton marked directions and at most h changed unmarked +arrivals, the universal stock bound min(b+s,b+2h) is sharp for every even b. +One three-vector exchange earns two independent marked differences while +changing one unmarked arrival. Fixed libraries suffice for every budget. + +For the synthetic 523+22 shape with b=12 and s=10, five changed unmarked +arrivals attain stock 22 and preserve terminal rank 545. The construction also +respects the base support partition 3+3+2+4. Consequently the dimension-only +argument in [ToikY #7258](https://github.com/CrocSwap/integer-mult-bounds/pull/7258) +cannot raise its five-arrival necessary condition. An obstruction beyond it must +use actual source libraries, donor projections, scheduling or costs. + +These are synthetic libraries. No claim of stock 22 on the literal BIT word, +physical delivery, native admission, complete multiplication theorem or new +kappa follows. The selected frontier and its five assumptions are unchanged. + +The [proof](PROOF.md) defines the relaxation, credits the predecessor upper bound, +and proves attainment. The standalone verifier constructs endpoints, checks full +rank and quotient rank, and exhausts every assignment in ten small singleton +models with an independent span oracle. It generates a receipt with source +hashes. No predecessor scientific verifier runs. + +Local CPython 3.12.15 verification covers 825 small construction cases, six +545-dimensional witnesses and all 26,286 assignments in the ten complete models. +Four mathematical controls and three invalid-parameter controls pass. + +## Reproduce + +From the repository root, using CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B -W error scripts/research_package.py --package research/bit-terminal-two-for-one +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B -W error research/bit-terminal-two-for-one/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/bit-terminal-two-for-one --check-modes --check-source-history +``` + +Registered normal and optimized checks have 120-second bounds. Direct verification +prints its generated hash-bound receipt. An optional `--receipt` path must be +outside the checkout. Runtime needs only the standard library and package files; +the source-history check additionally needs full Git history. + +## Open next questions + +Determine whether funded changed paths or expanded marked libraries can realize +even one three-vector gadget with the required shared U component and quotient +projection. Concurrent [#7260](https://github.com/CrocSwap/integer-mult-bounds/pull/7260) +studies actual old-source donor constraints, unlike this maximal-library relaxation. +Use its source-pinned donor map as a cited starting point rather than repeating +its census. A legal paid schedule, joint endpoint, ownership, restoration and +the complete invoice remain separate obligations. +The structured question is in [TASK.json](TASK.json). + +## Credit and source context + +The new exchange, sharpness theorem and verifier were produced by Nick Petalas. +Credit ToikY's #7258, exact head `90a63fbefcf79c3e0c0453ef0741dff8517b6167`, +for the 12+2h upper bound, singleton/base partition and altered-unmarked-arrival +route. Its census and prices are cited inputs, not deliverables rechecked here. +Credit Jerry Chen / CubeJerry #7001/#6726 and their retained contributors for the +BIT word motivating that route, and Clear1nsight #7244 for its complete comparison. +Binary elimination, rank-nullity and direct sums are classical methods. + +[SOURCES.json](SOURCES.json) records immutable main provenance and the exact public +predecessor path and hash. There are no external runtime inputs. Independent human +and formal proof-kernel review are unclaimed. New work is Apache-2.0. diff --git a/research/bit-terminal-two-for-one/SOURCES.json b/research/bit-terminal-two-for-one/SOURCES.json new file mode 100644 index 0000000000..16ad5b8b40 --- /dev/null +++ b/research/bit-terminal-two-for-one/SOURCES.json @@ -0,0 +1,28 @@ +{ + "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" + } + ], + "external_provenance": [ + { + "repository": "ToikY/integer-mult-bounds", + "commit": "90a63fbefcf79c3e0c0453ef0741dff8517b6167", + "path": "research/bit-fixed-payload-quotient-bound/NEXT.md", + "url": "https://github.com/ToikY/integer-mult-bounds/blob/90a63fbefcf79c3e0c0453ef0741dff8517b6167/research/bit-fixed-payload-quotient-bound/NEXT.md", + "sha256": "67e11381abef156fb3d24da94c53a4ee74fbbc2140638be98278a49c67b8a364", + "usage": "credited mathematical context; no runtime import or predecessor replay" + } + ] +} diff --git a/research/bit-terminal-two-for-one/TASK.json b/research/bit-terminal-two-for-one/TASK.json new file mode 100644 index 0000000000..602b96472b --- /dev/null +++ b/research/bit-terminal-two-for-one/TASK.json @@ -0,0 +1,77 @@ +{ + "schema_version": 1, + "task_id": "bit-helper-contract", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "bit-helper-contract", + "question": "Can a changed G20 helper path or independent-target split improve the complete BIT moment without losing its physical endpoint?", + "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", + "research/g20-helper-split/README.md", + "research/g20-conjugation-admission/README.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 full boundary contract and paid profile; unchanged scalar counts alone are insufficient. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "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": "First read #5679/#5708 and their audits as pending component proposals. Choose one uncovered helper group/cut on an exact word; compare arbitrary-input native action, targets, owned storage, both orientations and full signed bill. Stop if the gain is only a scalar count or repaid by lost targets. Do not rerun the frozen #5609 common-frame domain without changing its hypothesis.", + "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": [ + "G20", + "helper split", + "5679", + "5708", + "independent target" + ], + "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": "Prove sharpness of the binary dimension-only terminal stock bound min(b+s,b+2h) by a fixed-library exchange construction.", + "scope_change_reason": "The predecessor leaves altered unmarked arrivals open. This isolates the rank relaxation before any actual donor census, rather than auditing the predecessor or attempting an unpriced native construction.", + "bottleneck_link": "A stronger BIT terminal obstruction must use actual source libraries, donor projections or costs if the dimension-only relaxation is sharp. This is a local interface result, not a complete supplier.", + "budget_minutes": 60, + "stop_rule": "Ship the first verified exchange and sharpness theorem; do not extend to the actual port census.", + "outcome": "completed", + "evidence": "PROOF.md and the standalone exhaustive verifier. Generated hash-bound receipts print to stdout or an external path.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can funded changed paths or expanded marked libraries realize a three-vector exchange with the required shared U component and distinct terminal ports?", + "why_it_matters": "The abstract dimension bound cannot distinguish this route from a feasible rank endpoint.", + "first_step": "Use the exact source-constrained donor map in concurrent PR7260 as a cited input, then test funded new paths or changed marked libraries against the explicit gadget and full endpoint. Do not repeat its census.", + "blocked_by": "Actual fixed marked libraries, donor projections, eligible distinct funded slots, legal chronology, ownership, restoration and complete costs." + } + ] +} diff --git a/research/bit-terminal-two-for-one/VERIFY.json b/research/bit-terminal-two-for-one/VERIFY.json new file mode 100644 index 0000000000..27cc03d10f --- /dev/null +++ b/research/bit-terminal-two-for-one/VERIFY.json @@ -0,0 +1,32 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-B", + "-W", + "error", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Construct full-rank terminal bases and sharp quotient stock; exhaust ten small singleton models with independent elimination/span ranks; reject invalid parameters and lost endpoint rank." + }, + { + "argv": [ + "{python}", + "-B", + "-O", + "-W", + "error", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Repeat every mathematical check with optimized Python; explicit exceptions must retain all checks." + } + ] +} diff --git a/research/bit-terminal-two-for-one/verify.py b/research/bit-terminal-two-for-one/verify.py new file mode 100644 index 0000000000..848f98d170 --- /dev/null +++ b/research/bit-terminal-two-for-one/verify.py @@ -0,0 +1,205 @@ +#!/usr/bin/env python3 +"""Exact binary endpoint constructions and complete small singleton models.""" + +import argparse +import hashlib +import itertools +import json +from pathlib import Path +import platform + +MAX_DIMENSION = 545 + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def rank(rows, width): + require(0 <= width <= MAX_DIMENSION, "rank width outside finite check domain") + require(len(rows) <= 2 * MAX_DIMENSION, "too many rank rows") + pivots = [0] * width + result = 0 + for original in rows: + require(isinstance(original, int) and 0 <= original < 1 << width, + "rank row outside binary ambient space") + row = original + for bit in range(width - 1, -1, -1): + if not row >> bit & 1: + continue + if pivots[bit]: + row ^= pivots[bit] + else: + pivots[bit] = row + result += 1 + break + return result + + +def span_rank(rows, width): + """Independent exhaustive span cardinality, only in small ambient spaces.""" + require(0 <= width <= 6, "span oracle is restricted to six dimensions") + span = {0} + for row in rows: + require(0 <= row < 1 << width, "span row outside binary space") + span |= {value ^ row for value in span} + size = len(span) + require(size & (size - 1) == 0, "binary span size must be a power of two") + return size.bit_length() - 1 + + +def base_differences(n, b): + """Use the predecessor support partition 3+3+2+4 when b=12.""" + blocks = (3, 3, 2, 4) if b == 12 else (2,) * (b // 2) + differences = [] + offset = n + for size in blocks: + if size == 3: + a, c, d = (1 << (offset + j) for j in range(3)) + differences.extend((c, d, a ^ c)) + else: + for j in range(0, size, 2): + a, c = 1 << (offset + j), 1 << (offset + j + 1) + differences.extend((c, a ^ c)) + offset += size + require(len(differences) == b, "base block dimension mismatch") + return tuple(differences) + + +def construction(n, b, s, h): + require(0 <= h <= n <= 523 and b in (0, 2, 4, 6, 12), + "construction parameters outside the registered check domain") + width = n + b + s + require(0 <= s <= 10 and width <= MAX_DIMENSION, "invalid singleton count") + unmarked = [1 << j for j in range(n)] + differences = list(base_differences(n, b)) + [0] * s + pairs = min(h, s // 2) + for j in range(pairs): + u = 1 << j + a, c = 1 << (n + b + 2 * j), 1 << (n + b + 2 * j + 1) + unmarked[j] = a ^ c + differences[b + 2 * j] = a ^ u + differences[b + 2 * j + 1] = u + if s % 2 and h > pairs: + u, a = 1 << pairs, 1 << (n + b + 2 * pairs) + unmarked[pairs] = a + differences[b + 2 * pairs] = a ^ u + marked = tuple((1 << (n + j)) ^ d for j, d in enumerate(differences)) + return tuple(unmarked), marked, tuple(differences) + + +def check_construction(n, b, s, h): + unmarked, marked, differences = construction(n, b, s, h) + width = n + b + s + require(rank(unmarked, width) == n, "unmarked arrivals lost rank") + require(rank(unmarked + marked, width) == width, "terminal endpoint lost rank") + changed = sum(row != 1 << j for j, row in enumerate(unmarked)) + require(changed <= h, "unmarked change budget exceeded") + base_mask = (1 << (n + b)) - 1 + require(all(row & ~base_mask == 0 for row in differences[:b]), + "base difference escaped its fixed library") + for j in range(s): + allowed = ((1 << n) - 1) | (1 << (n + b + j)) + require(differences[b + j] & ~allowed == 0, "singleton library escaped") + stock = rank(unmarked + differences, width) - n + require(stock == min(b + s, b + 2 * h), "sharp construction missed capacity") + if width <= 6: + require(span_rank(unmarked + marked, width) == width, + "independent span oracle rejects endpoint") + require(span_rank(unmarked + differences, width) - n == stock, + "independent span oracle rejects stock") + return {"unmarked": n, "base": b, "singletons": s, "budget": h, + "changed": changed, "stock": stock} + + +def exhaustive_singletons(n, s): + """Enumerate every unmarked replacement and every maximal-library choice.""" + width = n + s + require((n == 0 and 1 <= s <= 4) or (n == 1 and 1 <= s <= 4) + or (n == 2 and 1 <= s <= 2), "unregistered exhaustive domain") + libraries = tuple(tuple(u | (coefficient << (n + j)) + for coefficient in range(2) for u in range(1 << n)) + for j in range(s)) + maxima = [-1] * (n + 1) + endpoints = [0] * (n + 1) + checked = 0 + for unmarked in itertools.product(range(1 << width), repeat=n): + changed = sum(row != 1 << j for j, row in enumerate(unmarked)) + for differences in itertools.product(*libraries): + checked += 1 + marked = tuple((1 << (n + j)) ^ d for j, d in enumerate(differences)) + endpoint_rank = span_rank(unmarked + marked, width) + if endpoint_rank != width: + continue + require(rank(unmarked + marked, width) == endpoint_rank, + "independent endpoint ranks disagree") + stock = span_rank(unmarked + differences, width) - n + require(rank(unmarked + differences, width) - n == stock, + "independent difference ranks disagree") + endpoints[changed] += 1 + for budget in range(changed, n + 1): + maxima[budget] = max(maxima[budget], stock) + expected = [min(s, 2 * h) for h in range(n + 1)] + require(maxima == expected, "complete singleton model disagrees with theorem") + require(checked == (1 << (width * n)) * (1 << ((n + 1) * s)), + "incomplete enumeration") + return {"unmarked": n, "singletons": s, "assignments": checked, + "endpoints_by_exact_changes": endpoints, "maxima_by_budget": maxima} + + +def controls(): + require(rank((0, 1, 2), 3) == 2, "own-pivot cancellation was accepted") + # Two marked cancellations cannot be rescued by a single changed arrival. + require(rank((6, 1, 1), 3) < 3, "two cancelled singleton pivots accepted") + # With the old unmarked arrival, differences inside U earn no quotient rank. + require(rank((1, 1, 1), 3) - 1 == 0, "old-U payload was credited twice") + # F_3 escapes the binary theorem: d=p keeps p+d nonzero. + require((1 + 1) % 3 == 2, "characteristic-three scope control failed") + rejected = 0 + for arguments in ((1, 0, 2, 2), (1, 1, 2, 0), (524, 0, 0, 0)): + try: + construction(*arguments) + except ValueError: + rejected += 1 + require(rejected == 3, "out-of-domain construction accepted") + return {"mathematical_controls": 4, "invalid_parameter_controls": rejected} + + +def certificate(): + small = [] + for n, b, s in itertools.product(range(5), (0, 2, 4, 6, 12), range(11)): + for h in range(n + 1): + small.append(check_construction(n, b, s, h)) + actual_shape = [check_construction(523, 12, 10, h) for h in range(6)] + census = [exhaustive_singletons(n, s) + for n, upper in ((0, 4), (1, 4), (2, 2)) + for s in range(1, upper + 1)] + return {"schema_version": 1, "claim_type": "scoped proof with finite corroboration", + "construction_cases": len(small), "complete_small_models": census, + "complete_assignments": sum(row["assignments"] for row in census), + "same_dimension_synthetic_witnesses": actual_shape, "controls": controls()} + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("--receipt", type=Path) + args = parser.parse_args() + result = certificate() + package = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", "verify.py") + hashes = {name: hashlib.sha256((package / name).read_bytes()).hexdigest() for name in names} + payload = json.dumps(result, sort_keys=True, separators=(",", ":")).encode() + receipt = {"result": result, "result_sha256": hashlib.sha256(payload).hexdigest(), + "source_sha256": hashes, "python": platform.python_version()} + rendered = json.dumps(receipt, indent=2, sort_keys=True) + "\n" + if args.receipt: + require(not args.receipt.resolve().is_relative_to(package.parents[1]), + "generated receipts must stay outside the checkout") + require(args.receipt.write_text(rendered, encoding="utf-8") == len(rendered), + "receipt write incomplete") + print("PASS_BIT_TERMINAL_TWO_FOR_ONE " + json.dumps(receipt, sort_keys=True)) + + +if __name__ == "__main__": + main() diff --git a/research/historical-selected-replay-gap/README.md b/research/historical-selected-replay-gap/README.md index 55d8cc3b49..36d9a873ca 100644 --- a/research/historical-selected-replay-gap/README.md +++ b/research/historical-selected-replay-gap/README.md @@ -69,7 +69,11 @@ python3 -B scripts/research_package.py --package research/historical-selected-re The direct command prints `PASS_HISTORICAL_SELECTED_REPLAY_GAP`. A registered replay prints `PASS_REGISTERED_RESEARCH_PACKAGE`. Both require Git history -containing the two inspected commits. +containing the two inspected commits and the source and manifest objects at +`2485805a6d47f36ea83ddde6327d453ac82d44dc`. The verifier uses a temporary +sparse checkout of that commit, checks the declared source digests there, and +uses its planner and manifest inventory. The recorded rejections and selection +therefore remain reproducible after later changes to the live Makefile or CI guide. ## Open next questions diff --git a/research/historical-selected-replay-gap/SOURCES.json b/research/historical-selected-replay-gap/SOURCES.json index c1010eec95..62bb8b3950 100644 --- a/research/historical-selected-replay-gap/SOURCES.json +++ b/research/historical-selected-replay-gap/SOURCES.json @@ -4,13 +4,13 @@ "files": [ { "path": "Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "0d683a06b9e7ee162496108ce9a7c5d2ee94fccf", "sha256": "4f2d4f2dcd15139ec82658a975f85ed300897385f85799218539f4c8d60567da" }, { "path": "certificates/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "eccafa830c16170c36faf93045ddf1f638f7bcd4", "sha256": "4c0b9d37e1034b2076e30a70f8e514416298c462d9ee98bc87fe6556b14df786" }, @@ -22,7 +22,7 @@ }, { "path": "docs/ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "63ba3e9aa8bdc5e942b56e34244b92b16f854085", "sha256": "c7d3027e9ad8bcbff68f07aa9576b30fb2f3c76c44d876d40c7fdbf4a3e2228a" }, @@ -34,163 +34,163 @@ }, { "path": "research/clifford-state-performance/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "6f98a0061a5104dfab82c9e806f819b41811f684", "sha256": "396d0f08df24952248140d5c65c51b8c902ef1c580892ff7ea182890530f67ee" }, { "path": "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "5e0f92af463ec12c5e1dcc3effd44081a88af647", "sha256": "07a9daeaf2bda308a92e9a4684f13d5fc766c7772d74801fceb7f4599fdab226" }, { "path": "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "9e13266bf85e627f1b7dc225e9530ea69fd2c7f0", "sha256": "421e1211fb1897c45621dc6801c276e53f2e6f335583c9c9049e535f87c0a3b1" }, { "path": "research/community-batch932-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "cc4d03eb59b9ab3f952735f7e88ff18c2d15d7af", "sha256": "184629cac91a5cfaca50330a88596008b824221433867dcf8117539c913c284a" }, { "path": "research/community-batch970-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8b9f4111badf7de5d97684799560b55110e9da79", "sha256": "23188ed920e38a54006cb883e181585620821c63bf7e8b5e05d32719417cc37e" }, { "path": "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "a5300d4e7a5381a3f443fc54c768ca6f0f236d68", "sha256": "3c820fb30e1b4d9bcfc6a7ab524375e5b2abd66b940af2c509146104f0bcd79c" }, { "path": "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "d7ff6d777b01d69b6ce84caf25d3b7e4a4d2f211", "sha256": "6b185a9902652f893f3ebd8ada92d2f11b6de6533a9a4d11718a8a4496101128" }, { "path": "research/community-hyperplane599-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "546f37d326d10a99910ae8f908e71ef768524d98", "sha256": "65099d764bfcc39bda5e4d9966783611b094c3522dbdd1435cd498d657a8ef8e" }, { "path": "research/community-k492-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "e538481e4cb16ed936d3195f2dfb5b5a9ca0a76b", "sha256": "2c0f4fa5bc150d05658af2e7c54c4d2c337dd52b7efd3d69530ae73bcbdf452a" }, { "path": "research/community-reconciliation92-audit/MANIFEST.json", - "usage": "input", + "usage": "provenance", "git_blob": "2a2e93685173d5f13cbb5abe740f5d90352e0228", "sha256": "5f501f3c118131e7d069f30ad77186eb2ad6961f9680a0ef105f4514ed41808a" }, { "path": "research/partial-swap-digest/baseline.py", - "usage": "input", + "usage": "provenance", "git_blob": "a2f0190704db83bd8ef48e46e723c49b925804fe", "sha256": "81e9af92cdf38243a540cdcff2062778e449467848d444da37a9553c12ca4c34" }, { "path": "research/r420-two-sided-basis/SOURCES.json", - "usage": "input", + "usage": "provenance", "git_blob": "5d718e11e62f4bcadecf1e02d6b61f87dbe190b0", "sha256": "d9810b0d139c5a1211fd2c1f0d142187cc1fca30026e1e7bc4f9ecfacf1596d1" }, { "path": "research/skip-clones/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8d1bb3b9c8189e35e5d8bfdfa632d7473e8be0d5", "sha256": "0b68e63e35a97ce6b0cdb6e291b88ebaa8f2dd4afb70b2498f10ee89428258dc" }, { "path": "research/split-skip/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "2ab610b6ea2edd2865fda793ef2168b0c76afb4f", "sha256": "7c2b4646a3ecfef6f881da5c43e4bd0fa9a4d1b00548b8ab458d897e16735134" }, { "path": "scripts/historical-ci-inputs/Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "aff68409021c9d401a6f8013b9dfd7dbcc30f2a8", "sha256": "ea8830dd79da493e2d75baf753d733ff7efbcf2b4794afe41fae0ac8f3055646" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "65db599ab0b1dea0312c4ca048e0bd0f44c3736f", "sha256": "96ea543e6c707424afe247e77bd86c82152f90fc76a0773c4232145da5cdf8d1" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "34820a8f24678f918f4d0e7a35380d8013fc3495", "sha256": "628391b6abfbc8674ceec1751867a4392f2cc0b5b66886243e139af86cf355ac" }, { "path": "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "c755b76e0d44ba4917aa94440ebe54daefce5b2a", "sha256": "d7fd929726b326aeeaf0a3996475adec88eee9aac09ae0bebeeaa0bc1fc8f199" }, { "path": "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "7f3c012504187917a728b9fe87043f0fc8cd006a", "sha256": "a854022e0e1d5d4db4d60e586be3ea56005013ef14a1fc06d02bc06e8529c4b0" }, { "path": "scripts/historical-ci-inputs/partial-swap-context.json", - "usage": "input", + "usage": "provenance", "git_blob": "ad65114886bf34a4fd27e79f3be502389e689faa", "sha256": "833a9642f33aeab2ffea17ec9c6b82e0a953f90192b2c82e10bef21538dccba9" }, { "path": "scripts/historical-ci-inputs/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "52075f2463f60af5e16571347f24274fce73a1ea", "sha256": "f3c4be597b2f2136da4ae2cc80c7454f63c90aa01f84e5b8131cee4dd55de815" }, { "path": "scripts/partial_swap/shared.py", - "usage": "input", + "usage": "provenance", "git_blob": "44a0e454c70f9c4b98e258b8443612e6a119904b", "sha256": "5a0646a50b9f3e8ea55168620a78e8853b0ab810517cefc8cfb8696aedee278a" }, { "path": "scripts/replay_historical_check.py", - "usage": "input", + "usage": "provenance", "git_blob": "1e92fff2782970ef71378f594f2350d245a4db26", "sha256": "5467619c78183d3adc82b0cb55af28e5c1a01fca2b0588677816244b53e2bafd" }, { "path": "scripts/research_package.py", - "usage": "input", + "usage": "provenance", "git_blob": "091b4c8f58bac9a9580d76025b887dc5c873d05f", "sha256": "e1256016e7f51827d04fa2179255989f639ae1d97afaa9c16265f85a0c6abd70" }, { "path": "scripts/run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "a96ab35b315ce492e7fbbfd6c5ae211aa066b541", "sha256": "49eb56dd0fc0d8d8ffdb209970a7adf2176223580646f575d5c22e59543b381c" }, { "path": "scripts/verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "6882a4700e410dec569b51ae2eaf1a19cc019195", "sha256": "d6b305eac5b9bdb8172c469ad30a1655a60fa0aceac8b1bf610e1b73f51babd8" }, { "path": "tests/test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "343b24abf6719b81805eba5a84c74e57634c8288", "sha256": "3a5470d0b139828b90e19bf9583ddeafcd69f8e34f2824664eb3a2958a52e34d" } diff --git a/research/historical-selected-replay-gap/VERIFY.json b/research/historical-selected-replay-gap/VERIFY.json index 98553e72ed..ab7efa3471 100644 --- a/research/historical-selected-replay-gap/VERIFY.json +++ b/research/historical-selected-replay-gap/VERIFY.json @@ -4,36 +4,7 @@ "python": "3.12", "requirements": [], "inputs": [ - "Makefile", - "certificates/partial-swap-network.json", - "docs/ci-verification.md", - "research/clifford-state-performance/SOURCE.json", - "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "research/community-batch932-audit/CONTENT-COVERAGE.json", - "research/community-batch970-audit/CONTENT-COVERAGE.json", - "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "research/community-hyperplane599-audit/SOURCE.json", - "research/community-k492-audit/SOURCE.json", - "research/community-reconciliation92-audit/MANIFEST.json", - "research/partial-swap-digest/baseline.py", - "research/r420-two-sided-basis/SOURCES.json", - "research/skip-clones/SOURCE.json", - "research/split-skip/SOURCE.json", - "scripts/historical-ci-inputs/Makefile", - "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "scripts/historical-ci-inputs/partial-swap-context.json", - "scripts/historical-ci-inputs/partial-swap-network.json", - "scripts/partial_swap/shared.py", - "scripts/replay_historical_check.py", - "scripts/research_package.py", - "scripts/run_isolated_tests.py", - "scripts/verify_selected_result.py", - "tests/test_isolated_test_runner.py" + "scripts/research_package.py" ], "commands": [ { diff --git a/research/historical-selected-replay-gap/verify.py b/research/historical-selected-replay-gap/verify.py index 83b995941a..9d266c5a4e 100644 --- a/research/historical-selected-replay-gap/verify.py +++ b/research/historical-selected-replay-gap/verify.py @@ -6,8 +6,10 @@ """ import hashlib import importlib.util +import json import subprocess import sys +import tempfile from pathlib import Path ROOT = Path(__file__).resolve().parents[2] @@ -61,31 +63,47 @@ def require(ok, message): raise SystemExit(message) -def load_checker(): - path = ROOT / "scripts/replay_historical_check.py" - spec = importlib.util.spec_from_file_location("historical_selected_replay_gap_checker", path) +def load_module(path): + spec = importlib.util.spec_from_file_location(path.stem, path) module = importlib.util.module_from_spec(spec) spec.loader.exec_module(module) return module +def checkout_snapshot(snapshot, sources, runner, env): + paths = [runner.canonical_relative_path(row["path"]) for row in sources["files"]] + git = ["git", "-c", "maintenance.auto=false", "-c", "gc.auto=0", + "-c", "core.autocrlf=false"] + subprocess.run([*git, "clone", "--quiet", "--shared", "--no-tags", "--no-checkout", + "--", str(ROOT), str(snapshot)], cwd=ROOT, env=env, check=True) + subprocess.run([*git, "update-ref", "--no-deref", "HEAD", INSPECTED], + cwd=snapshot, env=env, check=True) + # The pinned planner reads omitted manifests from the sparse HEAD/index. + patterns = "".join(f"/{path.as_posix()}\n" for path in paths) + subprocess.run([*git, "sparse-checkout", "set", "--no-cone", "--stdin"], + cwd=snapshot, env=env, input=patterns.encode("utf-8"), check=True) + subprocess.run([*git, "read-tree", "-mu", "HEAD"], cwd=snapshot, env=env, check=True) + for path, row in zip(paths, sources["files"], strict=True): + require(hashlib.sha256((snapshot / path).read_bytes()).hexdigest() == row["sha256"], + "historical checkout source digest changed: " + path.as_posix()) + + def entries(checker): for name, config in checker.CONFIG.items(): for entry in [config, *config.get("additional_inputs", [])]: yield name, entry -def reject(checker, entry): +def reject(root, checker, entry): try: - checker.authenticated_input(ROOT, entry) + checker.authenticated_input(root, entry) except ValueError as exc: return str(exc) raise SystemExit("historical input was admitted: " + entry["path"]) -def main(): - require(not sys.flags.optimize, "assertions must stay enabled") - checker = load_checker() +def check_snapshot(root, env): + checker = load_module(root / "scripts/replay_historical_check.py") selected = [entry for name, entry in entries(checker) if name == "tooling-ledger" and entry["path"] == SELECTED_PATH] require(len(selected) == 1, "selected-result checker overlay is not unique") @@ -94,7 +112,7 @@ def main(): require(entry["accepted_live_sha256"] == [SELECTED_ACCEPTED], "accepted selected-checker successors changed") frozen = (checker.INPUTS / entry["input"]).read_bytes() - live = (ROOT / SELECTED_PATH).read_bytes() + live = (root / SELECTED_PATH).read_bytes() require(hashlib.sha256(frozen).hexdigest() == SELECTED_PIN, "frozen selected checker bytes changed") require(hashlib.sha256(live).hexdigest() == SELECTED_LIVE, "live selected checker digest changed") require(SELECTED_LIVE not in (SELECTED_PIN, SELECTED_ACCEPTED), "live checker was already admitted") @@ -102,7 +120,7 @@ def main(): # live successor, not a broken comparison. require(SELECTED_PIN in (SELECTED_PIN, *entry["accepted_live_sha256"]), "pin membership control failed") - require(reject(checker, entry) == REJECTIONS[SELECTED_PATH][1], + require(reject(root, checker, entry) == REJECTIONS[SELECTED_PATH][1], "selected checker rejection text changed") counts = {path: 0 for path in REJECTIONS} @@ -110,7 +128,7 @@ def main(): for _name, item in entries(checker): if item["path"] not in REJECTIONS: continue - message = reject(checker, item) + message = reject(root, checker, item) counts[item["path"]] += 1 messages.setdefault(item["path"], message) for path, (count, message) in REJECTIONS.items(): @@ -118,20 +136,31 @@ def main(): require(messages[path] == message, "rejection text changed for " + path) require(sum(counts.values()) == 19, "rejection total changed") ci = [item for _name, item in entries(checker) if item["path"] == CI_PATH] - require(len(ci) == 1 and hashlib.sha256((ROOT / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, + require(len(ci) == 1 and hashlib.sha256((root / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, "selected CI note digest changed") diff = subprocess.check_output( - ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=ROOT, text=True) + ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=root, env=env, text=True) changed = sorted(name for name in diff.splitlines() if name) require(changed == CHANGED, "inspected commit diff changed") - sys.path.insert(0, str(ROOT / "scripts")) - from research_package import plan_details - details = plan_details(ROOT, set(changed)) + planner = load_module(root / "scripts/research_package.py") + details = planner.plan_details(root, set(changed)) require([row["package"] for row in details] == PLAN_PACKAGES, "helper plan selection changed") matched = {name for row in details for names in row["causes"].values() for name in names} require(sorted(set(changed) - matched) == UNMATCHED, "unmatched plan paths changed") - require(plan_details(ROOT, set()) == [], "empty change set selected a package") + require(planner.plan_details(root, set()) == [], "empty change set selected a package") + + +def main(): + require(not sys.flags.optimize, "assertions must stay enabled") + sources = json.loads(Path(__file__).with_name("SOURCES.json").read_bytes()) + require(sources["base_commit"] == INSPECTED, "historical checkout base changed") + runner = load_module(ROOT / "scripts/research_package.py") + env = runner.git_source_env() + with tempfile.TemporaryDirectory(prefix="historical-selected-replay-") as temporary: + snapshot = Path(temporary) / "snapshot" + checkout_snapshot(snapshot, sources, runner, env) + check_snapshot(snapshot, env) print("PASS_HISTORICAL_SELECTED_REPLAY_GAP") print("selected_checker_live=" + SELECTED_LIVE) print("rejections=19 distinct_paths=7 plan_packages=9")