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") diff --git a/research/rank-three-closed-completion/PROOF.md b/research/rank-three-closed-completion/PROOF.md new file mode 100644 index 0000000000..646cc7c530 --- /dev/null +++ b/research/rank-three-closed-completion/PROOF.md @@ -0,0 +1,119 @@ +# Exact rank-three alternating completion criterion + +This proof and its finite corroboration were produced by Nick Petalas. +Apache-2.0. + +## Statement and credited inputs + +Let V be a finite nondegenerate symplectic vector space over F2 with pairing +w. Let h:U -> V be an injective linear isometry. Write d=h+I, +K=ker d, D=d(U), and + + b(d(u),d(v)) = w(u,d(v)). + +Assume dim D=3 and b is alternating of rank two. Its radical R has +dimension one. Set U_R=d^-1(R), a subspace of U. All sums and inverse +images refer to the given V. Spectators required to remain fixed belong +to U with h(v)=v. Let L(h) be the minimum number of nonzero-axis +transvections in a symplectic extension of h in V. + +**Theorem.** If U_R is contained in K+D, then L(h)=5. Otherwise L(h)=4. +Moreover, every four-turn extension in this setting has four linearly +independent, pairwise orthogonal axes. + +The new result is the closed-case lower bound and the necessary commuting +structure. Ali Romman's [#6525](https://github.com/CrocSwap/integer-mult-bounds/pull/6525) +already proves 4<=L(h)<=5 and constructs four turns when U_R is not +contained in K+D. Those constructive upper bounds are used as premises; +they are not reconstructed or audited here. Its r=3 five-turn fixture +was already known. The new theorem treats every such contract in every +ambient dimension, rather than just that fixture. Its r>=4 closed case +remains open and can attain the lower endpoint. + +Krzysztof Wojt's #5097 supplies the general displacement-plus-nullity +bound. Nick Petalas's #5085/#6494, Brian / JoyboyBrian's #5051 and the +native/compiler lineage retained in #6525 supply the earlier problem +and constructions. The following lower-bound argument is self-contained. +Wall forms and binary quadratic forms are classical mathematics; no +literature-priority claim is made. + +## 1. Full displacement and its form + +For any symplectic extension S of h, put W=im(S+I). Symplecticity gives + + ker(S+I) = W-perp. + +For example, w(v,(S+I)x)=w((S^-1+I)v,x), so orthogonality to W is +equivalent to S(v)=v. Thus the form + + B((S+I)v,z) = w(v,z), z in W, + +is well-defined and nonsingular. If its left radical contained (S+I)v, +then v would be in W-perp and its displacement would vanish. Also + + B(x,y)+B(y,x)=w(x,y), B restricted to D equals b. (1) + +The first identity follows by expanding w(Sv,Su)=w(v,u); the second +follows from S|U=h. Since b is singular and D has dimension three, +W cannot equal D. Hence dim W>=4. + +A product of t transvections has displacement image contained in the +span of its t axes. Therefore L(h)>=4. If four turns extend h, their +axes a1,...,a4 are independent and W is exactly their span. + +In execution order, write the intermediate update at turn i as c_i a_i. +For input v the coefficients obey + + c_i = w(v,a_i) + sum_(j V, put d=h+I, K=ker d, +D=d(U), and b(d(u),d(v))=w(u,d(v)). Suppose dim D=3 and b is alternating +of rank two. Set R=rad b and U_R=d^-1(R). Then the exact unsigned +transvection minimum in the original ambient space is + + L(h) = 5 if U_R is contained in K+D, and 4 otherwise. + +Every four-turn extension necessarily has independent, commuting axes. +The new [proof](PROOF.md) excludes four turns for every closed contract, +in every ambient dimension. It settles the r=3 portion of Open next +question 1 in Ali Romman's [#6525](https://github.com/CrocSwap/integer-mult-bounds/pull/6525). +That source already supplies the general interval [4,5], the escaping-lift +four-turn construction and one closed five-turn example. Those are credited +inputs, not new constructions or audit deliverables. No predecessor +scientific verifier or numerical receipt is replayed. + +The proof uses the quadratic form of a hypothetical four-turn completion. +A totally singular hyperplane in a four-dimensional binary quadratic space +with nonzero polar form prevents its anisotropic vectors from spanning. +Four independent turn axes must span and each has quadratic value one. +Thus their displacement space is totally isotropic. The completion fixes +that entire image, which contradicts a nonzero closed radical lift. + +## Exact finite evidence + +[verify.py](verify.py) enumerates the new obstruction's finite coefficient +model, without rerunning the known five-turn fixture: + +- All 1,024 four-dimensional binary quadratic forms and their 15 hyperplanes. + There are 240 totally singular form/hyperplane pairs. All 210 with nonzero + polar form have polar rank two and anisotropic span dimension three. +- All 64 ordered independent four-axis Gram topologies, each realized by a + literal chronological word on an eight-dimensional symplectic space. + All 16,384 input vectors pass displacement and inverse checks; 65,536 + Wall basis equalities agree with a separate triangular formula. +- All 960 topology/hyperplane restrictions. Exactly one canonical pair has + alternating residual rank two. Its axes commute and all 16 radical lifts + escape K+D. This counts coefficient-model pairs, not all partial isometries. +- The 180 nonalternating rank-two restrictions with closed left-radical lifts + show that alternation is essential. All 256 single-turn omissions damage + their whole endpoints. A changed Wall diagonal and zero axis reject for + their specific intended reasons. + +[RESULT.json](RESULT.json) is generated from these enumerations and binds +six package sources by SHA256. Default replay recomputes and compares it. +The written proof supplies the arbitrary-dimension conclusion; finite checks +corroborate it. The credited upper bounds are mathematical premises, not +independently certified by this verifier. + +## Reproduce + +CPython 3.12 and its standard library suffice. From the repository root: + +```sh +~/git/integer-mult-bounds/.venv/bin/python3.12 -W error -B research/rank-three-closed-completion/verify.py +~/git/integer-mult-bounds/.venv/bin/python3.12 -O -W error -B research/rank-three-closed-completion/verify.py +~/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/rank-three-closed-completion +~/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/rank-three-closed-completion --check-source-history +``` + +Both direct modes print `PASS_RANK_THREE_CLOSED_COMPLETION`. Each registered +command has a 120-second bound. The standalone verifier needs only this +package, without Git, network or predecessor executables. After a deliberate +source edit, `verify.py --write-report` regenerates the receipt only after +all enumerations and controls succeed. + +Base e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8, +selected #7000. The card's selected-binding orientation passed. Live overlap +and main searches checked the rank-three, closed, alternating and radical-lift +formulations and the general completion question. The overlap snapshot covered +558 open PRs, 7,223 Discussion records and all 10,178 tracked top-level package +notes at that base. Nested diffs and unpublished work remain outside that +coverage. [Advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19542394). + +## Limits and implementation bounds + +Only the closed-case lower bound and commuting necessity are new. Exact +attainment uses #6525's cited upper bounds. The theorem is binary and fixes +displacement rank three. Prescribed fixed spectators belong in U. No ambient +enlargement, signed Gaussian realization, physical costs, owner cleanup, +precision, stock, tape, compiler closure or outer admission is supplied. +The five selected assumptions remain. No new kappa or selected-frontier +change is claimed. Lean, Docker and the selected cold replay are not run. +Independent human and formal proof-kernel review are unclaimed. + +There is no recursion or unbounded search. The largest outer census has +1,024 forms; words have four axes, coefficient spaces have 16 elements, +literal spaces have 256 elements and all nested loops have those fixed +bounds. Functions fit within 60 lines. Explicit exceptions remain active +under optimized Python. Managed Python allocations are a documented deviation +from fixed-allocation execution; live collections have the bounds above. +Warning-strict normal and optimized execution and source compilation provide +diagnostics. No static type checker is a declared dependency. Explicit +`--write-report` is the verifier's only mutation. + +## Open next questions + +1. Classify the alternating closed case at displacement rank four and above. + The quadratic obstruction here no longer applies directly; #6525 already + gives a closed r=4 contract attaining six turns. Start with minimal Wall + extensions containing a totally singular subspace of codimension two, + retaining the prescribed radical-lift action. A complete criterion and + constructive attaining words are missing. +2. Bind a qualifying partial contract to an actual signed native contact. + State its source, fixed spectators and phase anchor, then price every + turn, sign correction and physical operation. A short unsigned word alone + gives no recursive supplier improvement. + +## Credit + +The new lower-bound proof and verifier were produced by Nick Petalas. +Ali Romman #6525 supplies the question, interval, escaping construction and +known fixtures. Krzysztof Wojt #5097 supplies the general lower bound and +zero-form completion; Nick Petalas #5085/#6494 supplies earlier residual-form +and rank-one work; Brian / JoyboyBrian #5051 supplies signed partial-contract +compatibility. Credit also David Ganz / Dugongue #4841, Cao Yifan / intqwq, +Cinna Davis, zxv, Jacob Alan Sussman and the native/compiler lineage retained +by those sources. Wall forms and binary quadratic forms are classical; +no literature-priority claim is made. New work is Apache-2.0. diff --git a/research/rank-three-closed-completion/RESULT.json b/research/rank-three-closed-completion/RESULT.json new file mode 100644 index 0000000000..52d7a98c6d --- /dev/null +++ b/research/rank-three-closed-completion/RESULT.json @@ -0,0 +1,46 @@ +{ + "claim_type": "scoped written proof with exact finite corroboration", + "failure_controls": 2, + "quadratic_census": { + "hyperplanes_per_form": 15, + "nonzero_polar_pairs": 210, + "quadratic_forms": 1024, + "totally_singular_pairs": 240 + }, + "schema_version": 1, + "source_sha256": { + "PROOF.md": "76a9d6940954e1713daa69d51ec7f2cc5bd2832f5609cb287db553552875638b", + "README.md": "deedfdd99861da222b810b0d003eeb4e75fd8b6269aa8b564f951afd4fd5bbf7", + "SOURCES.json": "24ec60eb76794700e5551259beead67ab40e3195426b162feca7d5be349126d3", + "TASK.json": "c6ee382f3088b8c1b2e5d9a0b58781ecfd0ff39a9ee767577a972fc98aa525be", + "VERIFY.json": "84376ae6324d6688129491c0b26f779a2cb3c4c7ab3ac692fa5ef6169596be5f", + "verify.py": "6b8bf3627a10826a14d8c38fc74f66be1b21970a25d29a9af62bd52339a9d23a" + }, + "word_census": { + "counts": { + "alternating_rank_two_contracts": 1, + "escaping_radical_lifts": 16, + "gram_topologies": 64, + "hyperplane_restrictions": 960, + "literal_input_vectors": 16384, + "nonalternating_closed_controls": 180, + "omitted_turn_controls": 256, + "wall_basis_equalities": 65536 + }, + "nonalternating_control": { + "axes": [ + 1, + 18, + 20, + 8 + ], + "gram_code": 3, + "hyperplane_mask": 6, + "restricted_rows": [ + 1, + 0, + 4 + ] + } + } +} diff --git a/research/rank-three-closed-completion/SOURCES.json b/research/rank-three-closed-completion/SOURCES.json new file mode 100644 index 0000000000..36b824f989 --- /dev/null +++ b/research/rank-three-closed-completion/SOURCES.json @@ -0,0 +1,44 @@ +{ + "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/rank-two-residual-completion/PROOF.md", + "usage": "provenance", + "git_blob": "5a39770f196692268ba17dfcc4a01cbfe5f7fc40", + "sha256": "9e8b66ca71656833e47ea78635bb46f195076fef33cf26cefabac897256dd19f" + }, + { + "path": "research/rank-two-residual-completion/README.md", + "usage": "provenance", + "git_blob": "8008576fd96f1cb925d5ebb990fa2a58a6a75628", + "sha256": "b9ff73eb40d38453312a1e5d1f5b0580314173f273bccb355c32019301d7c1af" + }, + { + "path": "research/singular-rank-two-pauli/PROOF.md", + "usage": "provenance", + "git_blob": "c8ffbe676f33e14105c188959e47d8aafeaaae3e", + "sha256": "bc43da28cf432e370532cdeb1622ce8efb175d497fe83b632d8560fd27c20a5b" + } + ], + "bibliographic_predecessors": [ + { + "pr": 6525, + "author": "aliromman", + "head": "9797b952ee174f845f682b1a121600416f5c7bd1", + "role": "General interval and escaping upper bound; open closed-case question. No predecessor executable replayed." + } + ] +} diff --git a/research/rank-three-closed-completion/TASK.json b/research/rank-three-closed-completion/TASK.json new file mode 100644 index 0000000000..8d15bde397 --- /dev/null +++ b/research/rank-three-closed-completion/TASK.json @@ -0,0 +1,102 @@ +{ + "schema_version": 1, + "task_id": "formal-interface-lemma", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "formal-interface-lemma", + "question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/gate-operand-parity-lean/README.md", + "research/staged544-certified-endpoint/README.md", + "research/unconditional-batched-crt/README.md" + ], + "methods": [ + "Formalize a missing boundary lemma identified by the selected review.", + "Audit a formal theorem-to-certificate binding independently." + ], + "acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.", + "scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse." + }, + "first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.", + "bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.", + "allowed_variations": [ + "Narrow to one formal lemma or one theorem-to-certificate binding." + ], + "scope_change_triggers": [ + "Formalizing already-covered arithmetic and claiming the full multiplication theorem." + ], + "overlap_terms": [ + "hyperplane end", + "formal interface", + "Lean binding", + "3807", + "3857", + "4100", + "gate-operand-parity-lean", + "staged544-certified-endpoint", + "unconditional-batched-crt" + ], + "existing_checks": [ + { + "scope": "PR #3807: scoped gate-operand parity formalization.", + "evidence": "research/gate-operand-parity-lean/README.md", + "remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.", + "status": "author-checked", + "source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3857: certified real-power moment/endpoint arithmetic.", + "evidence": "research/staged544-certified-endpoint/README.md", + "remaining": "Uniform algorithmic implications, not another endpoint digit.", + "status": "author-checked", + "source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4100: compact-switch formalization proposed as future validation.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Audit the statement and assumptions before a formal proof campaign.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Exact four-versus-five unsigned transvection criterion for displacement-rank-three binary partial isometries with alternating rank-two residual form.", + "scope_change_reason": "Take the r=3 portion of Ali Romman PR6525 Open next question 1 as a written algebraic theorem. No Lean or selected-caller formalization is claimed.", + "bottleneck_link": "A partial native-label completion tariff: rules out all four-turn closed completions and identifies necessary commuting axes. Physical signed costs remain separate.", + "budget_minutes": 60, + "stop_rule": "Ship the first verified original lower bound, without extending to higher displacement rank or physical supplier construction.", + "outcome": "completed", + "evidence": "PROOF.md; exact quadratic and independent four-turn Gram-topology census; generated source-hash-bound RESULT.json.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Classify alternating closed contracts at displacement rank four and above.", + "why_it_matters": "Determines the remaining one-turn completion gap left by PR6525.", + "first_step": "Analyze minimal Wall extensions with a totally singular codimension-two subspace and prescribed radical lifts.", + "blocked_by": "The four-dimensional anisotropic-span argument does not extend directly; known closed r=4 examples already attain the lower endpoint." + }, + { + "question": "Can an actual signed native contact profit from this exact label criterion?", + "why_it_matters": "Unsigned turn count alone does not determine recursive paid rank.", + "first_step": "Fix the full source, spectators and phase anchor; price every turn and physical correction.", + "blocked_by": "No signed native caller or complete physical invoice is supplied." + } + ], + "coordination": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19542394" +} diff --git a/research/rank-three-closed-completion/VERIFY.json b/research/rank-three-closed-completion/VERIFY.json new file mode 100644 index 0000000000..d0bfc52eb4 --- /dev/null +++ b/research/rank-three-closed-completion/VERIFY.json @@ -0,0 +1,32 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact quadratic and four-turn Gram census, literal endpoints, hypothesis and corruption controls, source-hash receipt." + }, + { + "argv": [ + "{python}", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Identical exact evidence and explicit failure controls under optimized Python." + } + ] +} diff --git a/research/rank-three-closed-completion/verify.py b/research/rank-three-closed-completion/verify.py new file mode 100644 index 0000000000..80db47e05a --- /dev/null +++ b/research/rank-three-closed-completion/verify.py @@ -0,0 +1,241 @@ +#!/usr/bin/env python3 +"""Exact finite corroboration of the new rank-three obstruction. + +Standard library only. No predecessor executable or receipt is consumed. +""" + +import argparse +import hashlib +import json +from pathlib import Path + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def parity(value): + return value.bit_count() & 1 + + +def span(basis): + require(len(basis) <= 8, "bounded binary basis") + values = [0] + for vector in basis: + values += [old ^ vector for old in values] + return frozenset(values) + + +def basis_of(vectors): + require(len(vectors) <= 256, "bounded binary vector set") + basis = [] + occupied = {0} + for vector in sorted(vectors): + if vector not in occupied: + require(len(basis) < 8, "binary dimension limit") + basis.append(vector) + occupied = set(span(basis)) + return tuple(basis) + + +def rank(vectors): + return len(basis_of(vectors)) + + +def pairing(left, right): + return parity((left & 15) & (right >> 4)) ^ parity((right & 15) & (left >> 4)) + + +def word_image(value, axes): + require(len(axes) <= 4 and all(0 < a < 256 for a in axes), "word bound") + for axis in axes: + if pairing(value, axis): + value ^= axis + return value + + +def combine(coordinates, axes): + value = 0 + for index, axis in enumerate(axes): + if coordinates & (1 << index): + value ^= axis + return value + + +def bilinear(left, right, rows): + image = sum(parity(row & right) << i for i, row in enumerate(rows)) + return parity(image & left) + + +def quadratic_table(code): + diagonal = code & 15 + edges = tuple((i, j) for i in range(4) for j in range(i + 1, 4)) + table = [] + for value in range(16): + result = parity(value & diagonal) + for bit, (i, j) in enumerate(edges): + result ^= ((code >> (bit + 4)) & 1) & (value >> i) & (value >> j) & 1 + table.append(result) + return tuple(table) + + +def quadratic_census(): + totals = {"quadratic_forms": 1024, "hyperplanes_per_form": 15, + "totally_singular_pairs": 0, "nonzero_polar_pairs": 0} + for code in range(1024): + q = quadratic_table(code) + polar = tuple(sum((q[(1 << i) ^ (1 << j)] ^ q[1 << i] ^ q[1 << j]) << j + for j in range(4)) for i in range(4)) + for mask in range(1, 16): + plane = tuple(x for x in range(16) if not parity(x & mask)) + if any(q[x] for x in plane): + continue + totals["totally_singular_pairs"] += 1 + if rank(polar): + totals["nonzero_polar_pairs"] += 1 + radical = tuple(x for x in range(16) + if all(not parity(row & x) for row in polar)) + anisotropic = tuple(x for x in range(16) if q[x]) + require(rank(polar) == 2, "nonzero polar rank") + require(set(radical) <= set(plane), "radical lies in hyperplane") + require(all(not q[x] for x in radical), "quadratic radical vanishes") + require(len(anisotropic) == 4 and rank(anisotropic) == 3, + "anisotropic vectors cannot span four dimensions") + require(totals["nonzero_polar_pairs"] > 0, "nonvacuous quadratic control") + return totals + + +def topology(code): + axes = [1 << i for i in range(4)] + rows = [1 << i for i in range(4)] + bit = 0 + for i in range(4): + for j in range(i + 1, 4): + if code & (1 << bit): + axes[j] ^= 1 << (i + 4) + rows[i] ^= 1 << j + bit += 1 + require(rank(axes) == 4, "independent chronological axes") + return tuple(axes), tuple(rows) + + +def literal_wall(axes, rows): + images = tuple(word_image(v, axes) for v in range(256)) + for value in range(256): + displacement = images[value] ^ value + coordinates = displacement & 15 + require(combine(coordinates, axes) == displacement, "literal displacement") + for i, axis in enumerate(axes): + require(bilinear(coordinates, 1 << i, rows) == pairing(value, axis), + "triangular Wall form matches literal chronological word") + require(word_image(images[value], tuple(reversed(axes))) == value, + "literal inverse") + for i in range(8): + for j in range(i + 1, 8): + require(pairing(images[1 << i], images[1 << j]) == pairing(1 << i, 1 << j), + "whole symplectic endpoint") + return images + + +def contract_classification(axes, rows, images, plane): + vectors = tuple(combine(x, axes) for x in plane) + radical = tuple(x for x in plane + if all(not bilinear(x, y, rows) for y in plane)) + require(len(radical) == 2, "rank-two restriction has one-dimensional radical") + z = combine(next(x for x in radical if x), axes) + kernel = tuple(v for v in range(256) if images[v] == v) + kernel_plus_d = {k ^ d for k in kernel for d in vectors} + lifts = tuple(v for v in range(256) if images[v] ^ v == z) + require(len(lifts) > 0, "nonzero radical has a source lift") + closed = all(v in kernel_plus_d for v in lifts) + return closed, len(lifts) + + +def word_census(): + totals = {"gram_topologies": 64, "literal_input_vectors": 0, + "wall_basis_equalities": 0, "hyperplane_restrictions": 0, + "alternating_rank_two_contracts": 0, "escaping_radical_lifts": 0, + "nonalternating_closed_controls": 0, "omitted_turn_controls": 0} + control = None + for code in range(64): + axes, rows = topology(code) + images = literal_wall(axes, rows) + totals["literal_input_vectors"] += 256 + totals["wall_basis_equalities"] += 256 * 4 + for omitted in range(4): + damaged = axes[:omitted] + axes[omitted + 1:] + require(any(word_image(v, damaged) != images[v] for v in range(256)), + "omitting a turn must damage the whole endpoint") + totals["omitted_turn_controls"] += 1 + for mask in range(1, 16): + totals["hyperplane_restrictions"] += 1 + plane = tuple(x for x in range(16) if not parity(mask & x)) + basis = basis_of(plane) + restricted = tuple(sum(bilinear(x, y, rows) << j for j, y in enumerate(basis)) + for x in basis) + if rank(restricted) != 2: + continue + closed, lift_count = contract_classification(axes, rows, images, plane) + alternating = all(not bilinear(x, x, rows) for x in plane) + if alternating: + totals["alternating_rank_two_contracts"] += 1 + require(code == 0 and not closed, "four turns force commuting axes and escape") + totals["escaping_radical_lifts"] += lift_count + elif closed: + totals["nonalternating_closed_controls"] += 1 + if control is None: + control = {"gram_code": code, "hyperplane_mask": mask, + "axes": list(axes), "restricted_rows": list(restricted)} + require(totals["alternating_rank_two_contracts"] == 1, "nonvacuous sharp four-turn case") + require(totals["nonalternating_closed_controls"] > 0, "alternation is necessary") + return {"counts": totals, "nonalternating_control": control} + + +def failure_controls(): + axes, rows = topology(0) + wrong_rows = (rows[0] ^ 1,) + rows[1:] + rejected = 0 + try: + literal_wall(axes, wrong_rows) + except ValueError as error: + require(str(error) == "triangular Wall form matches literal chronological word", + "diagonal mutation rejects for the intended reason") + rejected += 1 + try: + word_image(0, (0,)) + except ValueError as error: + require(str(error) == "word bound", "zero axis rejects at the boundary") + rejected += 1 + require(rejected == 2, "both failure controls reject") + return rejected + + +def receipt(): + package = Path(__file__).resolve().parent + source_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 source_names} + return {"schema_version": 1, + "claim_type": "scoped written proof with exact finite corroboration", + "source_sha256": hashes, "quadratic_census": quadratic_census(), + "word_census": word_census(), "failure_controls": failure_controls()} + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("--write-report", action="store_true") + args = parser.parse_args() + report = receipt() + path = Path(__file__).resolve().with_name("RESULT.json") + if args.write_report: + path.write_text(json.dumps(report, indent=2, sort_keys=True) + "\n") + else: + require(json.loads(path.read_text()) == report, "receipt differs from exact replay") + print(json.dumps(report, sort_keys=True)) + print("PASS_RANK_THREE_CLOSED_COMPLETION") + + +if __name__ == "__main__": + main()