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/p104-current-multi-add-rechart-census/NOTICE.md b/research/p104-current-multi-add-rechart-census/NOTICE.md new file mode 100644 index 0000000000..0c1ff995f6 --- /dev/null +++ b/research/p104-current-multi-add-rechart-census/NOTICE.md @@ -0,0 +1 @@ +Apache-2.0. Credit #7334 for the exact fused helper word and #7113 for the signed caller; #7298 and #7362 for directed rank-power arithmetic; #7361 for the inherited multi-ADD method and literal reverse receipt; #7369 for the changed chart-746 component; and #7358 and #7337 for neighboring one-ADD and mixed chart scopes. OpenAI Codex and its subagents materially assisted proof, implementation and independent replay. diff --git a/research/p104-current-multi-add-rechart-census/PINS.json b/research/p104-current-multi-add-rechart-census/PINS.json new file mode 100644 index 0000000000..1b2d73e4dc --- /dev/null +++ b/research/p104-current-multi-add-rechart-census/PINS.json @@ -0,0 +1,11 @@ +{ + "PROVENANCE.json": "8bd6cea02f3d337b1361bc49c122c8b351ea89baa905233be755d920217d3c5d", + "inputs/7334-WORD.json.gz": "4b9fd1187b34ed97c3ac0c760d73531735a5d0ebc5b4d4ab4377160b20d9bb2a", + "inputs/7361-REVERSE.json": "917ddb1a1af768333e9e6dd797f4f99704e8160ea9a8210128b9293e0a7166cc", + "inputs/7369-AGREEMENT.json": "b98f7bcfcf8f8fb640f3d6825a6714418948d4b95581859591ed16fed408dbc9", + "inputs/pricing.py": "f4d0b6c9314b838d882d6d06020f24881c19a3fda97a7c00df87b1e920785182", + "receipts/FORWARD.json": "0956cf029f80588c9b7707eebfe033451d245caf05409806e56b24b41504babc", + "receipts/REVERSE.json": "3109b6d10871f9ff89caa73a3e3a8a248932a11e581764756c00723445452ef8", + "rechart.py": "347a7d90d34f0d7134d4dc68d95f135ee7cd9e002d6176eb5968f85f00db7d43", + "reverse.py": "ac01889cd8e917b5c3f93dcefaa19c159efc18bcdd6973b94b481f08185d0127" +} diff --git a/research/p104-current-multi-add-rechart-census/PROOF.md b/research/p104-current-multi-add-rechart-census/PROOF.md new file mode 100644 index 0000000000..ad64427f7e --- /dev/null +++ b/research/p104-current-multi-add-rechart-census/PROOF.md @@ -0,0 +1,21 @@ +# Common-chart support and exact paid price + +Split each literal role trajectory into segments at its paid MOVEs. An owned INIT or CLEAR also starts or ends a segment. Each ADD or COPY connects the two live segments of its operands, which must share the literal chart. Components are closed under those scalar coframes. A SCALE uses one segment and keeps its coefficient. Discard components touching a main, an owned segment, or an initial or final public boundary. Retain the ones with at least two ADDs. The two source-bound engines classify all literal components independently. + +For a retained component let its old rank be \(d\). Every incident entry chart \(L_i\) is strictly contained in the old chart and every incident exit chart \(U_j\) strictly contains it. A replacement chart \(X\) must satisfy + +\[ +\sum_i L_i\subseteq X\subseteq\bigcap_j U_j. +\] + +With every paid rank positive, the geometry-free integer dimension interval is from \(\max_i(1+\dim L_i)\) to \(\min_j(\dim U_j-1)\). The exact feasible interval intersects it with the lower-span rank and upper-intersection rank. Every dimension in the latter interval has a subspace between the two spans. This argument gives necessary geometry even when a new chart label is allowed. + +At a fixed \(00 else lo)[0 if n>0 else 1] for r,n in delta) + right = sum(n*h(r,lo if n>0 else hi)[1 if n>0 else 0] for r,n in delta) + return 17*left,17*right + + counts, cases = Counter(),[] + for g, members in groups.items(): + if sum(op=='ADD' for _,op in uses[g]) < 2: + continue + counts['multi_add'] += 1 + if any(r not in e for r,_,_ in members): + counts['main_or_owned'] += 1 + continue + if any(endpoint for _,_,endpoint in members): + counts['fixed_endpoint'] += 1 + continue + counts['closed_pure'] += 1 + current, = {c for _,c,_ in members} + d = ranks[current] + edges = sorted(incident[g]) + assert edges and all(w['program'][t][0]=='MOVE' for t,_,_ in edges) + lower = [c for _,c,_ in edges if ranks[c] < d] + upper = [c for _,c,_ in edges if ranks[c] > d] + assert len(lower)+len(upper)==len(edges) + assert all(spaces[c] <= spaces[current] for c in lower) + assert all(spaces[current] <= spaces[c] for c in upper) + min_r = max((ranks[c]+1 for c in lower),default=0) + max_r = min((ranks[c]-1 for c in upper),default=9) + low_space = span(x for c in lower for x in frames[c]) + high_space = set.intersection(set(range(512)),*(spaces[c] for c in upper)) + assert low_space <= spaces[current] <= high_space + first = max(min_r,len(low_space).bit_length()-1) + last = min(max_r,len(high_space).bit_length()-1) + assert first <= d <= last + stock = Counter(abs(d-ranks[c]) for _,c,_ in edges) + + def quote(k): + delta = stock.copy() + delta.subtract(abs(k-ranks[c]) for _,c,_ in edges) + return gain(tuple(sorted((r,n) for r,n in delta.items() if n))) + + relaxed = [k for k in sorted({min_r,max_r}) if quote(k)[1]>0] + if not relaxed: + counts['dimension_nonpositive'] += 1 + continue + feasible = [(k,quote(k)) for k in sorted({first,last}) if quote(k)[1]>0] + if feasible: + counts['geometry_survivor'] += 1 + else: + counts['geometry_exclusion'] += 1 + cases.append({'first_contact':uses[g][0][0],'old_chart':current,'old_rank':d, + 'roles':sorted({r for r,_,_ in members}),'contacts':uses[g], 'moves':edges, + 'relaxed_ranks':[min_r,max_r],'feasible_ranks':[first,last], + 'price_positive_relaxed':[(k,quote(k)) for k in relaxed], + 'price_positive_feasible':feasible,'lower_span':sorted(low_space),'upper_span':sorted(high_space)}) + alarm(0) + print(dumps({'pins':PINS,'counts':counts,'cases':sorted(cases,key=lambda x:x['first_contact']), + 'runner_cap_seconds':40,'paid_zero_disallowed':True,'seed':None},sort_keys=True,indent=2,default=str)) + + +if __name__ == '__main__': + main() diff --git a/research/p104-current-multi-add-rechart-census/replay.py b/research/p104-current-multi-add-rechart-census/replay.py new file mode 100644 index 0000000000..1728456570 --- /dev/null +++ b/research/p104-current-multi-add-rechart-census/replay.py @@ -0,0 +1,81 @@ +"""Authenticate and independently census literal common-chart components.""" +from fractions import Fraction +from hashlib import sha1, sha256 +from json import loads +from pathlib import Path, PurePosixPath +from subprocess import run +from sys import executable, implementation, version_info + +ROOT = Path(__file__).resolve().parent +WORD = 'inputs/7334-WORD.json.gz' + + +def unique(pairs): + result = dict(pairs) + assert len(result) == len(pairs), 'duplicate JSON key' + return result + + +def checked(name, data, pins): + assert sha256(data).hexdigest() == pins[name], name + return data + + +def matched_prior(forward, reverse, old): + assert forward['cases'] == reverse['cases'] and forward['counts'] == reverse['counts'] + assert forward['counts'] == {'closed_pure': 434, 'dimension_nonpositive': 420, + 'fixed_endpoint': 43, 'geometry_exclusion': 14, + 'main_or_owned': 824, 'multi_add': 1301} + assert len(reverse['exact_prior_7361_keys']) == 13 + assert not reverse['new_price_positive_keys'] + assert reverse['exact_prior_7369_key'] == [746, 40834] + changed, = (r for r in forward['cases'] if r['old_chart'] == 746) + assert changed['feasible_ranks'] == old['dimension_interval'] == [5, 6] + assert changed['price_positive_relaxed'][0][0] == old['rejected_rank'] == 4 + assert len(changed['roles']) == old['matched_roles'] == 3 + assert old['head'] == 'aaeec8c0acf01e99a5f331ef363a698d9c084ace' + assert old['matched_positive_offsets'] == 1 + assert all(not r['price_positive_feasible'] for r in forward['cases']) + quotes = [max(Fraction(q[1][1]) for q in r['price_positive_relaxed']) for r in forward['cases']] + assert max(quotes) < Fraction('0.106305391209185') + assert sum(quotes) < Fraction('0.993184112588') + + +def expect_rejection(action): + try: + action() + except AssertionError: + return + raise AssertionError('mutated control passed') + + +def main(): + assert __debug__ and implementation.name == 'cpython' and version_info[:2] == (3, 12) + pins = loads((ROOT / 'PINS.json').read_bytes(), object_pairs_hook=unique) + members = {f.relative_to(ROOT).as_posix() for d in ('inputs', 'receipts') + for f in (ROOT / d).iterdir() if f.is_file()} + assert set(pins) == members | {'rechart.py', 'reverse.py', 'PROVENANCE.json'} + inputs = {} + for name in sorted(pins): + path = PurePosixPath(name) + assert not path.is_absolute() and '..' not in path.parts + inputs[name] = checked(name, (ROOT / name).read_bytes(), pins) + found = [] + for engine, result in (('rechart.py', 'FORWARD'), ('reverse.py', 'REVERSE')): + output = run([executable, '-I', '-B', str(ROOT / engine)], check=True, + capture_output=True, timeout=40).stdout + observed = loads(output, object_pairs_hook=unique) + assert observed == loads(inputs[f'receipts/{result}.json'], object_pairs_hook=unique) + found.append(observed) + raw = inputs['inputs/7369-AGREEMENT.json'] + assert sha1(f'blob {len(raw)}\0'.encode() + raw).hexdigest() == '3aaa7aea617109f65272694e2026609395928030' + old = loads(raw, object_pairs_hook=unique) + matched_prior(*found, old) + damaged = bytes([inputs[WORD][0] ^ 1]) + inputs[WORD][1:] + expect_rejection(lambda: checked(WORD, damaged, pins)) + expect_rejection(lambda: matched_prior(*found, dict(old, dimension_interval=[4, 6]))) + print('PASS_CURRENT_MULTI_ADD_RECHART_CENSUS: 434 closed, 420 price exclusions, 14 geometry exclusions, zero unresolved') + + +if __name__ == '__main__': + main() diff --git a/research/p104-current-multi-add-rechart-census/reverse.py b/research/p104-current-multi-add-rechart-census/reverse.py new file mode 100644 index 0000000000..d35e516a9d --- /dev/null +++ b/research/p104-current-multi-add-rechart-census/reverse.py @@ -0,0 +1,198 @@ +"""Reverse lifetime indexing and BFS for the exact current multi-ADD census.""" +from collections import Counter, defaultdict +from fractions import Fraction +from functools import cache +from gzip import decompress +from hashlib import sha1, sha256 +from itertools import combinations +from json import dumps, loads +from pathlib import Path +from runpy import run_path +from signal import alarm + +ROOT = Path(__file__).resolve().parent +PINS = { + '7334-WORD.json.gz': '4b9fd1187b34ed97c3ac0c760d73531735a5d0ebc5b4d4ab4377160b20d9bb2a', + 'pricing.py': 'f4d0b6c9314b838d882d6d06020f24881c19a3fda97a7c00df87b1e920785182', + '7361-REVERSE.json': '917ddb1a1af768333e9e6dd797f4f99704e8160ea9a8210128b9293e0a7166cc', +} + + +def verify_inputs(): + sources = {} + for path, digest in PINS.items(): + data = (ROOT / 'inputs' / path).read_bytes() + assert sha256(data).hexdigest() == digest, path + sources[path] = data + old = sources['7361-REVERSE.json'] + assert sha1(f'blob {len(old)}\0'.encode() + old).hexdigest() == '24889261999bc4dc9f764d5a0dafbc3845ba5351' + word = decompress(sources['7334-WORD.json.gz']) + assert sha256(word).hexdigest() == '9aa8d6b054ba7eb2289d052c1079b16be518d2f0fbfb244569fa18e3733acdac' + return loads(word), loads(old) + + +def reverse_trace(w): + tape, n = w['program'], w['public'] + cursor = {r: (r, len(tape)) for r in range(n)} + frames = {cursor[r]: c for r, c in enumerate(w['final'])} + fixed = set(cursor.values()) + adj, contacts, transport = defaultdict(set), defaultdict(set), defaultdict(set) + for t in range(len(tape) - 1, -1, -1): + op, r, *payload = tape[t] + if op == 'CLEAR': + assert r >= n and r not in cursor + cursor[r] = r, t + frames[cursor[r]] = payload[0] + continue + outgoing = cursor[r] + if op == 'INIT': + assert r >= n and frames[outgoing] == payload[0] + del cursor[r] + elif op == 'MOVE': + lo, hi, owned = payload + assert frames[outgoing] == hi and owned == (r >= n) + incoming = r, t + frames[incoming] = lo + cursor[r] = incoming + transport[incoming].add((t, hi, 'source')) + transport[outgoing].add((t, lo, 'target')) + elif op in ('ADD', 'COPY'): + s, _, chart = payload + other = cursor[s] + assert r != s and frames[other] == frames[outgoing] == chart + adj[outgoing].add(other) + adj[other].add(outgoing) + contacts[outgoing].add((t, op)) + contacts[other].add((t, op)) + else: + assert op == 'SCALE' and frames[outgoing] == payload[1] + contacts[outgoing].add((t, op)) + assert sorted(cursor) == list(range(n)) + assert [frames[cursor[r]] for r in range(n)] == w['initial'] + fixed.update(cursor.values()) + return frames, fixed, adj, contacts, transport + + +def components(adj): + seen = set() + for vertex in sorted(adj): + if vertex in seen: + continue + group, stack = {vertex}, [vertex] + while stack: + node = stack.pop() + new = adj[node] - group + stack.extend(new) + group.update(new) + seen.update(group) + yield group + + +def frame_space(basis): + points = {0} + for size in range(1, len(basis) + 1): + for terms in combinations(basis, size): + v = 0 + for term in terms: + v ^= term + points.add(v) + assert len(points) == 1 << len(basis) + return points + + +def solve(w, inherited): + n = w['public'] + main = set(w['live']) | {i + 112 for i in w['live']} | set(w['hosted']['X2']) | set(w['hosted']['Y2']) + assert len(main) == 400 and n == 1501 and len(w['program']) == 76466 + frames, fixed, adj, contacts, transport = reverse_trace(w) + spaces = [frame_space(f) for f in w['frames']] + ranks = [len(f) for f in w['frames']] + tariff = run_path(str(ROOT / 'inputs' / 'pricing.py'))['power_bounds'] + k0 = Fraction('0.00364665195644044790699554028334161') + k1 = Fraction('0.00364665195644044790699554028334162') + lower = [Fraction(0)] + [tariff(r, k1)[0] for r in range(1, 10)] + upper = [Fraction(0)] + [tariff(r, k0)[1] for r in range(1, 10)] + + @cache + def priced(deltas): + lo = sum((lower[r] if c > 0 else upper[r]) * c for r, c in deltas) + hi = sum((upper[r] if c > 0 else lower[r]) * c for r, c in deltas) + return str(17 * lo), str(17 * hi) + + counts, rows = Counter(), [] + for group in components(adj): + events = sorted(set().union(*(contacts[s] for s in group))) + if sum(tag == 'ADD' for _, tag in events) < 2: + continue + counts['multi_add'] += 1 + if any(r in main or r >= n for r, _ in group): + counts['main_or_owned'] += 1 + continue + if group & fixed: + counts['fixed_endpoint'] += 1 + continue + counts['closed_pure'] += 1 + chart, = {frames[s] for s in group} + edges = sorted(set().union(*(transport[s] for s in group))) + assert edges and len(edges) == len({t for t, _, _ in edges}) + incoming = [c for _, c, side in edges if side == 'target'] + outgoing = [c for _, c, side in edges if side == 'source'] + assert len(incoming) == len(outgoing) == len(group) + lo = max(ranks[c] + 1 for c in incoming) + hi = min(ranks[c] - 1 for c in outgoing) + low_space, high_space = {0}, set(range(512)) + for c in incoming: + low_space = {a ^ b for a in low_space for b in spaces[c]} + for c in outgoing: + high_space &= spaces[c] + d = ranks[chart] + assert low_space <= spaces[chart] <= high_space and lo <= d <= hi + first = max(lo, len(low_space).bit_length() - 1) + last = min(hi, len(high_space).bit_length() - 1) + assert first <= d <= last + old = Counter([d - ranks[c] for c in incoming] + [ranks[c] - d for c in outgoing]) + + def endpoints(a, b): + out = [] + for rank in sorted({a, b}): + terms = old.copy() + terms.subtract([rank - ranks[c] for c in incoming]) + terms.subtract([ranks[c] - rank for c in outgoing]) + quote = priced(tuple(sorted((r, c) for r, c in terms.items() if c))) + if Fraction(quote[1]) > 0: + out.append((rank, quote)) + return out + + relaxed = endpoints(lo, hi) + if not relaxed: + counts['dimension_nonpositive'] += 1 + continue + possible = endpoints(first, last) + counts['geometry_survivor' if possible else 'geometry_exclusion'] += 1 + rows.append({'first_contact': events[0][0], 'old_chart': chart, 'old_rank': d, + 'roles': sorted({r for r, _ in group}), 'contacts': events, 'moves': edges, + 'relaxed_ranks': [lo, hi], 'feasible_ranks': [first, last], + 'price_positive_relaxed': relaxed, 'price_positive_feasible': possible, + 'lower_span': sorted(low_space), 'upper_span': sorted(high_space)}) + rows.sort(key=lambda r: r['first_contact']) + rebind = {(r['key'][0], min(r['clock_map'][x] for x in r['signed_ancestor_ADDs'])) for r in inherited['outcomes']} + actual = {(r['old_chart'], min(t for t, tag in r['contacts'] if tag == 'ADD')) for r in rows} + assert len(rebind) == 13 and actual - rebind == {(746, 40834)} and rebind <= actual + changed, = (r for r in rows if r['old_chart'] == 746) + assert [t for t, tag in changed['contacts'] if tag == 'ADD'] == [40834, 41179] + assert changed['relaxed_ranks'] == [4, 6] and changed['feasible_ranks'] == [5, 6] + assert not changed['price_positive_feasible'] + return {'counts': counts, 'cases': rows, 'exact_prior_7361_keys': sorted(rebind), + 'exact_prior_7369_key': [746, 40834], 'new_price_positive_keys': [], 'runner_cap_seconds': 40} + + +def main(): + assert __debug__ + alarm(40) + result = solve(*verify_inputs()) + alarm(0) + print(dumps(result, sort_keys=True, indent=2)) + + +if __name__ == '__main__': + main()