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-role230-banked/.gitattributes b/research/p104-role230-banked/.gitattributes new file mode 100644 index 0000000000..4bb5b3f7ff --- /dev/null +++ b/research/p104-role230-banked/.gitattributes @@ -0,0 +1 @@ +peer/source/7669-CREDITS.md -text !eol whitespace=cr-at-eol diff --git a/research/p104-role230-banked/ASSETS.json b/research/p104-role230-banked/ASSETS.json new file mode 100644 index 0000000000..bd49207c9b --- /dev/null +++ b/research/p104-role230-banked/ASSETS.json @@ -0,0 +1,450 @@ +{ + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "ci_bridge_commit": "0eabc624a9bc9ed2847719efd63390db4d297df4", + "comparator": { + "caller_sha256": "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf", + "head": "28b2af322a1fab01b3734365988930920f9dda48", + "pivot_sha256": "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85", + "pr": 7674, + "published_receipt_sha256": "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38", + "science": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "source_word": "ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d" + }, + "files": [ + { + "bytes": 11357, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "261eeb9e9f8b2b4b0d119366dda99c6fd7d35c64", + "path": "LICENSE", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/LICENSE", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "upstream_path": "research/p104-banked-transfer-pivots/LICENSE" + }, + { + "bytes": 4767, + "path": "data/CONTACTS.json", + "provenance": "Original exact role-230 splice on published ee251f60, with unchanged source clock keys and sparse contact census", + "sha256": "9e1d2b56750dee78be16b4514deae18dc886767dc9f92f21e1c6e0f10f6215dd" + }, + { + "bytes": 5896, + "path": "engines/application/SOURCE-PINS.json", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "166eeb4872d805a938608b325c5494b792b9eb9948481fa9216fbc1fd4361315" + }, + { + "bytes": 9677, + "path": "engines/application/bank_cost.py", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "8839ec35f4f6086bc9047cfa021bb60a35ac622ca56fcc5f6c08bac307f8ea56" + }, + { + "bytes": 3702, + "path": "engines/application/data/PHASE-BASES.json", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "325a1eb4aa7fe5f918b1d8344b88ad132ef4606268bccec20f223ace5feda18b" + }, + { + "bytes": 14024, + "path": "engines/application/vendor/binding16.py", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "589058311e44f2d8909495c005bee6d54828ebe561d4673b599193d269006170" + }, + { + "bytes": 7783, + "path": "engines/application/vendor/caller16.py", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "ced48867f07ca0143604aa98cfd74fa7453696b9d3221f7c230d73e9ab9ba81f" + }, + { + "bytes": 19068, + "path": "engines/application/vendor/upstream_application.py", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "d98987db98553dc55bfc80e3ca47abfcd51c57af6f8cda61101391d8eae94184" + }, + { + "bytes": 18982, + "path": "engines/application/verify.py", + "provenance": "Paired exact #7674 application verifier, exact ancestor and data bindings in co-located SOURCE-PINS.json", + "sha256": "c057e34919111fa55734517c063d2fb23f8a4f10a3f7452b1f1ce173b95f08df" + }, + { + "bytes": 18186, + "path": "engines/check_banked_provider_cost.py", + "provenance": "Independent complete banked resource audit with physically separate staging streams", + "sha256": "e369ffbf0b96a343b4c06b07e7bd1436f860f6a95070de0371ed7c6c38a5c036" + }, + { + "bytes": 8469, + "path": "engines/check_price.py", + "provenance": "Independent signed rational moment evaluator, derivative and extra fee exclusion", + "sha256": "446c8ebddf5b1e56d43b8d7f2ad3c1c9ba018a18105b207a0ac9e30386878a10" + }, + { + "bytes": 6824, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "166841a037f069249f6f7f6dedb89248812f59e2", + "path": "engines/frozen/clifford_exact.py", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/research/shared-wire-split-composition/frozen/clifford_exact.py", + "sha256": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962", + "upstream_path": "research/shared-wire-split-composition/frozen/clifford_exact.py" + }, + { + "bytes": 9553, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "fda2a852e9937e42fe40df0707694465ca7c1b48", + "path": "engines/frozen/compare_recursive_invoices.py", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/scripts/compare_recursive_invoices.py", + "sha256": "3930c22c11da7bc6042cfeb6e459ecb06e4478430037bee3469d034353855fc6", + "upstream_path": "scripts/compare_recursive_invoices.py" + }, + { + "bytes": 4593, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "ca50f8021fc3238a58fd420383f4619a8d008ace", + "path": "engines/frozen/evaluate_recursive_power.py", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/scripts/evaluate_recursive_power.py", + "sha256": "52b20f41fd0bb55fa88dccd6015af2ce358917817b9506720f3e60ce681cc3ad", + "upstream_path": "scripts/evaluate_recursive_power.py" + }, + { + "bytes": 12483, + "path": "engines/frozen/field_interpreter.py", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/25ede76cfead37a71fa2ae8d038f3a25819c6ce6/research/p104-180-contact-application/src/native/engines/physical.py", + "sha256": "e76bc78b132607890b2d9ea234d3a52e608e0e919bdc48308cc0727a2a07c73e" + }, + { + "bytes": 12323, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "2c209dfa9cfade3bc20ac5fc9d876b433a147f8c", + "path": "engines/frozen/native_verify.py", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/research/shared-wire-split-composition/frozen/native_verify.py", + "sha256": "3049471905b47b385c88378a1a3be7a18b8858aadd035b8a6da2f4a03b470f38", + "upstream_path": "research/shared-wire-split-composition/frozen/native_verify.py" + }, + { + "bytes": 10059, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "cd19f356a5549f6b70557095e7745cdddde0485c", + "path": "engines/frozen/selected-bit-ambient.json", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-admission/bit-ambient.json", + "sha256": "437ad2f9e7956e7f2b477b546f53a6c8cfa0567e207024300e9a7e58d3c0202c" + }, + { + "bytes": 2891, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "c9b816f8445be9dc19b2259e03e9d8709d18c87a", + "path": "engines/frozen/selected-claim.json", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/certificates/frontier7000/CLAIM.json", + "sha256": "3f8add8252adb223b60418ec69351a69b6b5edfe601ec1c6b4b65cd9e2afd9b2" + }, + { + "bytes": 10887, + "commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "git_blob": "7291ce5ab9c59f07ead921fbad9966b4a54e3292", + "path": "engines/frozen/selected-validation.json", + "provenance": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-application/VALIDATION.json", + "sha256": "e1374a98b240d7f9f2cca2a1e74b93f240b1bfc94b8cc4b94a385a50281d494e" + }, + { + "bytes": 21899, + "path": "engines/graph.py", + "provenance": "Independent stable-MOVE-key graph construction, unchanged 15-pivot replay and forward/adjoint wire checker", + "sha256": "7acf26e997e8d659b8c61fbaa675d6478fcdffff1600f45c6722824497fdea37" + }, + { + "bytes": 127065, + "path": "engines/native/MAP-CUSTODY.json.gz", + "provenance": "Exact #7674 paired DAG phase inventory, standalone verifier and underlying compact immutable matching recipe custody", + "sha256": "18cd4ff7bfaab88dc0c13fba636d1355350cd6199f83ef18c9fe477b33460d23" + }, + { + "bytes": 3798, + "path": "engines/native/bank_complete.py", + "provenance": "Recheck actual paired native phases and whole-tape receipt closure", + "sha256": "a8278778bc2d6b637f12b3cdb2f2bea55d4c220f59e3410ed752501bcb028d7b" + }, + { + "bytes": 10153, + "path": "engines/native/bank_dense.py", + "provenance": "Exact #7674 paired DAG phase inventory, standalone verifier and underlying compact immutable matching recipe custody", + "sha256": "2c71c0a15380649ebe11f914c25d79c4618bed7a9ce2285560e77f2148bc5e7b" + }, + { + "bytes": 19320, + "path": "engines/native/bank_phase.py", + "provenance": "Exact #7674 paired DAG phase inventory, standalone verifier and underlying compact immutable matching recipe custody", + "sha256": "6167457bd1e6ce8b278ae90f488d2035f9d237be01d2cb1093ec5bb55c583fb4" + }, + { + "bytes": 3491, + "path": "engines/native/custody.py", + "provenance": "Exact #7674 paired DAG phase inventory, standalone verifier and underlying compact immutable matching recipe custody", + "sha256": "58bfd0ecfbdac40fb212bfafe8286e5bed3693dfa1b8b444a7a28f87acff9884" + }, + { + "bytes": 8342, + "path": "evidence/APPLICATION-ORDINARY.json", + "provenance": "Guarded actual paired #7674 candidate and peer verification output", + "sha256": "b52e0a4770d4a7311635c4917273f1a1d03956d925565819bdd8daf6d3ac9734" + }, + { + "bytes": 1263, + "path": "evidence/APPLICATION-RESULT.json", + "provenance": "Guarded actual paired #7674 candidate and peer verification output", + "sha256": "b1af8b101a40f25eea55a8b58443794a7db708389ad66c20adefbace12828e09" + }, + { + "bytes": 2594, + "path": "evidence/DENSE-1000000009.json", + "provenance": "Guarded actual paired banked graph held-array execution on a declared prime", + "sha256": "012785e84bfcd12041e99036358ecfcb391a23130cea5c045e39f42795408d18" + }, + { + "bytes": 2046, + "path": "evidence/DENSE-998244353.json", + "provenance": "Guarded actual paired banked graph held-array execution on a declared prime", + "sha256": "75b11509ae79be3b33cd62229ccad25cfebb5f89ec0d958c220d11c21225b2d5" + }, + { + "bytes": 5568, + "path": "evidence/INDEPENDENT-PRICE.json", + "provenance": "Guarded independent exact price brackets and rank-one mutation on both frozen graphs", + "sha256": "80eb79031041245d4e62e2a64505a9de88a21f8e7ca0d67a9e71df14547cbb03" + }, + { + "bytes": 2338, + "path": "evidence/INVOICES.json", + "provenance": "Guarded actual paired #7674 candidate and peer verification output", + "sha256": "a9aecf52d99d5370506b9dc6d03799241bebd2c03bbdcfa2dd5f45ec03c9d70d" + }, + { + "bytes": 2802, + "path": "evidence/NATIVE-RESULT.json", + "provenance": "Completed paired native graph evidence and phase/dense bindings", + "sha256": "54e1ed3d604f63e9b6fe902cb144c282b14c361c7330bb4df6b7f4a7266d8b80" + }, + { + "bytes": 2300, + "path": "evidence/PHASE-RESULT.json", + "provenance": "Guarded actual paired native catalogue on both banked graphs", + "sha256": "50b05bdc2805d709761ce5c4b42e7ec352141366f5cc6031df9f8779e8872735" + }, + { + "bytes": 121248, + "path": "evidence/PRICE-OUTER.json", + "provenance": "Guarded actual paired #7674 candidate and peer verification output", + "sha256": "8e29f3ebb19c849884cfb87ef39431616774acfe95fa28a3cfe2e124abc6d202" + }, + { + "bytes": 7456, + "path": "evidence/PROVIDER-RESULT.json", + "provenance": "Guarded independent paired cost receipt, complete four-stream layout", + "sha256": "65aee4b27649605a4626e16520feabec4ea05cb2d20c042f503ddaaeb9ccd5f1" + }, + { + "bytes": 14786, + "path": "evidence/PROVIDER-SOURCE-REVIEW.md", + "provenance": "Independent full-view provider source review b867be9a\u2026 with two proof links relocated to the package receipts.", + "sha256": "3ad72faca26224e468428eea84ac15438e1b4833d5ef330b8e8f31988309ea32" + }, + { + "bytes": 4283, + "path": "evidence/WIRE-RESULT.json", + "provenance": "Actual guarded both-orders exact wire and pivot result", + "sha256": "cde8b602d182ece20f55616decab1bf5c2b64e877770c20106afca44ff08752d" + }, + { + "bytes": 1697, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "951f081717e0769f3bcc0f442f133965c064d2ce", + "path": "peer/NOTICE", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/NOTICE", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "382537634a3d9fa0a8089d6121a506a399382f9310088b1f29586dcc93eec92d", + "upstream_path": "research/p104-banked-transfer-pivots/NOTICE" + }, + { + "bytes": 8477, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "feede77664be2de84437dc1ef144ab6974b1e44c", + "path": "peer/PIVOTS.json", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/PIVOTS.json", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85", + "upstream_path": "research/p104-banked-transfer-pivots/PIVOTS.json" + }, + { + "bytes": 13018, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "11e0617c58d7d7e91f0fbb986690f78f6f76c224", + "path": "peer/RESULT.json", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/RESULT.json", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38", + "upstream_path": "research/p104-banked-transfer-pivots/RESULT.json" + }, + { + "bytes": 2483, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "489f8a60e98dcade0082b29c66448c8af5963f33", + "path": "peer/SOURCE-PINS.json", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/SOURCE-PINS.json", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "8fe48d96e2cc39ae92b0ea9d37f809005b5debc7cf4cadaef33e1674f979aeb8", + "upstream_path": "research/p104-banked-transfer-pivots/SOURCE-PINS.json" + }, + { + "bytes": 1581, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "f51fc62b8a70baee2bb8a04be73795efadc4b451", + "path": "peer/SOURCES.json", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/SOURCES.json", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "76818b74ee05a1a562813b1385b3609dea2bb548c260ebda1b3f8a7aeab236c9", + "upstream_path": "research/p104-banked-transfer-pivots/SOURCES.json" + }, + { + "bytes": 5804, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "945c27d8c49b206f4deeb48eaf88df74c4042b3b", + "path": "peer/caller.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/caller.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "9bfb77250ca4826c1098b896769dc504b587c8c0dac634dd07012150fc8dde37", + "upstream_path": "research/p104-banked-transfer-pivots/caller.py" + }, + { + "bytes": 4462, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "3ac4634c210d6f5b66dfc26fa8360f6f36bbd418", + "path": "peer/catalogue.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/catalogue.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "11b1b270e366f68bcae333e31716613f1cb9f0ac2ed3e687d70f8ebd7bc7c9c1", + "upstream_path": "research/p104-banked-transfer-pivots/catalogue.py" + }, + { + "bytes": 4786, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "3e09f65fe33e162e1a5e2e0433b7ea4483759b3a", + "path": "peer/native.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/native.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "788465324eb8693a698c75cb3dfdf1b82297324d5583910107ecad4600645e43", + "upstream_path": "research/p104-banked-transfer-pivots/native.py" + }, + { + "bytes": 8209, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "0ebc1925c40cc6c11af59e405221ea51801a6e92", + "path": "peer/network.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/network.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "a9169fd6ad0a13c69cf39bd32649d53256f6d6fa2ed2ceda854f848b64f4c546", + "upstream_path": "research/p104-banked-transfer-pivots/network.py" + }, + { + "bytes": 4404, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "2ec7f5e01b480d1abc80fb826c3124c17a232c2a", + "path": "peer/physical.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/physical.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "d887d0eb5a97bc8e6107e60e19fccf2bd2637b2f0510f1d9356e9a4ecfe5a475", + "upstream_path": "research/p104-banked-transfer-pivots/physical.py" + }, + { + "bytes": 1326, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "6ce1bc49a3612c9e906df02de81bcba84be8e803", + "path": "peer/source/7663-NOTICE", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/7663-NOTICE", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "5fd4367578d2339fbdcd7dc116b6c12cb4fa72e92d2e3d67be537a36c8bd9d40", + "upstream_path": "research/p104-banked-transfer-pivots/source/7663-NOTICE" + }, + { + "bytes": 7588, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "bbee2437f012c3268eb5cd920adfa37394c1de72", + "path": "peer/source/7669-CREDITS.md", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/7669-CREDITS.md", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "706c6c852e87e371ddf1828244b2f0c2b00279728818023aa911c8947d69ab83", + "upstream_path": "research/p104-banked-transfer-pivots/source/7669-CREDITS.md" + }, + { + "bytes": 585407, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "1273c83178693e1627a2324680907f9b0e95e995", + "path": "peer/source/K372-2-WORD.json.gz", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/K372-2-WORD.json.gz", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "631babeca90e78c5caac713484fe618328b9beee8294baef6ac45ffc9a75dd3b", + "upstream_path": "research/p104-banked-transfer-pivots/source/K372-2-WORD.json.gz" + }, + { + "bytes": 11854, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "26a75a1ae32cb4944a65281cfb08775967cb39a0", + "path": "peer/source/caller.json.gz", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/caller.json.gz", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "d889996a337f648087208ab51c98eaf052705d4fca88b5d01b6e9257a829897a", + "upstream_path": "research/p104-banked-transfer-pivots/source/caller.json.gz" + }, + { + "bytes": 1238, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "1bc9b4da2b8398954cd7a49356eb9d397785d0a6", + "path": "peer/source/gate-NOTICE", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/gate-NOTICE", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "cadbc642ca84311d2c7a6cf704c7828cb4cf77e3c784b66e4c6e8a5c28002fb8", + "upstream_path": "research/p104-banked-transfer-pivots/source/gate-NOTICE" + }, + { + "bytes": 6886, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "e24dc46079b4c25152f5afc096dda2ce8ee58ff5", + "path": "peer/source/interval_gate.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/interval_gate.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "60a743d13f668ef86db4b8215b4d5d04430a671ba6f1fe06d9c1c4c3dfe86da5", + "upstream_path": "research/p104-banked-transfer-pivots/source/interval_gate.py" + }, + { + "bytes": 574, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "4cfe4f0fe98a820153cac58747dd80fb2a2402e6", + "path": "peer/source/parent-invoice.json", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/parent-invoice.json", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "c79d8c51ad34c7c14134c41d3ae132ab91101e8e24674b52a2abfa191de3fd00", + "upstream_path": "research/p104-banked-transfer-pivots/source/parent-invoice.json" + }, + { + "bytes": 13849, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "23368c8750e6d981ee10664187c6a2c3859be542", + "path": "peer/source/source-edits.json", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/source-edits.json", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "05b84f9578fddc7adc7805f20afdfe5ea679d298b2232d7f718193185f471656", + "upstream_path": "research/p104-banked-transfer-pivots/source/source-edits.json" + }, + { + "bytes": 5422, + "commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "git_blob": "2de8722b8016ca22e408fea7ab1999bc73bed17e", + "path": "peer/verify.py", + "provenance": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/verify.py", + "refreshed_head": "28b2af322a1fab01b3734365988930920f9dda48", + "sha256": "0b3bf41e3c486538ac124e7f265d1b82549dfb8a7351879332e63aba5ae74fac", + "upstream_path": "research/p104-banked-transfer-pivots/verify.py" + } + ], + "schema_version": 1 +} diff --git a/research/p104-role230-banked/INPUTS.md b/research/p104-role230-banked/INPUTS.md new file mode 100644 index 0000000000..f76b230f67 --- /dev/null +++ b/research/p104-role230-banked/INPUTS.md @@ -0,0 +1,27 @@ +# Exact source capsule and replay checks + +`peer/` contains the original scientific dependencies of #7674 at `26b6c469aa6c4aa04322ce25a22150f90e5fb14e`. The refreshed head `28b2af322a1fab01b3734365988930920f9dda48` authenticates those same blobs. `peer/source/` carries the one original K372 gzip, the exact source edit and actual caller gzip. `peer/PIVOTS.json` is the only executable pivot list. [Manifest](ASSETS.json) · [Peer source pins](peer/SOURCE-PINS.json) + +`data/CONTACTS.json` carries the source-anchored role-230 replacements. Both banked graphs are rebuilt in scratch and checked by their decoded canonical hashes and compressed transport hashes. The retained [wire result](evidence/WIRE-RESULT.json) identifies every completed saved-signal check, the exact output digests and the deterministic control results. No second copy of the scientific graph source is needed for the native stage. + +The frozen phase producer/checker and the directed price evaluator and its helper live in `engines/frozen/`. Where a subprocess imports an original #7674 module, it uses those exact local bytes and the vendored peer path. `SOURCES.json` is for upstream Git provenance. `ASSETS.json` authenticates transitive proof inputs inside an unpacked source capsule. Output artifacts and caches are placed in scratch. The source, comparator pivot set and literal caller have independent pins. + +| Executed scope | Required replay and controls | Observed resource use | +|---|---|---:| +| Exact wire graph | Prove all fifteen saved signals, both full exact wire directions and the actual dependency closure. Reject a same-price wrong scalar, nonlocal donor and cocharted cycle. | 40.80 s wall, 318,652 KiB | +| Actual paired 16-call application | Complete signed bills, directed prices, outer predicates, exact paired grid and normalized bank dispatcher. Reject an extra paid rank-one fee. | 25.47 s wall, 238,228 KiB | +| Independent stored graph cost audit | Recount exact matched source/caller pre-products, positive private extent, complete copies, staging, phase and `q` movement budgets. | 3.85 s CPU, 117,652 KiB | +| Independent rational price | Recheck both crossing brackets, negative interval derivative, the improvement at the baseline upper, and a single-fee sign reversal. | 0.53 s wall | +| Native phases and dense tapes | Fresh signed Pauli and phase comparison on all 3,030 ordered pairs, 19 complete forward and adjoint literal column pairs, 104 main boundaries and two full held-array runs. Both actual first-prime fault variants alter 53 distinct public roles each. The second prime uses the unmodified paired graph. | 145.13 s CPU combined, 612,540 KiB peak | + +`paired` runs the exact graph, caller, complete resource and independent price scopes within 280 seconds. `native` rematerializes the identical graph hashes and executes the full native checks within 400 seconds. The measured materialization cost is 18.92 seconds wall. The two registered commands allocate 680 seconds total and at most 2 GiB address space per command. They use Linux CPython 3.12 and the standard library, write to fresh isolated scratch, check all local assets before and after each replay, and read back both exact scientific graph hashes. [VERIFY.json](VERIFY.json) + +```sh +python3.12 -I -B verify.py integrity +python3.12 -I -B verify.py paired --out /path/to/new-paired-directory +python3.12 -I -B verify.py native --out /path/to/new-native-directory +``` + +Omit `--out` to use temporary cleanup. In the repository run `python3.12 -B scripts/research_package.py --package research/p104-role230-banked`. The upstream source provenance check uses the task catalogue and selected record at pinned canonical main. The standalone checks use the archived package-relative files. + +The release branch carries ToikY's unchanged CI bridge at `0eabc624a9bc9ed2847719efd63390db4d297df4` as repository workflow context. The banked package has its own registered scopes and targets the two exact #7674 graph hashes above. diff --git a/research/p104-role230-banked/LICENSE b/research/p104-role230-banked/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/p104-role230-banked/LICENSE @@ -0,0 +1,201 @@ + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "[]" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright [yyyy] [name of copyright owner] + + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + You may obtain a copy of the License at + + http://www.apache.org/licenses/LICENSE-2.0 + + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. diff --git a/research/p104-role230-banked/NOTICE b/research/p104-role230-banked/NOTICE new file mode 100644 index 0000000000..4654631de0 --- /dev/null +++ b/research/p104-role230-banked/NOTICE @@ -0,0 +1,9 @@ +Apache License 2.0. Research prepared for Clear1nsight with substantial OpenAI Codex assistance. + +Ali Romman supplied the fifteen exact banked pivots and the frozen #7674 baseline, along with the complete signed 16-call graph and application method. The original notices remain at peer/NOTICE, peer/source/7663-NOTICE and peer/source/gate-NOTICE. Read peer/SOURCE-PINS.json for each ancestry binding and ASSETS.json for the exact vendored bytes at scientific commit 26b6c469aa6c4aa04322ce25a22150f90e5fb14e and refreshed head 28b2af322a1fab01b3734365988930920f9dda48. + +SYLforge supplied the #7669 composition, native source pins and literal caller. Its preserved parent provenance is peer/source/7669-CREDITS.md. Retain DreamingOfClouds' #7641/#7658 lineage, Clear1nsight's integer scalar/contact work including #7612, ToikY's #7643 contact-rechart precedent, Rohan Arun's #7113 signed-caller lineage, 5080's helper work, and all other contributors named in the original records. Ali Romman's #7663 exact-grid and extent proof and #7666/#7670 selection and guide work supply relevant implementation precedents. Jerry Chen (CubeJerry) supplied the selected #7000/#7001 applications and #7586 typed initialization. Douglas Colkitt and the authors in the original notices supplied the frozen native compiler, independent checker, price evaluator and package infrastructure. + +The release base reuses ToikY's exact shared CI and historical replay sync 0eabc624a9bc9ed2847719efd63390db4d297df4 above canonical e54523517d0f03e58352e647c403a5af3e525a57. This workflow provenance is separate from the banked construction and its mathematical comparison. + +This package credits the original role-230 splice and its same-contract transfer to the unchanged fifteen-pivot graph, the independent exact wire and price replays, matched complete resource accounting and source-bound native and caller verification. The original works retain their authorships and licenses. diff --git a/research/p104-role230-banked/PROOF.md b/research/p104-role230-banked/PROOF.md new file mode 100644 index 0000000000..df402cf3a5 --- /dev/null +++ b/research/p104-role230-banked/PROOF.md @@ -0,0 +1,55 @@ +# Paired exact banked role-230 construction + +## Stable paid graph and local identity + +The #7674 loader authenticates the same 150,522-event #7669 source word by rebuilding it from its original K372 artifact and twelve old exact edits. Its fold records a rational source form for each live paid MOVE, labeled by that MOVE's source event index, and one form for each public output. Negative token `~r` denotes independently supplied public role `r`. Every scalar read must be cocharted with the consumer. Every retained paid edge and scalar incidence determines the finite dependency order. [Pinned source loader](peer/network.py) + +Apply the single six-block literal role-230 edit in [CONTACTS.json](data/CONTACTS.json). Preserve stable original MOVE labels for the two rerouted edges and for all other paid slots. Quotients by the canonical ordered-chart Clifford set the physical frame, while the rational source forms act on normalized rows. Let `X`, `Y` and `Z` be the three incoming normalized signals of roles 230, 496 and 994. At the affected cut `X` and `Z` begin in chart 261 and `Y` begins in chart 730. The child sends `H=X+Z/2` to chart 912 and `U=2(Z−X)/3` to chart 730. It then sends `V=Y−U/2` to chart 912. Three old consumers of the `Y+X` read are rewritten to consume `V+2H/3`. The exit to chart 913 consumes `3U/2−Y` and the exit to chart 127 consumes `2H/3−V/2`. + +Exact expansion gives the same three exposed rows `Y+X`, `Z−X−Y` and `(X+Z−Y)/2`. The role-984 half input reaches the same later reads. The two paid route changes are `261→730` to `261→912` at 97471 and `730→127` to `912→127` at 102393, with dimension differences respectively `3→4` and `3→2`. The ordered-basis native comparison binds the actual Gaussian phase and forward and adjoint column maps of these new routes. The normalized scalar identity alone concerns coefficients and restored signals. + +## Compatibility with the fifteen fixed pivots + +The paid forms rewritten by the local edit are at source keys 97471, 97473, 97475, 97479, 101174, 101176, 102393 and 102653. The fifteen published sender, receiver, drop and lead witnesses remain byte-identical and use the old stable namespace. The three affected scalar charts are 261, 730 and 912. The pivot rewrite charts avoid these both in forward orientation and after transpose. Forward routes exiting 912 enter 148, 228 or 127. Charts 148 and 228 can reach only the terminal chart 127. The new edge goes directly to 127. The chart closure and actual cochart-checked acyclic schedules forbid feedback into the local inputs. [Published pivot sequence](peer/PIVOTS.json) + +The fresh exact verifier reconstructs both graphs and independently checks each saved-signal identity in its original orientation. The full normalized forward and adjoint comparisons each verify all 1,501 public rows and 7,640 equal exposed noninput rows. Only the three named internal signals differ. The exact controls reject a same-price wrong scalar at the exposed role-994 return, a nonlocal chart incidence and a same-chart cycle. This carries the source graph contract and all paid identities into the paired application. [Wire result](evidence/WIRE-RESULT.json) + +## Full matched price and application conditions + +The construction uses the same exact caller bytes for both graphs. It has 16 chronological calls on ambient rank 137, with 96 A and eight B ports, 400 native main slots, 3,536 root owners and 17,616 independent fresh native helper arrays. All 6,142 paid edges per native invocation are positive rank. Each helper returns its own normalized input on its actual complete boundary. Roles 325 and 1087 in particular have separate arbitrary inputs at chart 3 with a rank-`4f` same-owner map to chart 237 at multiplicity `f`. The phase-correct boundary is `T_237 T_3⁻¹` tensored across the active fibres and extended by identity on spectators. Their entrances, conversions, finite movement and complete returns are included in the shared bill. [Actual caller](evidence/APPLICATION-RESULT.json) · [Native and helper evidence](evidence/NATIVE-RESULT.json) + +Relative to #7674, the literal paired census gives paid delta `16(e_2−2e_3+e_4)` and every productive rank agrees. For `0<κ<1`, strict concavity of `f(r)=r^(1−κ)` gives positive target-minus-paid increase `16(2f(3)−f(2)−f(4))`. The independent directed rational evaluator proves the bracket signs, a negative derivative across the comparison interval through the selected BIT floor and positive margin in the child at the baseline upper point. It rejects one extra paid rank-one fee at the comparator upper point. The matched baseline bracket is `(0.00372604555571, 0.00372604555572)` and the child bracket is `(0.0037261023900, 0.0037261023901)`. The guarded child lower `0.0037261023899` exceeds the upper by `2841709/50000000000000`. Both actual caller/compiler checks pass 54 strict and four functional outer predicates. Both use carrier power 1,920, conservative compiler ambient cap 153, selected BIT rank 134 and floor `0.00376669`, written log power 2,287 and `H=14,558,800,000,000,000,000`. [Actual prices and outer checks](evidence/PRICE-OUTER.json) · [Independent price control](evidence/INDEPENDENT-PRICE.json) + +The native proof freshly checks the signed Pauli action and absolute Gaussian phase for 3,025 forward ordered-chart pairs and five additional fixed pivot directions. It binds 3,011 exact same-ordered-basis archived bodies and checks every one of the 512 forward and adjoint columns on 19 changed or unbound pairs. It binds all 104 main adapters and 96 hosted correspondences. At prime `1000000009` and seed 11, the actual changed-MOVE quarter-phase mutation and separate same-price scalar-sign mutation at slot 97471 each change exactly 53 distinct public roles. At prime `998244353` and seed 37 the unmodified whole graphs reproduce all outputs. Both finite runs check 400 main and 1,101 helper output arrays of width 512, alongside the full banked graph schedule. [Native catalogue and held arrays](evidence/NATIVE-RESULT.json) + +## Exact common root and bank costs + +Both graphs check exact divisions on native certificate grid `2025 × 2^18`, with scaled row mass bound `55,817,215,425/32`. They visit 8,533,666 and 8,535,132 exact forward products respectively. The actual caller has odd scale 2025 and height 9. Both native and caller physical boundaries charge multiplication by 2025 on entrance and exact division by 2025 on complete return. The independent cancellation-free prefix estimate over both graph and caller is `17782499795678641337625/1024 < 2^64`. One unfinished context adds at most 27 binary denominator bits. Use `c=2 max(27,64)=128` in both cases. Its depth factor `cK*` has bit length 14,080 below the checked shared `H`, with `K*=1920·153^1920·(H+1)^2`. Consequently the inherited path bound gives `ctQ_0` are `p′=p+Q_0`, `h′=Q_0+1` and `D=D_total−Q_0`. The selected direct-boundary case applies when `D_total≤Q_0`. At the full output, `H_0^(⊗d)=b^d S_d C^(⊗d) S_d` with `b=(1−i)/2` and `b^d=(−i/2)^floor(d/2)b^(d mod 2)`. Charge both complete phase passes, the shift and phase from the paired factors, and at most one remaining `b` pass. Reserve the additional `2d+4` temporary bits for the final output and apply one final truncation after the complete normalization. [Selected boundary dimensions and normalization, sections 5–7](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md) + +For a separately rounded variant, a single residual tick allowed by a total return at the ideal zero signal in chart 912 at slot 97471 would be read by row 101174 with coefficient `−1/3`. The scheduled scalar pre-product would require `−1/3` of that tick. The exact complete-root induction supplies the stronger premise that rules out this state. + +For public width `n=1,501` and paid rows `k=6,142`, reserve `2n+2k+4=15,290` independent full scientific homes per native invocation and 244,640 in the raw caller. They include entry snapshots, paid source accumulators, paid return snapshots, terminal accumulators and four temporaries. Each call has its own guarded selector and retains all parked backing until that owner's prescribed return. The original chronological scalar state and its CLEARs are folded into forms. The actual executor initializes, accesses, copies, installs and retires these complete banked fields. None of the proof terms in a discarded chronological certificate become a runtime donor read for physical erase. + +Use a complete padded stage shape `L′ = N_c(2(W+26)+3)` for `N_c` complete addresses. Let `b=15,290`. The `b` numerical homes include four ordinary scratch homes. A guarded slot zero is a separately charged selector origin. The seven-tape selector and guide have one bank data head. Provide four additional, separately movable guarded streams of `L′+2` cells each for the running accumulator, preserved donor copy, product and quotient/install payload. To copy between stores on the bank tape, first select and copy the complete source into the independent donor stream and return both heads. Preserve that stream while selecting the destination, then copy from it into the selected target and return again. A running accumulator stays on its own stream during either selection. Park all four streams with their ancestor context. [Full-view source proof](evidence/PROVIDER-SOURCE-REVIEW.md) + +The isolated INIT or CLEAR uses a guide to write the complete arbitrary old payload and returns both heads in `2L′+3`. For addressed slot `s`, the retained ruler bounds each full reset or selection by `(14s+9)L′+24s−7popcount(s)+27ℓ(s)+39s+59`, with bit length `ℓ`. Its maximum on slots 1 through `b` is `A=214069L′+963637`. Each selected copy leg pays in addition at most `C=128(L′+2)+64` for the typed full copy, installation and head returns. For `t` nonzero terms, `k` paid rows and `n` terminal rows per native invocation, charge `R=2b+8(t+k+n)+4n` reset services and `X=2t+2(k+n)+6k+4n` selected transfer legs. The separate streams and both legs of every bank-to-bank copy are included. The total local reset and copy bill is `RA+X(A+C)`, plus guide production, relabeling and retirement. Guide production uses the typed complete shape template and the retained binary countdown charges, with at most `q(N_c)+q(W′)+22N_cW′+36N_c+7W′+36` for `q(x)=24x−7popcount(x)+15ℓ(x)+12` and `W′=W+26`. Guide retirement adds `7L′+10`. [Independent paired physical bill](evidence/PROVIDER-RESULT.json) + +The complete raw tuple span has the per-stage terms `(b+6)(L′+2)` plus the actual width and shape descriptors, counter histories and guards. Let `M` sum their full recorded upper spans across all 16 stages. The 11 physical tracks have 11 corresponding typed layout markers with at most two extra delimiters per stage per track, giving shadow capacity `M+352`. Charge `34[256(M+352)+128]` for construction, retirement and all 32 raw stage entries/exits, plus the explicit fixed-degree descriptor charges. A stage switch scans the complete bounded selected view, preserves the parked backing, and returns heads before resuming an ancestor. Add any complete selected movement, child-view reshape and external wrapper work at their actual extents. [Physical stock and layout](evidence/PROVIDER-RESULT.json) + +| Complete bill | #7674 baseline | Role-230 child | +|---|---:|---:| +| Nonzero local terms per native invocation | 169,343 | 169,349 | +| Numerical homes per native and per raw caller | 15,290 / 244,640 | 15,290 / 244,640 | +| Addressed slots per native including dummy | 15,291 | 15,291 | +| Reset service bound per native | 1,452,472 | 1,452,520 | +| Selected transfer leg bound per native | 396,828 | 396,840 | +| Complete-array conversions per raw caller | 55,104 | 55,104 | +| Scalar service bound per raw caller | 117,280,256 | 117,283,328 | +| Ordinary map slots including 3,536 root `q` translations | 280,480 | 280,480 | +| Elementary record bound at ambient cap 153 | 26,607,454,720 | 26,607,454,720 | + +Each literal coefficient and conversion scale fits 13 bits. The signed finite carry, exact remainder and installation implementation is charged at up to `2^21` steps per padded payload cell per scalar service. Copies, resets, selected transfers, view and guide formation and retirement contribute only ordinary work. The raw map count covers actual graph and caller adapters, signed controls and 3,536 ordinary root-output `q` translations on each side. Charge the complete compiled owner, view and phase wrappers and the full normalization passes separately at `C_move V[(f log p)^τ+1]` in the selected movement notation, with actual complete volume `V` and spectator and return costs. Reserve every complete numerical home, dummy, guide, independent staging stream and suspended owner plus the compiler and BIT backing per actual occurrence. With compiled productive width `W_p`, paid rank-one mass `P`, ordinary work `G`, owned stock `O` and `N=2^H`, use `Z=W_p+O`, `E_0=64(Z+N+P+G+1)^3`, `B_0=P+E_0` and `C_0=32NB_0²` in the finite-template substitution. The strict outer margins permit increasing the eventual input cutoff to absorb these charged constants and bounded descriptor degrees. [Selected finite-template substitution](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md) + +The conditional result rests on the selected five interfaces for complete native columns, owned allocation and erasure, compiler closure, fixed-tape precision and movement, and analytic recovery. The source-bound graph and physical replays establish their stated finite domains. The common-root and complete-view cost proof lifts those checks within the five interfaces. [Registered checks](INPUTS.md) diff --git a/research/p104-role230-banked/README.md b/research/p104-role230-banked/README.md new file mode 100644 index 0000000000..b78c97ac8f --- /dev/null +++ b/research/p104-role230-banked/README.md @@ -0,0 +1,37 @@ +# Role-230 rank redistribution on the fifteen-pivot banked caller + +The role-230 correction gives **conditional κ ≥ 0.0037261023899** on Ali Romman's frozen fifteen-pivot banked graph from [#7674](https://github.com/CrocSwap/integer-mult-bounds/pull/7674). The lower point exceeds the matched #7674 upper endpoint `0.00372604555572` by **0.00000005683418**. The candidate retains all fifteen pivot witnesses, all 1,501 public operators, the literal 16-stage caller, and 15,290 numerical private homes per native invocation. Both graphs use the same complete exact common-root and physical bank contract under the five selected assumptions. [Proof](PROOF.md) · [Independent price](evidence/INDEPENDENT-PRICE.json) + +| Identity | SHA-256 or exact commit | +|---|---| +| #7674 refreshed head | `28b2af322a1fab01b3734365988930920f9dda48` | +| #7674 scientific source | `26b6c469aa6c4aa04322ce25a22150f90e5fb14e` | +| Shared #7669 source word | `ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d` | +| Reconstructed #7674 baseline graph | `d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098` | +| Reconstructed recharted graph | `1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150` | +| Shared caller after decompression | `62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf` | + +The role-230 graph changes source MOVE keys 97471 and 102393. The two rank-three paid edges become a rank-four and a rank-two edge. Across sixteen invocations, the full paid deltas are `{2:+16,3:−32,4:+16}`. All target ranks, 101,824 paid positions, 21,152 productive outputs and rank-mass surplus 1,328 are preserved. The child raw crossing is `(0.0037261023900, 0.0037261023901)`. Its six additional scalar terms per native invocation and all complete-view stock and movement costs enter the paired bill. [Wire result](evidence/WIRE-RESULT.json) · [Full invoices](evidence/INVOICES.json) · [Provider cost](evidence/PROVIDER-RESULT.json) + +## Reproduction + +Use Linux CPython 3.12 and the standard library. The package carries one copy each of the frozen #7674 source word inputs, caller and pivot list. Both banked graphs are rebuilt in scratch. SHA-256 and Git blob bindings identify each module and input. [Exact pivots](peer/PIVOTS.json) · [Asset manifest](ASSETS.json) + +```sh +python3.12 -I -B verify.py integrity +python3.12 -I -B verify.py paired --out /path/to/new-paired-directory +python3.12 -I -B verify.py native --out /path/to/new-native-directory +``` + +`paired` checks fifteen saved signals, both exact wire directions, complete caller prices, physical costs and all 54 strict and four functional outer predicates. `native` checks the 3,025 forward ordered-chart pairs, five additional pivot directions, 104 main boundaries, and both whole banked tapes at two primes. It includes all 512 forward and adjoint columns for 19 changed or unbound pairs. Both stages run rejecting controls using the actual frozen graph. The registered schedule allocates 680 seconds. [Replay checklist](INPUTS.md) · [Native evidence](evidence/NATIVE-RESULT.json) + +The two optional saved-witness controls reproduce an endpoint-preserving sign error at the third pivot (residual −8) and a missing chart-912 reader correction (output change 1/12). [Controls and standalone replay](witness-controls/README.md) + +## Open next questions + +- Can some of the banked snapshots share backing? Start from each literal donor's last read, then prove safe reuse through both forwarded child returns and the retained same-owner public installations. [Banked predecessor proof](https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/PROOF.md) +- A separately rounded supplier needs an exact reachable congruence or its own charged error proof. A one-tick residual in the chart-912 saved row at slot 97471 gives a nonintegral `−1/3` pre-product at row 101174. [Exact-root proof](PROOF.md#exact-common-root-and-bank-costs) + +## Credit + +The source hierarchy, scoped contribution and the separate ToikY CI bridge are recorded in [NOTICE](NOTICE). Ali Romman supplied the fifteen-pivot banked baseline and the common-grid context used here. SYLforge supplied the exact #7669 caller and source word with DreamingOfClouds and the contributors recorded in the preserved notices. The distinct change in this package is the one source-pinned role-230 transfer, its exact compatibility with the unchanged pivots and the matched accounting and verification. Clear1nsight prepared it with substantial OpenAI Codex assistance. [Pinned predecessor](peer/NOTICE) · [Parent provenance](peer/source/7669-CREDITS.md) diff --git a/research/p104-role230-banked/SOURCES.json b/research/p104-role230-banked/SOURCES.json new file mode 100644 index 0000000000..e8c2f265cd --- /dev/null +++ b/research/p104-role230-banked/SOURCES.json @@ -0,0 +1,18 @@ +{ + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "path": "certificates/selected-result.json", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1", + "usage": "provenance" + }, + { + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "path": "docs/research/agent-task-catalog.json", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81", + "usage": "provenance" + } + ], + "schema_version": 1 +} diff --git a/research/p104-role230-banked/TASK.json b/research/p104-role230-banked/TASK.json new file mode 100644 index 0000000000..d1de0b3164 --- /dev/null +++ b/research/p104-role230-banked/TASK.json @@ -0,0 +1,115 @@ +{ + "actual_scope": "Verify the exact role-230 rechart on the fixed #7674 fifteen-pivot graph and actual 16-call signed caller with the same complete banked private extent and grid on both graphs.", + "ai_assistance": "Substantial OpenAI Codex assistance with separate graph, caller, physical, native-phase and release verification.", + "author": "Clear1nsight", + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "bottleneck_link": "docs/research/bottleneck-brief.md", + "evidence": "Exact graph, paired directed prices, all-width resource check, complete native catalogue and two held-array executions in evidence/ and the declared replay.", + "open_questions": [ + { + "blocked_by": "An injective reuse allocator preserving every read, reset, shaped return and parked ancestor with complete movement charges.", + "first_step": "Derive the last use and return point of each token in the two literal schedules.", + "question": "Can the banked snapshots safely reuse physical homes across child returns?", + "why_it_matters": "The proof pays for 15,290 distinct numerical homes per native invocation." + } + ], + "original_card": { + "acceptance_gate": "An exact arbitrary-input identity, source/target frame availability and restoration at the chosen cut, plus the complete channel+correction+idle/hosting bill or an explicit favorable bound. The native channel alone is not a supplier. 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.", + "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." + ], + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "existing_checks": [ + { + "evidence": "research/p104-literal-slot-defect/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "scope": "PR #4133: literal-slot defect", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129", + "source_commit": "88666f1dee93fbd85b31fd5d6f91a219e111b5f4", + "status": "author-checked" + }, + { + "evidence": "research/p104-uniform-commutation-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "scope": "PR #4136: uniform commutation gap", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129", + "source_commit": "281ce601a8be9db470de630759179c23e1dfaa88", + "status": "author-checked" + }, + { + "evidence": "research/p104-uniform-encoding-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "scope": "PR #4140: uniform encoding gap", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129", + "source_commit": "de25c6525aa866962309df5d107b32d55e6e5628", + "status": "author-checked" + }, + { + "evidence": "research/p104-source-chart-shortcut/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "scope": "PR #4153: source-chart shortcut exhausts its optimistic allowance", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129", + "source_commit": "9123241fea53df77e51ffe30d9aca1625d4bf3a8", + "status": "author-checked" + }, + { + "evidence": "research/p104-fiber-tag-seam/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "scope": "PR #4154: fiber-tag seam mismatch", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129", + "source_commit": "4ffcdaee5d6255a9cea1fe53a5424435068089d0", + "status": "author-checked" + }, + { + "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.", + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "status": "reviewed" + } + ], + "first_experiment": "Start with the selected #5599 emitted word and review pending #5718 distinct input/output bases plus #5717/#5719 coverage before claiming work. Pick one uncovered source word, helper group and cut region. Prove the arbitrary-input relation and legal entry/exit corrections, then compare full target and paid profiles. Reject if completion, owned lifetimes or consumer costs repay the gain. A static pairing rank alone is not a physical split.", + "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." + }, + "id": "p104-side-correction", + "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." + ], + "overlap_terms": [ + "P104", + "helper basis", + "helper split", + "5718", + "dyadic capacity" + ], + "question": "Can joint helper bases and a legal causal split improve the complete P104 productive/paid invoice?", + "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." + ], + "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/p104-helper-subspace-splits/README.md", + "research/dyadic-helper-channel-capacity/README.md" + ] + }, + "outcome": "completed", + "schema_version": 1, + "scope_change_reason": "Apply one source-pinned side correction with all fifteen pivot witnesses fixed. Redistribute two paid ranks while preserving the complete target distribution.", + "scope_status": "refined", + "stop_rule": "Require exact forward and adjoint equality, all fifteen fixed witnesses, complete P/T, positive ordinary accounting and directed strict lower claim above the matched upper. Stop on a new fee, lost target, nonlocal operand, causal cycle or lost physical charge.", + "task_id": "p104-side-correction" +} diff --git a/research/p104-role230-banked/VERIFY.json b/research/p104-role230-banked/VERIFY.json new file mode 100644 index 0000000000..8aa6e9a22f --- /dev/null +++ b/research/p104-role230-banked/VERIFY.json @@ -0,0 +1,31 @@ +{ + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-B", + "{package}/verify.py", + "paired" + ], + "checks": "Rebuild both banked graphs, verify all fifteen saved signals and both exact wire directions, then run the actual 16-call grid, physical resource, directed price and outer predicates.", + "timeout_seconds": 280 + }, + { + "argv": [ + "{python}", + "-I", + "-B", + "{package}/verify.py", + "native" + ], + "checks": "Rematerialize the same two graph hashes, check the complete ordered-basis native phase catalogue and both full held-array executions, including their exact phase, causality and scalar mutation controls.", + "timeout_seconds": 400 + } + ], + "inputs": [], + "python": "3.12", + "requirements": [], + "schema_version": 1, + "status": "ready" +} diff --git a/research/p104-role230-banked/data/CONTACTS.json b/research/p104-role230-banked/data/CONTACTS.json new file mode 100644 index 0000000000..f5c4041ece --- /dev/null +++ b/research/p104-role230-banked/data/CONTACTS.json @@ -0,0 +1,338 @@ +{ + "anchors": { + "97471": [ + "MOVE", + 230, + 261, + 730, + false + ], + "97472": [ + "ADD", + 496, + 230, + "1", + 730 + ], + "97473": [ + "MOVE", + 994, + 261, + 730, + false + ], + "97474": [ + "ADD", + 994, + 496, + "-1", + 730 + ], + "97475": [ + "MOVE", + 496, + 730, + 912, + false + ], + "97477": [ + "ADD", + 496, + 984, + "1/2", + 912 + ], + "97478": [ + "ADD", + 230, + 994, + "1/2", + 730 + ], + "97479": [ + "MOVE", + 994, + 730, + 913, + false + ], + "102393": [ + "MOVE", + 230, + 730, + 127, + false + ] + }, + "clear_witnesses": { + "102319": { + "1000": "-1/2", + "1206": "-3", + "1207": "1", + "1208": "-1/2", + "1343": "-1/4", + "1344": "-1/4", + "1346": "-1/4", + "1347": "-1/4", + "1354": "1", + "1393": "-1/4", + "1445": "1", + "1458": "-1/2", + "1460": "-2", + "1466": "1", + "1477": "1", + "1490": "2", + "226": "1", + "230": "1", + "449": "-4", + "473": "1", + "485": "1", + "496": "1", + "508": "1", + "521": "1", + "544": "1", + "7": "-1/2", + "779": "-1/2", + "857": "-1/2", + "87": "-1/2", + "882": "-1/2", + "883": "-1/2", + "884": "-1/2", + "888": "-1/2", + "889": "1/2", + "890": "-1/2", + "894": "-1/2", + "898": "-1/2", + "902": "-1/2", + "903": "-1/2", + "904": "-1/2", + "905": "-1/2", + "906": "-1/2", + "907": "-1/2", + "910": "-1/2", + "914": "-1/2", + "918": "-1/2", + "919": "-1/2", + "920": "-1/2", + "921": "-1/2", + "922": "-1/2", + "931": "-1/2", + "932": "-1/2", + "933": "-1/2", + "934": "-1/2", + "940": "-1/2", + "941": "-1/2", + "942": "-1/2", + "946": "-1/2", + "947": "-1/2", + "948": "-1/2", + "949": "-1/2", + "950": "-1/2", + "951": "-1/2", + "958": "-1/2", + "959": "-1/2", + "960": "-1/2", + "965": "-1/2", + "966": "-1/2", + "967": "-1/2", + "971": "-1/2", + "972": "-1/2", + "973": "-1/2", + "976": "-1/2", + "977": "-1/2", + "978": "-1/2", + "980": "-1/2", + "981": "-1/2", + "982": "-1/2", + "983": "-1/2", + "984": "-1/2", + "985": "-1/2", + "990": "1", + "994": "1/2" + } + }, + "head": "eaef5d1580e5761feaed09262b964871f3e5f553", + "source_word": "ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d", + "splice": { + "97471": [ + [ + "ADD", + 230, + 994, + "1/2", + 261 + ], + [ + "ADD", + 994, + 230, + "-2/3", + 261 + ], + [ + "MOVE", + 230, + 261, + 912, + false + ] + ], + "97472": [], + "97474": [ + [ + "ADD", + 496, + 994, + "-1/2", + 730 + ], + [ + "ADD", + 994, + 496, + "-1", + 730 + ] + ], + "97475": [ + [ + "MOVE", + 496, + 730, + 912, + false + ], + [ + "ADD", + 496, + 230, + "2/3", + 912 + ], + [ + "ADD", + 230, + 496, + "-1/2", + 912 + ] + ], + "97478": [], + "102393": [ + [ + "MOVE", + 230, + 912, + 127, + false + ] + ] + }, + "touches": { + "97471": [ + "MOVE", + 230, + 261, + 730, + false + ], + "97472": [ + "ADD", + 496, + 230, + "1", + 730 + ], + "97473": [ + "MOVE", + 994, + 261, + 730, + false + ], + "97474": [ + "ADD", + 994, + 496, + "-1", + 730 + ], + "97475": [ + "MOVE", + 496, + 730, + 912, + false + ], + "97477": [ + "ADD", + 496, + 984, + "1/2", + 912 + ], + "97478": [ + "ADD", + 230, + 994, + "1/2", + 730 + ], + "97479": [ + "MOVE", + 994, + 730, + 913, + false + ], + "97480": [ + "ADD", + 994, + 902, + "1/2", + 913 + ], + "97483": [ + "ADD", + 994, + 985, + "1/2", + 913 + ], + "97484": [ + "ADD", + 994, + 902, + "1/2", + 913 + ], + "99976": [ + "ADD", + 220, + 496, + "-1/2", + 912 + ], + "99977": [ + "ADD", + 134, + 994, + "1/2", + 913 + ], + "99978": [ + "MOVE", + 994, + 913, + 127, + false + ], + "102393": [ + "MOVE", + 230, + 730, + 127, + false + ] + } +} diff --git a/research/p104-role230-banked/engines/application/SOURCE-PINS.json b/research/p104-role230-banked/engines/application/SOURCE-PINS.json new file mode 100644 index 0000000000..367eb39ac2 --- /dev/null +++ b/research/p104-role230-banked/engines/application/SOURCE-PINS.json @@ -0,0 +1,114 @@ +{ + "science_commit": "26b6c469aa6c4aa04322ce25a22150f90e5fb14e", + "head": "28b2af322a1fab01b3734365988930920f9dda48", + "pins": [ + { + "root": "peer", + "path": "PIVOTS.json", + "sha256": "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/PIVOTS.json" + }, + { + "root": "peer", + "path": "RESULT.json", + "sha256": "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/RESULT.json" + }, + { + "root": "peer", + "path": "SOURCE-PINS.json", + "sha256": "8fe48d96e2cc39ae92b0ea9d37f809005b5debc7cf4cadaef33e1674f979aeb8", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/SOURCE-PINS.json" + }, + { + "root": "peer", + "path": "network.py", + "sha256": "a9169fd6ad0a13c69cf39bd32649d53256f6d6fa2ed2ceda854f848b64f4c546", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/network.py" + }, + { + "root": "peer", + "path": "native.py", + "sha256": "788465324eb8693a698c75cb3dfdf1b82297324d5583910107ecad4600645e43", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/native.py" + }, + { + "root": "peer", + "path": "caller.py", + "sha256": "9bfb77250ca4826c1098b896769dc504b587c8c0dac634dd07012150fc8dde37", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/caller.py" + }, + { + "root": "peer", + "path": "physical.py", + "sha256": "d887d0eb5a97bc8e6107e60e19fccf2bd2637b2f0510f1d9356e9a4ecfe5a475", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/physical.py" + }, + { + "root": "peer", + "path": "source/interval_gate.py", + "sha256": "60a743d13f668ef86db4b8215b4d5d04430a671ba6f1fe06d9c1c4c3dfe86da5", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/interval_gate.py" + }, + { + "root": "peer", + "path": "source/caller.json.gz", + "sha256": "d889996a337f648087208ab51c98eaf052705d4fca88b5d01b6e9257a829897a", + "source": "https://github.com/aliromman/integer-mult-bounds/blob/26b6c469aa6c4aa04322ce25a22150f90e5fb14e/research/p104-banked-transfer-pivots/source/caller.json.gz" + }, + { + "root": "engine", + "path": "compare_recursive_invoices.py", + "sha256": "3930c22c11da7bc6042cfeb6e459ecb06e4478430037bee3469d034353855fc6", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/scripts/compare_recursive_invoices.py" + }, + { + "root": "engine", + "path": "evaluate_recursive_power.py", + "sha256": "52b20f41fd0bb55fa88dccd6015af2ce358917817b9506720f3e60ce681cc3ad", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/scripts/evaluate_recursive_power.py" + }, + { + "root": "engine", + "path": "selected-claim.json", + "sha256": "3f8add8252adb223b60418ec69351a69b6b5edfe601ec1c6b4b65cd9e2afd9b2", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/certificates/frontier7000/CLAIM.json" + }, + { + "root": "engine", + "path": "selected-bit-ambient.json", + "sha256": "437ad2f9e7956e7f2b477b546f53a6c8cfa0567e207024300e9a7e58d3c0202c", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-admission/bit-ambient.json" + }, + { + "root": "engine", + "path": "selected-validation.json", + "sha256": "e1374a98b240d7f9f2cca2a1e74b93f240b1bfc94b8cc4b94a385a50281d494e", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-application/VALIDATION.json" + }, + { + "root": "local", + "path": "vendor/caller16.py", + "sha256": "ced48867f07ca0143604aa98cfd74fa7453696b9d3221f7c230d73e9ab9ba81f", + "source": "Prior 235-lifetime independent caller replay; adaptation of #7663 and #7113" + }, + { + "root": "local", + "path": "vendor/binding16.py", + "sha256": "589058311e44f2d8909495c005bee6d54828ebe561d4673b599193d269006170", + "source": "Phase subroutine from prior 235-lifetime checker; adapted from the exact source upstream_application.py below" + }, + { + "root": "local", + "path": "vendor/upstream_application.py", + "sha256": "d98987db98553dc55bfc80e3ca47abfcd51c57af6f8cda61101391d8eae94184", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/07a76c5e2738882c0cb322278e56f6cae3c9885d/research/signed-caller-8x9/replay/supplier7112/short-caller/upstream_application.py" + }, + { + "root": "local", + "path": "data/PHASE-BASES.json", + "sha256": "325a1eb4aa7fe5f918b1d8344b88ad132ef4606268bccec20f223ace5feda18b", + "source": "https://github.com/CrocSwap/integer-mult-bounds/blob/07a76c5e2738882c0cb322278e56f6cae3c9885d/research/signed-caller-8x9/replay/supplier7112/short-caller/DATA-PHASES.json (exact orthogonal-axes projection for the 104 ports)" + } + ] +} diff --git a/research/p104-role230-banked/engines/application/bank_cost.py b/research/p104-role230-banked/engines/application/bank_cost.py new file mode 100644 index 0000000000..e8f67ec2a0 --- /dev/null +++ b/research/p104-role230-banked/engines/application/bank_cost.py @@ -0,0 +1,167 @@ +"""Paired full-field snapshot schedule and ordinary cost substitution.""" + +from collections import Counter +from fractions import Fraction + +from caller16 import exact_div, require + + +def roots_for_fixture(word, unit): + values = { + role: (unit * ((19 * role + 7) % 91 - 45), unit * ((31 * role + 2) % 87 - 43)) + for role in range(word["public"]) + } + out = dict(values) + hosted = word["hosted"] + ports = set(hosted["Dports"]) + for port, x in enumerate(word["live"]): + y = x + 112 + a, b = values[x], values[y] + if port in ports: + out[y] = tuple(u + v for u, v in zip(a, b, strict=True)) + else: + out[x] = tuple(u - v for u, v in zip(a, b, strict=True)) + out[y] = tuple(exact_div(u + v, 2) for u, v in zip(a, b, strict=True)) + for x, y in zip(hosted["X2"], hosted["Y2"], strict=True): + out[x] = tuple(u - v for u, v in zip(values[x], values[y], strict=True)) + return values, out + + +def dispatch_fixture(word, graph, order, unit): + """Replay the complete held-snapshot schedule in normalized coordinates. + + MOVE changes the named chart of a complete returned field. Its physical + Gaussian maps are bound by the separate native catalogue receipt. + """ + n = word["public"] + k = len(graph.moves) + entrance = {~r: r + 1 for r in range(n)} + accum = {node: n + i + 1 for i, node in enumerate(sorted(graph.forms))} + returned = {node: 2 * n + k + i + 1 for i, node in enumerate(sorted(graph.moves))} + scratch = tuple(range(2 * n + 2 * k + 1, 2 * n + 2 * k + 5)) + slots = set(entrance.values()) | set(accum.values()) | set(returned.values()) | set(scratch) + require(len(slots) == 2 * n + 2 * k + 4 and slots == set(range(1, len(slots) + 1)), + "separate complete field homes") + home_count = len(slots) + guard_left, guard_right = ("borrowed external left guard",), ("borrowed external right guard",) + alias = {0: ("unselected dummy bank",), home_count + 1: ("parked ancestor",)} + occupied = {i: ("old dirty", -(i + 1), i + 1) for i in slots} + head = 0 + visits = Counter() + slot_total = 0 + + def access(slot, operation, write=None): + nonlocal head, slot_total + require(head == 0 and 1 <= slot <= home_count, "selected complete-slot address") + head = slot + visits[operation] += 1 + slot_total += slot + previous = occupied[slot] + if write is not None: + occupied[slot] = write + head = 0 + return previous + + public, expected = roots_for_fixture(word, unit) + original = dict(public) + for slot in sorted(slots): + access(slot, "full_init", (None, 0, 0)) + for role, value in public.items(): + access(entrance[~role], "entrance_snapshot_write", (graph.initial[role], *value)) + + for node in order: + paid = node in graph.moves + a, b = graph.moves[node] if paid else (graph.final[node - graph.first_output], None) + rx = ix = 0 + for donor, c in sorted(graph.forms[node].items()): + slot = entrance[donor] if donor < 0 else returned[donor] + chart, real, imag = access(slot, "intact_donor_read") + require(chart == a, "held donor and accumulator in identical chart") + rx += exact_div(c.numerator * real, c.denominator) + ix += exact_div(c.numerator * imag, c.denominator) + access(accum[node], "accumulator_write", (a, rx, ix)) + if paid: + chart, x, y = access(accum[node], "paid_child_input_read") + require(chart == a, "complete child input chart") + access(returned[node], "completed_paid_snapshot_write", (b, x, y)) + require(public == original, "every external input retained until all terminal loads") + for role in range(n): + terminal = graph.first_output + role + chart, real, imag = access(accum[terminal], "public_install_read") + require(chart == graph.final[role], "public install chart") + public[role] = (real, imag) + require(public == expected, "complete signed normalized snapshot execution") + for slot in sorted(slots): + access(slot, "full_retire", ("raw blank",)) + require(all(payload == ("raw blank",) for payload in occupied.values()) and head == 0 + and alias == {0: ("unselected dummy bank",), home_count + 1: ("parked ancestor",)} + and guard_left == ("borrowed external left guard",) + and guard_right == ("borrowed external right guard",), "full-bank and guard restoration") + return {"homes": home_count, "dummy_slots": 1, "logical_visits": dict(visits), + "logical_selected_slot_distance_sum": slot_total, + "signed_public_outputs_checked": len(public), + "public_inputs_parked_until_install": True, "restored_head_and_kept_guards": True} + + +def ordinary_cost(word, graph, native, caller, compiler, published_budget, fixture): + n, k, m = word["public"], len(graph.moves), native["terms"] + calls = caller["calls"] + k_homes = 2 * n + 2 * k + 4 + visits = fixture["logical_visits"] + require((visits["full_init"], visits["full_retire"], visits["intact_donor_read"], + visits["entrance_snapshot_write"], visits["accumulator_write"], + visits["paid_child_input_read"], visits["completed_paid_snapshot_write"], + visits["public_install_read"]) == (k_homes, k_homes, m, n, k+n, k, k, n), + "literal ordinary snapshot/read/return/install counts") + conversions = 2 * (caller["root_owners"] + calls * n) + require(conversions == published_budget["odd_conversions"] == 55104, + "literal caller/native scale and unscale counts") + old_resets = calls * (2 * k_homes + 4 * (m + k + n)) + require(old_resets == published_budget["reset_services_upper"], "published reset allowance") + resets = calls * (2 * k_homes + 8 * (m + k + n) + 4 * n) + whole_copy_count = calls * (2 * m + 2 * (k + n) + 6 * k + 4 * n) + require((resets + whole_copy_count) >= calls * sum(visits.values()), + "complete visited-field and scratch allowance") + # Charge the entire retained #7670 highest-slot reset service as an + # upper bound on any addressed macro, including nonwriting selections. + # Its source bound at ordinal 15,290 is 214069 L + 963637. + require(k_homes == 15290, "fixed packed selector slot cap") + selector_l = (resets + whole_copy_count) * 214069 + selector_const = (resets + whole_copy_count) * 963637 + require(len(caller["owners"]) == 3536, "fixed root ownership") + maps = published_budget["monomial_slots_upper"] + caller["root_negative_corrections"] + h = int(compiler["H"]) + c = published_budget["context_c"] + k_star = 1920 * 153**1920 * (h + 1)**2 + require((c * k_star).bit_length() < h, "candidate-specific complete root guard") + return { + "raw_paid_nodes": k, "raw_terminal_nodes": n, "raw_form_terms": m, + "homes_per_native": k_homes, "homes_plus_dummy_per_native": k_homes + 1, + "raw_private_homes": calls * k_homes, + "raw_private_homes_with_dummy": calls * (k_homes + 1), + "logical_access_counts_per_native": visits, + "all_field_boundary_conversions": conversions, + "scales": {"caller": caller["odd_scale"], "native": native["odd"]}, + "scalar_services_upper": published_budget["scalar_services_upper"], + "scalar_step_rate_per_padded_component_bit": published_budget["scalar_steps_per_bit_upper"], + "full_copy_streams_charged_at_most": whole_copy_count, + "stateful_reset_services_upper": resets, + "published_reset_allowance_before_explicit_scratch": old_resets, + "selector_charge": {"coefficient_of_L": selector_l, "constant": selector_const, + "meaning": "Use the full #7670 highest-slot reset rate for each addressed macro, including read-only selection and head return."}, + "reset_charge": {"coefficient_of_L": 2 * resets, "constant": 3 * resets}, + "copy_charge": {"coefficient_of_L": 128 * whole_copy_count, "constant": 320 * whole_copy_count}, + "layout": {"field_extent": "L=(2(W+26)+3)R 2^D", + "guide": "One immutable typed guide per equal packed view; charge whole-field production, alignment, return and retirement.", + "capacity_per_view": "(2n+2k+5)(L+2) + (L+2) for the guide, plus descriptors, public fields and other aux; reserve old backing and full parked ancestors.", + "view_wrappers": "Charge each public/child entrance and return, equal-view transfer and any shape change at the retained complete-view movement rate, with the full actual and historical extents."}, + "monomial_slots_with_root_q_corrections": maps, + "elementary_records_upper_at_cap_153": maps * 4 * 154**2, + "dyadic_height": published_budget["dyadic_height"], + "context_mass_upper": published_budget["context_mass_upper"], + "context_c": c, "H": h, "depth_guard_bits": (c * k_star).bit_length(), + "compiled_stock": {"O": f"{k_homes + 1} J native homes including dummy, plus U caller tuples and all actual guide, historic, parked, compiler, adapter and BIT backing", + "G": "Sum the positive complete reads, copies, installs, restores, selectors, resets and guide layout costs, compiler wrappers and primitive movement; count actual complete shaped views.", + "substitution": "Z=Wp+O; E0=64(Z+N+P+G+1)^3; B0=P+E0; C0=32 N B0^2", + "cutoffs": "Recompute an eventual cutoff for each positive outer gap after finite constants and complete occurrence stock are fixed."}, + } diff --git a/research/p104-role230-banked/engines/application/data/PHASE-BASES.json b/research/p104-role230-banked/engines/application/data/PHASE-BASES.json new file mode 100644 index 0000000000..3e4aa383a5 --- /dev/null +++ b/research/p104-role230-banked/engines/application/data/PHASE-BASES.json @@ -0,0 +1 @@ +{"by_q":{"100":[2,97,8,16,69,37,128,256],"11":[13,14,7,16,32,64,128,256],"112":[2,4,8,97,81,49,128,256],"13":[14,11,7,16,32,64,128,256],"131":[133,134,8,16,32,64,7,256],"133":[134,131,8,16,32,64,7,256],"134":[133,131,8,16,32,64,7,256],"138":[137,4,131,16,32,64,11,256],"14":[13,11,7,16,32,64,128,256],"140":[2,137,133,16,32,64,13,256],"145":[146,4,8,131,32,64,19,256],"146":[145,4,8,131,32,64,19,256],"148":[2,145,8,133,32,64,21,256],"152":[2,4,145,137,32,64,25,256],"161":[162,4,8,16,131,64,35,256],"164":[2,161,8,16,133,64,37,256],"168":[2,4,161,16,137,64,41,256],"176":[2,4,8,161,145,64,49,256],"19":[21,22,8,7,32,64,128,256],"191":[253,251,247,239,223,254,127,256],"193":[194,4,8,16,32,131,67,256],"194":[193,4,8,16,32,131,67,256],"196":[2,193,8,16,32,133,69,256],"200":[2,4,193,16,32,137,73,256],"208":[2,4,8,193,32,145,81,256],"21":[22,19,8,7,32,64,128,256],"22":[21,19,8,7,32,64,128,256],"223":[253,251,247,239,254,191,127,256],"224":[2,4,8,16,193,161,97,256],"239":[253,251,247,254,223,191,127,256],"247":[253,251,254,239,223,191,127,256],"251":[253,254,247,239,223,191,127,256],"253":[254,251,247,239,223,191,127,256],"254":[253,251,247,239,223,191,127,256],"259":[261,262,8,16,32,64,128,7],"26":[25,4,19,11,32,64,128,256],"261":[262,259,8,16,32,64,128,7],"262":[261,259,8,16,32,64,128,7],"265":[266,4,259,16,32,64,128,11],"268":[2,265,261,16,32,64,128,13],"273":[274,4,8,259,32,64,128,19],"274":[273,4,8,259,32,64,128,19],"276":[2,273,8,261,32,64,128,21],"28":[2,25,21,13,32,64,128,256],"280":[2,4,273,265,32,64,128,25],"290":[289,4,8,16,259,64,128,35],"292":[2,289,8,16,261,64,128,37],"296":[2,4,289,16,265,64,128,41],"304":[2,4,8,289,273,64,128,49],"319":[381,379,375,367,351,382,128,127],"321":[322,4,8,16,32,259,128,67],"322":[321,4,8,16,32,259,128,67],"324":[2,321,8,16,32,261,128,69],"328":[2,4,321,16,32,265,128,73],"336":[2,4,8,321,32,273,128,81],"35":[37,38,8,16,7,64,128,256],"351":[381,379,375,367,382,319,128,127],"352":[2,4,8,16,321,289,128,97],"367":[381,379,375,382,351,319,128,127],"37":[38,35,8,16,7,64,128,256],"375":[381,379,382,367,351,319,128,127],"379":[381,382,375,367,351,319,128,127],"38":[37,35,8,16,7,64,128,256],"381":[382,379,375,367,351,319,128,127],"382":[381,379,375,367,351,319,128,127],"385":[386,4,8,16,32,64,259,131],"386":[385,4,8,16,32,64,259,131],"388":[2,385,8,16,32,64,261,133],"392":[2,4,385,16,32,64,265,137],"400":[2,4,8,385,32,64,273,145],"41":[42,4,35,16,11,64,128,256],"415":[445,443,439,431,446,64,319,191],"416":[2,4,8,16,385,64,289,161],"431":[445,443,439,446,415,64,319,191],"439":[445,443,446,431,415,64,319,191],"44":[2,41,37,16,13,64,128,256],"443":[445,446,439,431,415,64,319,191],"445":[446,443,439,431,415,64,319,191],"446":[445,443,439,431,415,64,319,191],"463":[477,475,471,478,32,415,351,223],"471":[477,475,478,463,32,415,351,223],"475":[477,478,471,463,32,415,351,223],"477":[478,475,471,463,32,415,351,223],"478":[477,475,471,463,32,415,351,223],"487":[493,491,494,16,463,431,367,239],"49":[50,4,8,35,19,64,128,256],"493":[494,491,487,16,463,431,367,239],"494":[493,491,487,16,463,431,367,239],"499":[501,502,8,487,471,439,375,247],"50":[49,4,8,35,19,64,128,256],"501":[502,499,8,487,471,439,375,247],"502":[501,499,8,487,471,439,375,247],"505":[506,4,499,491,475,443,379,251],"506":[505,4,499,491,475,443,379,251],"508":[2,505,501,493,477,445,381,253],"56":[2,4,49,41,25,64,128,256],"69":[70,67,8,16,32,7,128,256],"70":[69,67,8,16,32,7,128,256],"73":[74,4,67,16,32,11,128,256],"74":[73,4,67,16,32,11,128,256],"81":[82,4,8,67,32,19,128,256],"84":[2,81,8,69,32,21,128,256],"88":[2,4,81,73,32,25,128,256],"98":[97,4,8,16,67,35,128,256]},"full_phase_table_sha256":"c5916ff312678f12aba403847643fbbc29f643acec60bdf836fa56cd3e8251fa"} diff --git a/research/p104-role230-banked/engines/application/vendor/binding16.py b/research/p104-role230-banked/engines/application/vendor/binding16.py new file mode 100644 index 0000000000..d07341b817 --- /dev/null +++ b/research/p104-role230-banked/engines/application/vendor/binding16.py @@ -0,0 +1,280 @@ +"""Complete occurrence and source-bound phase specialization of #7000/#7113. + +The degree-two phase polynomial and translation checks are reused unchanged +from Douglas Colkitt's retained upstream_application.py. See SOURCE-PINS.json. +""" + +from collections import Counter + +from caller16 import literal_layout, require +from upstream_application import boundary, digest, dot, polynomial, sub, terms, translation + + +def route(q, basis, stage, ambient): + native = [q, *basis] + require(len(native) == 9 and all(0 < v < 512 for v in native), + "nine central directions") + require(all(dot(a, b) == (i == j) for i, a in enumerate(native) + for j, b in enumerate(native)), "orthonormal central directions") + fresh = [1 << (9 + 8 * (stage - 1) + j) for j in range(8)] + mask = 511 | sum(fresh) + + def transform(value): + central = value & 511 + out = value & ~mask + if dot(central, q): + out ^= q + for basis_vector, axis in zip(basis, fresh, strict=True): + if dot(central, basis_vector): + out ^= axis + if value & axis: + out ^= basis_vector + return out + + axes = [1 << j for j in range(ambient)] + require(all(transform(transform(a)) == a for a in axes), "full route involution") + require(transform(q) == q, "preserved head direction") + require(all(transform(a) == a for a in axes if not mask & a), "complete spectators") + return transform + + +def contact_phase(q, basis, stage, ambient): + move = route(q, basis, stage, ambient) + before_axes = [1 << j for j in range(9 + 8 * (stage - 1))] + after_axes = [1 << j for j in range(9 + 8 * stage)] + spectator = [1 << j for j in range(9, 9 + 8 * stage)] + x0 = terms((a, 1) for a in before_axes) + y0 = terms([*x0.items(), (q, -1)]) + x1 = terms((a, 1) for a in after_axes) + y1 = terms([*x1.items(), (q, -1)]) + nx0 = terms([(a, 1) for a in spectator] + [(q, 1)]) + ny0 = terms((a, 1) for a in spectator) + nx1 = terms((a, 1) for a in [*spectator, *[1 << j for j in range(9)]]) + ny1 = terms([*nx1.items(), (q, -1)]) + pairs = ((x0, nx0), (y0, ny0), (nx1, x1), (ny1, y1)) + shifts = [boundary(a, b, move) for a, b in pairs] + body = terms((1 << j, 1) for j in range(9 + 8 * (stage - 1), 9 + 8 * stage)) + require(not polynomial(sub(sub(x1, x0), body)) + and not polynomial(sub(sub(y1, y0), body)) + and not polynomial(sub(sub(y1, x0), terms([*body.items(), (q, -1)]))) + and not polynomial(sub(sub(x1, y0), terms([*body.items(), (q, 1)]))), + "all four signed contact operators") + require(polynomial(sub(terms([(q, 1)]), terms([(q, -1)]))), + "query orientation discrimination") + # The two signed head corrections and the Q^2 term of LAMBDA. + require(translation(sub(terms([(q, 1)]), terms([(q, -1)]))) == q + and translation(terms([(q, 2)])) == q, "ordinary head translations") + first_shift = next((i for i, shift in enumerate(shifts) if shift), None) + return shifts, (move, pairs[first_shift]) if first_shift is not None else None + + +def native_inventory(word, helpers): + dimensions = [len(frame) for frame in word["frames"]] + public = word["public"] + owned = {} + lifetimes = [] + moves = [] + paid = Counter() + opcodes = Counter() + live_peak = 0 + for clock, event in enumerate(word["program"]): + op, role, *args = event + opcodes[op] += 1 + if op == "INIT": + require(public <= role < public + word["owned_fields"] and role not in owned, + "fresh owned lifetime") + owned[role] = len(lifetimes) + lifetimes.append([role, clock, args[0], None, None]) + live_peak = max(live_peak, len(owned)) + elif op == "CLEAR": + require(role in owned, "ordered owned retirement") + lifetime = lifetimes[owned.pop(role)] + lifetime[3:] = [clock, args[0]] + elif op == "MOVE": + first, last, is_owned = args + rank = abs(dimensions[last] - dimensions[first]) + require(rank > 0 and is_owned == (role >= public), "positive paid native rank") + require(not is_owned or role in owned, "current private MOVE owner") + moves.append((clock, role, first, last, rank, owned.get(role))) + paid[rank] += 1 + require(not owned and len(lifetimes) == 235 and live_peak == 51, "full 235-lifetime closure") + targets = Counter() + for role in helpers: + rank = dimensions[word["final"][role]] - dimensions[word["initial"][role]] + require(rank > 0, "positive independently owned helper target") + targets[rank] += 1 + return lifetimes, moves, paid, targets, opcodes + + +def complete_binding(word, caller, phases, signed): + stages, types, role_sets = literal_layout(caller, word) + ambient = caller["ambient_rank"] + public = word["public"] + require(public == 1501 and word["owned_fields"] == 68, "exact native public/private header") + ports = word["ports"] + live = word["live"] + h = word["hosted"] + second = dict(zip(h["Dports"], zip(h["X2"], h["Y2"], strict=True), strict=True)) + main = set(live) | {r + 112 for r in live} | set(h["X2"]) | set(h["Y2"]) + helpers = sorted(set(range(public)) - main) + require(len(live) == len(ports) == 104 and len(set(ports)) == 104 + and len(main) == 400 and len(helpers) == 1101, "actual native partition") + special_helpers = (325, 1087) + for role in special_helpers: + pair = [word["initial"][role], word["final"][role]] + require(role in helpers and pair == [3, 237] + and not word["frames"][pair[0]] + and word["frames"][pair[1]] == [30, 75, 138, 266], + "explicit arbitrary-input rank-four helper boundary") + by_q = {row["q"]: row["idle_children"][0]["orthogonal_axes"][:8] + for row in phases["recipes"]} + require(set(ports) <= set(by_q), "every actual port has a pinned phase basis") + for port, (first, q) in enumerate(zip(live, ports, strict=True)): + companion = first + 112 + fin = word["frames"][word["final"][companion]] + require(word["frames"][word["initial"][first]] == [q] + and not word["frames"][word["initial"][companion]] + and word["frames"][word["final"][first]] == [1 << j for j in range(9)] + and len(fin) == 8 and all(dot(q, axis) == 0 for axis in fin), + "actual main source and target charts") + if port in second: + x2, y2 = second[port] + require(all(word[key][a] == word[key][b] + for key in ("initial", "final") + for a, b in ((first, x2), (companion, y2))), + "separate second plane with identical charts") + + lifetime_plan, moves, native_paid, helper_targets, opcodes = native_inventory(word, helpers) + roots = {("main", port, role) for kind, spec in types.items() + for port in spec["ports"] for role in role_sets[kind]} + require(len(roots) == signed["root_owners"] == 3536, "distinct root owner count") + fresh_helpers = set() + paid = Counter() + targets = Counter() + phase_rows = [] + occurrences = [] + owner_maps = [] + phase_fault_rejected = False + signed_idles = 0 + special_owners = [] + for clock, event in enumerate(caller["events"]): + if event[0] == "J": + _, stage, a, b = event + owners = {} + for port, first in enumerate(live): + pair = a[:2] if port in second else b[:2] + first_pair = ((first, pair[0]), (first + 112, pair[1])) + if port in second: + first_pair += tuple(zip(second[port], a[2:], strict=True)) + for slot, role in first_pair: + tag = ("main", port, role) + require(tag in roots and slot not in owners, "injective main assignment") + owners[slot] = tag + shifts, fault = contact_phase(ports[port], by_q[ports[port]], stage, ambient) + phase_rows.append([clock, port, shifts, 2 if port in second else 1]) + if fault and not phase_fault_rejected: + transform, (before, after) = fault + try: + boundary(before, after, transform, omit_translation=True) + except ValueError as exc: + require(str(exc) == "forward contact includes its phase", + "phase control rejection reason") + phase_fault_rejected = True + else: + raise ValueError("omitted contact translation escaped") + require(set(owners) == main and len(set(owners.values())) == 400, + "all source main slots have different physical owners") + for role in helpers: + tag = ("helper", stage, role) + require(tag not in fresh_helpers and tag not in roots, "fresh arbitrary helper") + fresh_helpers.add(tag) + owners[role] = tag + if role in special_helpers: + special_owners.append({ + "tag": tag, "stage": stage, "caller_clock": clock, + "initial_chart": 3, "final_chart": 237, "target_rank": 4, + "exit_ordered_basis": word["frames"][237], + }) + require(set(owners) == set(range(public)) and len(set(owners.values())) == public, + "full public-field injection") + owner_maps.append([stage, sorted(owners.items())]) + for native_clock, role, first, last, rank, owned in moves: + tag = owners[role] if owned is None else ("owned", stage, owned) + require(tag not in roots or owned is None, "private owner separation") + paid[rank] += 1 + occurrences.append([clock, native_clock, tag, rank, first, last]) + targets.update(helper_targets) + continue + + kind, op, role, *args = event + if op not in {"QUERY", "IDLE_ONE", "IDLE_ODD"}: + continue + if op == "QUERY": + rank = 1 + else: + rank = 8 * len(args[0]) + int(op == "IDLE_ODD") + for port in types[kind]["ports"]: + tag = ("query_scratch", clock, port) if op == "QUERY" else ("main", port, role) + require((tag not in roots) if op == "QUERY" else tag in roots, "caller paid owner") + occurrences.append([clock, op, tag, rank]) + paid[rank] += 1 + signed_idles += int(op == "IDLE_ODD") + require(len(owner_maps) == stages and len(fresh_helpers) == 17616 and phase_fault_rejected, + "complete 16-call owners and phase control") + require(len(special_owners) == len({row["tag"] for row in special_owners}) == 32, + "distinct stage-tagged arbitrary helper 325 and 1087 ingress/egress") + root_targets = Counter() + root_negative = 0 + for kind, spec in types.items(): + for phase, coeff_phase, *selection in spec["diagonal"]: + require(coeff_phase == 0 and any(selection), "whole positive target endpoint") + for port in spec["ports"]: + q = ports[port] + axes = [1 << (9 + 8 * j + offset) for j, yes in enumerate(selection) + if yes for offset in range(8)] + require(len(axes) == len(set(axes)) and all(a < 1 << ambient for a in axes), + "positive target complete distinct axes") + actual = terms([(q, phase)] + [(axis, 1) for axis in axes]) + positive = terms((a, 1) for a in ([q] if phase else []) + axes) + require(translation(sub(positive, actual)) == (q if phase == -1 else 0), + "exact negative root translation") + root_targets[len(axes) + int(bool(phase))] += 1 + root_negative += int(phase < 0) + targets.update(root_targets) + references = Counter({rank: stages * count for rank, count in native_paid.items()}) + references.update(signed["fixed_caller_paid"]) + require(paid == references and root_targets == Counter(signed["fixed_root_targets"]), + "independent decomposition and occurrence invoices agree") + require(len(occurrences) == sum(paid.values()) and sum(targets.values()) == 21152, + "complete paid and productive owner count") + contacts = sum(4 * row[3] for row in phase_rows) + nonzero = sum(row[3] * sum(bool(v) for v in row[2]) for row in phase_rows) + require(contacts == nonzero == 12800, "all 12,800 absolute phase translations charged") + return { + "ambient": ambient, + "calls": stages, + "native_public": public, + "main_per_native": len(main), + "fresh_helpers": len(fresh_helpers), + "role_325_and_1087_helper_owners": special_owners, + "root_owners": len(roots), + "productive_fields": sum(targets.values()), + "paid_positions": len(occurrences), + "native_paid": dict(native_paid), + "native_targets": dict(helper_targets), + "paid": dict(paid), + "targets": dict(targets), + "phase_digest": digest(phase_rows), + "owner_map_digest": digest(owner_maps), + "ordered_paid_digest": digest(occurrences), + "contacts": contacts, + "nonzero_contact_translations": nonzero, + "phase_omission_rejected": phase_fault_rejected, + "signed_idle_ordinary_corrections": signed_idles, + "negative_root_ordinary_corrections": root_negative, + "owned_lifetimes_per_native": len(lifetime_plan), + "owned_lifetime_plan_digest": digest(lifetime_plan), + "owned_fresh_homes_per_raw_caller": stages * len(lifetime_plan), + "owned_resets_per_raw_caller": 2 * stages * len(lifetime_plan), + "native_opcodes": dict(opcodes), + } diff --git a/research/p104-role230-banked/engines/application/vendor/caller16.py b/research/p104-role230-banked/engines/application/vendor/caller16.py new file mode 100644 index 0000000000..2865530b78 --- /dev/null +++ b/research/p104-role230-banked/engines/application/vendor/caller16.py @@ -0,0 +1,182 @@ +"""Exact signed caller replay, adapted from Ali Romman's #7663 caller.py. + +See SOURCE-PINS.json for Rohan Arun's literal #7113-derived caller and +the attributed reference engines. Apache-2.0. +""" + +from collections import Counter +from fractions import Fraction +from functools import cache + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def exact_div(numerator, denominator): + quotient, remainder = divmod(numerator, denominator) + require(remainder == 0, "inexact caller pre-product") + return quotient + + +def literal_layout(caller, word): + stages = caller["stages"] + require(stages == 16 and caller["ambient_rank"] == 9 + 8 * stages == 137, + "literal 16-call, 137-axis layout") + require(len(caller["events"]) == 4192, "literal caller event count") + types = caller["types"] + require(set(types) == {"A", "B"}, "literal type partition") + require(all(spec["roles"] == 34 for spec in types.values()), "literal 34+34 roles") + require(types["A"]["ports"] == word["hosted"]["Dports"], "hosted port assignment") + require((len(types["A"]["ports"]), len(types["B"]["ports"])) == (96, 8), + "literal 96+8 ports") + require(sorted(types["A"]["ports"] + types["B"]["ports"]) == list(range(104)), + "disjoint complete 104-port assignment") + role_sets = { + kind: set(range(spec["offset"], spec["offset"] + spec["roles"])) + for kind, spec in types.items() + } + require(role_sets["A"].isdisjoint(role_sets["B"]) + and role_sets["A"] | role_sets["B"] == set(range(caller["roles"])), + "disjoint complete root role ranges") + h = word["hosted"] + coefficients = tuple(Fraction(h[k]) for k in ("alpha", "beta", "alpha2", "beta2")) + require(coefficients == (-1, Fraction(1, 2), -1, 0), "joint normalized source coefficients") + require(Fraction(types["A"]["alpha2"]) == coefficients[2], "A second-plane coefficient") + return stages, types, role_sets + + +def signed_caller(caller, word, odd_scale, dyadic_height): + stages, types, role_sets = literal_layout(caller, word) + unit = odd_scale << dyadic_height + zero = (0,) * stages + rows = [{(r, 0, zero): (unit, 0)} for r in range(caller["roles"])] + paid = Counter() + targets = Counter() + uses = Counter() + calls = [] + checks = 0 + peak = unit + peak_at = (-1, "entrance") + clock = -1 + + def observe(row, site): + nonlocal peak, peak_at + mass = sum(abs(real) + abs(imag) for real, imag in row.values()) + if mass > peak: + peak, peak_at = mass, (clock, site) + + @cache + def shifted(exponents, shift): + result = list(exponents) + for stage in shift: + result[stage - 1] += 1 + return tuple(result) + + def term(row, ar=1, ai=0, denominator=1, phase=0, shift=()): + nonlocal checks + out = {} + for (role, q, powers), (x, y) in row.items(): + real, imag = ar * x - ai * y, ar * y + ai * x + if denominator != 1: + real, imag = exact_div(real, denominator), exact_div(imag, denominator) + checks += 1 + if real or imag: + key = (role, (q + phase) % 4, shifted(powers, shift) if shift else powers) + out[key] = (real, imag) + observe(out, "scaled separate term") + return out + + def add(a, b): + out = a.copy() + for key, (u, v) in b.items(): + x, y = out.get(key, (0, 0)) + if x + u or y + v: + out[key] = (x + u, y + v) + else: + out.pop(key, None) + observe(out, "stored sum") + return out + + for clock, event in enumerate(caller["events"]): + kind = event[0] + if kind == "J": + _, stage, (x, y, u, v), (a, b, alpha, beta) = event + require(stage == len(calls) + 1, "chronological joint occurrences") + require(Fraction(alpha) == -1 and Fraction(beta) == Fraction(1, 2), + "literal joint coefficients") + require(len({x, y, u, v}) == 4 and {x, y, u, v} <= role_sets["A"] + and a != b and {a, b} <= role_sets["B"], "joint owner alias") + calls.append(stage) + rows[y] = add(rows[y], term(rows[x], phase=-1)) + rows[u] = add(rows[u], term(rows[v], -1, phase=1)) + first, second = rows[a], rows[b] + rows[a] = add(first, term(second, -1, phase=1)) + rows[b] = add(term(second, denominator=2), + term(first, denominator=2, phase=-1)) + for role in (x, y, u, v, a, b): + rows[role] = term(rows[role], shift=(stage,)) + continue + + _, op, role, *args = event + require(kind in role_sets and role in role_sets[kind], "caller target owner") + replicas = len(types[kind]["ports"]) + uses[op] += replicas + if op in {"ADD", "SWAP", "QUERY"}: + require(args[0] in role_sets[kind] and args[0] != role, "caller donor owner") + if op == "SWAP": + other, = args + rows[role], rows[other] = rows[other], rows[role] + elif op == "QUERY": + donor, sign = args + require(sign in (-1, 1), "caller query orientation") + rows[role] = add(rows[role], term(rows[donor], phase=sign)) + paid[1] += replicas + elif op in {"ADD", "SCALE"}: + factor = Fraction(args[-1]) + donor = args[0] if op == "ADD" else role + contribution = term(rows[donor], factor.numerator, denominator=factor.denominator) + rows[role] = add(rows[role], contribution) if op == "ADD" else contribution + elif op == "LAMBDA": + sign, = args + require(sign in (-1, 1), "caller LAMBDA sign") + old = rows[role] + rows[role] = add(term(old, 1, sign, 2), term(old, 1, -sign, 2, phase=2)) + else: + require(op in {"IDLE_ONE", "IDLE_ODD"}, "known caller operation") + block = tuple(args[0]) + require(block and len(block) == len(set(block)) + and all(1 <= k <= stages for k in block), "whole idle stage subset") + if op == "IDLE_ODD": + require(len(args) == 2 and len(block) == 1 and args[1] == -1, + "literal signed rank-nine child") + else: + require(len(args) == 1, "literal unit idle") + phase = args[1] if op == "IDLE_ODD" else 0 + rows[role] = term(rows[role], phase=phase, shift=block) + paid[8 * len(block) + phase % 2] += replicas + + require(calls == list(range(1, stages + 1)), "all 16 native invocations") + for spec in types.values(): + require(len(spec["diagonal"]) == spec["roles"], "complete diagonal") + for off, (phase, coefficient_phase, *powers) in enumerate(spec["diagonal"]): + role = spec["offset"] + off + require(phase in (-1, 0, 1) and coefficient_phase == 0 and len(powers) == stages + and set(powers) <= {0, 1} and any(powers), "positive whole root target") + require(rows[role] == {(role, phase % 4, tuple(powers)): (unit, 0)}, + "exact signed root endpoint") + targets[8 * sum(powers) + phase % 2] += len(spec["ports"]) + return { + "fixed_caller_paid": dict(paid), + "fixed_root_targets": dict(targets), + "uses": dict(uses), + "calls": stages, + "roles": len(rows), + "root_owners": sum(targets.values()), + "dyadic_height": dyadic_height, + "odd_scale": odd_scale, + "peak_scaled_mass": str(Fraction(peak, 1 << dyadic_height)), + "peak_witness": peak_at, + "exact_preproduct_divisions": checks, + } diff --git a/research/p104-role230-banked/engines/application/vendor/upstream_application.py b/research/p104-role230-banked/engines/application/vendor/upstream_application.py new file mode 100644 index 0000000000..1a6d358cbe --- /dev/null +++ b/research/p104-role230-banked/engines/application/vendor/upstream_application.py @@ -0,0 +1,369 @@ +#!/usr/bin/env python3 +"""Exact-source caller geometry, occurrence allocation and rational BIT frames. + +No contributor scientific module is imported. Complex phase-polynomial +method credited to the retained fragment physical audit; here coefficients +of the full degree-two polynomial are constructed instead of probing it. +OpenAI Codex assistance for Douglas Colkitt. Apache-2.0. +""" +from collections import Counter +from copy import deepcopy +from fractions import Fraction as Q +from hashlib import sha256 +from pathlib import Path +import gzip +import json + +HERE = Path(__file__).resolve().parent +ROOT = HERE.parents[3] + + +def need(ok, message): + if not ok: + raise ValueError(message) + + +def read(path): + raw = (ROOT / path).read_bytes() + pin = next(p for p in json.loads((HERE / 'SOURCES.json').read_text())['files'] + if p['path'] == path) + need(sha256(raw).hexdigest() == pin['sha256'], 'source bytes: ' + path) + return json.loads(gzip.decompress(raw) if path.endswith('.gz') else raw) + + +def digest(value): + return sha256(json.dumps(value, sort_keys=True, separators=(',', ':')).encode()).hexdigest() + + +def bits(n): + result = [] + while n: + a = n & -n + result.append(a) + n ^= a + return result + + +def dot(a, b): + return (a & b).bit_count() % 2 + + +def terms(items): + c = Counter() + for v, a in items: + c[v] += a + return {v: a % 4 for v, a in c.items() if v and a % 4} + + +def sub(a, b): + return terms(list(a.items()) + [(v, -c) for v, c in b.items()]) + + +def polynomial(t): + # parity(sum x_i) = sum x_i - 2 sum_{i 0, 'positive complete helper job') + T[rank] += 1 + need(len(mapping) == len(set(mapping.values())) == word['public'], 'injective native inputs') + for r in range(word['public'], word['public']+word['owned_fields']): + mapping[r] = ('owned', ci, r-word['public']) + need(len(set(mapping.values())) == word['public']+51, 'owned/public separation') + for ni, move in native_moves: + _, r, start, end, owned = move + rank = abs(len(word['frames'][end])-len(word['frames'][start])) + need(owned == (r >= word['public']) and rank > 0, 'actual paid owner class') + P[rank] += 1 + occurrences.append([ci, ni, list(mapping[r]), rank, start, end]) + for pi, q in enumerate(word['ports']): + transform = route(q, by_q[q], stage) + before_axes = [1 << j for j in range(9+8*(stage-1))] + after_axes = [1 << j for j in range(9+8*stage)] + spectator = [1 << j for j in range(9, 9+8*stage)] + x0 = terms((a, 1) for a in before_axes) + y0 = terms(list(x0.items())+[(q, -1)]) + x1 = terms((a, 1) for a in after_axes) + y1 = terms(list(x1.items())+[(q, -1)]) + nx0 = terms([(a, 1) for a in spectator]+[(q, 1)]) + ny0 = terms((a, 1) for a in spectator) + nx1 = terms((a, 1) for a in spectator+[1 << j for j in range(9)]) + ny1 = terms(list(nx1.items())+[(q, -1)]) + shifts = [boundary(a, b, transform) for a, b in + ((x0, nx0), (y0, ny0), (nx1, x1), (ny1, y1))] + body = terms((1 << j, 1) for j in range(9+8*(stage-1), 9+8*stage)) + for actual, expected in ((sub(x1,x0),body), (sub(y1,y0),body), + (sub(y1,x0),terms(list(body.items())+[(q,-1)])), + (sub(x1,y0),terms(list(body.items())+[(q,1)]))): + need(not polynomial(sub(actual,expected)), 'all four contact operators') + need(polynomial(sub(terms([(q,1)]),terms([(q,-1)]))), 'wrong query orientation rejected') + phase_records.append([ci,pi,shifts,2 if pi in second else 1]) + else: + ty, op, r, *a = e + kind = caller['types'][ty] + used = [r] + ([a[0]] if op in ('ADD','SWAP','QUERY') else []) + need(all(kind['offset'] <= x < kind['offset']+kind['roles'] for x in used), 'caller owners stay in type') + need(len(used) == len(set(used)), 'distinct scalar/query owners') + if op in ('QUERY','IDLE_ONE'): + if op == 'QUERY': + need(a[1] in (-1,1), 'signed completed query') + rank = 1; query_uses += len(kind['ports']) + else: + selected = a[0] + need(selected and len(selected)==len(set(selected)) + and all(1 <= s <= 18 for s in selected), 'whole idle stage axes') + rank = 8*len(selected); idle_uses += len(kind['ports']) + for pi in kind['ports']: + owner = ['query_scratch',ci,pi] if op == 'QUERY' else ['main',pi,r] + occurrences.append([ci,op,owner,rank]); P[rank] += 1 + elif op == 'LAMBDA': + need(a[0] in (-1,1), 'global normalizer sign') + lambda_uses += len(kind['ports']) + need(stage_order == list(range(1,19)), 'fresh chronological native stages') + for kind in caller['types'].values(): + for diagonal in kind['diagonal']: + qp, zero, *selection = diagonal + need(qp in (-1,0,1) and zero == 0 and len(selection)==18 + and set(selection)<={0,1} and any(selection), 'positive nonempty root endpoint') + rank = abs(qp)+8*sum(selection) + for pi in kind['ports']: + q = word['ports'][pi] + axes = [1 << (9+8*j+k) for j,yes in enumerate(selection) if yes for k in range(8)] + actual = terms([(q,qp)]+[(a,1) for a in axes]) + target = terms((a,1) for a in ([q] if qp else [])+axes) + need(translation(sub(target,actual)) == (q if qp == -1 else 0), 'whole output correction') + T[rank] += 1 + for name, actual in [('P',P),('T',T)]: + need(actual == Counter({int(k):v for k,v in receipt['invoice'][name].items()}), 'independent '+name+' invoice') + need(sum(T.values()) == len(owners), 'every productive target is one actual owner') + need(len(occurrences) == sum(P.values()), 'every paid position retained in order') + return dict(ambient=153, native_calls=18, native_public=1480, fresh_helpers=19440, + productive_fields=len(owners), paid_positions=len(occurrences), + complete_paid_position_digest=digest(occurrences), + native_contact_boundaries=sum(4*r[3] for r in phase_records), + phase_record_digest=digest(phase_records), nonzero_boundary_translations=sum(sum(bool(x) for x in r[2])*r[3] for r in phase_records), + reserved_native_banks=18*51, reserved_serial_query_lambda_bank=1, + query_uses=query_uses, idle_uses=idle_uses, lambda_uses=lambda_uses, + paid=dict(sorted(P.items())), targets=dict(sorted(T.items())), + rank_surplus=sum(r*T[r] for r in T)-sum(r*P[r] for r in P)) + + +def inverse(matrix): + n = len(matrix) + a = [[Q(x) for x in row]+[Q(i==j) for j in range(n)] for i,row in enumerate(matrix)] + det = Q(1) + for j in range(n): + pivot = next((i for i in range(j,n) if a[i][j]),None) + need(pivot is not None, 'rational basis invertible') + if pivot != j: + a[j],a[pivot] = a[pivot],a[j]; det = -det + v = a[j][j]; det *= v; a[j] = [x/v for x in a[j]] + for i in range(n): + if i != j: + v = a[i][j] + a[i] = [x-v*y for x,y in zip(a[i],a[j])] + return [row[n:] for row in a], det + + +def bit_application(word, caller, receipt): + ff = word['frames']; determinants=[]; denominator_witnesses=set() + for label, frame in ff.items(): + B,A = frame['B'],frame['A']; d = frame['dim'] + need(len(B)==d and len(A)==8-d and all(len(v)==8 for v in B+A), 'rational frame dimensions') + need(all(sum(Q(x)*Q(y) for x,y in zip(b,a))==0 for b in B for a in A), 'complement annihilation') + inv, det = inverse(list(zip(*(B+A)))) + determinants.append([label,str(det)]) + denominator_witnesses.add(abs(det.numerator)); denominator_witnesses.add(det.denominator) + for row in inv: + denominator_witnesses.update(x.denominator for x in row) + for row in B+A: + denominator_witnesses.update(Q(x).denominator for x in row) + charts=[] + for port in range(111): + head=ff[str(word['start'][port])]; body=ff[str(word['final'][port+111])] + need(head['dim']==1 and body['dim']==7, 'actual main head/body ranks') + u=head['B'][0] + need(all(sum(Q(x)*Q(y) for x,y in zip(u,v))==0 for v in body['B']), 'main complement') + inv,det=inverse(list(zip(*([u]+body['B'])))) + charts.append([port,str(det)]) + denominator_witnesses.update([abs(det.numerator),det.denominator]) + for row in inv:denominator_witnesses.update(x.denominator for x in row) + P,T=Counter(),Counter(); positions=[]; names={('main',pi,r) for pi in range(111) for r in range(38)} + calls=[] + for ci,e in enumerate(caller['events']): + op=e[0] + if op=='LOCAL': + _,stage,src,dst=e; calls.append(stage) + mapping={i:('main',i,src) for i in range(111)} + mapping.update({i+111:('main',i,dst) for i in range(111)}) + for r in range(222,word['public']): + owner=('helper',ci,r); need(owner not in names,'fresh BIT helper');names.add(owner);mapping[r]=owner + T[abs(ff[str(word['start'][r])]['dim']-ff[str(word['final'][r])]['dim'])]+=1 + need(len(mapping)==len(set(mapping.values()))==659,'injective BIT occurrence') + for r in range(659,659+word['owned_fields']):mapping[r]=('owned',ci,r-659) + for ni,move in enumerate(word['program']): + if move[0]=='MOVE': + _,r,a,b=move;rank=abs(ff[str(a)]['dim']-ff[str(b)]['dim']) + P[rank]+=1;positions.append([ci,ni,list(mapping[r]),rank,a,b]) + elif op=='QUERY': + need(e[1]!=e[2] and 0<=min(e[1:])<=max(e[1:])<38,'BIT query owners') + for pi in range(111):P[1]+=1;positions.append([ci,op,['query_scratch',ci,pi],1]) + elif op=='IDLE_ONE': + _,owner,ss=e;need(ss and len(ss)==len(set(ss)) and all(1<=s<=18 for s in ss),'BIT idle axes') + for pi in range(111):P[7*len(ss)]+=1;positions.append([ci,op,['main',pi,owner],7*len(ss)]) + need(calls==[s for s in range(1,19) for _ in range(2)],'paired native chronology') + for d in caller['diagonal']: + need(d['q']==1 and d['stages'] and len(d['stages'])==len(set(d['stages'])),'BIT positive endpoint') + T[1+7*len(d['stages'])]+=111 + need(P==Counter({int(k):v for k,v in receipt['paid'].items()}) and + T==Counter({int(k):v for k,v in receipt['targets'].items()}),'complete BIT invoice') + need(sum(T.values())==len(names)==19950,'BIT owner count') + return dict(ambient=134, rational_frames=len(ff), rational_main_charts=len(charts), + rational_determinants_digest=digest(determinants), + finite_prime_exclusion_witness_count=len(denominator_witnesses), + finite_prime_exclusion_witness_digest=digest(sorted(denominator_witnesses)), + native_calls=len(calls), fresh_helpers=36*437, productive_fields=len(names), + paid_positions=len(positions), complete_paid_position_digest=digest(positions), + reserved_native_banks=36*word['owned_fields'], reserved_serial_query_bank=1, + rank_surplus=sum(r*T[r] for r in T)-sum(r*P[r] for r in P)) + + +def main(): + p='research/shared-wire-split-composition/' + w,c,r=read(p+'data/final.json.gz'),read(p+'data/caller.json'),read(p+'FULL-RESULT.json') + phases=read('research/p104-two-chain-shared-native/retained/runtime/DATA-PHASES.json') + complex_result=complex_application(w,c,r,phases) + p='research/paired-query-only-bit/' + bw,bc,br=read(p+'retained/inputs/BIT-NATIVE-WORD.json.gz'),read(p+'EFREE-CALLER.json.gz'),read(p+'EFREE-RESULT.json') + bit_result=bit_application(bw,bc,br) + controls={} + def reject(name, action): + try:action() + except ValueError as error:controls[name]=str(error) + else:raise ValueError('negative control accepted: '+name) + alias=deepcopy(c);joint=next(e for e in alias['events'] if e[0]=='J');joint[2][2]=joint[2][0] + reject('same_frame_main_alias',lambda:complex_application(w,alias,r,phases)) + reordered=deepcopy(c);joint=next(e for e in reordered['events'] if e[0]=='J');joint[1]=2 + reject('wrong_stage',lambda:complex_application(w,reordered,r,phases)) + bad_bit=deepcopy(bw);bad_bit['frames']['0']['A'][1]=bad_bit['frames']['0']['A'][0][:] + reject('singular_BIT_spectator_basis',lambda:bit_application(bad_bit,bc,br)) + q=w['ports'][0];basis=next(x for x in phases['recipes'] if x['q']==q)['idle_children'][0]['orthogonal_axes'][:8] + reject('singular_complex_route',lambda:route(q,basis[:-1]+basis[:1],1)) + transform=route(q,basis,1) + before=terms((1< Fraction(BIT), "completed selected BIT supplies outer floor") + return {"working_ambient": bit["ambient"], "completed_ordinary": "0.00385248", + "outer_floor": BIT, "retained_assumptions": claim["assumptions"]} + + +def graph_input(path, kind, word, receipt): + from network import Network + + can_sha, byte_sha = GRAPH_PINS[kind] + data, decoded = load(path, byte_sha) + require(decoded == can_sha and digest(canonical(data)) == can_sha, "exact canonical graph") + fixed = receipt["graphs"][kind] + require((fixed["canonical_sha256"], fixed["gzip_sha256"]) == (can_sha, byte_sha), + "exact wire gate binds graph") + metadata = data["metadata"] + require(metadata == {"schema": "p104-exact-banked-dag/v1", "kind": kind, + "peer_head": HEAD, "scientific_commit": SCIENCE, + "source_word_sha256": SOURCE, "caller_sha256": CALLER, + "role230_direct_word_sha256": DIRECT if kind == "candidate" else None, + "fixed_pivot_sha256": PIVOTS, "published_result_sha256": PR_RESULT}, + "fixed exact comparison scope") + require(data["frames"] == word["frames"] and data["initial"] == word["initial"] + and data["final"] == word["final"] and data["first_output"] == len(word["program"]), + "public boundary and frames") + moves = {key: (a, b) for key, a, b in data["moves"]} + forms = {key: {donor: Fraction(coef) for donor, coef in entries} + for key, entries in data["forms"]} + require(len(moves) == len(data["moves"]) == 6142 and len(forms) == len(data["forms"]) == 7643 + and all(len(forms[key]) == len(entries) for key, entries in data["forms"]), + "duplicate or lost graph slot") + require(all(coef for row in forms.values() for coef in row.values()), "nonzero literal reads") + graph = Network(data["first_output"], data["initial"], data["final"], moves, forms) + schedule = graph.schedule() + require(schedule == data["schedule"], "deterministic coframe and causal schedule") + return graph, schedule + + +def owner_and_phase(word, caller, signed): + from binding16 import contact_phase + from caller16 import literal_layout + + stages, types, role_sets = literal_layout(caller, word) + h = word["hosted"] + hosted = dict(zip(h["Dports"], zip(h["X2"], h["Y2"], strict=True), strict=True)) + main = set(word["live"]) | {r + 112 for r in word["live"]} | set(h["X2"]) | set(h["Y2"]) + helpers = sorted(set(range(1501)) - main) + owner_tags = {("main", port, role) for kind, spec in types.items() + for port in spec["ports"] for role in role_sets[kind]} + require(len(owner_tags) == 3536 == signed["root_owners"] and len(helpers) == 1101 + and len(main) == 400, "distinct whole root and helper owners") + phase_bases = load(HERE / "data/PHASE-BASES.json")[0]["by_q"] + phase_rows, mapped, exact_helpers = [], [], [] + for clock, event in enumerate(caller["events"]): + if event[0] != "J": + continue + _, stage, a, b = event + rows = {} + for j, (r, q) in enumerate(zip(word["live"], word["ports"], strict=True)): + y = r + 112 + require(word["frames"][word["initial"][r]] == [q] + and not word["frames"][word["initial"][y]], "actual main ingress") + if j in hosted: + u, v = hosted[j] + require(all(word[boundary][u] == word[boundary][r] + and word[boundary][v] == word[boundary][y] + for boundary in ("initial", "final")), "second-plane exact charts") + pairs = zip((r, y, u, v), a, strict=True) + else: + pairs = zip((r, y), b[:2], strict=True) + for slot, role in pairs: + tag = ("main", j, role) + require(tag in owner_tags and slot not in rows, "valid stage alias guard") + rows[slot] = tag + shifts, _ = contact_phase(q, phase_bases[str(q)], stage, caller["ambient_rank"]) + phase_rows.append([clock, j, shifts, 2 if j in hosted else 1]) + require(set(rows) == main and len(set(rows.values())) == 400, "injective main bindings") + for role in helpers: + rows[role] = ("helper", stage, role) + require(len(rows) == len(set(rows.values())) == 1501, "actual 1,501-input stage") + for role in (325, 1087): + require(rows[role] == ("helper", stage, role) + and (word["initial"][role], word["final"][role]) == (3, 237) + and not word["frames"][3] and word["frames"][237] == [30, 75, 138, 266], + "distinct arbitrary helper rank-four boundary") + exact_helpers.append([stage, role, 3, 237]) + mapped.append([stage, sorted(rows.items())]) + require(len(mapped) == stages and len(exact_helpers) == 32, "complete stage lineage") + contacts = sum(4 * row[3] for row in phase_rows) + require(contacts == 12800 and all(all(row[2]) for row in phase_rows) + and digest(canonical(phase_rows)) == "29196a9aa29ecf4b3705a6346c40642eef9b14600ccc832210df91c3e4f84f50", + "complete pre-existing same-caller phase context") + root_negative = sum(len(spec["ports"]) for spec in types.values() + for phase, _, *_ in spec["diagonal"] if phase == -1) + require(root_negative == 3536, "charge actual negative root ordinary head corrections") + return {"owners": sorted(owner_tags), "root_negative_corrections": root_negative, + "phase_contacts": contacts, "phase_digest": digest(canonical(phase_rows)), + "all_public_tag_digest": digest(canonical(mapped)), + "fresh_helpers": stages * len(helpers), "special_live_helpers": exact_helpers, + "main_roles": sorted(main)} + + +def independent_rank(word, graph, caller, signed): + dims, masks = [], [] + for basis in word["frames"]: + span = {0} + for row in basis: + require(type(row) is int and 0 < row < 512 and row not in span, + "independent actual chart basis") + span |= {row ^ v for v in span} + masks.append(span) + dims.append(len(basis)) + + def positive(pair, directed=False): + a, b = pair + require(0 <= a < len(masks) and 0 <= b < len(masks) + and (masks[a] < masks[b] or (not directed and masks[b] < masks[a])), + "actual positive nested chart pair") + return abs(dims[a] - dims[b]) + + main_roles = set(caller["main_roles"]) + native = Counter(positive(pair) for pair in graph.moves.values()) + helper = Counter(positive((graph.initial[r], graph.final[r]), True) + for r in range(word["public"]) if r not in main_roles) + p = Counter({rank: signed["calls"] * count for rank, count in native.items()}) + t = Counter({rank: signed["calls"] * count for rank, count in helper.items()}) + p.update(signed["fixed_caller_paid"]) + t.update(signed["fixed_root_targets"]) + require(sum(p.values()) == 101824 and sum(t.values()) == 21152 + and sum(rank * (t[rank] - p[rank]) for rank in p.keys() | t.keys()) == 1328, + "actual complete paid and productive counts") + return native, helper, p, t + + +def make_invoice(reference, p, t): + return {**reference, "paid": {str(k): v for k, v in p.items()}, + "targets": {str(k): v for k, v in t.items()}} + + +def price(empty, invoice, point): + from evaluate_recursive_power import evaluate + + at = 1 - Fraction(point) + check = evaluate(empty, invoice, at, 256) + require(check["classification"] in ("new_cost_lower", "new_cost_higher"), + "directed price undetermined") + return check + + +def decimal_integer(k, places): + base = 10**places + return f"{k // base}.{k % base:0{places}d}" + + +def find_crossing(empty, invoice): + places = 13 + lo = int(Fraction(TARGET) * 10**places) + hi = int(Fraction("0.00372611") * 10**places) + require(price(empty, invoice, decimal_integer(lo, places))["classification"] == "new_cost_lower" + and price(empty, invoice, decimal_integer(hi, places))["classification"] == "new_cost_higher", + "candidate bracket right of fixed target") + while hi - lo > 1: + mid = (lo + hi) // 2 + if price(empty, invoice, decimal_integer(mid, places))["classification"] == "new_cost_lower": + lo = mid + else: + hi = mid + return decimal_integer(lo - 1, places), decimal_integer(lo, places), decimal_integer(hi, places) + + +def numerical(empty, invoice, p, t, triple, baseline_sign): + from interval_gate import gate + + claim, lower, upper = triple + probe = Fraction(claim) + 7 * GAP + rows = {} + for point, direction in ((claim, "lower"), (str(probe), "lower"), (lower, "lower"), + (upper, "higher"), (BL, baseline_sign)): + check = price(empty, invoice, point) + require(check["classification"] == "new_cost_" + direction, "strict endpoint " + point) + rows[point] = check + outer = gate({"P": p, "T": t}, claim, probe, lower, upper, BIT) + o = outer["outer"] + require(o["strict_count"] == 54 and o["functional_count"] == 4 + and Fraction(o["minimum_margin"]) > 0, "all exact numerical outer predicates") + return {"decimal_claim": claim, "bracket": [lower, upper], + "directed_checks": rows, "compiler": outer} + + +def main(): + parser = ArgumentParser(description=__doc__) + for field in ("package", "engine-dir", "parent-graph", "candidate-graph", "graph-receipt", "out"): + parser.add_argument("--" + field, required=True, type=Path) + args = parser.parse_args() + args.out.mkdir() + bit = pinned_inputs(args.package, args.engine_dir) + sys.path[:0] = [str(HERE), str(HERE / "vendor"), str(args.package.resolve()), + str(args.package.resolve() / "source"), str(args.engine_dir.resolve())] + from bank_cost import dispatch_fixture, ordinary_cost + from caller import caller_replay + from caller16 import signed_caller + from native import check_endpoints + from network import networks, source_word + from physical import budget + + ref = load(args.package / "RESULT.json", PR_RESULT)[0] + wire = load(args.graph_receipt, WIRE_RESULT)[0] + require(wire["status"] == "PASS_BANK24_WIRE_COMMUTATION", "exact positive wire receipt") + word = source_word() + caller, caller_sha = load(args.package / "source/caller.json.gz") + require(caller_sha == CALLER and digest(canonical(word)) == SOURCE, "actual 16-call source") + peer, peer_order = graph_input(args.parent_graph, "peer", word, wire) + child, child_order = graph_input(args.candidate_graph, "candidate", word, wire) + _, expected_peer, pivot_rows = networks(word) + require(expected_peer == peer and pivot_rows == ref["application"]["pivots"] + and len(pivot_rows) == 15, "actual published parent fixed pivots") + require(peer.moves.keys() == child.moves.keys() + and set(i for i in peer.moves if peer.moves[i] != child.moves[i]) == {97471, 102393}, + "no extra paid child in exact graph") + emit(args.out, "INPUTS.json", {"graph_pins": GRAPH_PINS, "wire_sha256": WIRE_RESULT, + "caller_sha256": CALLER, "public_parent_head": HEAD, "bit": bit}) + + old_signed = caller_replay(caller, word) + require(json.loads(json.dumps(old_signed, sort_keys=True)) == ref["application"]["caller"], + "exact #7674 signed caller receipt") + signed = signed_caller(caller, word, 2025, 9) + for a, b in (("fixed_caller_paid", "paid"), ("fixed_root_targets", "targets"), + ("uses", "uses"), ("root_owners", "root_owners"), ("exact_preproduct_divisions", "exact_preproduct_divisions"), + ("peak_scaled_mass", "peak_scaled_mass"), ("dyadic_height", "dyadic_height")): + require(signed[a] == old_signed[b], "second exact caller replay: " + a) + owners = owner_and_phase(word, caller, signed) + require(owners["fresh_helpers"] == 17616, "distinct arbitrary helper roots") + emit(args.out, "CALLER.json", {"signed": signed, "owners": owners}) + + p_native, p_helper, p, t = independent_rank(word, peer, owners, signed) + c_native, c_helper, cp, ct = independent_rank(word, child, owners, signed) + expected = ref["application"]["invoice"] + original = make_invoice(expected, p, t) + candidate = make_invoice(expected, cp, ct) + require(original == expected and p_helper == c_helper and t == ct, "exact original P/T and target preservation") + require((cp - p, p - cp) == (Counter({2: 16, 4: 16}), Counter({3: 32})), + "only the two paid ranks changed on the full tape") + emit(args.out, "INVOICES.json", {"peer": original, "candidate": candidate, + "native_paid": {"peer": p_native, "candidate": c_native}, + "native_helper_targets": p_helper}) + empty = make_invoice(expected, {}, {}) + old_number = numerical(empty, original, p, t, PARENT, "higher") + triple = find_crossing(empty, candidate) + new_number = numerical(empty, candidate, cp, ct, triple, "lower") + require(Fraction(triple[0]) > Fraction(BL), "strict directed increase at safety claim") + paid_tax = deepcopy(candidate) + paid_tax["paid"]["1"] += 1 + erases_gain = price(empty, paid_tax, BL) + require(erases_gain["classification"] == "new_cost_higher", "extra paid charge control") + emit(args.out, "PRICE-OUTER.json", {"peer": old_number, "candidate": new_number, + "added_rank_one_charge": erases_gain}) + print("PASS signed paired caller, actual complete P/T, split compiler and 54+4", flush=True) + + grid = {"peer": check_endpoints(peer, word), "candidate": check_endpoints(child, word)} + require(grid["peer"] == ref["native"], "exact published fixed bank endpoint/grid replay") + emit(args.out, "GRAPH-GRID.json", grid) + merged = {**signed, **owners} + costs = {} + for kind, graph, schedule, paid, target, numeric in ( + ("peer", peer, peer_order, p, t, old_number), + ("candidate", child, child_order, cp, ct, new_number), + ): + c = numeric["compiler"] + original_budget = budget(graph, caller, grid[kind], old_signed, paid, target, c) + if kind == "peer": + require(original_budget == ref["application"]["physical"], + "published finite budget reproduces before adding common explicit charges") + fixture = dispatch_fixture(word, graph, schedule, int(grid[kind]["grid"])) + costs[kind] = {"original_budget": original_budget, "dispatcher": fixture, + "explicit_complete_cost": ordinary_cost(word, graph, grid[kind], merged, + c, original_budget, fixture)} + emit(args.out, "PHYSICAL.json", costs) + result = { + "status": "PASS_BANK24_ACTUAL16_APPLICATION_COMPONENT", + "candidate_directed_conditional_lower": triple[0], + "candidate_raw_bracket": list(triple[1:]), + "published_peer_upper": BL, + "strict_gap": str(Fraction(triple[0]) - Fraction(BL)), + "graphs": GRAPH_PINS, + "caller_sha256": CALLER, + "signed_paid_delta": {"2": 16, "3": -32, "4": 16}, "signed_target_delta": {}, + "paid_count": sum(cp.values()), "productive_count": sum(ct.values()), + "scope": "Paired exact normalized banked graph and caller, physical snapshot scheduler in normalized coordinates, all-width ordinary accounting under the selected five assumptions, and complete rank funding and outer numerical probes. Separate held-field native map receipts bind all shaped paid operators; the compiled multiplier is an inherited conditional construction.", + } + emit(args.out, "RESULT.json", result) + print(result["status"], triple[0], flush=True) + + +if __name__ == "__main__": + main() diff --git a/research/p104-role230-banked/engines/check_banked_provider_cost.py b/research/p104-role230-banked/engines/check_banked_provider_cost.py new file mode 100644 index 0000000000..083c5a5b73 --- /dev/null +++ b/research/p104-role230-banked/engines/check_banked_provider_cost.py @@ -0,0 +1,313 @@ +#!/usr/bin/env python3 +"""Check physical ownership, safe path grids and complete ordinary bank costs.""" + +from collections import Counter +from fractions import Fraction +from hashlib import sha256 +from math import lcm +from pathlib import Path +import argparse +import gzip +import json + + +HEAD = "28b2af322a1fab01b3734365988930920f9dda48" +GRAPH = { + "peer": "d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098", + "candidate": "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150", +} +PEER_RESULT = "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38" +PIVOTS = "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85" +CALLER = "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf" +CALLER_ODD = 2025 +NATIVE_STAGES = 16 +SELECTOR_TAPES = 7 +STREAM_ROLES = ("running row accumulator", "staged read-only donor or field transfer", + "full product and arithmetic work", "quotient and completed install payload") + + +def require(ok, reason): + if not ok: + raise ValueError(reason) + + +def encode(value): + return json.dumps(value, sort_keys=True, separators=(",", ":")).encode() + + +def digest(raw): + return sha256(raw).hexdigest() + + +def import_graph(path, metadata, side): + packed = path.read_bytes() + require(digest(packed) == metadata["gzip_sha256"], f"exact {side} gzip") + raw = gzip.decompress(packed) + require(digest(raw) == metadata["canonical_sha256"] == GRAPH[side], f"exact {side} graph") + graph = json.loads(raw) + stamp = graph["metadata"] + require(encode(graph) == raw and stamp["schema"] == "p104-exact-banked-dag/v1" + and stamp["kind"] == side and stamp["peer_head"] == HEAD + and stamp["fixed_pivot_sha256"] == PIVOTS and stamp["published_result_sha256"] == PEER_RESULT + and stamp["caller_sha256"] == CALLER, f"{side} immutable graph contract") + return graph + + +def span(basis): + values = {0} + for item in basis: + require(type(item) is int and 0 < item < 512 and item not in values, "independent chart rows") + values.update({value ^ item for value in values}) + return values + + +def provider(graph): + n = len(graph["initial"]) + require(n == len(graph["final"]) == 1501, "same public boundary") + first = graph["first_output"] + moves = {int(key): (source, target) for key, source, target in graph["moves"]} + rows = {int(key): [(int(donor), Fraction(value)) for donor, value in data] + for key, data in graph["forms"]} + terminal_keys = set(range(first, first+n)) + order = graph["schedule"] + k = len(moves) + require(k == len(graph["moves"]) == 6142 and len(rows) == len(graph["forms"]) == n+k, + "one record per paid or terminal row") + require(set(moves).isdisjoint(terminal_keys) and set(rows) == set(moves) | terminal_keys + and set(order) == set(rows) and len(order) == len(rows), "exact scheduled graph denominator") + spaces = [span(v) for v in graph["frames"]] + returns = {node: 2*n+k+1+j for j, node in enumerate(sorted(moves))} + accum = {node: n+1+j for j, node in enumerate(sorted(rows))} + tags = [r+1 for r in range(n)] + list(accum.values()) + list(returns.values()) + homes = 2*n+2*k+4 + tags += list(range(homes-3, homes+1)) + require(len(set(tags)) == len(tags) == homes and set(tags) == set(range(1, homes+1)), + "separate data homes and four scratch slots, excluding charged dummy") + + # Only entrances and completed paid returns can be GET donors. + available = {~r: (chart, r+1, 1, Fraction(1)) for r, chart in enumerate(graph["initial"])} + live_terminal = set() + p_ranks, directions = Counter(), Counter() + denominator, largest_mass, peak = 1, Fraction(1), None + terms = 0 + numeric_numerator_bits, numeric_denominator_bits = 0, 0 + schedule_hash = sha256() + for key in order: + source = moves[key][0] if key in moves else graph["final"][key-first] + row_mass = Fraction() + row_bound = 1 + seen = set() + schedule_hash.update(encode(["ZERO_ACC", accum[key], source])) + for donor, value in rows[key]: + require(donor in available and donor not in seen and value, f"no early, duplicate or zero GET at {key}") + chart, slot, donor_bound, donor_mass = available[donor] + require(source == chart and slot != accum[key], f"coframe GET or alias failure at {key}") + seen.add(donor) + row_mass += abs(value)*donor_mass + row_bound = lcm(row_bound, donor_bound*value.denominator) + numeric_numerator_bits = max(numeric_numerator_bits, abs(value.numerator).bit_length()) + numeric_denominator_bits = max(numeric_denominator_bits, value.denominator.bit_length()) + schedule_hash.update(encode(["GET", slot, accum[key], chart, str(value)])) + terms += 1 + if row_mass > largest_mass: + largest_mass, peak = row_mass, key + denominator = lcm(denominator, row_bound) + if key in moves: + dest = moves[key][1] + require(spaces[source] < spaces[dest] or spaces[dest] < spaces[source], + "relative paid Gauss chart needs the retained nested normal form") + rank = abs(len(graph["frames"][dest])-len(graph["frames"][source])) + require(rank > 0, "nondegenerate declared paid child") + p_ranks[rank] += 1 + directions["ascending" if spaces[source] < spaces[dest] else "descending"] += 1 + schedule_hash.update(encode(["MOVE_AND_SAVE", accum[key], returns[key], source, dest, rank])) + available[key] = dest, returns[key], row_bound, row_mass + else: + live_terminal.add(key) + require(live_terminal == terminal_keys and len(available) == n+k, "all deferred terminal/public installs") + for role in range(n): + schedule_hash.update(encode(["PUBLIC_INSTALL", accum[first+role], role, graph["final"][role]])) + dyadic = (denominator & -denominator).bit_length()-1 + return {"entrance_snapshots": n, "paid_children_and_saved_returns": k, "terminal_installs": n, + "actual_form_accumulators": n+k, "private_get_terms": terms, "private_homes": homes, + "home_slots_with_dummy": homes+1, "scheduled_provider_digest": schedule_hash.hexdigest(), + "paid_native_ranks": dict(p_ranks), "paid_native_directions": dict(directions), + "path_grid": denominator, "path_grid_odd": denominator >> dyadic, + "path_grid_height": dyadic, "positive_path_mass_bound_unscaled": str(largest_mass), + "positive_path_mass_peak_node": peak, + "literal_bits_num_den": [numeric_numerator_bits, numeric_denominator_bits]} + + +def raw_caller(caller_file): + raw = gzip.decompress(caller_file.read_bytes()) + require(digest(raw) == CALLER, "exact 16-call caller decode") + word = json.loads(raw) + require(word["ambient_rank"] == 137 and word["stages"] == 16, "cookie-free complete caller geometry") + require([event[1] for event in word["events"] if event[0] == "J"] == list(range(1,17)), + "literal joint schedule") + ports = {key: len(group["ports"]) for key, group in word["types"].items()} + uses = Counter() + max_literal_bits = 0 + for event in word["events"]: + if event[0] != "J": + uses[event[1]] += ports[event[0]] + if event[1] in {"SCALE", "ADD"}: + factor = Fraction(event[-1]) + max_literal_bits = max(max_literal_bits, abs(factor.numerator).bit_length(), + factor.denominator.bit_length()) + roots = sum(ports[key]*group["roles"] for key, group in word["types"].items()) + negative = sum(ports[key] * sum(row[0] < 0 for row in group["diagonal"]) + for key, group in word["types"].items()) + require((roots,negative,uses["IDLE_ODD"]) == (3536,3536,32), + "actual root ordinary q translation and signed idle census") + return roots, negative, uses, max_literal_bits + + +def addressed_budget(counts, uses, roots, negative, coefficient_bits): + n,k,t,h = [counts[name] for name in ("entrance_snapshots", "paid_children_and_saved_returns", + "private_get_terms", "private_homes")] + conversions = 2*(roots+16*n) + resets = 2*h+8*(t+k+n)+4*n + transfers = 2*t+2*(k+n)+6*k+4*n + selector_l = 14*h+9 + selector_const = 63*h-7*h.bit_count()+27*h.bit_length()+59 + stream_count = len(STREAM_ROLES) + local_tracks = SELECTOR_TAPES+stream_count + layout_guard_cells = 2*NATIVE_STAGES*local_tracks + charged_pairs = 2*(101824+21152+16*400) + 2*(uses["IDLE_ONE"]+uses["IDLE_ODD"]) + charged_pairs += 3*uses["QUERY"]+uses["LAMBDA"]+uses["IDLE_ODD"]+negative + require(charged_pairs == 280480, "all ordinary native/caller monomial slots") + scalar_count = 32*(16*(t+4*(k+n)+2*n+h)+sum(uses.values())+conversions) + return { + "baseline_counting_units": "matched guarded finite exact implementation", + "actual_data_homes_per_native": h, "addressed_slots_per_native": h+1, + "actual_data_homes_raw": NATIVE_STAGES*h, "addressed_slots_raw": NATIVE_STAGES*(h+1), + "separate_guarded_streams_per_native": stream_count, + "separate_guarded_streams_raw": NATIVE_STAGES*stream_count, + "added_separate_stream_cells_per_native": "4(L'+2)", + "separate_stream_functions": STREAM_ROLES, + "selector_and_stream_tracks_per_stage": local_tracks, + "raw_stage_volume_M": "sum_stage[(h+6)(L'+2)+ell(N_c)+ell(W')+max(ell(N_c),ell(W'),ell(h))+max(N_c,h)+max(W',ell(h))+10]", + "layout_shadow_cells_upper": f"M+{layout_guard_cells}", + "raw_construction_complete_entry_exit_retirement_steps_upper": f"34*(256(M+{layout_guard_cells})+128) plus descriptor polynomial", + "actual_odd_scale_and_unscale_conversions": conversions, + "primitive_reset_services_upper_per_native": resets, + "typed_selected_transfers_upper_per_native": transfers, + "maximum_rebased_selector_instructions_L_and_constant": [selector_l,selector_const], + "complete_wrapper_reset_copy_instructions_per_native_L_and_constant": [ + resets*selector_l+transfers*(selector_l+128), + resets*selector_const+transfers*(selector_const+320)], + "per_raw_scalar_services_upper": scalar_count, + "maximum_literal_or_odd_scale_bits": coefficient_bits, + "scalar_steps_per_padded_payload_cell_upper": 2**max(20, coefficient_bits+8), + "ordinary_map_slots": charged_pairs, + "ordinary_elementary_record_upper": charged_pairs*4*154**2, + "view_extent": "L'=N_c(2(W+26)+3)", + "booked_additional_ordinary_work": "guide production/retirement, disjoint staging backing, explicit 34 raw local layout scans, bounded descriptor polynomials, per-stage guard and history spans, all numerical adapters and child view returns", + "positive_recursive_bank_get_copy_reset_charges": 0, + } + + +def actual_application(path, counted): + inputs = json.loads((path / "INPUTS.json").read_bytes()) + result = json.loads((path / "RESULT.json").read_bytes()) + caller = json.loads((path / "CALLER.json").read_bytes())["signed"] + require(inputs["public_parent_head"] == HEAD and inputs["caller_sha256"] == CALLER + and {name: record[0] for name, record in inputs["graph_pins"].items()} == GRAPH + and result["status"] == "PASS_BANK24_ACTUAL16_APPLICATION_COMPONENT", + "actual signed application pins") + require(caller["odd_scale"] == CALLER_ODD and caller["dyadic_height"] == 9 + and Fraction(caller["peak_scaled_mass"]) == Fraction(495734175,2), + "actual caller scale, dyadic height and measured pre-product envelope") + prices = json.loads((path / "PRICE-OUTER.json").read_bytes()) + invoices = json.loads((path / "INVOICES.json").read_bytes()) + grids = json.loads((path / "GRAPH-GRID.json").read_bytes()) + records = {} + for side in ("peer", "candidate"): + scoped = prices[side]["compiler"] + require(scoped["outer"]["strict_count"] == 54 and scoped["outer"]["functional_count"] == 4, + "paired actual signed outer scope") + grid, independent = grids[side], counted[side] + require(independent["path_grid"] % int(grid["grid"]) == 0 + and grid["terms"] == independent["private_get_terms"] + and grid["slots"] == independent["paid_children_and_saved_returns"], "signed actual grid receipt") + require(Fraction(grid["peak_scaled_mass"])/grid["odd"] + <= Fraction(independent["positive_path_mass_bound_unscaled"]), "validated exact mass bounded") + bill = invoices[side] + require(sum(bill["paid"].values()) == 101824 and sum(bill["targets"].values()) == 21152, + "actual complete signed totals") + records[side] = {"H": int(scoped["H"]), "native_odd": grid["odd"], + "native_height": grid["dyadic_height"], "scaled_mass": grid["peak_scaled_mass"]} + a, b = [invoices[s]["paid"] for s in ("peer", "candidate")] + delta = {int(k): b.get(k,0)-a.get(k,0) for k in a.keys() | b.keys() if a.get(k,0) != b.get(k,0)} + require(delta == {2:16,3:-32,4:16} + and invoices["peer"]["targets"] == invoices["candidate"]["targets"], "actual matched P/T") + return records + + +def main(args): + binder = json.loads(args.binding.read_bytes()) + require(binder["status"] == "FROZEN_BOTH_ORDERS_WITH_EXACT_STABLE_KEYS", "frozen graph custody") + peer_raw = args.peer_result.read_bytes() + require(digest(peer_raw) == PEER_RESULT, "actual submitted #7674 result") + reported_peer = json.loads(peer_raw) + graphs = {side: import_graph(args.binding.parent / binder["graphs"][side]["file"], + binder["graphs"][side], side) for side in ("peer", "candidate")} + require(all(graphs["peer"][key] == graphs["candidate"][key] + for key in ("frames","initial","final","first_output")), "matched actual boundary and atlas") + a, b = [{key: (source, dest) for key, source, dest in graphs[side]["moves"]} + for side in ("peer", "candidate")] + require(a.keys() == b.keys() and {k for k in a if a[k] != b[k]} == {97471,102393}, + "exact fixed stable paid keys and only the two scoped charts") + counted = {side: provider(graphs[side]) for side in graphs} + old, new = counted["peer"], counted["candidate"] + require(old["path_grid"] == int(reported_peer["native"]["grid"]) + and old["private_get_terms"] == reported_peer["native"]["terms"] == 169343 + and new["private_get_terms"] == 169349, "independent filed and transferred term/grid census") + paid_change = {r: 16*(new["paid_native_ranks"].get(r,0)-old["paid_native_ranks"].get(r,0)) + for r in old["paid_native_ranks"] | new["paid_native_ranks"]} + require({r: v for r,v in paid_change.items() if v} == {2:16,3:-32,4:16}, "no extra paid rank position") + roots, negative, uses, caller_bits = raw_caller(args.caller) + odd = lcm(old["path_grid_odd"],new["path_grid_odd"]) + height = max(old["path_grid_height"],new["path_grid_height"]) + # Deliberately cancellation-free to cover all materialized partial sums. + native_mass = odd*max(Fraction(entry["positive_path_mass_bound_unscaled"]) for entry in counted.values()) + context_mass = native_mass*Fraction(495734175,2) + mass_bits = ((context_mass.numerator + context_mass.denominator - 1)//context_mass.denominator).bit_length() + c = 2*max(height+9,mass_bits) + coefficient_bits = max(odd.bit_length(), CALLER_ODD.bit_length(), caller_bits, + *old["literal_bits_num_den"], *new["literal_bits_num_den"]) + require(coefficient_bits <= 24, "matched W+26 checked exact scalar service") + ordinary = {side: addressed_budget(counts, uses, roots, negative, coefficient_bits) + for side, counts in counted.items()} + peer_h = reported_peer["application"]["physical"]["H"] + bound = actual_application(args.application_dir, counted) if args.application_dir else None + thresholds = [int(peer_h)] if bound is None else [bound[side]["H"] for side in ("peer", "candidate")] + require(thresholds[0] == int(peer_h), "actual peer threshold matches submitted object") + K = 1920*153**1920*(max(thresholds)+1)**2 + require((c*K).bit_length() < min(thresholds), "retained rank threshold and common exact grid") + output = {"status": "PASS_PAIRED_BANKED_PHYSICAL_COST_COMPONENT", + "scope": "Explicit full held-field, addressed ordinary proof and independent safe context audit; no complete fixed tape or arbitrary-input operator replay", + "graphs": GRAPH, "caller_decode": CALLER, "head": HEAD, "native": counted, + "normalized_physical_bounds": ordinary, "same_signed_delta": {"paid": {2:16,3:-32,4:16}, "targets": {}}, + "common_exact_root": {"native_odd": odd, "native_height": height, "caller_odd": CALLER_ODD, + "caller_height": 9, "safe_native_absolute_scaled_mass": str(native_mass), + "safe_context_absolute_scaled_mass": str(context_mass), "context_mass_bits": mass_bits, + "context_c": c,"compared_H_values": thresholds, + "bounded_depth_guard_bits": (c*K).bit_length(), + "actual_candidate_H_bound": bound is not None, + "grid": "2^-(p+D)", "W": "p+h+2D+3", "temporary": "W+26"}} + if bound is not None: + output["actual_signed_grid_and_compiler"] = bound + with args.out.open("x", encoding="utf-8") as stream: + json.dump(output, stream, sort_keys=True, indent=2) + stream.write("\n") + print(output["status"]) + + +if __name__ == "__main__": + parser = argparse.ArgumentParser(description=__doc__) + for name in ("binding","peer-result","caller","out"): + parser.add_argument("--"+name,type=Path,required=True) + parser.add_argument("--application-dir",type=Path) + main(parser.parse_args()) diff --git a/research/p104-role230-banked/engines/check_price.py b/research/p104-role230-banked/engines/check_price.py new file mode 100644 index 0000000000..8785a1337d --- /dev/null +++ b/research/p104-role230-banked/engines/check_price.py @@ -0,0 +1,184 @@ +#!/usr/bin/env python3 +"""Independent rational bounds on the two frozen banked invoices.""" + +from argparse import ArgumentParser +from fractions import Fraction +from functools import lru_cache +from hashlib import sha256 +import json +from pathlib import Path + + +INVOICE = "a9aecf52d99d5370506b9dc6d03799241bebd2c03bbdcfa2dd5f45ec03c9d70d" +OUTER = "8e29f3ebb19c849884cfb87ef39431616774acfe95fa28a3cfe2e124abc6d202" +PEER = "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38" +RESULT = "b1af8b101a40f25eea55a8b58443794a7db708389ad66c20adefbace12828e09" +PLAN = "509c44b078561a8868b68dab9f50b0b7d87d0976361d927bc8cc6bfdf1239393" +F = Fraction +Q = 1 << 160 +BIT = F("0.00376669") +PEER_CLAIM = F("0.0037260455556") +CHILD_CLAIM = F("0.0037261023899") +PEER_BRACKET = tuple(map(F, ("0.00372604555571", "0.00372604555572"))) +CHILD_BRACKET = tuple(map(F, ("0.0037261023900", "0.0037261023901"))) + + +def require(predicate, reason): + if not predicate: + raise ValueError(reason) + + +def load_exact(path, expected): + raw = path.read_bytes() + require(sha256(raw).hexdigest() == expected, f"frozen bytes changed: {path.name}") + return json.loads(raw) + + +def outward(lower, upper): + return F(lower * Q // 1, Q), F(-((-upper * Q) // 1), Q) + + +def log_unit(value): + """Lower partial sum and upper geometric tail on log(value), 1 <= value <= 2.""" + u = (value - 1) / (value + 1) + require(0 <= u <= F(1, 3), "range reduction for the logarithm") + square, term, total = u * u, u, F() + for index in range(28): + total += 2 * term / (2 * index + 1) + term *= square + return total, total + 2 * term / (57 * (1 - square)) + + +@lru_cache(maxsize=None) +def log_rank(rank): + power = rank.bit_length() - 1 + low2, high2 = log_unit(F(2)) + low, high = log_unit(F(rank, 1 << power)) + return outward(power * low2 + low, power * high2 + high) + + +def positive_exp(value): + """Bound exp(value) from its first 27 positive terms and the remaining tail.""" + require(0 <= value <= 1, "range reduction for the exponential") + term, total = F(1), F(1) + for index in range(1, 27): + term *= value / index + total += term + first_omitted = term * value / 27 + return total, total + first_omitted / (1 - value / 28) + + +@lru_cache(maxsize=None) +def power_rank(rank, k_low, k_high): + require(0 <= k_low <= k_high < 1, "positive exponent interval") + log_low, log_high = log_rank(rank) + x_low, x_high = outward((1-k_high) * log_low / 8, (1-k_low) * log_high / 8) + low = positive_exp(x_low)[0] + high = positive_exp(x_high)[1] + low, high = outward(low, high) + for _ in range(3): + low, high = outward(low * low, high * high) + return low, high + + +def moment(coefficients, k_low, k_high, derivative=False): + low, high = F(), F() + for rank, coeff in sorted(coefficients.items()): + term_low, term_high = power_rank(rank, k_low, k_high) + if derivative: + log_low, log_high = log_rank(rank) + term_low, term_high = -term_high * log_high, -term_low * log_low + lower, upper = sorted((term_low * coeff, term_high * coeff)) + low, high = low + lower, high + upper + return low, high + + +def read_history(invoice): + p = {int(k): v for k, v in invoice["paid"].items()} + t = {int(k): v for k, v in invoice["targets"].items()} + require(all(1 <= k <= 137 and type(v) is int and v > 0 + for series in (p, t) for k, v in series.items()), "literal positive rank bill") + require(sum(p.values()) == 101824 and sum(t.values()) == 21152, "full bill denominators") + coeff = {k: t.get(k, 0) - p.get(k, 0) for k in p.keys() | t.keys()} + require(sum(k * v for k, v in coeff.items()) == 1328, "retained signed rank surplus") + return p, t, coeff + + +def per_side(invoice, received, claim, bracket, comparator, comparator_sign): + _, _, coeff = read_history(invoice) + require(F(received["decimal_claim"]) == claim and tuple(map(F, received["bracket"])) == bracket, + "same directed endpoints shown in the application receipt") + query = {claim: 1, claim + F(7, 10**14): 1, bracket[0]: 1, bracket[1]: -1} + require(comparator not in query or query[comparator] == comparator_sign, "consistent comparator sign") + query[comparator] = comparator_sign + points = {} + for point, sign in query.items(): + bounds = moment(coeff, point, point) + require(bounds[0] > 0 if sign > 0 else bounds[1] < 0, f"strict moment sign at {point}") + points[str(point)] = list(map(str, bounds)) + derivative = moment(coeff, PEER_CLAIM, BIT, derivative=True) + require(derivative[1] < 0, "strictly decreasing moment on the shared comparison interval") + return { + "claim": str(claim), "bracket": list(map(str, bracket)), "target_minus_paid": points, + "derivative_range": list(map(str, derivative)), + "derivative_interval_kappa": [str(PEER_CLAIM), str(BIT)], + } + + +def main(): + parser = ArgumentParser(description=__doc__) + for name in ("invoices", "outer", "application", "peer-result", "out"): + parser.add_argument("--" + name, required=True, type=Path) + parser.add_argument("--plan-sha256", required=True) + args = parser.parse_args() + require(args.plan_sha256 == PLAN, "registered independent rational price check") + invoices = load_exact(args.invoices, INVOICE) + outer = load_exact(args.outer, OUTER) + published = load_exact(args.peer_result, PEER)["application"] + applied = load_exact(args.application, RESULT) + require(applied["status"] == "PASS_BANK24_ACTUAL16_APPLICATION_COMPONENT" + and invoices["peer"] == published["invoice"], "same complete #7674 comparator") + require(applied["graphs"]["peer"][0] == "d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098" + and applied["graphs"]["candidate"][0] == "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150", + "actual frozen peer and child graph identities") + peer_p, peer_t, _ = read_history(invoices["peer"]) + child_p, child_t, child_coeff = read_history(invoices["candidate"]) + delta = {k: child_p.get(k, 0) - peer_p.get(k, 0) for k in peer_p.keys() | child_p.keys()} + require({k: change for k, change in delta.items() if change} == {2: 16, 3: -32, 4: 16} + and peer_t == child_t, "the only signed fee change is the paid rank redistribution") + compared = PEER_BRACKET[1] + improvement = moment({2: -16, 3: 32, 4: -16}, compared, compared) + require(0 < improvement[0] <= improvement[1] < 1, "strict improvement with no rank-one fee") + child_plus_fee = dict(child_coeff) + child_plus_fee[1] -= 1 + control = moment(child_plus_fee, compared, compared) + require(control[1] < 0, "a single added rank-one charge rejects the claimed comparison") + gap = CHILD_CLAIM - compared + require(gap == F(applied["strict_gap"]) == F(2841709, 50000000000000), "exact strict gap") + result = { + "status": "PASS_BANK24_REVIEW_INDEPENDENT_DIRECTED_PRICE", + "scope": "Independent signed-rank moment brackets, derivative and added-price control", + "inputs": {"invoices": INVOICE, "outer_receipt": OUTER, "application": RESULT, + "published_peer": PEER, "plan_receipt": PLAN, + "source": sha256(Path(__file__).read_bytes()).hexdigest()}, + "graphs": applied["graphs"], "caller_sha256": applied["caller_sha256"], + "paid_count_each": 101824, "target_count_each": 21152, + "rank_mass_surplus_each": 1328, "paid_delta": {2: 16, 3: -32, 4: 16}, + "target_delta": {}, "strict_gap": str(gap), + "peer": per_side(invoices["peer"], outer["peer"], PEER_CLAIM, PEER_BRACKET, compared, -1), + "candidate": per_side(invoices["candidate"], outer["candidate"], CHILD_CLAIM, + CHILD_BRACKET, compared, 1), + "target_minus_paid_improvement_at_peer_upper": list(map(str, improvement)), + "actual_child_added_one_rank_one_fee_control": list(map(str, control)), + } + for path, digest in ((args.invoices, INVOICE), (args.outer, OUTER), + (args.application, RESULT), (args.peer_result, PEER)): + require(sha256(path.read_bytes()).hexdigest() == digest, f"input changed: {path.name}") + with args.out.open("x") as handle: + json.dump(result, handle, indent=2, sort_keys=True) + handle.write("\n") + print(result["status"]) + + +if __name__ == "__main__": + main() diff --git a/research/p104-role230-banked/engines/frozen/clifford_exact.py b/research/p104-role230-banked/engines/frozen/clifford_exact.py new file mode 100644 index 0000000000..166841a037 --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/clifford_exact.py @@ -0,0 +1,149 @@ +"""Small exact Gaussian-dyadic Clifford compiler, independent of gx internals. +Paulis use i^p X^x Z^z. State vectors use integer Gaussian numerators / 2^d. +The tableau is supplemented by a literal circuit, so global phases are kept. +""" +from dataclasses import dataclass + +def parity(x):return x.bit_count()&1 +def rank(rows): + p={} + for x in rows: + while x: + b=x.bit_length()-1 + if b not in p:p[b]=x;break + x^=p[b] + return len(p) +def transpose(rows,n):return tuple(sum(((rows[j]>>i)&1)<>j&1);a[j],a[k]=a[k],a[j] + for i in range(n): + if i!=j and a[i]>>j&1:a[i]^=a[j] + assert [r&((1<>n for r in a) +def basis_extend(cols,n): + out=[] + for x in list(cols)+[1<len(out):out.append(x) + assert len(out)==n + return tuple(out) +def nullspace(rows,n): + a=list(rows);p=[];k=0 + for j in range(n): + t=next((i for i in range(k,len(a)) if a[i]>>j&1),None) + if t is None:continue + a[t],a[k]=a[k],a[t] + for i in range(len(a)): + if i!=k and a[i]>>j&1:a[i]^=a[k] + p.append(j);k+=1 + return tuple((1<>j)&1)<>i&1:out=pmul(out,T[i]) + for i in range(n): + if z>>i&1:out=pmul(out,T[n+i]) + return out +def compose(A,B):return tuple(apply(A,p) for p in B) +def inverse(T): + n=len(T)//2;cols=[x|(z<>n;u,v,p=apply(T,(x,z,0));assert (u,v)==identity(n)[j][:2];out.append((x,z,(-p)%4)) + return tuple(out) +def qvalue(Q,alpha,x,n): + return (sum(alpha[i] for i in range(n) if x>>i&1)+2*sum(parity((Q[i]>>(i+1))&(x>>(i+1))) for i in range(n) if x>>i&1))%4 +def mul_i(a,p): + x,y=a;p%=4 + return [(x,y),(-y,x),(-x,-y),(y,-x)][p] +@dataclass +class Op: + n:int + tab:tuple + circuit:list + def then(self,b): + assert self.n==b.n + return Op(self.n,compose(b.tab,self.tab),self.circuit+b.circuit) + def adjoint(self): + circ=[] + for e in reversed(self.circuit): + if e[0]=='P':circ.append(('P',inv(e[1],self.n))) + elif e[0]=='D':circ.append(('D',e[1],tuple((-x)%4 for x in e[2]))) + elif e[0]=='C':circ.append(('C',e[1],-e[2])) + elif e[0]=='phase':circ.append(('phase',(-e[1])%4)) + else:circ.append(e) + return Op(self.n,inverse(self.tab),circ) + def zero_state(self,basis=0): + N=1<>i)&1 for i in range(n)) + assert all(alpha[i]%2==(Q[i]>>i)&1 for i in range(n)) + return Op(n,tuple([(1<>i&1 else 0,1<>i&1 else 0) for i in range(n)]),[('C',q,sgn)]) +def xgate(n,b):return Op(n,tuple([(1<>i)&1)) for i in range(n)]),[('X',b)]) +def fourier(n,axes=None): + out=ident(n) + for i in range(n) if axes is None else axes:out=out.then(cgate(n,1<len(selected):picks.append(j);selected.append(x) + assert len(picks)==r and all(x>>r==0 for x in Bcols) + Br=transpose(selected,r);Bi=inv(Br,r);Dr=transpose([Dcols[j]&((1<= 0 for value in values): + classification, power_sign = "uniformly_worse", "strictly_positive" + else: + classification, power_sign = "inconclusive", "not_determined" + old_mass, new_mass = _masses(old), _masses(new) + return { + "schema": REPORT_SCHEMA, + "classification": classification, + "contract": old["contract"], + "delta_paid": paid, + "delta_targets": targets, + "signed_net_delta": net, + "hinges": hinges, + "rank_mass": {"old": old_mass, "new": new_mass, + "delta": {key: new_mass[key] - old_mass[key] for key in old_mass}}, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "tariff_class": "increasing concave f on nonnegative ranks, with f(0)=0", + "uniform_order": "weak; some concave tariffs can give equality", + "power_moment": {"tariff": "r^t", "exponent": "0 < t < 1", + "new_minus_old_sign": power_sign}, + "assurance": { + "contract": "Exact matching user declarations; mathematical applicability is not verified.", + "input_binding": "SHA-256 identifies the exact input bytes read, when loaded by this CLI.", + "scope": "Histogram arithmetic only. Histogram correctness, circuit legality, ownership, " + "phases, precision, supplier admission and compiler endpoints are not validated.", + "inconclusive": "Mixed hinge signs do not establish a power-moment crossing or failure.", + }, + "method_credit": "Classical concave order/majorization; mightyOil's t16-moment-order-audit " + "and its retained predecessors. No new theorem claim.", + } + + +def main(argv=None): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("old", help="old invoice JSON") + parser.add_argument("new", help="new invoice JSON") + args = parser.parse_args(argv) + try: + old, old_evidence = load_invoice(args.old) + new, new_evidence = load_invoice(args.new) + report = compare_invoices(old, new) + report["inputs"] = {"old": old_evidence, "new": new_evidence} + except (OSError, ValueError, TypeError, RecursionError) as exc: + print(json.dumps({"status": "INVALID_RECURSIVE_INVOICE", "error": str(exc)}, + ensure_ascii=True), file=sys.stderr) + return 2 + print(json.dumps(report, indent=2, sort_keys=True, ensure_ascii=True)) + return 0 + + +if __name__ == "__main__": + raise SystemExit(main()) diff --git a/research/p104-role230-banked/engines/frozen/evaluate_recursive_power.py b/research/p104-role230-banked/engines/frozen/evaluate_recursive_power.py new file mode 100644 index 0000000000..ca50f8021f --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/evaluate_recursive_power.py @@ -0,0 +1,98 @@ +#!/usr/bin/env python3 +# SPDX-License-Identifier: Apache-2.0 +"""Certify a signed invoice cost at one exact rational power, using integer bounds. + +Usage: evaluate_recursive_power.py OLD.json NEW.json --exponent 0.9969 +See docs/research/recursive-power-comparison.md for the interval argument. +Prepared for aliromman with OpenAI Codex assistance. The invoice schema and +signed accounting retain the compare_recursive_invoices predecessor credits. +""" +import argparse +from fractions import Fraction as Q +import json +import re +from math import isqrt +from pathlib import Path +import sys + +sys.path.insert(0, str(Path(__file__).resolve().parent)) +try: + from compare_recursive_invoices import compare_invoices, load_invoice, require, MAX_RANK +finally: + sys.path.pop(0) + + +def parse_exponent(text): + require(isinstance(text, str) and len(text) <= 128, 'exponent needs at most 128 characters') + require(re.fullmatch(r'[+-]?(?:[0-9]+(?:/[0-9]+)?|[0-9]*\.[0-9]+)', text) is not None, + 'use a fraction or decimal without scientific notation') + exponent = Q(text) + require(0 < exponent < 1, 'exponent must satisfy 0 < t < 1') + return exponent + + +def power_bounds(rank, exponent, bits=128): + """Enclose rank**exponent by directed integer square roots and products.""" + require(type(rank) is int and 1 <= rank <= MAX_RANK, 'rank is outside 1..10^9') + require(isinstance(exponent, Q) and 0 < exponent < 1, 'need an exact rational 0 < t < 1') + require(type(bits) is int and 16 <= bits <= 256, 'bits must be an integer in 16..256') + scale = 1 << bits + digits, remainder = divmod(exponent.numerator * scale, exponent.denominator) + lower = upper = scale + root_lower = root_upper = rank * scale + for shift in range(bits - 1, -1, -1): + root_lower = isqrt(root_lower * scale) + radicand = root_upper * scale + root_upper = isqrt(radicand) + root_upper += root_upper * root_upper < radicand + if digits & (1 << shift): + lower = lower * root_lower // scale + upper = (upper * root_upper + scale - 1) // scale + if remainder: + upper = (upper * root_upper + scale - 1) // scale + return Q(lower, scale), Q(upper, scale) + + +def evaluate(old, new, exponent, bits=128): + report = compare_invoices(old, new) + require(isinstance(exponent, Q) and 0 < exponent < 1, 'need an exact rational 0 < t < 1') + require(type(bits) is int and 16 <= bits <= 256, 'bits must be an integer in 16..256') + delta = report['signed_net_delta'] + require(len(delta) <= 512, 'power comparison supports at most 512 nonzero ranks') + lower = upper = Q(0) + terms = [] + for rank, count in delta.items(): + lo, hi = power_bounds(int(rank), exponent, bits) + lower += count * (lo if count > 0 else hi) + upper += count * (hi if count > 0 else lo) + terms.append({'rank': int(rank), 'signed_count': count, 'power_lower': str(lo), 'power_upper': str(hi)}) + sign = ('new_cost_lower' if upper < 0 else 'new_cost_higher' if lower > 0 + else 'equal' if lower == upper == 0 else 'unresolved') + return {'schema': 'integer-mult-recursive-power-comparison/v1', 'contract': report['contract'], + 'exponent': str(exponent), 'bits': bits, 'classification': sign, + 'new_minus_old': {'lower': str(lower), 'upper': str(upper)}, 'terms': terms, + 'quantity': report['quantity'], + 'scope': 'Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, ' + 'compiler, applicability or kappa claim is verified. Unresolved is not equality.'} + + +def main(argv=None): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument('old'); parser.add_argument('new') + parser.add_argument('--exponent', required=True, help='exact fraction or decimal t in r^t') + parser.add_argument('--bits', type=int, default=128, help='dyadic grid bits, 16..256; default 128') + args = parser.parse_args(argv) + try: + exponent = parse_exponent(args.exponent) + old, old_pin = load_invoice(args.old); new, new_pin = load_invoice(args.new) + report = evaluate(old, new, exponent, args.bits) + report['inputs'] = {'old': old_pin, 'new': new_pin} + except (OSError, ValueError, TypeError, RecursionError, ZeroDivisionError) as exc: + print(json.dumps({'status': 'INVALID_POWER_COMPARISON', 'error': str(exc)}), file=sys.stderr) + return 2 + print(json.dumps(report, indent=2, sort_keys=True)) + return 0 + + +if __name__ == '__main__': + raise SystemExit(main()) diff --git a/research/p104-role230-banked/engines/frozen/field_interpreter.py b/research/p104-role230-banked/engines/frozen/field_interpreter.py new file mode 100644 index 0000000000..4872d370db --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/field_interpreter.py @@ -0,0 +1,306 @@ +"""Dense all-event finite replay adapted from the exact #7660 interpreter.""" + +from fractions import Fraction +from functools import cache +import hashlib +from math import isqrt +from random import Random +from struct import Struct +from time import monotonic_ns + + +DIM = 512 +ADDRESS = range(DIM) +PACK_ROW = Struct("<512I") + + +class GateInterpreter: + def __init__(self, prime, require): + require(type(prime) is int and 5 <= prime < 2**31 and prime % 4 == 1, + "modulus range and fourth root") + require(all(prime % f for f in range(3, isqrt(prime) + 1, 2)), "modulus is not prime") + self.p = prime + for x in range(2, prime): + root = pow(x, (prime - 1) // 4, prime) + if root * root % prime == prime - 1: + self.i = root + break + self.powers = (1, self.i, prime - 1, prime - self.i) + self.zero = [0] * DIM + self.gates = {} + self.require = require + + def coefficient(self, script): + q = Fraction(script) + self.require(q.denominator % self.p != 0, "literal denominator vanishes in F_p") + return q.numerator * pow(q.denominator, -1, self.p) % self.p + + def gate(self, spec): + if spec in self.gates: + return self.gates[spec] + op, *params = spec + if op == "P": + rows, = params + perm = [None] * DIM + for prev in ADDRESS: + after = sum(((prev & row).bit_count() % 2) << j for j, row in enumerate(rows)) + self.require(perm[after] is None, "non-permutation gate") + perm[after] = prev + gate = ("gather", perm) + elif op == "X": + offset, = params + gate = ("gather", [x ^ offset for x in ADDRESS]) + elif op == "D": + rows, linear = params + weights = [] + for mask in ADDRESS: + phase = 0 + for j, (row, weight) in enumerate(zip(rows, linear)): + if mask >> j & 1: + phase += weight + 2 * ((row & mask) >> (j + 1)).bit_count() + weights.append(self.powers[phase % 4]) + gate = ("weights", weights) + elif op == "phase": + exponent, = params + gate = ("phase", self.powers[exponent % 4]) + elif op == "C": + line, sign = params + half = (self.p + 1) // 2 + gate = ("mix", (1 + sign * self.i) * half % self.p, + (1 - sign * self.i) * half % self.p, [x ^ line for x in ADDRESS]) + else: + raise ValueError(f"unknown physical gate {op}") + self.gates[spec] = gate + return gate + + def apply(self, gates, value): + p = self.p + for op, *spec in gates: + if op == "gather": + indices, = spec + value = [value[j] for j in indices] + elif op == "weights": + weights, = spec + value = [a * b % p for a, b in zip(value, weights)] + elif op == "phase": + weight, = spec + if weight != 1: + value = [a * weight % p for a in value] + else: + c, d, indices = spec + value = [(c * a + d * value[j]) % p for a, j in zip(value, indices)] + return value + + def column_residue(self, exact): + sparse, denominator = exact + inverse = pow(2, -denominator, self.p) + target = [0] * DIM + for x, (re, im) in sparse.items(): + target[x] = (re + self.i * im) * inverse % self.p + return target + + +def raw_ports(phase, w, require): + """The 104 hosted parent-port equations, plus opposite-sign controls.""" + frames = w["frames"] + require(len(w["live"]) == len(w["ports"]) == 104 and len(set(w["live"])) == 104, + "raw port count") + + @cache + def frame(i): + return phase.frame_op(frames[i]) + + def same(x, y): + return x.tab == y.tab and all(phase.column(x.circ, j) == phase.column(y.circ, j) for j in (0, 1)) + + full = phase.op_four(range(9)) + for r, q in zip(w["live"], w["ports"]): + y = r + 112 + low_x, low_y = w["initial"][r], w["initial"][y] + high_x, high_y = w["final"][r], w["final"][y] + require(frames[low_x] == [q] and frames[low_y] == [] + and len(frames[high_x]) == 9 and len(frames[high_y]) == 8, f"port chart dimensions {r}") + p, v, z = frame(high_y), frame(high_x), frame(low_y) + qp, qm = phase.op_c(q, 1), phase.op_c(q, -1) + d = qm.then(full) + low_adapter = phase.lower(qp.dag().then(frame(low_x))) + high_adapter = phase.lower(p.dag().then(d)) + require(low_adapter["rank"] == high_adapter["rank"] == 0, f"port adapter rank {r}") + circ = phase.recipe_circuit(high_adapter) + mp = phase.Op(phase.tableau(circ), circ) + xx = qp.dag().then(v) + yy = z.dag().then(p).then(mp) + yx = qp.dag().then(p).then(mp) + xy = z.dag().then(v) + require(same(xx, d) and same(yy, d) and same(yx, qm.then(d)) and same(xy, qp.then(d)), + f"raw port operator identity {r}") + require(not same(xy, qm.then(d)) and not same(yx, qp.then(d)), + f"raw port operator sign control {r}") + return {"ports": 104, "directions": 4, "opposite_sign_rejections": 208, + "comparisons": "signed Pauli action and Gaussian absolute phase"} + + +def digest(rows): + value = hashlib.sha256() + for row in rows: + value.update(PACK_ROW.pack(*row)) + return value.hexdigest() + + +def evaluate(phase, source, candidate, prime, seed, altered_clock, test_wrong_phase, require): + """Evaluate dense finite fields. Compiled MOVEs and oracle frame maps differ.""" + t0 = monotonic_ns() + field = GateInterpreter(prime, require) + frames, n = source["frames"], source["public"] + size = n + source["owned_fields"] + rand = Random(seed) + initial = [[rand.randrange(prime) for _ in ADDRESS] for _ in range(n)] + + @cache + def direct_frame(frame): + return phase.frame_circuit(frames[frame]) + + @cache + def chart_operator(frame): + return phase.frame_op(frames[frame]) + + @cache + def literal(a, b): + return phase.dagger(direct_frame(a)) + direct_frame(b) + + @cache + def compiled(a, b): + lo, hi = (a, b) if len(frames[a]) < len(frames[b]) else (b, a) + rec = phase.lower(chart_operator(lo).dag().then(chart_operator(hi))) + require(rec["rank"] == len(frames[hi]) - len(frames[lo]), f"compiled MOVE rank {lo},{hi}") + circ = phase.recipe_circuit(rec) + if lo != a: + circ = phase.dagger(circ) + return tuple(field.gate(g) for g in circ) + + @cache + def oracle(a, b): + return tuple(field.gate(g) for g in literal(a, b)) + + @cache + def residue(value): + return field.coefficient(value) + + def cvec(a, b, v): + return field.apply(compiled(a, b), v) + + def pred_move(a, b, v): + return field.apply(oracle(a, b), v) + + # Independently reduce the exact column convention before using a dense + # finite vector. Use the actual candidate transition at the control clock. + endpoints = tuple(candidate["program"][altered_clock][2:4]) + r0 = source["live"][0] + boundary = (source["initial"][r0], source["final"][r0]) + witnesses = ((endpoints, cvec), (endpoints[::-1], cvec), (boundary, pred_move)) + for (a, b), move in witnesses: + for j in (0, 5): + v = [0] * DIM + v[j] = 1 + require(move(a, b, v) == field.column_residue(phase.column(literal(a, b), j)), + f"finite versus exact interpreter column {a},{b},{j}") + + def scale(vector, a): + return [a * x % prime for x in vector] + + def plus(x, a, y): + return [(u + a * v) % prime for u, v in zip(x, y)] + + def replay(word, inject=False): + values = initial + [field.zero] * (size - n) + erased = hashlib.sha256() + clears, copy_checks = 0, 0 + for i, e in enumerate(word["program"]): + op, r = e[:2] + if op == "MOVE": + row = cvec(e[2], e[3], values[r]) + values[r] = scale(row, field.i) if inject and i == altered_clock else row + elif op == "INIT": + require(not any(values[r]), f"nonzero dead owned state at INIT {i}") + values[r] = field.zero + elif op == "CLEAR": + erased.update(PACK_ROW.pack(*values[r])) + values[r] = field.zero + clears += 1 + elif op == "SCALE": + values[r] = scale(values[r], residue(e[2])) + else: + if op == "COPY": + if any(values[r]) and inject: + return None, {"detected_at_COPY": i} + require(not any(values[r]), f"nonzero owned COPY target at {i}") + copy_checks += 1 + values[r] = plus(values[r], residue(e[3]), values[e[2]]) + require(not any(any(v) for v in values[n:]), "nonzero final owned payload") + return values, {"events": len(word["program"]), "ordered_clear_values": erased.hexdigest(), + "clears": clears, "copy_zero_checks": copy_checks} + + H = source["hosted"] + require(H["mode"] == "mix-t0", "hosted native model") + live, dp = source["live"], H["Dports"] + x2, y2 = H["X2"], H["Y2"] + require(len(dp) == len(set(dp)) == len(x2) == len(y2) and set(dp) <= set(range(104)), + "hosted second-port count") + mains = set(live) | {r + 112 for r in live} | set(x2) | set(y2) + require(len(mains) == 2 * (104 + len(x2)), "overlapping hosted role") + alpha1, beta1 = map(Fraction, (H["alpha"], H["beta"])) + alpha2, beta2 = map(Fraction, (H["alpha2"], H["beta2"])) + require(alpha2, "nonzero second-port sign witness") + lo, hi = source["initial"], source["final"] + + def row_from(r, s): + return pred_move(lo[s], hi[r], initial[s]) + + def expected(rows, r, s, a, b): + rows[r] = plus(row_from(r, r), residue(a), row_from(r, s)) + rows[s] = plus(scale(row_from(s, r), residue(b)), residue(1 + a * b), row_from(s, s)) + + ref = [None] * n + for k, x in enumerate(live): + a, b = (0, 1) if k in dp else (alpha1, beta1) + expected(ref, x, x + 112, a, b) + for x, y in zip(x2, y2): + expected(ref, x, y, alpha2, beta2) + for r in range(n): + if r not in mains: + ref[r] = row_from(r, r) + require(all(row is not None for row in ref), "incomplete physical endpoint predictor") + + old, old_counts = replay(source) + new, new_counts = replay(candidate) + for label, data in (("source", old), ("candidate", new)): + bad = [r for r in range(n) if data[r] != ref[r]] + require(not bad, f"{label} physical endpoint mismatch {bad[:12]}") + require(old == new, "paired physical endpoints differ") + require(old_counts.keys() == new_counts.keys() + and all(old_counts[k] == new_counts[k] for k in old_counts if k != "events"), + "ordered CLEAR values or COPY zero observations differ") + wrong_ref = [None] * n + for x, y in zip(x2, y2): + expected(wrong_ref, x, y, -alpha2, beta2) + wrong_sign = [r for r in (*x2, *y2) if new[r] != wrong_ref[r]] + require(bool(wrong_sign), "wrong second-port alpha sign accepted") + failed = None + if test_wrong_phase: + mutated, counts = replay(candidate, inject=True) + failed = counts if mutated is None else {"endpoint_rows": [ + r for r in range(n) if mutated[r] != ref[r]]} + require(failed.get("detected_at_COPY") is not None or bool(failed.get("endpoint_rows")), + "wrong edited transition phase accepted") + return { + "status": "PASS_PAIRED_DENSE_PHYSICAL_WORDS", + "prime": prime, "seed": seed, "i_squared_minus_one": field.i, + "endpoint_rows": n, "owned_zero_rows": size - n, "vector_width": DIM, + "elapsed_ns": monotonic_ns() - t0, + "digests": {"initial": digest(initial), "source": digest(old), "candidate": digest(new), + "reference_public": digest(ref)}, + "source": old_counts, "candidate": new_counts, + "wrong_second_alpha_rows": wrong_sign, "wrong_edited_transition_phase": failed, + "six_finite_exact_column_crosschecks": 6, + "scope": "One deterministic dense input at this modulus through every literal event", + } diff --git a/research/p104-role230-banked/engines/frozen/native_verify.py b/research/p104-role230-banked/engines/frozen/native_verify.py new file mode 100644 index 0000000000..2c209dfa9c --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/native_verify.py @@ -0,0 +1,277 @@ +"""Check native operators with exact Gaussian dyadic arithmetic. + +The interpreter is adapted from the independent campaign native review. +It does not import the source-code producer or the Clifford compiler. +Research used OpenAI Codex under the user's direction. +""" + +from functools import lru_cache + + +def require(condition, label): + if not condition: + raise ValueError(label) + + +def parity(value): + return value.bit_count() % 2 + + +def mul(matrix, vector): + return sum(parity(row & vector) << i for i, row in enumerate(matrix)) + + +def transpose(matrix): + return tuple(sum(((row >> j) & 1) << i for i, row in enumerate(matrix)) for j in range(len(matrix))) + + +def inverse(matrix): + n = len(matrix) + rows = [row | (1 << (n+i)) for i, row in enumerate(matrix)] + for j in range(n): + pivot = next((i for i in range(j, n) if rows[i] >> j & 1), None) + require(pivot is not None, 'singular binary chart') + rows[j], rows[pivot] = rows[pivot], rows[j] + for i in range(n): + if i != j and rows[i] >> j & 1: + rows[i] ^= rows[j] + require([row & ((1 << n)-1) for row in rows] == [1 << i for i in range(n)], 'binary inverse') + return tuple(row >> n for row in rows) + + +def extend(vectors, n): + columns, pivots = [], {} + for value in tuple(vectors) + tuple(1 << i for i in range(n)): + reduced = value + while reduced: + j = reduced.bit_length()-1 + if j not in pivots: + pivots[j] = reduced + columns.append(value) + break + reduced ^= pivots[j] + require(len(columns) == n, 'frame basis extension') + return tuple(columns) + + +def adjoint(circuit): + out = [] + for gate in reversed(circuit): + if gate[0] == 'P': + out.append(('P', inverse(gate[1]))) + elif gate[0] == 'D': + out.append(('D', gate[1], tuple(-a % 4 for a in gate[2]))) + elif gate[0] == 'C': + out.append(('C', gate[1], -gate[2])) + elif gate[0] == 'phase': + out.append(('phase', -gate[1] % 4)) + else: + require(gate[0] == 'X', 'adjoint gate type') + out.append(gate) + return tuple(out) + + +def fourier(rank): + return tuple(('C', 1 << i, 1) for i in range(rank)) + + +def frame(vectors, n): + rank = len(vectors) + if rank == 0: + return () + if rank == n: + return fourier(n) + matrix = transpose(extend(vectors, n)) + columns = transpose(inverse(matrix)) + quadratic = tuple((1 << i) ^ sum(parity(a & b) << j for j, b in enumerate(columns)) for i, a in enumerate(columns)) + diagonal = tuple((row >> i) & 1 for i, row in enumerate(quadratic)) + chart = (('P', matrix), ('D', quadratic, diagonal)) + return adjoint(chart) + fourier(rank) + chart + + +def monomial(record): + matrix = tuple(record['matrix_rows']) + quadratic = tuple(record['quadratic_rows']) + linear = tuple(record['linear_Z4']) + require(transpose(quadratic) == quadratic, 'quadratic symmetry') + require(len(matrix) == len(quadratic) == len(linear) == 9, 'monomial dimension') + require(all(a % 2 == (quadratic[i] >> i) & 1 for i, a in enumerate(linear)), 'diagonal parity') + inverse(matrix) + return (('D', quadratic, linear), ('P', matrix), ('X', record['offset']), ('phase', record['phase'])) + + +def recipe(record): + rank = record['rank'] + require(isinstance(rank, int) and 0 <= rank <= 9, 'child rank') + if rank == 0: + require(record['right'] is None, 'rank zero right factor') + return monomial(record['left']) + return monomial(record['right']) + fourier(rank) + monomial(record['left']) + + +def tableau(circuit, n=9): + rows = [(1 << i, 0, 0) for i in range(n)] + [(0, 1 << i, 0) for i in range(n)] + for gate in circuit: + tag = gate[0] + out = [] + inverse_transpose = transpose(inverse(gate[1])) if tag == 'P' else None + for x, z, phase in rows: + if tag == 'P': + x, z = mul(gate[1], x), mul(inverse_transpose, z) + elif tag == 'X': + phase += 2 * parity(z & gate[1]) + elif tag == 'C': + if parity(z & gate[1]): + x ^= gate[1] + phase += 3 * gate[2] + elif tag == 'D': + quadratic, linear = gate[1:] + phase += sum(linear[i] for i in range(n) if x >> i & 1) + phase += 2 * sum(parity((quadratic[i] >> (i+1)) & (x >> (i+1))) for i in range(n) if x >> i & 1) + z ^= mul(quadratic, x) + else: + require(tag == 'phase', 'tableau gate type') + out.append((x, z, phase % 4)) + rows = out + return tuple(rows) + + +@lru_cache(maxsize=512) +def action(gate): + if gate[0] == 'P': + return tuple(mul(gate[1], x) for x in range(512)) + require(gate[0] == 'D', 'state action type') + quadratic, linear = gate[1:] + return tuple((sum(linear[i] for i in range(9) if x >> i & 1) + + 2 * sum(parity((quadratic[i] >> (i+1)) & (x >> (i+1))) for i in range(9) if x >> i & 1)) % 4 for x in range(512)) + + +def rotate(pair, power): + a, b = pair + return ((a, b), (-b, a), (-a, -b), (b, -a))[power % 4] + + +def state(circuit, basis=0): + value, denominator = {basis: (1, 0)}, 0 + for gate in circuit: + tag = gate[0] + result = {} + if tag == "C": + direction, sign = gate[1:] + for address, (a, b) in value.items(): + for target, pair in ((address, (a - sign*b, b + sign*a)), + (address ^ direction, (a + sign*b, b - sign*a))): + old = result.get(target, (0, 0)) + result[target] = (old[0] + pair[0], old[1] + pair[1]) + denominator += 1 + else: + for address, pair in value.items(): + if tag == "P": + target = mul(gate[1], address) + elif tag == "X": + target = address ^ gate[1] + else: + target = address + if tag == "D": + pair = rotate(pair, action(gate)[address]) + else: + require(tag == "phase", "Unknown Gaussian state gate") + pair = rotate(pair, gate[1]) + require(target not in result, "A monomial address map is not injective") + result[target] = pair + value = {address: pair for address, pair in result.items() if pair != (0, 0)} + while denominator and all((a | b) % 2 == 0 for a, b in value.values()): + denominator -= 1 + value = {address: (a//2, b//2) for address, (a, b) in value.items()} + return value, denominator + + +def equal(actual, expected, label): + require(tableau(actual) == tableau(expected), label + ": signed Pauli action") + require(state(actual) == state(expected), label + ": exact global phase") + + +def verify(data, certificate): + word = data["word"] + original, clean = data["programs"], data["clean_programs"] + source_recipes = data["recipes"] + residuals = data["residuals"]["recipes"] + native_tags = {"climb", "adapter", "residual_adapter"} + for orientation in ("forward", "backward"): + native = [event for event in clean[orientation] if event[0] in native_tags] + require(native == [event for event in original[orientation] if event[0] in native_tags], + "A retained native event changed") + require(len(native) == 5056, "The retained native event count changed") + frames = [frame(tuple(vectors), 9) for vectors in word["frames"]] + used = {(event[3], event[4]) for program in clean.values() + for event in program if event[0] == "climb"} + children = {(record["old"], record["new"]): record for record in source_recipes["children"]} + require(len(children) == len(source_recipes["children"]) and used <= set(children), + "The retained child recipe coverage is incomplete") + for old, new in sorted(used): + record = children[old, new] + require(record["rank"] == len(word["frames"][new]) - len(word["frames"][old]), + "A retained child has the wrong rank") + equal(recipe(record), adjoint(frames[old]) + frames[new], "Retained child") + endpoints = {(record["role"], record["port"]): record + for record in source_recipes["endpoint_adapters"]} + require(len(endpoints) == len(source_recipes["endpoint_adapters"]) + and set(endpoints) == {(role, p) for role in ("source", "target") for p in range(112)}, + "The endpoint adapter coverage is incomplete") + for (role, port), record in endpoints.items(): + direction = word["ports"][port] + conventional = (("C", direction, 1),) if role == "source" else ( + ("C", direction, -1),) + fourier(9) + index = word["start"][port] if role == "source" else word["final"][112 + port] + require(record["frame"] == index and record["rank"] == 0, "An endpoint frame changed") + equal(recipe(record), adjoint(conventional) + frames[index], "Endpoint adapter") + used_residuals = set() + for program in clean.values(): + for event in program: + if event[0] != "residual_adapter": + continue + _, position, register, entry, *tail = event + terminal = tail[0] if tail else 1 + key = str(entry) if terminal == 1 else str(entry) + ":" + str(terminal) + require(key in residuals and position in ("pre", "post"), "A residual binding changed") + require(entry == word["start"][register] and terminal == word["final"][register], + "A residual endpoint changed") + used_residuals.add(key) + for key in sorted(used_residuals): + record = residuals[key] + equal(recipe(record), adjoint(frames[record["frame"]]) + frames[record.get("terminal", 1)], + "Residual adapter") + records = certificate["input_recipes"] + ports = certificate["compensation_ports"] + require([record["port"] for record in records] == ports and len(records) == 8, + "The eight input recipes changed") + columns = 0 + for item in records: + port, label = item["port"], item["label"] + require(label == word["ports"][port] and item["canonical_start_frame_id"] == word["start"][port], + "An input recipe has the wrong supplier label") + record = item["recipe"] + require(record["rank"] == 1, "An input copy has the wrong child rank") + for side in ("left", "right"): + factor = record[side] + require(factor["quadratic_rows"] == [0] * 9 and factor["linear_Z4"] == [0] * 9 + and factor["offset"] == factor["phase"] == 0, + "An input factor is not an address permutation") + actual, expected = recipe(record), (("C", label, 1),) + equal(actual, expected, "Positive inherited input line") + for basis in range(512): + require(state(actual, basis) == state(expected, basis), "A complete input Gaussian column differs") + columns += 1 + negative = monomial(record["right"]) + (("C", 1, -1),) + monomial(record["left"]) + require(tableau(negative) != tableau(expected) or state(negative) != state(expected), + "An inverse input child was not detected") + phased = actual + (("phase", 1),) + require(tableau(phased) == tableau(actual) and state(phased) != state(expected), + "An input phase-only error was not detected") + return {"status": "PASS_EXACT_INPUT_NATIVE_FRAMES", "retained_native_events_per_orientation": 5056, + "retained_child_recipes": len(used), "endpoint_adapter_recipes": len(endpoints), + "residual_adapter_recipes": len(used_residuals), "new_input_recipes": len(records), + "new_exact_gaussian_columns": columns, "inverse_input_child_controls": len(records), + "phase_only_controls": len(records), "address_permutation_factors": 2 * len(records), + "method": "Independent signed Pauli and exact Gaussian interpretation; no compiler import", + "scope": "Positive inherited input frames before every retained adapter. No recursive hosting claim."} diff --git a/research/p104-role230-banked/engines/frozen/selected-bit-ambient.json b/research/p104-role230-banked/engines/frozen/selected-bit-ambient.json new file mode 100644 index 0000000000..cd19f356a5 --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/selected-bit-ambient.json @@ -0,0 +1,98 @@ +{ + "name": "bit-ambient", + "command": [ + "/usr/local/bin/python3.12", + "-I", + "-B", + "docs/research/pr-intake-evidence/pr7000-admission/check_bit_ambient.py" + ], + "base": "17469fff78c22941280f04d39dc5a1faee09c840", + "started_at": "2026-11-10T13:34:04.485882+00:00", + "exit_code": 0, + "wall_seconds": 0.26789799984544516, + "peak_sampled_descendant_kib": 1600, + "stop": null, + "limits": { + "seconds": 30, + "descendant_kib": 1048576, + "sampling_seconds": 0.2, + "serial": true + }, + "python": "3.12.8 (v3.12.8:2dc476bcb91, Dec 3 2024, 14:43:19) [Clang 13.0.0 (clang-1300.0.29.30)]", + "platform": "macOS-26.6.2-arm64-arm-64bit", + "source_sha256": { + "research/shared-wire-split-composition/native-accounting.json": "ec4f2657a6c172a16c68e958e865ef7bf5217a47814fb506e6e144d19daeaebc", + "research/shared-wire-split-composition/INDEPENDENT-NOTICE.md": "cadbc642ca84311d2c7a6cf704c7828cb4cf77e3c784b66e4c6e8a5c28002fb8", + "research/shared-wire-split-composition/INDEPENDENT-SOURCES.json": "dced1457df5230466ba6202fd6d4595bc2b7fb2a65302806bf2720b1837ff350", + "research/shared-wire-split-composition/SOURCES.json": "c66f8049a4e4bf9890d5f7d9f386de2c4897490f8f5e48edcc69a54b9333d103", + "research/shared-wire-split-composition/NATIVE-INPUTS.json": "9bb6c1567783661334d6c1d23f715ce5635cbbb513678819ab9e020a34c7e4c0", + "research/shared-wire-split-composition/VERIFY.json": "f27f759db9707cf5e8e4a331ca509401186c994ed661a9f4b480961642d5544f", + "research/shared-wire-split-composition/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "research/shared-wire-split-composition/INDEPENDENT-REVIEW.md": "c24c7ee899c258420e281afe4e6dfcd890adf552b469822a38c13898bcd2a936", + "research/shared-wire-split-composition/compose.py": "f057d659243575529cfd89a5534c8f333d0716897ee495bfe3de67eeb0970c20", + "research/shared-wire-split-composition/interval_gate.py": "60a743d13f668ef86db4b8215b4d5d04430a671ba6f1fe06d9c1c4c3dfe86da5", + "research/shared-wire-split-composition/reproduce.py": "9b9fca18bf28c627ff29ba06048503af0cb5f27a4ffabeadffed50e0678c96c9", + "research/shared-wire-split-composition/FULL-RESULT.json": "d9ba709fa5dcefffe3f3abdcf34600ce188224703cfd743e6db8b58ba4816cb7", + "research/shared-wire-split-composition/TASK.json": "60e22522e87684c068f32c8ec687305f2be934f2800e2f10a55483bff02506a1", + "research/shared-wire-split-composition/VALIDATION.md": "582d71db76db5ac7bcfb2f9a962479d1a76d321c7536f08347f16fe01ec9d52e", + "research/shared-wire-split-composition/chart_delta.json": "881bc1bb93e1738aa9269f41af6db0ef80b377920aed6f91e79b9b6ed70e5deb", + "research/shared-wire-split-composition/independent.py": "21f46a8340331abb1486b50bd4e04453f1968b0a5950d86ff7780dd368590874", + "research/shared-wire-split-composition/NOTICE": "da12736e2e824167ff56f2ecb623a5f88f75a270410360890f61dffc33bab249", + "research/shared-wire-split-composition/chart_delta.py": "865f1e526663cb6e53092db66b5fdabae5ed37a0afe7520bdbe1bb21d0266d38", + "research/shared-wire-split-composition/README.md": "f8d540c9f505d5856416897c231bcb9186f873f6148b68b9f23fedac70313831", + "research/shared-wire-split-composition/split_build.py": "54f80d3c557175acfc2cf13059f00f004be3f18fb6c76946e05efe8ca8b5f33a", + "research/shared-wire-split-composition/independent_construction.py": "1e8d66885afce4181ff6195c31aa3445886410b13faf1c8c7321f3ae7fc9554e", + "research/shared-wire-split-composition/precision_replay.py": "850d9098c5946ab27ef5228acc54d59df2196e72259d3e21588ec0c319c8f5ee", + "research/shared-wire-split-composition/VERIFY-INDEPENDENT.json": "820992b885fffaee53854be2c0200b7d4bf96ec678c305b1eff3e6be1364b3e3", + "research/shared-wire-split-composition/CONSTRUCTION-REVIEW.md": "038392a7c5f1705b1978bcc35f9dc889d4ccd457a1f32c384a500c81259e978b", + "research/shared-wire-split-composition/build_wire.py": "b0e1f38dd70f7c1a6f4d9ec8289c76747f558dc8e1ba44b22dd58ff82870e6bd", + "research/shared-wire-split-composition/full_verify.py": "08134736288c3a1067d61185f195c645aa2624051b45c808b2447360d2d20ae0", + "research/shared-wire-split-composition/verify.py": "d2a291f8f4ea6dce51648ba44614d655b47e8e38d235458ac64924af7552b57b", + "research/shared-wire-split-composition/CONSTRUCTION.md": "40249ccc0854393aa3a6ff14845879407ebeb0bc365f14c49ab155489addb436", + "research/shared-wire-split-composition/frozen/verify_host3_odd.py": "e75ad2096ba2587d1dc9c8982b2c2eb7c6fd2636a80adcd943314ef2cf6fd258", + "research/shared-wire-split-composition/frozen/clifford_exact.py": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962", + "research/shared-wire-split-composition/frozen/physical.py": "4e995d1158033d83bf69b671f23dc7924d66edbbe07623ba063ba7421234ea20", + "research/shared-wire-split-composition/frozen/native_verify.py": "3049471905b47b385c88378a1a3be7a18b8858aadd035b8a6da2f4a03b470f38", + "research/shared-wire-split-composition/data/caller.json": "3828d53e80ea97e8b866320f081af20b6b93bfebd58b95b56b85a7afe151af5e", + "research/shared-wire-split-composition/data/split759.proof.json": "35f8b64110957b6f51fd8dd0e53326c466e2ffeecf9254012f0e55a5275bea81", + "research/shared-wire-split-composition/data/bit-admission.json": "a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b", + "research/shared-wire-split-composition/data/split759_450.proof.json": "78b25749911131b50bb4565b17a06d08ccf4b511ec05e598e7f146c96aed4174", + "research/shared-wire-split-composition/data/wh_6937.json.gz": "25326dac562fa07edd28a6daf302de0c27f5f2e82f610eaf3671d39575f8dbea", + "research/shared-wire-split-composition/data/final.json.gz": "2b94953dc14a122e3ef089633f05b58ec689ec5156feb7c784ed3e137dc01883", + "research/shared-wire-split-composition/data/extra_wire_spec.json": "b065bd6c3b0762bc90f5cd0a0c1fb6b9664edefc5a1becbff6734a72ab7698d8", + "research/shared-wire-split-composition/data/main_6936.json.gz": "273e81f176f001684b1fa3eb857992bf58b54748004fcfe806b83adb48d2cc00", + "research/shared-wire-split-composition/retained/query-only-precision-envelope/envelopes.py": "783da6b5b450fc07434946cb9ec86070dfee01df6b5fa1c385cb024def2c9a9f", + "research/shared-wire-split-composition/retained/query-only-precision-envelope/source_binding.py": "624c459311c58f3847b7713b818bfd340153abf42919f02ac9aa8892ed52a2bd", + "research/shared-wire-split-composition/retained/odd-native-common-grid/independent_bounds.py": "198521def614fe78fa728f1dde2b7fb820c0c0e0ac3ad0c9224dccbf51eac0d5", + "research/paired-query-only-bit/SOURCES.json": "1037b0a2d0d60d998630d0d6faf80bc8f2d4351ba1a50dcdfa9f7e86e44019fd", + "research/paired-query-only-bit/PROOF.md": "3c32eb61bec108aceee3d2d676c2c115391f5d0f9845ac209214bb58ef4ebee4", + "research/paired-query-only-bit/INDEPENDENT-REVIEW.json": "e44a7204dcac835817e89be12fc0fb33d981c99ed6ebc3e33b48e49d2fdaeeb3", + "research/paired-query-only-bit/VERIFY.json": "774280bdef625e08e3f854a0f886f65b4283db17fcb397efe7556f97082cbaad", + "research/paired-query-only-bit/check.py": "460ed9a77d66264b00c31d0a7f8dab1db9aab21ec4cc0eaf0452bd4be4ef585e", + "research/paired-query-only-bit/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "research/paired-query-only-bit/EFREE-CALLER.json.gz": "757b3523798f840bdb02028b23708c3416627a99ea09e7a3c4bcdc5cd0c7ce4b", + "research/paired-query-only-bit/EFREE-RESULT.json": "a46b6c6040f75184cab5467656811ad988c216e3bc8e44d595a5015b6e49620b", + "research/paired-query-only-bit/TASK.json": "4c76a0988a076598a22473b2849f062116e09613939a4a4fb672e5792c5c7906", + "research/paired-query-only-bit/VALIDATION.md": "1cc6f940cf4ce1cc6c54c9d07fd2574c1bdbb543097eede31ad78836b1918903", + "research/paired-query-only-bit/NOTICE": "8c73eaf46327f01b4cfc18640b5e5f552648fc5e4427cbccd42af5e7ecd3b732", + "research/paired-query-only-bit/README.md": "cfdb5e13f1b7571a76f6d645eb3bcc703e545e55a34a6fdc08a8e6f96ba1a9a8", + "research/paired-query-only-bit/INPUT-PINS.json": "84007e990d41cf4aac3cd9c1a08984b895fff20acdefc99d464262ec2ad694d4", + "research/paired-query-only-bit/independent/bit_review.py": "6db4b1657bac033ed526fb714b4830b51ae2260d2ce11c3ef0b9e907cadd47db", + "research/paired-query-only-bit/independent/interval_gate.py": "8dc2bc4c64cba3f83c664373984a075f1a14b4d53958084091345c8cab189dec", + "research/paired-query-only-bit/data/selected_review.md": "8bd158b8ef68202000f167b9b78db0b31531b5b067b5cbd91b5bf35f3ddd1ab6", + "research/paired-query-only-bit/data/selected_record.json": "9b8d0eea95b3bf0dfcb7938a732a6439b87a2685dec2a5ab9e525b3b34debbfa", + "research/paired-query-only-bit/data/selected_claim.json": "9cee8a1304fa893be3d3b641eda42fdd9b2fd6a5ac2124fb891de7a1a5e8d92e", + "research/paired-query-only-bit/data/query_only_6980.json": "3828d53e80ea97e8b866320f081af20b6b93bfebd58b95b56b85a7afe151af5e", + "research/paired-query-only-bit/data/6980_PROOF.md": "0cede285a98dd61b78020651202729c6d9cd16fb078ee5fe9a01aa2400df5432", + "research/paired-query-only-bit/data/6834_result.json": "5c3dd8b954de767e41ec7b3d51895ed8c28968d39cb6af57a84c01683f5780ae", + "research/paired-query-only-bit/retained/audit_binary_mixed.py": "bb6616dbf536acf10163b8fff65ebfa69d01dfdeda3c0ead388c03377361b298", + "research/paired-query-only-bit/retained/NOTICE": "620e4ec6f537fa1c071f019ac92fa0e4eec8ab487c811e84153292b981de0424", + "research/paired-query-only-bit/retained/inputs/independent_interval.py": "9293f567aa4afd9b4e618f1cddd3cf66eea51c5e194e3c578e7a8f4db6e04a57", + "research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz": "51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78", + "research/paired-query-only-bit/retained/inputs/credited_trim.py": "fcff17fdd3108be68761fbde0fcbfe218be166cf518c99f7163e60d53ab785d9", + "research/paired-query-only-bit/retained/inputs/inputs/exact_arithmetic.py": "0ce7e7137422d5ffeda22085c81fa88471bbe963100fdad62e659f1e3bf89326" + }, + "source_unchanged": true, + "log": "bit-ambient.log", + "log_sha256": "90e8b8bba405ec40d89c6f522cceb48fe873e51527f39a88d0c61b4f1990f98e" +} diff --git a/research/p104-role230-banked/engines/frozen/selected-claim.json b/research/p104-role230-banked/engines/frozen/selected-claim.json new file mode 100644 index 0000000000..c9b816f844 --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/selected-claim.json @@ -0,0 +1,65 @@ +{ + "schema": "proposed-conditional-integer-multiplication-claim/1", + "kappa": "363005817/100000000000", + "source_result": "research/shared-wire-split-composition/FULL-RESULT.json", + "uniform_templates": [ + { + "family": "complex", + "rank_encoding": "2^14174600000000000000", + "saving": "181502908503/50000000000000", + "ambient": 153 + }, + { + "family": "BIT before cover", + "rank_encoding": "2^296630000000000", + "saving": "38525299/10000000000", + "ambient": 134 + } + ], + "covered_BIT_saving": "19262649/5000000000", + "ordinary_BIT_saving": "4815653101/1250000000000", + "admitted_BIT_saving": "12039/3125000", + "complex_BIT_premise": "376669/100000000", + "BIT_bootstrap": [ + "17/5000", + "38507/10000000", + "12039/3125000" + ], + "nine_outer_savings": { + "main_transform": "36300581700299636994182997/10000000000000000000000000000", + "global_coordinate_router": "90751454251/25000000000000", + "fused_gaussian": "36300581700398910982548991/10000000000000000000000000000", + "group_bit_router": "9075145425124727745637247/2500000000000000000000000000", + "group_scans": "49999999999999/50000000000000", + "boundary_algebraic_matrix": "36300581700399636994182997/10000000000000000000000000000", + "sparse_union_movement": "4098800581700399636994182997/10000000000000000000000000000", + "polynomial_products": "99999999999999/100000000000000", + "microbox_face_corrections": "1925000000000001/25000000000000" + }, + "outer_formula_source": "research/shared-wire-split-composition/interval_gate.py", + "limiting_outer_saving": "36300581700299636994182997/10000000000000000000000000000", + "strict_limiting_slack": "299636994182997/10000000000000000000000000000", + "assumptions": [ + { + "id": "native_all_columns", + "statement": "Retained native operators, phase conventions, spectators and whole-job adapters work at every positive column multiplicity." + }, + { + "id": "owned_erasure", + "statement": "Owned streams and suspended centers obey the retained allocation, erasure and ownership contracts." + }, + { + "id": "compiler", + "statement": "The finite mixed-target compiler and chronological product, completion and splitting satisfy the retained uniform closure contract." + }, + { + "id": "precision_tape", + "statement": "Retained fixed-tape movement and precision/storage prescriptions apply to the new fixed finite template." + }, + { + "id": "analytic_recovery", + "statement": "Analytic decomposition, fine-prime avoidance and exact integer recovery follow the retained upstream/outer framework." + } + ], + "scope": "Conditional shared-native mixed caller with exact common-grid scalar service; five inherited assumptions. No materialized uniform word, complete multiplier, independent human proof or formal-kernel acceptance." +} diff --git a/research/p104-role230-banked/engines/frozen/selected-validation.json b/research/p104-role230-banked/engines/frozen/selected-validation.json new file mode 100644 index 0000000000..7291ce5ab9 --- /dev/null +++ b/research/p104-role230-banked/engines/frozen/selected-validation.json @@ -0,0 +1,223 @@ +{ + "schema_version": 1, + "status": "admitted_conditional", + "base": "f16923d466a6aba912299882e0545564d2ba7bb2", + "source_heads": { + "7000": "93effe2a135bf57b9e484cb630d8dd057159aec9", + "7001": "d777f3a0aa2878bea0478918923dabcf86b9878b" + }, + "selected_frontier_changed": true, + "selected_kappa": "0.00363005817", + "previous_kappa": "0.003125804", + "registered_replays_complete": true, + "all_jobs_finished": true, + "receipts": [ + { + "name": "bit-primary", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/bit-primary.json", + "sha256": "2bd4ae504350b8189e5a25c8e55212666ad15e16e3d85a824691513f0f498b11", + "wall_seconds": 13.74172916682437, + "peak_sampled_descendant_kib": 32544, + "exit_code": 0 + }, + { + "name": "bit-independent", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/bit-independent.json", + "sha256": "16088896d2b49bb81d17b778f162e41aee988188d79e76bdffe967ac0e9d40ff", + "wall_seconds": 0.4980977922677994, + "peak_sampled_descendant_kib": 34128, + "exit_code": 0 + }, + { + "name": "complex-primary", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/complex-primary.json", + "sha256": "fab9a2ead4a6212f3bc262a8da1019a623c420af02a38edb63807516b5cee8bf", + "wall_seconds": 99.33472337480634, + "peak_sampled_descendant_kib": 241472, + "exit_code": 0 + }, + { + "name": "complex-independent", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/complex-independent.json", + "sha256": "cbecd914e3a231b915ab4826a0046c0118fe1c800f2cca5a5c1e9586aa87d7e7", + "wall_seconds": 84.73606283264235, + "peak_sampled_descendant_kib": 110064, + "exit_code": 0 + }, + { + "name": "complex-physical", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/complex-physical.json", + "sha256": "fab7f7e00d40a09508a5bee285dc8fb33f06c92f48ed86e1f99affc35207627c", + "wall_seconds": 80.88798883417621, + "peak_sampled_descendant_kib": 699600, + "exit_code": 0 + }, + { + "name": "owned-factorizations", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/owned-factorizations.json", + "sha256": "938d1791dc320d7fa0bdb44ef318641960798823cd66c4074a037bb9c7682bd9", + "wall_seconds": 22.427095042075962, + "peak_sampled_descendant_kib": 102480, + "exit_code": 0 + }, + { + "name": "lambda-algebra", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/lambda-algebra.json", + "sha256": "bc871b73eaf56318c8be84b117c6f8e7eed8db4e0f9d0ab729eeb5d425a4a1d7", + "wall_seconds": 0.5506485840305686, + "peak_sampled_descendant_kib": 17728, + "exit_code": 0 + }, + { + "name": "bit-ambient", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/bit-ambient.json", + "sha256": "437ad2f9e7956e7f2b477b546f53a6c8cfa0567e207024300e9a7e58d3c0202c", + "wall_seconds": 0.26789799984544516, + "peak_sampled_descendant_kib": 1600, + "exit_code": 0 + }, + { + "name": "bit-ambient-optimized", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/bit-ambient-optimized.json", + "sha256": "977abde2a364af1a0153033f759cc2d90ea79b6f266bcdbb0830c52d22976ded", + "wall_seconds": 0.26918487483635545, + "peak_sampled_descendant_kib": 2272, + "exit_code": 0 + }, + { + "name": "interface-bindings", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/interface-bindings.json", + "sha256": "e3313b43b32169fba878600b43a722c51cce770f685f151433a7addeff25c3d3", + "wall_seconds": 0.28022624971345067, + "peak_sampled_descendant_kib": 1920, + "exit_code": 0 + }, + { + "name": "interface-bindings-optimized", + "receipt": "docs/research/pr-intake-evidence/pr7000-admission/interface-bindings-optimized.json", + "sha256": "030311e1fcdf372c059545a8c355cf09b4931fda34b7759333406f14d837b2bd", + "wall_seconds": 0.28489804081618786, + "peak_sampled_descendant_kib": 4832, + "exit_code": 0 + }, + { + "name": "application", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/application.json", + "sha256": "b6ca671c7101674a40a2c30fdea0ec95f08f9b61bbc9a0926d38da9a6942e14b", + "wall_seconds": 49.84868695773184, + "peak_sampled_descendant_kib": 105232, + "exit_code": 0 + }, + { + "name": "application-optimized", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/application-optimized.json", + "sha256": "f8989171cd7561dccd1ce0db3a7cb119640b965d7f6212d21e9f2d7f16590365", + "wall_seconds": 38.167422249913216, + "peak_sampled_descendant_kib": 106320, + "exit_code": 0 + }, + { + "name": "scalar", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/scalar.json", + "sha256": "d3eb6cf49dd74cc78ea85703236ec1e31a84b6c52e5a42311a65b7a19faeb669", + "wall_seconds": 10.96639662515372, + "peak_sampled_descendant_kib": 47040, + "exit_code": 0 + }, + { + "name": "scalar-optimized", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/scalar-optimized.json", + "sha256": "13e86b7a72e98e8189c964969b43fb055291f5b2efa92fc7ca63e5bf6b8324bb", + "wall_seconds": 15.716162957716733, + "peak_sampled_descendant_kib": 45600, + "exit_code": 0 + }, + { + "name": "native-catalogue-0", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/native-catalogue-0.json", + "sha256": "60911939b399975817334f2ab0e33e1b3d15ac937baab1bc82573f18c761766e", + "wall_seconds": 222.34261462511495, + "peak_sampled_descendant_kib": 58640, + "exit_code": 0 + }, + { + "name": "native-catalogue-1", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/native-catalogue-1.json", + "sha256": "d7cb2b5ac7ebdfdde129877916bded5c5dfc386316b6395dbe58ebbefdd7c69d", + "wall_seconds": 249.59168437542394, + "peak_sampled_descendant_kib": 58624, + "exit_code": 0 + }, + { + "name": "native-catalogue-2", + "receipt": "docs/research/pr-intake-evidence/pr7000-application/native-catalogue-2.json", + "sha256": "2e1f8fd8e4504b2495d07488bf9831e913c706a3e94d1c4de3c1866c585cacaa", + "wall_seconds": 338.04289187537506, + "peak_sampled_descendant_kib": 59712, + "exit_code": 0 + } + ], + "historical_input_aliases": { + "cc723faaf0d182693f69d51ad8a5b3d483103e4a8d0e2ecbbcb5e1508e77404e": "docs/research/pr-intake-evidence/pr7000-application/orchestration-initial.txt", + "8b8067cfd88d785a74c68e8b8e519b3b90c2122298aa3c1b29cb51efea164b63": "docs/research/pr-intake-evidence/pr7000-application/orchestration-monolithic.txt" + }, + "nonexecuted_inventory_changes": { + "scalar": { + "docs/research/pr-intake-evidence/pr7000-application/check_application.py": "c44411369b8bfa66ed2865b0be15ccb45b7410d0a34d2fa24b6fe0fc6a08b17d" + }, + "scalar-optimized": { + "docs/research/pr-intake-evidence/pr7000-application/check_application.py": "c44411369b8bfa66ed2865b0be15ccb45b7410d0a34d2fa24b6fe0fc6a08b17d" + } + }, + "nonexecuted_inventory_changes_reason": "The scalar harness inventoried check_application.py but did not execute or import it. Later changes added application controls; both application modes then passed at its current hash. Both exact scalar executions used the unchanged current scalar checker. Orchestration snapshots retain the earlier harness bytes.", + "prior_review_checker_sha256": { + "check_bit_ambient.py": "e8dabd0285c2ea84472a588a0f6f56e0a7865535ba5f0109db56b08cb7e79886", + "check_interface_bindings.py": "24f5a3c1660b2490981c3af2bd00791c95a0eae373b20db08854d61362c5e08f" + }, + "failed_attempt": { + "receipt": "docs/research/pr-intake-evidence/pr7000-application/native-catalogue.json", + "sha256": "aed71658d6b85b37c44bfb961c9f56c7d72e625b9d5fcc8b492b75d17ce4aa6c", + "original_checker": "docs/research/pr-intake-evidence/pr7000-application/native-catalogue-monolithic.txt", + "scope": "600-second monolithic timeout; no successful coverage reused. Disjoint bounded parts replace it." + }, + "coverage": [ + "All five registered candidate/BIT checks reused at unchanged scientific input hashes.", + "Current complete native catalogue: 3057 maps, 104 main boundary pairs, exact signed Pauli action and absolute Gaussian phase.", + "All 14400 complex native contacts and current paid-owner lists; all 636 BIT frames and 111 main charts.", + "Exact fixed-rational scalar reference normal/optimized; common-grid and fixed-tape scan application supplied in the review.", + "Current root/complete-spectator layouts, owned lifetimes, full cost units and fresh thresholds applied under the same five assumptions." + ], + "remaining": [], + "retained_assumptions": [ + { + "id": "native_all_columns", + "statement": "Retained native operators, phase conventions, spectators and whole-job adapters work at every positive column multiplicity." + }, + { + "id": "owned_erasure", + "statement": "Owned streams and suspended centers obey the retained allocation, erasure and ownership contracts." + }, + { + "id": "compiler", + "statement": "The finite mixed-target compiler and chronological product, completion and splitting satisfy the retained uniform closure contract." + }, + { + "id": "precision_tape", + "statement": "Retained fixed-tape movement and precision/storage prescriptions apply to the new fixed finite template." + }, + { + "id": "analytic_recovery", + "statement": "Analytic decomposition, fine-prime avoidance and exact integer recovery follow the retained upstream/outer framework." + } + ], + "reuse_invalidation": "Any changed executed checker, source data, imported engine, occurrence recipe or application premise invalidates its affected coverage. Orchestration-only historical aliases and the scalar job's nonexecuted application checker are explicit. The previous selected record is preserved byte-for-byte as frontier6030.json.", + "scope": "Maintainer conditional application admission; finite checks and a written specialization, not a complete multiplier, independent human proof or formal-kernel acceptance.", + "review_files_sha256": { + "PROOF-REVIEW.md": "4501502c2ceb9759b20372435fe4beb51082c5a5e2910c1fd5dbe6edca415055", + "SOURCES.json": "8fa7eb44bcc8c7d442848b9f51e9b5e26413a433ebc382f302c350981871265c", + "check_application.py": "d98987db98553dc55bfc80e3ca47abfcd51c57af6f8cda61101391d8eae94184", + "check_exact_scalar.py": "f83e506617a92027b3ff82f28bc043e34e890951eb7f3bd930e08c6c02a04a9d", + "check_native_catalogue.py": "6120e1ea1e07eeba757694d209437a38f121b0a377cc466889a30fa52c561472", + "replay_bounded.py": "ed8324a1f126d3282e312ecc252e4f4847ec50aed9e8b70d00b98d4b9ab96a16" + } +} diff --git a/research/p104-role230-banked/engines/graph.py b/research/p104-role230-banked/engines/graph.py new file mode 100644 index 0000000000..b542bd675d --- /dev/null +++ b/research/p104-role230-banked/engines/graph.py @@ -0,0 +1,437 @@ +#!/usr/bin/env python3 +"""Reconstruct the fixed #7674 pivots with the independent role-230 splice.""" +from argparse import ArgumentParser +from collections import Counter +from datetime import datetime, timezone +from fractions import Fraction as Q +import gzip +from graphlib import CycleError +from hashlib import sha256 +import json +import os +from pathlib import Path +import resource +import signal +import sys +from types import ModuleType + +PEER_HEAD = "28b2af322a1fab01b3734365988930920f9dda48" +PEER_SCIENCE = "26b6c469aa6c4aa04322ce25a22150f90e5fb14e" +PARENT = "ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d" +DIRECT = "ab5653d6b6007f8a7987e7ffc6ebab24c662ba852a0d0b446c3a1be19b88db8a" +CALLER = "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf" +CONTACTS = "9e1d2b56750dee78be16b4514deae18dc886767dc9f92f21e1c6e0f10f6215dd" +PINS = { + "network.py": "a9169fd6ad0a13c69cf39bd32649d53256f6d6fa2ed2ceda854f848b64f4c546", + "native.py": "788465324eb8693a698c75cb3dfdf1b82297324d5583910107ecad4600645e43", + "PIVOTS.json": "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85", + "RESULT.json": "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38", +} +REWRITTEN = {97471, 97473, 97475, 97479, 102393, 101174, 101176, 102653} +INNER = {97471, 97473, 97475} +ROUTES = {97471: ((261, 730), (261, 912)), 102393: ((730, 127), (912, 127))} +RECOVERY = {101174: Q(-1, 2), 101176: Q(-1, 2), 102653: Q(1)} + + +def require(ok, detail): + if not ok: + raise ValueError(detail) + + +def canonical(value): + return json.dumps(value, sort_keys=True, separators=(",", ":")).encode() + + +def digest(raw): + return sha256(raw).hexdigest() + + +def pinned(path, expected): + raw = path.read_bytes() + require(digest(raw) == expected, f"source byte pin {path.name}") + return raw + + +def write(out, name, item, *, exact=False): + data = item if exact else canonical(item) + b"\n" + with (out / name).open("xb") as f: + f.write(data) + return digest(data) + + +def stamp(): + return datetime.now(timezone.utc).isoformat() + + +def peer_module(package, *, reference=False): + path = package / ("native.py" if reference else "network.py") + name = "_bank24_peer_native" if reference else "_bank24_peer_network" + if name in sys.modules and sys.modules[name].__file__ == str(path): + return sys.modules[name] + raw = pinned(path, PINS[path.name]) + module = ModuleType(name) + module.__file__ = str(path) + sys.modules[name] = module + saved = sys.path[:] + prior = sys.modules.get("network") + try: + if reference: + sys.modules["network"] = peer_module(package) + exec(compile(raw, str(path), "exec"), module.__dict__) + finally: + sys.path[:] = saved + if prior is None: + sys.modules.pop("network", None) + else: + sys.modules["network"] = prior + return module + + +def bind_words(package, source_word, direct_word, contacts): + engine = peer_module(package) + word = engine.source_word() + require(digest(canonical(word)) == PARENT, "exact published source word") + if source_word is not None: + require(digest(gzip.decompress(source_word.read_bytes())) == PARENT, "optional source canonical pin") + contact = json.loads(pinned(contacts, CONTACTS)) + require(contact["source_word"] == PARENT, "role-230 splice source") + for clock, event in contact["anchors"].items(): + require(word["program"][int(clock)] == event, f"literal splice anchor {clock}") + edits = {int(clock): events for clock, events in contact["splice"].items()} + program, move_keys = [], {} + for clock, current in enumerate(word["program"]): + emitted = edits.get(clock, [current]) + moves = [(len(program) + i, event) for i, event in enumerate(emitted) if event[0] == "MOVE"] + if current[0] == "MOVE": + require(len(moves) == 1 and moves[0][1][1] == current[1], f"stable MOVE owner {clock}") + move_keys[moves[0][0]] = clock + else: + require(not moves, f"new MOVE key {clock}") + program.extend(emitted) + direct = {**word, "program": program} + require(digest(canonical(direct)) == DIRECT and len(program) == 150525, "exact reconstructed child") + if direct_word is not None: + require(digest(gzip.decompress(direct_word.read_bytes())) == DIRECT, "optional direct canonical pin") + return engine, word, direct, move_keys + + +def stable_fold(engine, word, direct, move_keys): + net = engine.fold(direct) + anchor = len(word["program"]) + require(net.moves.keys() == move_keys.keys(), "all native child MOVE slots mapped") + require(len(set(move_keys.values())) == len(net.moves) == 6157, "stable MOVE key injection") + + def resolve(k): + if k < 0: + return k + if k >= net.first_output: + return anchor + (k - net.first_output) + return move_keys[k] + + moves = {resolve(k): value for k, value in net.moves.items()} + forms = {resolve(k): {resolve(donor): coefficient for donor, coefficient in row.items()} + for k, row in net.forms.items()} + return engine.Network(anchor, net.initial, net.final, moves, forms) + + +def local_rewrite(engine, net): + x = {89727: Q(1), 89728: Q(1), 97321: Q(-4)} + z = {91754: Q(1), 95209: Q(-1)} + forms = net.forms.copy() + moves = net.moves.copy() + old = { + 97471: x, 97473: z, 97475: {97470: Q(1), 97471: Q(1)}, + 97479: {97473: Q(1), 97470: Q(-1), 97471: Q(-1)}, + 102393: {97471: Q(1, 2), 97473: Q(1, 2), 97470: Q(-1, 2)}, + } + require(all(forms[k] == row for k, row in old.items()), "exact folded local preimage") + for key, (before, after) in ROUTES.items(): + require(moves[key] == before, f"exact route preimage at {key}") + moves[key] = after + forms[97471] = x.copy() + engine.add_scaled(forms[97471], z, Q(1, 2)) + forms[97473] = {k: Q(2, 3) * c for k, c in z.items()} + engine.add_scaled(forms[97473], x, Q(-2, 3)) + forms[97475] = {97470: Q(1), 97473: Q(-1, 2)} + forms[97479] = {97473: Q(3, 2), 97470: Q(-1)} + forms[102393] = {97471: Q(2, 3), 97475: Q(-1, 2)} + for slot, coefficient in RECOVERY.items(): + row = net.forms[slot] + require(row.get(97475) == coefficient and 97471 not in row, f"exact recovered C read at {slot}") + forms[slot] = {**row, 97471: Q(2, 3) * coefficient} + require({k for k, row in net.forms.items() if 97475 in row} == RECOVERY.keys(), + "complete old C-reader incidence") + return engine.Network(net.first_output, net.initial, net.final, moves, forms) + + +def equal_graph(one, two, context): + require((one.first_output, one.initial, one.final, one.moves) == + (two.first_output, two.initial, two.final, two.moves), f"graph move/boundary mismatch {context}") + delta = [k for k in one.forms.keys() | two.forms.keys() if one.forms.get(k) != two.forms.get(k)] + require(not delta, f"graph form mismatch {context}: {sorted(delta)[:8]}") + + +def oriented(net, edit): + return net.transpose() if edit["direction"] == "transpose" else net + + +def pivots_in_lockstep(engine, old, direct, edits): + equal_graph(local_rewrite(engine, old), direct, "initial stable child fold") + steps = [] + for index, edit in enumerate(edits): + before, child_before = oriented(old, edit), oriented(direct, edit) + drop, lead = edit["remove"], edit["pivot"] + old_reads = {k: row[drop] for k, row in before.forms.items() if drop in row} + new_reads = {k: row[drop] for k, row in child_before.forms.items() if drop in row} + require(old_reads == new_reads and old_reads, f"pivot uses at entry {index}") + require(before.moves[drop] == child_before.moves[drop] and before.moves[lead] == child_before.moves[lead], + f"pivot route preimage at entry {index}") + old = oriented(engine.pivot(before, edit), edit) + direct = oriented(engine.pivot(child_before, edit), edit) + orders = (old.schedule(), direct.schedule()) + equal_graph(local_rewrite(engine, old), direct, f"commutation at pivot {index}") + require(len(old.moves) == len(direct.moves) == 6156 - index, f"slot decrement {index}") + steps.append({"index": index, "direction": edit["direction"], "remove": drop, "lead": lead, + "surviving_slots": len(old.moves), "cocharted_use_count": len(old_reads), + "lead_before_in_direction": before.moves[lead], "lead_final_forward": old.moves[lead], + "same_directed_forms_after_commutation": True, + "scheduled_nodes_each": [len(order) for order in orders]}) + return old, direct, steps + + +def build_graphs(package, source_word, direct_word, contacts): + engine, word, direct_word_value, keys = bind_words(package, source_word, direct_word, contacts) + edits = json.loads(pinned(package / "PIVOTS.json", PINS["PIVOTS.json"])) + result = json.loads(pinned(package / "RESULT.json", PINS["RESULT.json"])) + require(len(edits) == result["pivot_checks"] == 15, "frozen pivot denominator") + require(Counter(e["direction"] for e in edits) == {"forward": 7, "transpose": 8}, + "frozen pivot orientation counts") + old = engine.fold(word) + direct = stable_fold(engine, word, direct_word_value, keys) + peer, combined, steps = pivots_in_lockstep(engine, old, direct, edits) + require([[s["direction"], s["remove"], s["lead"], s["surviving_slots"]] for s in steps] == + result["application"]["pivots"], "published exact pivot schedule inventory") + require({k for k in peer.moves if peer.moves[k] != combined.moves[k]} == ROUTES.keys(), + "only the two role-230 paid routes changed") + require({k for k in peer.forms if peer.forms[k] != combined.forms[k]} == REWRITTEN, + "only the exact folded role-230 row forms changed") + return word, peer, combined, { + "published_pivot_inventory_reproduced": True, "stages": steps, + "changed_move_keys": sorted(ROUTES), "changed_forms": sorted(REWRITTEN), + "first_output": peer.first_output, + "local_semantic_clock_map": {str(k): v for k, v in keys.items() + if v in REWRITTEN or v in {97470, 97476, 98347, 98350}}, + } + + +def record(net, word, kind): + return { + "metadata": {"schema": "p104-exact-banked-dag/v1", "kind": kind, + "peer_head": PEER_HEAD, "scientific_commit": PEER_SCIENCE, + "source_word_sha256": PARENT, + "role230_direct_word_sha256": DIRECT if kind == "candidate" else None, + "caller_sha256": CALLER, "fixed_pivot_sha256": PINS["PIVOTS.json"], + "published_result_sha256": PINS["RESULT.json"]}, + "frames": word["frames"], "initial": net.initial, "final": net.final, + "first_output": net.first_output, + "moves": [[key, *route] for key, route in sorted(net.moves.items())], + "forms": [[key, [[donor, str(coef)] for donor, coef in sorted(row.items())]] + for key, row in sorted(net.forms.items())], + "schedule": net.schedule(), + } + + +def freeze(out, word, peer, child, stage): + graphs = {} + for kind, net in (("peer", peer), ("candidate", child)): + raw = canonical(record(net, word, kind)) + filename = kind.upper() + "-GRAPH.json.gz" + byte_sha = write(out, filename, gzip.compress(raw, mtime=0), exact=True) + graphs[kind] = {"file": filename, "canonical_sha256": digest(raw), "gzip_sha256": byte_sha} + result = {"status": "FROZEN_BOTH_ORDERS_WITH_EXACT_STABLE_KEYS", + "observed_at": stamp(), "graphs": graphs, **stage} + write(out, "GRAPH-BINDING.json", result) + for kind, info in graphs.items(): + print("FROZEN_BANK24_GRAPH", kind, info["canonical_sha256"], info["gzip_sha256"], flush=True) + return result + + +def verify_saved_signals(package, source_word, direct_word, contacts): + engine, word, direct, keys = bind_words(package, source_word, direct_word, contacts) + native = peer_module(package, reference=True) + edits = json.loads(pinned(package / "PIVOTS.json", PINS["PIVOTS.json"])) + child = stable_fold(engine, word, direct, keys) + checked = [] + for index, edit in enumerate(edits): + before = oriented(child, edit) + native.verify_pivot(before, edit) + child = oriented(engine.pivot(before, edit), edit) + checked.append({"index": index, "orientation": edit["direction"], + "remove": edit["remove"], "lead": edit["pivot"], "saved_signal_equal": True}) + print("PASS_BANK24_SAVED_SIGNAL", index, edit["direction"], flush=True) + return child, checked + + +def normalized_equal(lrow, lgrid, rrow, rgrid): + return len(lrow) == len(rrow) and all(v * rgrid == rrow.get(col, 0) * lgrid for col, v in lrow.items()) + + +def census_native(word, net, total, peak, work): + dyadic = (total & -total).bit_length() - 1 + bits = max(max(abs(c.numerator).bit_length(), c.denominator.bit_length()) + for row in net.forms.values() for c in row.values()) + mains = set(word["live"]) | {r + 112 for r in word["live"]} | set(word["hosted"]["X2"]) | set(word["hosted"]["Y2"]) + return {"grid": str(total), "odd": total >> dyadic, "dyadic_height": dyadic, + "peak_scaled_mass": str(Q(peak, 1 << dyadic)), "checked_products": work, + "terms": sum(map(len, net.forms.values())), "slots": len(net.moves), + "coefficient_bits": bits, "public": word["public"], "mains": len(mains)} + + +def replay_pair(package, word, peer, child, *, transpose=False): + native = peer_module(package, reference=True) + peer_net, child_net = (peer.transpose(), child.transpose()) if transpose else (peer, child) + a, old, peak_a, work_a = native.evaluate(peer_net) + b, new, peak_b, work_b = native.evaluate(child_net) + require(old.keys() == new.keys(), "matched arbitrary-input row keys") + mismatches = [i for i in old if i not in INNER and not normalized_equal(old[i], a, new[i], b)] + require(not mismatches, f"changed exposed row in {'adjoint' if transpose else 'forward'}: {mismatches[:8]}") + first = peer.first_output + endpoints = [first + role for role in range(word["public"])] + expected = native.expected(word, a) + if transpose: + swapped = [{} for _ in endpoints] + for r, row in enumerate(expected): + for src, value in row.items(): + swapped[src][r] = value + expected = swapped + require([old[i] for i in endpoints] == expected, "exact published matrix and direction") + output = {"direction": "adjoint" if transpose else "forward", "public_outputs": len(endpoints), + "equal_exposed_noninput_rows": sum(i >= 0 and i not in INNER for i in old), + "differing_internal_rows": sorted(i for i in INNER if not normalized_equal(old[i], a, new[i], b)), + "old_grid": str(a), "new_grid": str(b), "old_products": work_a, "new_products": work_b} + if not transpose: + restore = {k: 3 * v for k, v in new[97475].items()} + peer_module(package).add_scaled(restore, new[97471], 2) + require(normalized_equal(old[97475], a, restore, 3 * b), "exposed Y restoration in chart 912") + output["restored_y_in_c"] = True + output["published_native"] = census_native(word, peer, a, peak_a, work_a) + output["candidate_native"] = census_native(word, child, b, peak_b, work_b) + return output + + +def controls(package, child): + engine = peer_module(package) + native = peer_module(package, reference=True) + def with_rows(rows, moves=None): + return engine.Network(child.first_output, child.initial, child.final, + child.moves if moves is None else moves, rows) + rows = child.forms.copy() + rows[97473] = {**rows[97473], 89727: -rows[97473][89727]} + wrong = with_rows(rows) + a, old, _, _ = native.evaluate(child, {97479}) + b, new, _, _ = native.evaluate(wrong, {97479}) + require(wrong.moves == child.moves and not normalized_equal(old[97479], a, new[97479], b), + "same-price wrong scalar escaped") + rows = child.forms.copy() + rows[97471] = {**rows[97471], 97470: Q(1)} + try: + with_rows(rows).schedule() + except ValueError as failure: + require(str(failure) == "nonlocal scalar", "wrong coframe rejection boundary") + else: + raise ValueError("wrong coframe accepted") + rows, moves = child.forms.copy(), child.moves.copy() + m, n = child.first_output - 2, child.first_output - 1 + require(m not in moves and n not in moves, "cycle-control spare stable keys") + rows.update({m: {n: Q(1)}, n: {m: Q(1)}}) + moves.update({m: (261, 912), n: (912, 261)}) + try: + with_rows(rows, moves).schedule() + except CycleError: + pass + else: + raise ValueError("cocharted two-node cycle accepted") + return {"same_price_wrong_scalar": "rejected at exposed Z slot 97479", + "nonlocal_chart": "rejected before schedule", "cocharted_cycle": "rejected by topological order"} + + +def main(): + parser = ArgumentParser(description=__doc__) + parser.add_argument("--peer-package", type=Path, required=True) + parser.add_argument("--contacts-file", type=Path, required=True) + parser.add_argument("--parent-word", type=Path) + parser.add_argument("--direct-word", type=Path) + parser.add_argument("--out", type=Path, required=True) + parser.add_argument("--materialize-only", type=Path, metavar="EXACT_RESULT", + help="Rebuild both ordered graphs and compare their hashes to a completed exact receipt") + args = parser.parse_args() + resource.setrlimit(resource.RLIMIT_CPU, (240, 240)) + resource.setrlimit(resource.RLIMIT_AS, (2 * 1024**3, 2 * 1024**3)) + os.sched_setaffinity(0, {min(os.sched_getaffinity(0))}) + signal.alarm(420) + started = stamp() + out = args.out.resolve() + out.mkdir() + package = args.peer_package.resolve() + inputs = (package, args.parent_word, args.direct_word, args.contacts_file.resolve()) + start_sha = write(out, "START.json", { + "status": "RUNNING_BANK24_WIRE_COMMUTATION", "time": started, + "pid": os.getpid(), "affinity": sorted(os.sched_getaffinity(0)), + "cpu_limit_seconds": 240, "address_space_bytes": 2 * 1024**3, "wall_limit_seconds": 420, + "head": PEER_HEAD, "source_word": PARENT, "direct_word": DIRECT, "input_pins": PINS, + "authorization_receipt": "progress.kappa-leading-20261118t0540z.00000026", + "scope": "https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19702865", + "driver_sha256": digest(Path(__file__).read_bytes()), + }) + print("START_BANK24_WIRE_COMMUTATION", start_sha, flush=True) + try: + word, peer, child, stages = build_graphs(*inputs) + binding = freeze(out, word, peer, child, stages) + if args.materialize_only is not None: + exact_raw = args.materialize_only.read_bytes() + exact = json.loads(exact_raw) + require(exact["status"] == "PASS_BANK24_WIRE_COMMUTATION" + and exact["graphs"] == binding["graphs"] and exact["input_pins"] == PINS, + "proven deterministic graph bindings") + write(out, "MATERIALIZATION.json", { + "status": "PASS_BANK24_MATERIALIZATION_ONLY", "graphs": binding["graphs"], + "exact_result_sha256": digest(exact_raw), + }) + print("PASS_BANK24_MATERIALIZATION_ONLY", flush=True) + return + candidate_from_saved, pivots = verify_saved_signals(*inputs) + equal_graph(candidate_from_saved, child, "fresh saved-signal branch") + checked = controls(package, child) + forward = replay_pair(package, word, peer, child) + reference = json.loads(pinned(package / "RESULT.json", PINS["RESULT.json"])) + require(forward["published_native"] == reference["native"], "complete published native receipt reproduced") + adjoint = replay_pair(package, word, peer, child, transpose=True) + for filename, pin in PINS.items(): + pinned(package / filename, pin) + pinned(args.contacts_file, CONTACTS) + result = { + "status": "PASS_BANK24_WIRE_COMMUTATION", "started_at": started, "completed_at": stamp(), + "start_sha256": start_sha, + "binding_sha256": digest((out / "GRAPH-BINDING.json").read_bytes()), + "graphs": binding["graphs"], "input_pins": PINS, "parent_source_word": PARENT, + "direct_child_word": DIRECT, "caller_sha256": CALLER, "peer_head": PEER_HEAD, + "exact_whole_graph_both_orders": True, "published_native_receipt_reproduced": True, + "changed_move_keys": sorted(ROUTES), "changed_forms": sorted(REWRITTEN), + "pivot_checks": pivots, "forward": forward, "adjoint": adjoint, "controls": checked, + "resource": {"cpu_seconds": os.times().user + os.times().system, + "peak_rss_kib": resource.getrusage(resource.RUSAGE_SELF).ru_maxrss}, + "scope": "Exact normalized graph construction, exposed rows, stable routes, chronology and fixed saved-signal identities. Physical Gaussian recipes and complete signed application have their own gates.", + } + result_sha = write(out, "RESULT.json", result) + print("PASS_BANK24_WIRE_COMMUTATION", binding["graphs"]["candidate"]["canonical_sha256"], result_sha, flush=True) + except (ValueError, CycleError, OSError, KeyError) as error: + write(out, "FAILURE.json", { + "status": "FAIL_BANK24_WIRE_COMMUTATION", "time": stamp(), + "error_type": type(error).__name__, "detail": str(error), + "start_sha256": start_sha, + }) + raise + + +if __name__ == "__main__": + main() diff --git a/research/p104-role230-banked/engines/native/MAP-CUSTODY.json.gz b/research/p104-role230-banked/engines/native/MAP-CUSTODY.json.gz new file mode 100644 index 0000000000..64c5de99e1 Binary files /dev/null and b/research/p104-role230-banked/engines/native/MAP-CUSTODY.json.gz differ diff --git a/research/p104-role230-banked/engines/native/bank_complete.py b/research/p104-role230-banked/engines/native/bank_complete.py new file mode 100644 index 0000000000..f678720f46 --- /dev/null +++ b/research/p104-role230-banked/engines/native/bank_complete.py @@ -0,0 +1,61 @@ +#!/usr/bin/env python3 +"""Bind the proved physical bank map catalogue and both dense graph receipts.""" + +import argparse +from pathlib import Path +import sys + +sys.path.insert(0,str(Path(__file__).resolve().parent)) +import bank_phase as phase +from custody import need,read,sha + + +def main(): + p=argparse.ArgumentParser(description=__doc__) + p.add_argument('--phase',type=Path,required=True) + p.add_argument('--dense-first',type=Path,required=True) + p.add_argument('--dense-second',type=Path,required=True) + p.add_argument('--out',type=Path,required=True) + args=p.parse_args() + pa=args.phase/'RESULT.json' + data=read(pa) + pin=sha(pa.read_bytes()) + need(data['status']=='PASS_PAIRED_BANK24_EXACT_NATIVE_MAPS' and data['source_head']==phase.HEAD + and data['pivot_manifest_sha256']==phase.PIVOTS and data['forward_union']==3025 + and data['fresh_maps_512_each_direction']==19 and data['main_boundary_pairs']==104 + and data['hosted_correspondences']==96,'complete paired graph map/port denominator') + for name,digest in data['artifact_sha256'].items(): + need(sha((args.phase/name).read_bytes())==digest,'complete catalogue artifact remains immutable') + receipts = {} + for pth,prime,seed in ((args.dense_first,1000000009,11),(args.dense_second,998244353,37)): + path=pth/'RESULT.json' + result=read(path) + need(result['status']=='PASS_PAIRED_BANK24_ACTUAL_HELD_ARRAYS' and result['phase_sha256']==pin + and result['prime']==prime and result['seed']==seed and result['graph_pins']==data['graph_pins'] + and result['exact_caller_sha256']==phase.DEC_CALLER,'same exact graph and actual finite tape orientation') + need(result['main_outputs']==400 and result['positive_helper_outputs']==1101 and result['width']==512 + and len(result['exact_column_links'])==8,'complete actual width and output incidence') + for side,ref in (('peer','source'),('candidate','candidate')): + one=result[side] + need(one['terminal_arrays_sha256']==result['independent_expected_sha256'] and + one['distinct_scientific_held_arrays']==15286 and one['independent_entry_banks']==1501 + and one['paid_slots']==6142 and one['active_nodes']==7643 and one['terminal_rows']==1501 + and one['local_scalar_terms']==data[ref]['local_terms'],'actual bank VM extent') + faults=result['actual_negative_controls'] + if prime==1000000009: + need(set(faults)=={'quarter phase','same-price sign'} and + all(v['injected_slot']==97471 and v['changed_public_roles'] for v in faults.values()), + 'actual role-230 rejecting physical controls') + receipts[str(prime)]={'sha256':sha(path.read_bytes()),'seed':seed,'borrowed_inputs_sha256':result['input_sha256'], + 'terminal_arrays_sha256':result['independent_expected_sha256'],'faults':faults} + phase.write(args.out,{'status':'PASS_PAIRED_BANK24_NATIVE_QUALIFICATION_COMPONENT', + 'phase_sha256':pin,'graph_pins':data['graph_pins'],'source_head':phase.HEAD, + 'pivot_manifest_sha256':phase.PIVOTS,'caller_sha256':phase.DEC_CALLER, + 'source':data['source'],'candidate':data['candidate'],'forward_union':3025, + 'diagnostic_only_pivot_orientations':5,'fresh_512_maps_each_direction':19, + 'main_boundary_pairs':104,'hosted_correspondences':96,'dense':receipts, + 'scope':'Actual scheduled banked native map bodies and two complete finite held-array projections. All-width physical extent, ordinary and outer are independent components.'}) + + +if __name__=='__main__': + main() diff --git a/research/p104-role230-banked/engines/native/bank_dense.py b/research/p104-role230-banked/engines/native/bank_dense.py new file mode 100644 index 0000000000..7d562aeb77 --- /dev/null +++ b/research/p104-role230-banked/engines/native/bank_dense.py @@ -0,0 +1,208 @@ +#!/usr/bin/env python3 +"""Fresh held-array projections of the #7674 parent and role-230 bank graphs.""" + +import argparse +from fractions import Fraction +from functools import cache +from pathlib import Path +from random import Random +import runpy +import sys + +sys.path.insert(0,str(Path(__file__).resolve().parent)) +import bank_phase as phase +from custody import need,read,sha + + +FIELD_PIN = 'e76bc78b132607890b2d9ea234d3a52e608e0e919bdc48308cc0727a2a07c73e' +RECEIPT = 'progress.kappa-leading-20261118t0540z.00000034' +SEED = {1000000009:11,998244353:37} +FAULT_SLOT = 97471 +WIDTH=512 + + +def compiled_bank_recipes(directory, certificate, parent, child, mains): + for name,pin in certificate['artifact_sha256'].items(): + need(sha((directory/name).read_bytes())==pin,'phase component artifact bytes') + ps,ph,_ = phase.graph_census(parent,mains) + cs,ch,_ = phase.graph_census(child,mains) + union = ps.keys()|ph.keys()|cs.keys()|ch.keys() + records = read(directory/'BANK-RECIPES.json.gz') + recipe = {} + for row in records: + a,b = row['pair'] + if row['in_forward_union']: + need((a,b) in union and (a,b) not in recipe and row['compared_signed_pauli_and_absolute_phase'], + 'physically fixed used body against union') + need((row['peer_moves'],row['candidate_moves'],row['productive_roles']) == + (ps.get((a,b),[]),cs.get((a,b),[]),ph.get((a,b),[])), 'actual per-slot bank and helper occurrences') + recipe[a,b] = row['recipe'] + need(recipe.keys()==union and len(recipe)==certificate['forward_union'],'complete matched paid and target recipes') + return recipe + + +def check(word,parent,child,recipes,prime,seed,checker,field_engine,run_faults): + field = field_engine['GateInterpreter'](prime,need) + digest = field_engine['digest'] + basis = word['frames'] + random = Random(seed) + input_rows = [[random.randrange(prime) for _ in range(WIDTH)] for _ in range(word['public'])] + pinned_public = digest(input_rows) + + @cache + def chart(a): + return checker.frame(basis[a],9) + + @cache + def raw(a,b): + if a==b: + return () + return tuple(field.gate(op) for op in checker.adjoint(chart(a))+chart(b)) + + @cache + def compiled(a,b): + return tuple(field.gate(op) for op in checker.recipe(recipes[a,b])) + + @cache + def scalar(q): + return field.coefficient(q) + + def add(dst,q,source): + if q==1: + return [(a+b)%prime for a,b in zip(dst,source,strict=True)] + return [(a+q*b)%prime for a,b in zip(dst,source,strict=True)] + + def factor(q,source): + return [q*a%prime for a in source] + + def column_controls(): + rows = [] + for a,b in (child.moves[97471],child.moves[102393]): + compiled_gates = checker.recipe(recipes[a,b]) + target = checker.adjoint(chart(a))+chart(b) + for direction in ('forward','adjoint'): + actual,expected = ((compiled_gates,target) if direction=='forward' else + (checker.adjoint(compiled_gates),checker.adjoint(target))) + gates = tuple(field.gate(op) for op in actual) + for col in (0,17): + unit = [0]*WIDTH + unit[col] = 1 + need(field.apply(gates,unit)==field.column_residue(checker.state(expected,col)), + 'compiled modular gate orientation against exact Gaussian independent column') + rows.append([a,b,direction,col]) + return rows + + def replay(g, fault=None): + # Graph slots are distinct held banks. Keep the source accumulator and + # returned snapshot separate until every scheduled terminal is present. + sources, returned, terminal = {},{},{} + bars = {~r:row for r,row in enumerate(input_rows)} + term_count = 0 + for key in g.schedule: + row=[0]*WIDTH + for idx,(donor,q) in enumerate(g.forms[key]): + if fault=='same-price sign' and key==FAULT_SLOT and idx==0: + q=-q + row=add(row,scalar(q),bars[donor]) + term_count += 1 + sources[key]=row + if key in g.moves: + a,b=g.moves[key] + response=field.apply(compiled(a,b),row) + if fault=='quarter phase' and key==FAULT_SLOT: + response=factor(field.i,response) + need(response is not row,'distinct paid source and returned snapshot') + returned[key]=bars[key]=response + else: + terminal[key-g.first]=row + n=len(input_rows) + need(len(returned)==6142 and set(terminal)==set(range(n)) and len(sources)==7643, + 'actual separate paid and terminal banks for the full literal schedule') + held = [*input_rows, *sources.values(), *returned.values()] + need(len({id(v) for v in held})==len(held)==15286,'distinct actual VM arrays for all scheduled field banks') + need(digest(input_rows)==pinned_public,'arbitrary independent input arrays remain intact') + ports=[terminal[r] for r in range(n)] + return ports,{'active_nodes':len(g.schedule),'paid_slots':len(g.moves),'terminal_rows':len(ports), + 'local_scalar_terms':term_count,'independent_entry_banks':n,'distinct_scientific_held_arrays':len(held), + 'terminal_arrays_sha256':digest(ports),'returns_sha256':digest([returned[k] for k in sorted(returned)])} + + initial,final = parent.initial,parent.final + live,host = word['live'],word['hosted'] + x2,y2,dport = host['X2'],host['Y2'],set(host['Dports']) + need(len(live)==104 and len(x2)==len(y2)==len(dport)==96,'real native caller slot geometry') + mains = set(live)|{r+112 for r in live}|set(x2)|set(y2) + + def from_input(target,donor): + return field.apply(raw(initial[donor],final[target]),input_rows[donor]) + + def main_block(rows,r,s,a,b): + rows[r]=add(from_input(r,r),scalar(a),from_input(r,s)) + rows[s]=add(factor(scalar(b),from_input(s,r)),scalar(1+a*b),from_input(s,s)) + + expected = [None]*len(input_rows) + alpha,beta,alpha2,beta2=(Fraction(host[name]) for name in ('alpha','beta','alpha2','beta2')) + for j,x in enumerate(live): + a,b=(0,1) if j in dport else (alpha,beta) + main_block(expected,x,x+112,a,b) + for x,y in zip(x2,y2,strict=True): + main_block(expected,x,y,alpha2,beta2) + for r in range(len(input_rows)): + if r not in mains: + expected[r]=from_input(r,r) + + controls = column_controls() + left,lrec = replay(parent) + right,rrec = replay(child) + for label,rows in (('peer',left),('candidate',right)): + mismatch = [r for r in range(len(expected)) if expected[r]!=rows[r]] + need(not mismatch,f'{label} actual bank graph and independent main/helper physical maps disagree {mismatch[:8]}') + need(left==right,'identical actual bank boundaries on the admitted projection') + faults = {} + if run_faults: + for kind in ('quarter phase','same-price sign'): + faulty,_=replay(child,kind) + diff=[r for r in range(len(expected)) if faulty[r]!=expected[r]] + need(diff,f'actual {kind} mutation must change a physical public endpoint') + faults[kind]={'injected_slot':FAULT_SLOT,'changed_public_roles':diff} + return {'status':'PASS_PAIRED_BANK24_ACTUAL_HELD_ARRAYS','prime':prime,'seed':seed,'imaginary_root':field.i, + 'width':WIDTH,'main_outputs':len(mains),'positive_helper_outputs':len(input_rows)-len(mains), + 'input_sha256':pinned_public,'independent_expected_sha256':digest(expected), + 'peer':lrec,'candidate':rrec,'actual_negative_controls':faults,'exact_column_links':controls, + 'helper_325_1087_boundaries':{r:[initial[r],final[r]] for r in (325,1087)}, + 'scope':'Actual forward bank graph and independent direct public boundaries on dense prime projections. Private integer bit format, extent/reset/retirement and tariff are separate components.'} + + +def main(): + p=argparse.ArgumentParser(description=__doc__) + p.add_argument('--peer-package',type=Path,required=True) + p.add_argument('--engine-dir',type=Path,required=True) + p.add_argument('--field-engine',type=Path,required=True) + p.add_argument('--graphs',type=Path,required=True) + p.add_argument('--phase',type=Path,required=True) + p.add_argument('--prime',type=int,choices=tuple(SEED),required=True) + p.add_argument('--out',type=Path,required=True) + a=p.parse_args() + a.out.mkdir() + phase_path=a.phase/'RESULT.json' + phase_sha=sha(phase_path.read_bytes()) + start={'observed_at':phase.stamp(),'phase_sha256':phase_sha,'prime':a.prime, + 'program_sha256':sha(Path(__file__).read_bytes()),'scope':RECEIPT} + phase.write(a.out/'START.json',start) + receipt=read(phase_path,phase_sha) + need(receipt['status']=='PASS_PAIRED_BANK24_EXACT_NATIVE_MAPS','complete exact paired phase component') + word,parent,child,binding,_,_,mains=phase.graph_inputs(a.peer_package,a.graphs,receipt['graph_pins']) + recipes=compiled_bank_recipes(a.phase,receipt,parent,child,mains) + _,checker=phase.engine_pair(a.engine_dir) + need(sha(a.field_engine.read_bytes())==FIELD_PIN,'exact dense modular interpreter source') + projector=runpy.run_path(str(a.field_engine)) + result=check(word,parent,child,recipes,a.prime,SEED[a.prime],checker,projector,a.prime==1000000009) + need(sha(phase_path.read_bytes())==phase_sha and sha(a.field_engine.read_bytes())==FIELD_PIN,'immutable field and catalogue') + for kind,r in binding['graphs'].items(): + need(sha((a.graphs/r['file']).read_bytes())==r['gzip_sha256'],f'immutable {kind} scientific graph at exit') + phase.write(a.out/'RESULT.json',{**start,**result,'completed_at':phase.stamp(),'graph_pins':receipt['graph_pins'], + 'exact_caller_sha256':phase.DEC_CALLER}) + print('PASS_PAIRED_BANK24_ACTUAL_HELD_ARRAYS',a.prime,1501,6142,flush=True) + + +if __name__=='__main__': + main() diff --git a/research/p104-role230-banked/engines/native/bank_phase.py b/research/p104-role230-banked/engines/native/bank_phase.py new file mode 100644 index 0000000000..397f621e29 --- /dev/null +++ b/research/p104-role230-banked/engines/native/bank_phase.py @@ -0,0 +1,359 @@ +#!/usr/bin/env python3 +"""Check actual banked DAG geometry, physical operator bodies and main boundaries.""" + +import argparse +from collections import Counter, defaultdict +from copy import deepcopy +from dataclasses import dataclass +from datetime import datetime, timezone +from fractions import Fraction +from functools import cache +import gzip +from hashlib import sha256 +import importlib +import json +from pathlib import Path +import sys + +sys.path.insert(0,str(Path(__file__).resolve().parent)) +from custody import canonical,read,need,sha,NATIVE + + +WORD = 'ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d' +DIRECT = 'ab5653d6b6007f8a7987e7ffc6ebab24c662ba852a0d0b446c3a1be19b88db8a' +HEAD = '28b2af322a1fab01b3734365988930920f9dda48' +SCIENCE = '26b6c469aa6c4aa04322ce25a22150f90e5fb14e' +PIVOTS = 'fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85' +PEER_RESULT = '00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38' +CUSTODY_PACKED = '18cd4ff7bfaab88dc0c13fba636d1355350cd6199f83ef18c9fe477b33460d23' +DEC_CALLER = '62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf' +CLAIM = 'https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19702865' +RECEIPT = 'progress.kappa-leading-20261118t0540z.00000027' +ENGINE_PINS = {'clifford_exact.py':'2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962', + 'native_verify.py':'3049471905b47b385c88378a1a3be7a18b8858aadd035b8a6da2f4a03b470f38'} +PEER_PINS = {'PIVOTS.json':PIVOTS,'RESULT.json':PEER_RESULT, + 'network.py':'a9169fd6ad0a13c69cf39bd32649d53256f6d6fa2ed2ceda854f848b64f4c546', + 'catalogue.py':'11b1b270e366f68bcae333e31716613f1cb9f0ac2ed3e687d70f8ebd7bc7c9c1', + 'SOURCES.json':'76818b74ee05a1a562813b1385b3609dea2bb548c260ebda1b3f8a7aeab236c9'} + + +def stamp(): + return datetime.now(timezone.utc).isoformat() + + +def write(path, value): + with path.open('xb') as stream: + stream.write(canonical(value)+b'\n') + + +def pinned_import(folder, name, digest): + path = folder / (name+'.py') + need(sha(path.read_bytes()) == digest,f'{name} source pin') + sys.path.insert(0,str(folder)) + try: + module = importlib.import_module(name) + need(Path(module.__file__).resolve() == path.resolve(),'exact module import path') + return module + finally: + sys.path.pop(0) + + +def frame_span(vectors): + members = {0} + for value in vectors: + need(type(value) is int and 0 < value < 512 and value not in members,'binary independent chart basis') + members |= {value^m for m in members} + return members + + +@cache +def coefficient(value): + fraction = Fraction(value) + need(fraction != 0 and str(fraction) == value,'nonzero exact canonical rational coefficient') + return fraction + + +@dataclass +class Graph: + kind: str + metadata: dict + frames: list + initial: list + final: list + first: int + moves: dict + forms: dict + schedule: list + + +def frozen_graph(root,binding,kind): + item = binding['graphs'][kind] + wanted = kind.upper()+'-GRAPH.json.gz' + need(item['file'] == wanted,'exact graph file name') + packed = (root/wanted).read_bytes() + blob = gzip.decompress(packed) + need(sha(packed) == item['gzip_sha256'] and sha(blob) == item['canonical_sha256'],'immutable bank graph custody') + data = json.loads(blob) + need(canonical(data) == blob,'canonical leased graph bytes') + meta = {'schema':'p104-exact-banked-dag/v1','kind':kind,'peer_head':HEAD,'scientific_commit':SCIENCE, + 'source_word_sha256':WORD,'role230_direct_word_sha256':DIRECT if kind=='candidate' else None, + 'caller_sha256':DEC_CALLER,'fixed_pivot_sha256':PIVOTS,'published_result_sha256':PEER_RESULT} + need(data['metadata'] == meta and data['first_output'] == 150522,'same tagged bank graph namespace and source') + moves = {key:(a,b) for key,a,b in data['moves']} + forms = {key:[(donor,coefficient(q)) for donor,q in terms] for key,terms in data['forms']} + need(len(moves) == len(data['moves']) == 6142 and len(forms) == len(data['forms']) == 7643, + 'actual initial+terminal row denominator and unique paid slots') + return Graph(kind,meta,data['frames'],data['initial'],data['final'],data['first_output'],moves,forms,data['schedule']) + + +def graph_inputs(peer,root,expected_pair=None): + for name,digest in PEER_PINS.items(): + need(sha((peer/name).read_bytes()) == digest,f'peer source pin {name}') + network = pinned_import(peer,'network',PEER_PINS['network.py']) + word = network.source_word() + need(sha(canonical(word)) == WORD,'exact source word header and ancestry') + binding = read(root/'GRAPH-BINDING.json') + need(binding['status'] == 'FROZEN_BOTH_ORDERS_WITH_EXACT_STABLE_KEYS' + and binding['published_pivot_inventory_reproduced'] and binding['first_output'] == 150522, + 'frozen paired graph receipt') + got = {k:r['canonical_sha256'] for k,r in binding['graphs'].items()} + need(expected_pair is None or got == expected_pair,'exact qualified bank graph digests') + before = frozen_graph(root,binding,'peer') + after = frozen_graph(root,binding,'candidate') + for g in (before,after): + need(g.frames == word['frames'] and g.initial == word['initial'] and g.final == word['final'], + 'common exact ordered frames and public entrances/exits') + original,peer_net,stamps = network.networks(word) + need(peer_net.moves == before.moves and + {k:tuple(sorted(terms.items())) for k,terms in peer_net.forms.items()} == {k:tuple(v) for k,v in before.forms.items()} + and peer_net.schedule() == before.schedule,'base literally rebuilt by published #7674 scientific code') + return word,before,after,binding,original.moves,stamps,network.main_roles(word) + + +def graph_census(g, mains): + spans = list(map(frame_span,g.frames)) + need(len(mains) == 400 and len(g.initial) == len(g.final) == 1501,'exact public main/helper denominator') + ends = set(range(g.first,g.first+len(g.final))) + need(set(g.forms) == ends|g.moves.keys() and len(g.schedule) == len(g.forms) and set(g.schedule) == set(g.forms), + 'unique complete schedule covering paid and terminal slots') + move_occurrences, helper_occurrences = defaultdict(list),defaultdict(list) + paid, productive = Counter(),Counter() + + def positive(a,b): + need(a in range(len(spans)) and b in range(len(spans)), 'paid or helper chart indices') + need(spans[a] < spans[b] or spans[b] < spans[a], 'strict nested positive rank') + return abs(len(g.frames[a])-len(g.frames[b])) + + for key,(a,b) in g.moves.items(): + paid[positive(a,b)] += 1 + move_occurrences[a,b].append(key) + for role,(a,b) in enumerate(zip(g.initial,g.final,strict=True)): + if role not in mains: + rank = positive(a,b) + need(spans[a] < spans[b],'each productive helper E/G is strictly ascending') + productive[rank] += 1 + helper_occurrences[a,b].append(role) + known = {~role:chart for role,chart in enumerate(g.initial)} + total_terms = 0 + for key in g.schedule: + a,b = g.moves[key] if key in g.moves else (g.final[key-g.first],)*2 + seen = set() + for donor,_ in g.forms[key]: + need(donor in known and donor not in seen and known[donor] == a, + f'bank dependency or chart mismatch at slot {key}') + seen.add(donor) + total_terms += len(seen) + if key in g.moves: + known[key] = b + return move_occurrences,helper_occurrences,{'native_paid':dict(paid),'native_targets':dict(productive), + 'move_occurrences':sum(paid.values()),'productive_occurrences':sum(productive.values()), + 'move_pairs':len(move_occurrences),'productive_pairs':len(helper_occurrences), + 'directed_union':len(move_occurrences.keys()|helper_occurrences.keys()),'scheduled_forms':len(g.schedule), + 'local_terms':total_terms,'helper_325_1087_EG': {r:[g.initial[r],g.final[r]] for r in (325,1087)}} + + +def cached_maps(path): + depot = read(path,CUSTODY_PACKED) + need(depot['source'] == WORD and depot['candidate'] == DIRECT and depot['native_result_sha256'] == NATIVE, + 'scoped rising direct-word proof provenance') + need(depot['engines'] == {'clifford_exact.py':{'sha256':ENGINE_PINS['clifford_exact.py'], + 'git_blob':'166841a037f069249f6f7f6dedb89248812f59e2'}, + 'native_verify.py':{'sha256':ENGINE_PINS['native_verify.py'], + 'git_blob':'2c209dfa9cfade3bc20ac5fc9d876b433a147f8c'}}, + 'cached compiler and checker are exactly the same frozen bytes') + need(sha(canonical([[*ids,recipe] for ids,_,recipe,_,_ in depot['maps']])) == depot['semantic_recipe_sha256'], + 'immutable complete operator body archive') + by_basis = {} + for ids,(a,b),recipe,shard,pin in depot['maps']: + by_basis.setdefault((tuple(a),tuple(b)),(ids,recipe,shard,pin)) + return by_basis + + +def engine_pair(folder): + return tuple(pinned_import(folder,name[:-3],digest) for name,digest in ENGINE_PINS.items()) + + +def main_boundaries(word, producer, checker): + frames = word['frames'] + h = word['hosted'] + hosted = dict(zip(h['Dports'],zip(h['X2'],h['Y2'],strict=True),strict=True)) + rows = [] + for j,(x,q) in enumerate(zip(word['live'],word['ports'],strict=True)): + y = x+112 + a,b,c,d = word['initial'][x],word['initial'][y],word['final'][x],word['final'][y] + need(frames[a] == [q] and frames[b] == [] and + frame_span(frames[d]) == {s for s in range(512) if (s&q).bit_count() %2 ==0}, 'actual main port axes') + ar,_ = producer.lower_child(producer.cgate(9,q,1).adjoint().then(producer.canonical_frame(9,tuple(frames[a])))) + br,_ = producer.lower_child(producer.canonical_frame(9,tuple(frames[d])).adjoint().then( + producer.cgate(9,q,-1).then(producer.fourier(9)))) + need(ar['rank'] == br['rank'] == 0,'main adapter physical rank zero') + checker.equal(checker.recipe(ar),(('C',q,-1),)+checker.frame(frames[a],9),'actual input main phase') + checker.equal(checker.recipe(br),checker.adjoint(checker.frame(frames[d],9))+(('C',q,-1),)+checker.fourier(9), + 'actual output main phase') + checker.equal(checker.frame(frames[c],9),checker.fourier(9),'main Fourier return') + if j in hosted: + u,v = hosted[j] + need((word['initial'][u],word['initial'][v],word['final'][u],word['final'][v]) == (a,b,c,d), + 'byte-equal corresponding hosted boundaries') + rows.append({'j':j,'q':q,'main_roles':[x,y],'hosted_roles':hosted.get(j),'charts':[a,b,c,d], + 'input_recipe':ar,'output_recipe':br}) + need(len(rows)==104 and len(hosted)==96,'complete actual 104/96 boundary denominator') + return rows + + +def check_operators(frames, keys, forced, custody, producer, checker): + records = [] + + @cache + def chart(a): + return producer.canonical_frame(9,tuple(frames[a])) + + @cache + def ideal(a): + return checker.frame(frames[a],9) + + for a,b in sorted(keys): + ordered = tuple(frames[a]),tuple(frames[b]) + archived = custody.get(ordered) + fresh = archived is None or (a,b) in forced + if fresh: + recipe,_ = producer.lower_child(chart(a).adjoint().then(chart(b))) + else: + recipe = archived[1] + need(recipe['rank'] == abs(len(frames[a])-len(frames[b])) > 0, f'paid or productive rank {a}->{b}') + actual,target = checker.recipe(recipe),checker.adjoint(ideal(a))+ideal(b) + checker.equal(actual,target,f'{a}->{b} signed Pauli and exact absolute phase') + if fresh: + for u,v in ((actual,target),(checker.adjoint(actual),checker.adjoint(target))): + for column in range(512): + need(checker.state(u,column)==checker.state(v,column),f'literal all columns {a}->{b} col {column}') + records.append({'pair':[a,b],'recipe':recipe,'all_column_comparison':512 if fresh else 0, + 'compared_signed_pauli_and_absolute_phase':True, + 'reuse': {'prior_pair':archived[0],'shard':archived[2],'proof_sha256':archived[3]} if not fresh else None}) + return records + + +def pivot_geometry(steps,stamps,pivots,old_moves,direct,results): + expected = [[r['direction'],r['remove'],r['pivot'],6156-i] for i,r in enumerate(pivots)] + need(expected == stamps == results['application']['pivots'] and len(stamps)==15, + 'frozen seven forward and eight transpose pivot identities') + for i,(step,stamp) in enumerate(zip(steps,stamps,strict=True)): + d,drop,lead,count = stamp + need((i,d,drop,lead,count,True) == (step['index'],step['direction'],step['remove'],step['lead'],step['surviving_slots'], + step['same_directed_forms_after_commutation']), 'disjoint pivot stages and actual direction') + changed = {pair for key,pair in direct.moves.items() if pair != old_moves[key]} + expected_keys = {tuple(p) for shard in results['catalogue'] for p in shard['columns']} + need(changed == expected_keys and len(changed)==10,'published ten final rerouted ordered bases') + proof_routes = [] + for step in steps: + final = tuple(step['lead_final_forward']) + actual = final if step['direction']=='forward' else final[::-1] + proof_routes.append({'index':step['index'],'direction':step['direction'],'lead':step['lead'], + 'in_pivot_direction':actual,'forward':final, + 'lead_before':step['lead_before_in_direction']}) + return changed,proof_routes + + +def main(): + p=argparse.ArgumentParser(description=__doc__) + p.add_argument('--peer-package',type=Path,required=True) + p.add_argument('--engine-dir',type=Path,required=True) + p.add_argument('--graphs',type=Path,required=True) + p.add_argument('--custody',type=Path,required=True) + p.add_argument('--expect-peer',required=True) + p.add_argument('--expect-child',required=True) + p.add_argument('--out',type=Path,required=True) + args=p.parse_args() + out=args.out + out.mkdir() + expected = {'peer':args.expect_peer,'candidate':args.expect_child} + write(out/'START.json',{'observed_at':stamp(),'scope':RECEIPT,'claim':CLAIM,'head':HEAD,'pivot_manifest':PIVOTS, + 'graph_pins':expected,'program_sha256':sha(Path(__file__).read_bytes()), + 'map_custody_sha256':CUSTODY_PACKED}) + word,parent,child,binding,old_moves,stamps,mains = graph_inputs(args.peer_package,args.graphs,expected) + source_m,source_h,source_account = graph_census(parent,mains) + child_m,child_h,child_account = graph_census(child,mains) + need(source_h == child_h and parent.moves.keys()==child.moves.keys() and parent.forms.keys()==child.forms.keys(), + 'fixed productive fields and scheduled banks for both constructions') + changed = [k for k in parent.moves if parent.moves[k]!=child.moves[k]] + need(sorted(changed) == binding['changed_move_keys'] == [97471,102393],'actual changed role230 slots') + need(sum(Counter(child_account['native_targets']).values())==1101,'preserved productive targets') + price = Counter(child_account['native_paid']) + price.subtract(source_account['native_paid']) + need({k:v for k,v in price.items() if v} == {2:1,3:-2,4:1},'no extra paid job or target loss') + pivot_pairs,orientation = pivot_geometry(binding['stages'],stamps,read(args.peer_package/'PIVOTS.json',PIVOTS), + old_moves,parent,read(args.peer_package/'RESULT.json',PEER_RESULT)) + from_source = {parent.moves[k] for k in changed} + from_child = {child.moves[k] for k in changed} + actual_keys=source_m.keys()|source_h.keys()|child_m.keys()|child_h.keys() + direction_keys={tuple(s['in_pivot_direction']) for s in orientation} + recently_changed=from_source|from_child|pivot_pairs|direction_keys + producer,checker=engine_pair(args.engine_dir) + custody = cached_maps(args.custody) + phase = check_operators(word['frames'],actual_keys|direction_keys,recently_changed,custody,producer,checker) + actual_change = child.moves[97471] + found=next(r for r in phase if tuple(r['pair'])==actual_change) + altered = deepcopy(found['recipe']) + altered['left']['phase']=(altered['left']['phase']+1)%4 + desired = checker.recipe(found['recipe']) + bad = checker.recipe(altered) + need(checker.tableau(bad)==checker.tableau(desired),'phase-only control unchanged signed Pauli action') + try: + checker.equal(bad,desired,'mutated actual role230 recipe') + except ValueError as exc: + need(str(exc).endswith('exact global phase'),'actual wrong phase failure reason') + else: + raise ValueError('phase fault entered the checked bank catalogue') + forms = child.forms.copy() + forms[97471] = [(97471,Fraction(1)),*forms[97471]] + bad_graph=Graph(child.kind,child.metadata,child.frames,child.initial,child.final,child.first,child.moves,forms,child.schedule) + try: + graph_census(bad_graph,mains) + except ValueError as exc: + need(str(exc)=='bank dependency or chart mismatch at slot 97471','actual cycle mutation rejected at changed slot') + else: + raise ValueError('edited dependency cycle escaped') + write(out/'MAIN-BOUNDARIES.json', main_boundaries(word,producer,checker)) + write(out/'PIVOT-DIRECTIONS.json', orientation) + by_pair = [] + for record in phase: + pair=tuple(record['pair']) + by_pair.append({**record,'in_forward_union':pair in actual_keys,'peer_moves':source_m.get(pair,[]), + 'candidate_moves':child_m.get(pair,[]),'productive_roles':source_h.get(pair,[])}) + with (out/'BANK-RECIPES.json.gz').open('xb') as stream: + stream.write(gzip.compress(canonical(by_pair),mtime=0)) + write(out/'RESULT.json',{'status':'PASS_PAIRED_BANK24_EXACT_NATIVE_MAPS','complete_at':stamp(),'source_head':HEAD, + 'graph_pins':expected,'source_word':WORD,'role230_direct':DIRECT,'caller_sha256':DEC_CALLER, + 'source':source_account,'candidate':child_account,'pivot_manifest_sha256':PIVOTS, + 'forward_union':len(actual_keys),'diagnostic_only_pivot_orientations':len(direction_keys-actual_keys), + 'fresh_maps_512_each_direction':sum(bool(r['all_column_comparison']) for r in phase), + 'cached_same_basis_bodies_fresh_pauli_and_phase':sum(r['reuse'] is not None for r in phase), + 'actual_phase_control_rejected':[97471,*actual_change],'actual_cycle_control_rejected':97471, + 'main_boundary_pairs':104,'hosted_correspondences':96, + 'artifact_sha256':{f.name:sha(f.read_bytes()) for f in sorted(out.iterdir())}, + 'scope':'Actual bank graph map census, all fresh exact Pauli/phase, all columns on changed/unbound pairs and pivot orientations. Separate full held-array and physical storage/resource tests.'}) + print('PASS_PAIRED_BANK24_EXACT_NATIVE_MAPS',len(actual_keys),len(direction_keys-actual_keys),flush=True) + + +if __name__=='__main__': + main() diff --git a/research/p104-role230-banked/engines/native/custody.py b/research/p104-role230-banked/engines/native/custody.py new file mode 100644 index 0000000000..8712a201e3 --- /dev/null +++ b/research/p104-role230-banked/engines/native/custody.py @@ -0,0 +1,80 @@ +#!/usr/bin/env python3 +"""Package independently checked operator bodies from the frozen 235-word result.""" + +import argparse +import gzip +from hashlib import sha256 +import json +from pathlib import Path + + +NATIVE = 'f5f77093ee3f8f7447726f36fe6967b21a08005d503a99441181b57e280a5970' +CENSUS = 'e1ee0b6c1b53ff269c162d6b134a5e9126be4f86cc8f4bd909e2eb8329f0d1e5' + + +def need(condition, reason): + if not condition: + raise ValueError(reason) + + +def canonical(value): + return json.dumps(value,sort_keys=True,separators=(',',':')).encode() + + +def sha(blob): + return sha256(blob).hexdigest() + + +def read(path, pin=None): + raw = path.read_bytes() + if pin is not None: + need(sha(raw) == pin,f'{path.name} byte pin') + return json.loads(gzip.decompress(raw) if raw.startswith(b'\x1f\x8b') else raw) + + +def build(root): + native = read(root/'NATIVE-RESULT.json',NATIVE) + census = read(root/'SOURCE-CATALOGUE.json',CENSUS) + rows = census['rows'] + need(native['source']['word'] == census['baseline_word'] and native['candidate']['word'] == census['candidate_word'] + and native['union_maps_exact_signed_pauli_and_phase'] == 3026, 'prior exact native result') + recipes = {} + for shard,pin in enumerate(native['catalogue_shard_result_sha256']): + folder = root/f'catalogue-{shard:02d}' + receipt = read(folder/'RESULT.json',pin) + need(receipt['status'] == 'PASS_16_PAIRED_NATIVE_CATALOGUE_SHARD' and receipt['source_catalogue_sha256'] == CENSUS + and receipt['phase_only_control_rejected_at'] and (receipt['shard'],receipt['shards']) == (shard,6), + 'old actual shard custody') + for row,index in zip(read(folder/'RECIPES.json',receipt['artifact_sha256']['RECIPES.json']), + range(shard,len(rows),6),strict=True): + census_record = rows[index] + charts = row['charts'] + needs_column = census_record['prior_all_column_proof'] is None + need(row['index'] == index and census_record['charts'] == charts + and row['signed_pauli_and_absolute_phase'] + and row['literal_columns_each_direction'] == (512 if needs_column else 0) + and row['prior_all_column_proof'] == census_record['prior_all_column_proof'], 'same prior verified map') + recipes[index] = [charts,census_record['ordered_basis'],row['recipe'],shard,pin] + need(len(recipes) == len(rows) == 3026, 'complete ordered-basis custody') + emitted = [recipes[index] for index in range(len(rows))] + semantic = [[*charts,recipe] for charts,_,recipe,_,_ in emitted] + need(sha(canonical(semantic)) == native['recipe_union_semantic_sha256'], 'actual old recipe union identity') + return {'source':native['source']['word'],'candidate':native['candidate']['word'], + 'native_result_sha256':NATIVE,'map_census_sha256':CENSUS,'engines':census['exact_engines'], + 'semantic_recipe_sha256':native['recipe_union_semantic_sha256'],'maps':emitted} + + +def main(): + parser=argparse.ArgumentParser(description=__doc__) + parser.add_argument('--root',type=Path,required=True) + parser.add_argument('--out',type=Path,required=True) + a=parser.parse_args() + raw=canonical(build(a.root)) + packed=gzip.compress(raw,mtime=0) + with a.out.open('xb') as stream: + stream.write(packed) + print(json.dumps({'maps':3026,'decoded_sha256':sha(raw),'packed_sha256':sha(packed)})) + + +if __name__=='__main__': + main() diff --git a/research/p104-role230-banked/evidence/APPLICATION-ORDINARY.json b/research/p104-role230-banked/evidence/APPLICATION-ORDINARY.json new file mode 100644 index 0000000000..a1e5867b1e --- /dev/null +++ b/research/p104-role230-banked/evidence/APPLICATION-ORDINARY.json @@ -0,0 +1,200 @@ +{ + "candidate": { + "dispatcher": { + "dummy_slots": 1, + "homes": 15290, + "logical_selected_slot_distance_sum": 1234654122, + "logical_visits": { + "accumulator_write": 7643, + "completed_paid_snapshot_write": 6142, + "entrance_snapshot_write": 1501, + "full_init": 15290, + "full_retire": 15290, + "intact_donor_read": 169349, + "paid_child_input_read": 6142, + "public_install_read": 1501 + }, + "public_inputs_parked_until_install": true, + "restored_head_and_kept_guards": true, + "signed_public_outputs_checked": 1501 + }, + "explicit_complete_cost": { + "H": 14558800000000000000, + "all_field_boundary_conversions": 55104, + "compiled_stock": { + "G": "Sum the positive complete reads, copies, installs, restores, selectors, resets and guide layout costs, compiler wrappers and primitive movement; count actual complete shaped views.", + "O": "15291 J native homes including dummy, plus U caller tuples and all actual guide, historic, parked, compiler, adapter and BIT backing", + "cutoffs": "Recompute an eventual cutoff for each positive outer gap after finite constants and complete occurrence stock are fixed.", + "substitution": "Z=Wp+O; E0=64(Z+N+P+G+1)^3; B0=P+E0; C0=32 N B0^2" + }, + "context_c": 118, + "context_mass_upper": "27670501239509649375/64", + "copy_charge": { + "coefficient_of_L": 812728320, + "constant": 2031820800 + }, + "depth_guard_bits": 14080, + "dyadic_height": 27, + "elementary_records_upper_at_cap_153": 26607454720, + "full_copy_streams_charged_at_most": 6349440, + "homes_per_native": 15290, + "homes_plus_dummy_per_native": 15291, + "layout": { + "capacity_per_view": "(2n+2k+5)(L+2) + (L+2) for the guide, plus descriptors, public fields and other aux; reserve old backing and full parked ancestors.", + "field_extent": "L=(2(W+26)+3)R 2^D", + "guide": "One immutable typed guide per equal packed view; charge whole-field production, alignment, return and retirement.", + "view_wrappers": "Charge each public/child entrance and return, equal-view transfer and any shape change at the retained complete-view movement rate, with the full actual and historical extents." + }, + "logical_access_counts_per_native": { + "accumulator_write": 7643, + "completed_paid_snapshot_write": 6142, + "entrance_snapshot_write": 1501, + "full_init": 15290, + "full_retire": 15290, + "intact_donor_read": 169349, + "paid_child_input_read": 6142, + "public_install_read": 1501 + }, + "monomial_slots_with_root_q_corrections": 280480, + "published_reset_allowance_before_explicit_scratch": 11816768, + "raw_form_terms": 169349, + "raw_paid_nodes": 6142, + "raw_private_homes": 244640, + "raw_private_homes_with_dummy": 244656, + "raw_terminal_nodes": 1501, + "reset_charge": { + "coefficient_of_L": 46480640, + "constant": 69720960 + }, + "scalar_services_upper": 117283328, + "scalar_step_rate_per_padded_component_bit": 2097152, + "scales": { + "caller": 2025, + "native": 2025 + }, + "selector_charge": { + "coefficient_of_L": 6334250333440, + "constant": 28513787557120, + "meaning": "Use the full #7670 highest-slot reset rate for each addressed macro, including read-only selection and head return." + }, + "stateful_reset_services_upper": 23240320 + }, + "original_budget": { + "H": 14558800000000000000, + "coefficient_bits": 13, + "context_c": 118, + "context_mass_bits": 59, + "context_mass_upper": "27670501239509649375/64", + "depth_guard_bits": 14080, + "dyadic_height": 27, + "elementary_records_upper": 26272015616, + "homes_per_native": 15290, + "monomial_slots_upper": 276944, + "odd_conversions": 55104, + "raw_private_homes": 244640, + "reset_services_upper": 11816768, + "scalar_services_upper": 117283328, + "scalar_steps_per_bit_upper": 2097152, + "scalar_test_cases": 4038 + } + }, + "peer": { + "dispatcher": { + "dummy_slots": 1, + "homes": 15290, + "logical_selected_slot_distance_sum": 1234587377, + "logical_visits": { + "accumulator_write": 7643, + "completed_paid_snapshot_write": 6142, + "entrance_snapshot_write": 1501, + "full_init": 15290, + "full_retire": 15290, + "intact_donor_read": 169343, + "paid_child_input_read": 6142, + "public_install_read": 1501 + }, + "public_inputs_parked_until_install": true, + "restored_head_and_kept_guards": true, + "signed_public_outputs_checked": 1501 + }, + "explicit_complete_cost": { + "H": 14558800000000000000, + "all_field_boundary_conversions": 55104, + "compiled_stock": { + "G": "Sum the positive complete reads, copies, installs, restores, selectors, resets and guide layout costs, compiler wrappers and primitive movement; count actual complete shaped views.", + "O": "15291 J native homes including dummy, plus U caller tuples and all actual guide, historic, parked, compiler, adapter and BIT backing", + "cutoffs": "Recompute an eventual cutoff for each positive outer gap after finite constants and complete occurrence stock are fixed.", + "substitution": "Z=Wp+O; E0=64(Z+N+P+G+1)^3; B0=P+E0; C0=32 N B0^2" + }, + "context_c": 118, + "context_mass_upper": "27670501239509649375/64", + "copy_charge": { + "coefficient_of_L": 812703744, + "constant": 2031759360 + }, + "depth_guard_bits": 14080, + "dyadic_height": 27, + "elementary_records_upper_at_cap_153": 26607454720, + "full_copy_streams_charged_at_most": 6349248, + "homes_per_native": 15290, + "homes_plus_dummy_per_native": 15291, + "layout": { + "capacity_per_view": "(2n+2k+5)(L+2) + (L+2) for the guide, plus descriptors, public fields and other aux; reserve old backing and full parked ancestors.", + "field_extent": "L=(2(W+26)+3)R 2^D", + "guide": "One immutable typed guide per equal packed view; charge whole-field production, alignment, return and retirement.", + "view_wrappers": "Charge each public/child entrance and return, equal-view transfer and any shape change at the retained complete-view movement rate, with the full actual and historical extents." + }, + "logical_access_counts_per_native": { + "accumulator_write": 7643, + "completed_paid_snapshot_write": 6142, + "entrance_snapshot_write": 1501, + "full_init": 15290, + "full_retire": 15290, + "intact_donor_read": 169343, + "paid_child_input_read": 6142, + "public_install_read": 1501 + }, + "monomial_slots_with_root_q_corrections": 280480, + "published_reset_allowance_before_explicit_scratch": 11816384, + "raw_form_terms": 169343, + "raw_paid_nodes": 6142, + "raw_private_homes": 244640, + "raw_private_homes_with_dummy": 244656, + "raw_terminal_nodes": 1501, + "reset_charge": { + "coefficient_of_L": 46479104, + "constant": 69718656 + }, + "scalar_services_upper": 117280256, + "scalar_step_rate_per_padded_component_bit": 2097152, + "scales": { + "caller": 2025, + "native": 2025 + }, + "selector_charge": { + "coefficient_of_L": 6334044827200, + "constant": 28512862465600, + "meaning": "Use the full #7670 highest-slot reset rate for each addressed macro, including read-only selection and head return." + }, + "stateful_reset_services_upper": 23239552 + }, + "original_budget": { + "H": 14558800000000000000, + "coefficient_bits": 13, + "context_c": 118, + "context_mass_bits": 59, + "context_mass_upper": "27670501239509649375/64", + "depth_guard_bits": 14080, + "dyadic_height": 27, + "elementary_records_upper": 26272015616, + "homes_per_native": 15290, + "monomial_slots_upper": 276944, + "odd_conversions": 55104, + "raw_private_homes": 244640, + "reset_services_upper": 11816384, + "scalar_services_upper": 117280256, + "scalar_steps_per_bit_upper": 2097152, + "scalar_test_cases": 4038 + } + } +} diff --git a/research/p104-role230-banked/evidence/APPLICATION-RESULT.json b/research/p104-role230-banked/evidence/APPLICATION-RESULT.json new file mode 100644 index 0000000000..39f9fe2a6f --- /dev/null +++ b/research/p104-role230-banked/evidence/APPLICATION-RESULT.json @@ -0,0 +1,30 @@ +{ + "caller_sha256": "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf", + "candidate_directed_conditional_lower": "0.0037261023899", + "candidate_raw_bracket": [ + "0.0037261023900", + "0.0037261023901" + ], + "graphs": { + "candidate": [ + "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150", + "8e28c1d403145ca5d72521f4acd7e068603598334c87f18f2fefb738844a1970" + ], + "peer": [ + "d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098", + "d293b505f9c572ea56a5ee378d194e5a5b34796ae3fde97467d6f7aace97f84d" + ] + }, + "paid_count": 101824, + "productive_count": 21152, + "published_peer_upper": "0.00372604555572", + "scope": "Paired exact normalized banked graph and caller, physical snapshot scheduler in normalized coordinates, all-width ordinary accounting under the selected five assumptions, and complete rank funding and outer numerical probes. Separate held-field native map receipts bind all shaped paid operators; the compiled multiplier is an inherited conditional construction.", + "signed_paid_delta": { + "2": 16, + "3": -32, + "4": 16 + }, + "signed_target_delta": {}, + "status": "PASS_BANK24_ACTUAL16_APPLICATION_COMPONENT", + "strict_gap": "2841709/50000000000000" +} diff --git a/research/p104-role230-banked/evidence/DENSE-1000000009.json b/research/p104-role230-banked/evidence/DENSE-1000000009.json new file mode 100644 index 0000000000..ec41489826 --- /dev/null +++ b/research/p104-role230-banked/evidence/DENSE-1000000009.json @@ -0,0 +1 @@ +{"actual_negative_controls":{"quarter phase":{"changed_public_roles":[17,19,38,40,135,220,283,469,772,774,779,781,782,783,784,790,794,795,796,797,803,804,805,807,817,819,820,821,824,825,826,832,833,840,841,842,847,849,855,857,859,860,861,862,864,868,870,871,872,873,877,878,879],"injected_slot":97471},"same-price sign":{"changed_public_roles":[17,19,38,40,135,220,283,469,772,774,779,781,782,783,784,790,794,795,796,797,803,804,805,807,817,819,820,821,824,825,826,832,833,840,841,842,847,849,855,857,859,860,861,862,864,868,870,871,872,873,877,878,879],"injected_slot":97471}},"candidate":{"active_nodes":7643,"distinct_scientific_held_arrays":15286,"independent_entry_banks":1501,"local_scalar_terms":169349,"paid_slots":6142,"returns_sha256":"cdfa50035fd5abeb46ff1fb6a33fe14ff8463dc84a337ca4021dad9f9e43ab10","terminal_arrays_sha256":"b256a61014a245ba8be7fc6988611696efecfd51fe1a4cf8e631a9c5beda072d","terminal_rows":1501},"completed_at":"2026-11-18T07:36:14.532470+00:00","exact_caller_sha256":"62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf","exact_column_links":[[261,912,"forward",0],[261,912,"forward",17],[261,912,"adjoint",0],[261,912,"adjoint",17],[912,127,"forward",0],[912,127,"forward",17],[912,127,"adjoint",0],[912,127,"adjoint",17]],"graph_pins":{"candidate":"1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150","peer":"d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098"},"helper_325_1087_boundaries":{"325":[3,237],"1087":[3,237]},"imaginary_root":569522298,"independent_expected_sha256":"b256a61014a245ba8be7fc6988611696efecfd51fe1a4cf8e631a9c5beda072d","input_sha256":"5e0a3b42f5964dcbdbd5a2bb6b3d429e1da7acc016c683539c3b24107c8c8b1d","main_outputs":400,"observed_at":"2026-11-18T07:35:06.598641+00:00","peer":{"active_nodes":7643,"distinct_scientific_held_arrays":15286,"independent_entry_banks":1501,"local_scalar_terms":169343,"paid_slots":6142,"returns_sha256":"8fa3fea0f086790e9ccf5077d47909f81a69c79a4704ba41dd334e7765cec6da","terminal_arrays_sha256":"b256a61014a245ba8be7fc6988611696efecfd51fe1a4cf8e631a9c5beda072d","terminal_rows":1501},"phase_sha256":"50b05bdc2805d709761ce5c4b42e7ec352141366f5cc6031df9f8779e8872735","positive_helper_outputs":1101,"prime":1000000009,"program_sha256":"2c71c0a15380649ebe11f914c25d79c4618bed7a9ce2285560e77f2148bc5e7b","scope":"Actual forward bank graph and independent direct public boundaries on dense prime projections. Private integer bit format, extent/reset/retirement and tariff are separate components.","seed":11,"status":"PASS_PAIRED_BANK24_ACTUAL_HELD_ARRAYS","width":512} diff --git a/research/p104-role230-banked/evidence/DENSE-998244353.json b/research/p104-role230-banked/evidence/DENSE-998244353.json new file mode 100644 index 0000000000..580e6adc0b --- /dev/null +++ b/research/p104-role230-banked/evidence/DENSE-998244353.json @@ -0,0 +1 @@ +{"actual_negative_controls":{},"candidate":{"active_nodes":7643,"distinct_scientific_held_arrays":15286,"independent_entry_banks":1501,"local_scalar_terms":169349,"paid_slots":6142,"returns_sha256":"246e6a00ea5aa4f3bde5f948444b3fabd6568216189677a8c08fc20194e02c31","terminal_arrays_sha256":"ebc04a837785119c0ec6e2a21152e9802acd87c10debf9d7c0495381043b47fb","terminal_rows":1501},"completed_at":"2026-11-18T07:37:47.769030+00:00","exact_caller_sha256":"62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf","exact_column_links":[[261,912,"forward",0],[261,912,"forward",17],[261,912,"adjoint",0],[261,912,"adjoint",17],[912,127,"forward",0],[912,127,"forward",17],[912,127,"adjoint",0],[912,127,"adjoint",17]],"graph_pins":{"candidate":"1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150","peer":"d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098"},"helper_325_1087_boundaries":{"325":[3,237],"1087":[3,237]},"imaginary_root":911660635,"independent_expected_sha256":"ebc04a837785119c0ec6e2a21152e9802acd87c10debf9d7c0495381043b47fb","input_sha256":"f95e41e2c6e36366b4a44ac7d7008b4215e73ad99b6b746efc52d940c97ddf28","main_outputs":400,"observed_at":"2026-11-18T07:37:07.566591+00:00","peer":{"active_nodes":7643,"distinct_scientific_held_arrays":15286,"independent_entry_banks":1501,"local_scalar_terms":169343,"paid_slots":6142,"returns_sha256":"bd047906b5f5cacdd2f3ba2b4911d106c1e20f0bd7d2b7b901662c15d4fa27be","terminal_arrays_sha256":"ebc04a837785119c0ec6e2a21152e9802acd87c10debf9d7c0495381043b47fb","terminal_rows":1501},"phase_sha256":"50b05bdc2805d709761ce5c4b42e7ec352141366f5cc6031df9f8779e8872735","positive_helper_outputs":1101,"prime":998244353,"program_sha256":"2c71c0a15380649ebe11f914c25d79c4618bed7a9ce2285560e77f2148bc5e7b","scope":"Actual forward bank graph and independent direct public boundaries on dense prime projections. Private integer bit format, extent/reset/retirement and tariff are separate components.","seed":37,"status":"PASS_PAIRED_BANK24_ACTUAL_HELD_ARRAYS","width":512} diff --git a/research/p104-role230-banked/evidence/INDEPENDENT-PRICE.json b/research/p104-role230-banked/evidence/INDEPENDENT-PRICE.json new file mode 100644 index 0000000000..b267d018cf --- /dev/null +++ b/research/p104-role230-banked/evidence/INDEPENDENT-PRICE.json @@ -0,0 +1,111 @@ +{ + "actual_child_added_one_rank_one_fee_control": [ + "-89507667304993153684230604978435576017107791391/91343852333181432387730302044767688728495783936", + "-89507667304993153684226947570381466639271153295/91343852333181432387730302044767688728495783936" + ], + "caller_sha256": "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf", + "candidate": { + "bracket": [ + "372610239/100000000000", + "37261023901/10000000000000" + ], + "claim": "37261023899/10000000000000", + "derivative_interval_kappa": [ + "9315113889/2500000000000", + "376669/100000000" + ], + "derivative_range": [ + "-47224925535399222102966042820062759449844476338577179347765616620321350025423939693055612288330415527/133499189745056880149688856635597007162669032647290798121690100488888732861290034376435130433536", + "-23601341228092735071194756688019416732637458850102512642034873151185843374034834609487518004369142211/66749594872528440074844428317798503581334516323645399060845050244444366430645017188217565216768" + ], + "target_minus_paid": { + "37261023899/10000000000000": [ + "2272338349497115494938120569214152511475/45671926166590716193865151022383844364247891968", + "2272338349497117323641684982381240355949/45671926166590716193865151022383844364247891968" + ], + "372610238997/100000000000000": [ + "570784845759099988115813883464903224345/22835963083295358096932575511191922182123945984", + "570784845759100902467596089763540212061/22835963083295358096932575511191922182123945984" + ], + "372610239/100000000000": [ + "1313909104768956487326330285337311625471/91343852333181432387730302044767688728495783936", + "82119319048060009045841194377715484689/5708990770823839524233143877797980545530986496" + ], + "37261023901/10000000000000": [ + "-1916858489454995294956456923259041511293/91343852333181432387730302044767688728495783936", + "-958429244727495818774664050090472468079/45671926166590716193865151022383844364247891968" + ], + "93151138893/25000000000000": [ + "1836185028188278703499697066332112711387992545/91343852333181432387730302044767688728495783936", + "1836185028188278703503354474386222089224630641/91343852333181432387730302044767688728495783936" + ] + } + }, + "graphs": { + "candidate": [ + "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150", + "8e28c1d403145ca5d72521f4acd7e068603598334c87f18f2fefb738844a1970" + ], + "peer": [ + "d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098", + "d293b505f9c572ea56a5ee378d194e5a5b34796ae3fde97467d6f7aace97f84d" + ] + }, + "inputs": { + "application": "b1af8b101a40f25eea55a8b58443794a7db708389ad66c20adefbace12828e09", + "invoices": "a9aecf52d99d5370506b9dc6d03799241bebd2c03bbdcfa2dd5f45ec03c9d70d", + "outer_receipt": "8e29f3ebb19c849884cfb87ef39431616774acfe95fa28a3cfe2e124abc6d202", + "plan_receipt": "509c44b078561a8868b68dab9f50b0b7d87d0976361d927bc8cc6bfdf1239393", + "published_peer": "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38", + "source": "446c8ebddf5b1e56d43b8d7f2ad3c1c9ba018a18105b207a0ac9e30386878a10" + }, + "paid_count_each": 101824, + "paid_delta": { + "2": 16, + "3": -32, + "4": 16 + }, + "peer": { + "bracket": [ + "372604555571/100000000000000", + "93151138893/25000000000000" + ], + "claim": "9315113889/2500000000000", + "derivative_interval_kappa": [ + "9315113889/2500000000000", + "376669/100000000" + ], + "derivative_range": [ + "-47225640074755295158009948487196598564754546021670750175983532005556045026988816086315068007088082723/133499189745056880149688856635597007162669032647290798121690100488888732861290034376435130433536", + "-47203397116553667225128431003388075358451099660474104648755222993564821733869302727698154665304507995/133499189745056880149688856635597007162669032647290798121690100488888732861290034376435130433536" + ], + "target_minus_paid": { + "372604555567/100000000000000": [ + "381088124227458465961917598771206379509/22835963083295358096932575511191922182123945984", + "1524352496909837521110093523223781575255/91343852333181432387730302044767688728495783936" + ], + "372604555571/100000000000000": [ + "232025598897697654188515576733505714527/91343852333181432387730302044767688728495783936", + "29003199862212663931367338027657526295/11417981541647679048466287755595961091061972992" + ], + "9315113889/2500000000000": [ + "3785924568431581486016483571985377351627/91343852333181432387730302044767688728495783936", + "3785924568431585143278906701263936221943/91343852333181432387730302044767688728495783936" + ], + "93151138893/25000000000000": [ + "-91056125605303329702552857654773896425/91343852333181432387730302044767688728495783936", + "-2845503925165614763754054072806869355/2854495385411919762116571938898990272765493248" + ] + } + }, + "rank_mass_surplus_each": 1328, + "scope": "Independent signed-rank moment brackets, derivative and added-price control", + "status": "PASS_BANK24_REVIEW_INDEPENDENT_DIRECTED_PRICE", + "strict_gap": "2841709/50000000000000", + "target_count_each": 21152, + "target_delta": {}, + "target_minus_paid_improvement_at_peer_upper": [ + "459046279811101077200756637533787982275860963/22835963083295358096932575511191922182123945984", + "1836185119244404308803027133265770856102895119/91343852333181432387730302044767688728495783936" + ] +} diff --git a/research/p104-role230-banked/evidence/INVOICES.json b/research/p104-role230-banked/evidence/INVOICES.json new file mode 100644 index 0000000000..eb3730cd37 --- /dev/null +++ b/research/p104-role230-banked/evidence/INVOICES.json @@ -0,0 +1,127 @@ +{ + "candidate": { + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "paid": { + "1": 63408, + "16": 416, + "2": 14112, + "24": 416, + "3": 9680, + "32": 416, + "4": 3920, + "40": 416, + "48": 416, + "5": 5792, + "56": 416, + "6": 1392, + "7": 176, + "8": 752, + "9": 96 + }, + "schema": "integer-mult-recursive-invoice/v1", + "targets": { + "1": 288, + "129": 208, + "17": 416, + "2": 336, + "25": 416, + "3": 752, + "33": 416, + "4": 3632, + "41": 416, + "49": 416, + "5": 1248, + "57": 416, + "6": 704, + "65": 416, + "7": 304, + "8": 512, + "9": 10256 + } + }, + "native_helper_targets": { + "1": 18, + "2": 21, + "3": 47, + "4": 227, + "5": 78, + "6": 44, + "7": 19, + "8": 32, + "9": 615 + }, + "native_paid": { + "candidate": { + "1": 3939, + "2": 882, + "3": 605, + "4": 245, + "5": 362, + "6": 87, + "7": 11, + "8": 7, + "9": 4 + }, + "peer": { + "1": 3939, + "2": 881, + "3": 607, + "4": 244, + "5": 362, + "6": 87, + "7": 11, + "8": 7, + "9": 4 + } + }, + "peer": { + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "paid": { + "1": 63408, + "16": 416, + "2": 14096, + "24": 416, + "3": 9712, + "32": 416, + "4": 3904, + "40": 416, + "48": 416, + "5": 5792, + "56": 416, + "6": 1392, + "7": 176, + "8": 752, + "9": 96 + }, + "schema": "integer-mult-recursive-invoice/v1", + "targets": { + "1": 288, + "129": 208, + "17": 416, + "2": 336, + "25": 416, + "3": 752, + "33": 416, + "4": 3632, + "41": 416, + "49": 416, + "5": 1248, + "57": 416, + "6": 704, + "65": 416, + "7": 304, + "8": 512, + "9": 10256 + } + } +} diff --git a/research/p104-role230-banked/evidence/NATIVE-RESULT.json b/research/p104-role230-banked/evidence/NATIVE-RESULT.json new file mode 100644 index 0000000000..5eb82df65e --- /dev/null +++ b/research/p104-role230-banked/evidence/NATIVE-RESULT.json @@ -0,0 +1 @@ +{"caller_sha256":"62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf","candidate":{"directed_union":3024,"helper_325_1087_EG":{"1087":[3,237],"325":[3,237]},"local_terms":169349,"move_occurrences":6142,"move_pairs":2977,"native_paid":{"1":3939,"2":882,"3":605,"4":245,"5":362,"6":87,"7":11,"8":7,"9":4},"native_targets":{"1":18,"2":21,"3":47,"4":227,"5":78,"6":44,"7":19,"8":32,"9":615},"productive_occurrences":1101,"productive_pairs":187,"scheduled_forms":7643},"dense":{"1000000009":{"borrowed_inputs_sha256":"5e0a3b42f5964dcbdbd5a2bb6b3d429e1da7acc016c683539c3b24107c8c8b1d","faults":{"quarter phase":{"changed_public_roles":[17,19,38,40,135,220,283,469,772,774,779,781,782,783,784,790,794,795,796,797,803,804,805,807,817,819,820,821,824,825,826,832,833,840,841,842,847,849,855,857,859,860,861,862,864,868,870,871,872,873,877,878,879],"injected_slot":97471},"same-price sign":{"changed_public_roles":[17,19,38,40,135,220,283,469,772,774,779,781,782,783,784,790,794,795,796,797,803,804,805,807,817,819,820,821,824,825,826,832,833,840,841,842,847,849,855,857,859,860,861,862,864,868,870,871,872,873,877,878,879],"injected_slot":97471}},"seed":11,"sha256":"012785e84bfcd12041e99036358ecfcb391a23130cea5c045e39f42795408d18","terminal_arrays_sha256":"b256a61014a245ba8be7fc6988611696efecfd51fe1a4cf8e631a9c5beda072d"},"998244353":{"borrowed_inputs_sha256":"f95e41e2c6e36366b4a44ac7d7008b4215e73ad99b6b746efc52d940c97ddf28","faults":{},"seed":37,"sha256":"75b11509ae79be3b33cd62229ccad25cfebb5f89ec0d958c220d11c21225b2d5","terminal_arrays_sha256":"ebc04a837785119c0ec6e2a21152e9802acd87c10debf9d7c0495381043b47fb"}},"diagnostic_only_pivot_orientations":5,"forward_union":3025,"fresh_512_maps_each_direction":19,"graph_pins":{"candidate":"1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150","peer":"d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098"},"hosted_correspondences":96,"main_boundary_pairs":104,"phase_sha256":"50b05bdc2805d709761ce5c4b42e7ec352141366f5cc6031df9f8779e8872735","pivot_manifest_sha256":"fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85","scope":"Actual scheduled banked native map bodies and two complete finite held-array projections. All-width physical extent, ordinary and outer are independent components.","source":{"directed_union":3024,"helper_325_1087_EG":{"1087":[3,237],"325":[3,237]},"local_terms":169343,"move_occurrences":6142,"move_pairs":2977,"native_paid":{"1":3939,"2":881,"3":607,"4":244,"5":362,"6":87,"7":11,"8":7,"9":4},"native_targets":{"1":18,"2":21,"3":47,"4":227,"5":78,"6":44,"7":19,"8":32,"9":615},"productive_occurrences":1101,"productive_pairs":187,"scheduled_forms":7643},"source_head":"28b2af322a1fab01b3734365988930920f9dda48","status":"PASS_PAIRED_BANK24_NATIVE_QUALIFICATION_COMPONENT"} diff --git a/research/p104-role230-banked/evidence/PHASE-RESULT.json b/research/p104-role230-banked/evidence/PHASE-RESULT.json new file mode 100644 index 0000000000..a2b5309098 --- /dev/null +++ b/research/p104-role230-banked/evidence/PHASE-RESULT.json @@ -0,0 +1 @@ +{"actual_cycle_control_rejected":97471,"actual_phase_control_rejected":[97471,261,912],"artifact_sha256":{"BANK-RECIPES.json.gz":"06dbe8d913627dbfef6cfe6599fd8eaa7fd82daddf72253b1f9bc5cb5a4eb0e9","MAIN-BOUNDARIES.json":"52f7260cf935ce523f5e899c7f384765b56a257bce93bdc4427417df3ba971e0","PIVOT-DIRECTIONS.json":"b71c45c78cee0386294c868f8a0de2687094dce99cf41f88eb1448710848ca77","START.json":"5f042e373da3683cd32609f07c0af44954cdb0cc365305b199261d0cb1122e68"},"cached_same_basis_bodies_fresh_pauli_and_phase":3011,"caller_sha256":"62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf","candidate":{"directed_union":3024,"helper_325_1087_EG":{"325":[3,237],"1087":[3,237]},"local_terms":169349,"move_occurrences":6142,"move_pairs":2977,"native_paid":{"1":3939,"2":882,"3":605,"4":245,"5":362,"6":87,"7":11,"8":7,"9":4},"native_targets":{"1":18,"2":21,"3":47,"4":227,"5":78,"6":44,"7":19,"8":32,"9":615},"productive_occurrences":1101,"productive_pairs":187,"scheduled_forms":7643},"complete_at":"2026-11-18T07:33:09.462960+00:00","diagnostic_only_pivot_orientations":5,"forward_union":3025,"fresh_maps_512_each_direction":19,"graph_pins":{"candidate":"1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150","peer":"d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098"},"hosted_correspondences":96,"main_boundary_pairs":104,"pivot_manifest_sha256":"fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85","role230_direct":"ab5653d6b6007f8a7987e7ffc6ebab24c662ba852a0d0b446c3a1be19b88db8a","scope":"Actual bank graph map census, all fresh exact Pauli/phase, all columns on changed/unbound pairs and pivot orientations. Separate full held-array and physical storage/resource tests.","source":{"directed_union":3024,"helper_325_1087_EG":{"325":[3,237],"1087":[3,237]},"local_terms":169343,"move_occurrences":6142,"move_pairs":2977,"native_paid":{"1":3939,"2":881,"3":607,"4":244,"5":362,"6":87,"7":11,"8":7,"9":4},"native_targets":{"1":18,"2":21,"3":47,"4":227,"5":78,"6":44,"7":19,"8":32,"9":615},"productive_occurrences":1101,"productive_pairs":187,"scheduled_forms":7643},"source_head":"28b2af322a1fab01b3734365988930920f9dda48","source_word":"ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d","status":"PASS_PAIRED_BANK24_EXACT_NATIVE_MAPS"} diff --git a/research/p104-role230-banked/evidence/PRICE-OUTER.json b/research/p104-role230-banked/evidence/PRICE-OUTER.json new file mode 100644 index 0000000000..a36184ccd5 --- /dev/null +++ b/research/p104-role230-banked/evidence/PRICE-OUTER.json @@ -0,0 +1,1752 @@ +{ + "added_rank_one_charge": { + "bits": 256, + "classification": "new_cost_higher", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "24906848861107/25000000000000", + "new_minus_old": { + "lower": "7091528011512702225130543545055297957311901572640474053607048038102619213483/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "7091528011512702225130543545055297957311901572640474053607048038102626736265/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63121 + }, + { + "power_lower": "7218338693544968372542695263213704907278850123963006842833878258473106261127/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "power_upper": "115493419096719493960683124211419278516461601983408109485342052135569700178379/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 2, + "signed_count": 13776 + }, + { + "power_lower": "172978598277250252387716440214603898625564063829340528322269357036456071580325/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "345957196554500504775432880429207797251128127658681056644538714072912143161629/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 3, + "signed_count": 8928 + }, + { + "power_lower": "460782077342528252123280822112541953595486989119412855327855070104498857739925/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "28798879833908015757705051382033872099717936819963303457990941881531178608823/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "rank": 4, + "signed_count": 288 + }, + { + "power_lower": "575498903146331774982463990014404639767949920962610286100693837620846447698807/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "575498903146331774982463990014404639767949920962610286100693837620846447700317/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "172532423218073263994327735566434117395078111099471099446534063019146931474911/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "172532423218073263994327735566434117395078111099471099446534063019146931475361/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "402344492201388840753572118489544384650743352217884094139616132722568989078449/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "804688984402777681507144236979088769301486704435768188279232265445137978158997/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "229796775933926876982281181544499234254100451315605667928590296463608114465653/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "459593551867853753964562363088998468508200902631211335857180592927216228932489/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "1033631767387422619411701735952912182060172483558620767935082141402340636621293/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "16150496365428478428307839624264252844690195055603449498985658459411572447249/1809251394333065553493296640760748560207343510400633813116524750123642650624", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "1833632368139977426211936288202087643729472910765017923165842761897556960130403/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1833632368139977426211936288202087643729472910765017923165842761897556960134935/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "973897176991971838794209110830977728107872919249933673458935944379315505220427/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1947794353983943677588418221661955456215745838499867346917871888758631010445641/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "2746296362834559476600661651674494800743988318182969665864956916819742013219409/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2746296362834559476600661651674494800743988318182969665864956916819742013226203/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860290281522062820340722934196288367320624992033936347393215757366201565060787/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "715072570380515705085180733549072091830156248008484086848303939341550391266947/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657805519492310282956161794837939443840932000152358123724418813122253966957345/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3657805519492310282956161794837939443840932000152358123724418813122253966966335/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771679469232150182208749489424090171044418852446409858478375070596067245023999/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3771679469232150182208749489424090171044418852446409858478375070596067245033249/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "4568456908157036019726299045479327392995868564408529694843461940590319429570709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "571057113519629502465787380684915924124483570551066211855432742573789928697739/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682237518036792157817088858315762406371976325300570534606538985811774389652709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4682237518036792157817088858315762406371976325300570534606538985811774389664197/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "10700049454135092105763317916180930920080211031471555596277978036865896948617/226156424291633194186662080095093570025917938800079226639565593765455331328", + "power_upper": "2739212660258583579075409386542318315540534024056718232647162377437669618852667/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "5592129530473112703703526414009473445551252277321917733109489784306790537686639/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "5592129530473112703703526414009473445551252277321917733109489784306790537700343/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387826161986614886970210579907873545791051224557544216116948626680334203870297/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "6387826161986614886970210579907873545791051224557544216116948626680334203885947/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "3250732852103901754576096064278951117518966881295066198415115514568436173400311/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "6501465704207803509152192128557902235037933762590132396830231029136872346816459/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "7410324885702497058616589477499769038037287034782615258209994752107499861568783/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3705162442851248529308294738749884519018643517391307629104997376053749930793357/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "3667283255711052006203565282070849207615120331559118114852836427788919995959347/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "14669133022844208024814261128283396830460481326236472459411345711155679983873099/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + }, + "candidate": { + "bracket": [ + "0.0037261023900", + "0.0037261023901" + ], + "compiler": { + "BIT_margin": "4058761003/100000000000000", + "BIT_pin": "376669/100000000", + "H": "14558800000000000000", + "alpha": [ + 0.9999999999999074, + 0.9999999999999074 + ], + "claim": "37261023899/10000000000000", + "compiler_gap": "1/100000000000000", + "delta": [ + 0.9322377546833008, + 0.9322377546833008 + ], + "derivative_upper": -348607.89227731834, + "gamma": [ + 0.9334350612704647, + 0.9334350612704647 + ], + "input_lift": { + "derivative_upper_on_required_interval": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + "interval_kappa_cap": "376669/100000000", + "margins": { + "37261023899/10000000000000": [ + "15875765481739016901514065819620238380765820379559187096850539116718159260277/12500000000000000000000000000000000000000000000000000000000000000000000000000000", + "63503061926956067606056263278480953523063281518236748387402156466872637042079/50000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "372610238997/100000000000000": [ + "127006123856193978214155965568726338897099500940813404551958323114155732023651/100000000000000000000000000000000000000000000000000000000000000000000000000000000", + "5080244954247759128566238622749053555883980037632536182078332924566229281023/4000000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "source_BIT_wide_crude_bound_would_be": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000" + }, + "minimum_log_power": 2286, + "moment_margin_float": { + "372610238997/100000000000000": [ + 2.499499774444079e-08, + 2.499499774444079e-08 + ], + "372610239/100000000000": [ + 1.438420945918076e-08, + 1.438420945918076e-08 + ], + "37261023901/10000000000000": [ + -2.098508482500992e-08, + -2.098508482500992e-08 + ] + }, + "moment_margins": { + "372610238997/100000000000000": [ + "156218735902754928513548276774307440322316530526037341595233809704640649/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "156218735902754928513548276774307440322316530526037341595233809706850997/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "372610239/100000000000": [ + "89901309119879750342618919123193014317091679925016467427856784842944099/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "17980261823975950068523783824638602863418335985003293485571356969032247/1250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "37261023901/10000000000000": [ + "-32789195039078003958706362453789554170089065380832080807420776204856483/1562500000000000000000000000000000000000000000000000000000000000000000000000000", + "-131156780156312015834825449815158216680356261523328323229683104817223453/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "outer": { + "BIT_just_below_effective_rejected": true, + "functional_count": 4, + "minimum_margin": "1/1000000000000000", + "strict_count": 54 + }, + "raw_bracket": [ + "372610239/100000000000", + "37261023901/10000000000000" + ], + "tested": "372610238997/100000000000000", + "written_log_power": 2287 + }, + "decimal_claim": "0.0037261023899", + "directed_checks": { + "0.00372604555572": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "24906848861107/25000000000000", + "new_minus_old": { + "lower": "-145477565819559988842643017987696283517472468962061198859050962391951389013/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "-145477565819559988842643017987696283517472468962061198859050962391943866231/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "7218338693544968372542695263213704907278850123963006842833878258473106261127/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "power_upper": "115493419096719493960683124211419278516461601983408109485342052135569700178379/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 2, + "signed_count": 13776 + }, + { + "power_lower": "172978598277250252387716440214603898625564063829340528322269357036456071580325/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "345957196554500504775432880429207797251128127658681056644538714072912143161629/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 3, + "signed_count": 8928 + }, + { + "power_lower": "460782077342528252123280822112541953595486989119412855327855070104498857739925/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "28798879833908015757705051382033872099717936819963303457990941881531178608823/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "rank": 4, + "signed_count": 288 + }, + { + "power_lower": "575498903146331774982463990014404639767949920962610286100693837620846447698807/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "575498903146331774982463990014404639767949920962610286100693837620846447700317/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "172532423218073263994327735566434117395078111099471099446534063019146931474911/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "172532423218073263994327735566434117395078111099471099446534063019146931475361/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "402344492201388840753572118489544384650743352217884094139616132722568989078449/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "804688984402777681507144236979088769301486704435768188279232265445137978158997/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "229796775933926876982281181544499234254100451315605667928590296463608114465653/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "459593551867853753964562363088998468508200902631211335857180592927216228932489/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "1033631767387422619411701735952912182060172483558620767935082141402340636621293/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "16150496365428478428307839624264252844690195055603449498985658459411572447249/1809251394333065553493296640760748560207343510400633813116524750123642650624", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "1833632368139977426211936288202087643729472910765017923165842761897556960130403/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1833632368139977426211936288202087643729472910765017923165842761897556960134935/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "973897176991971838794209110830977728107872919249933673458935944379315505220427/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1947794353983943677588418221661955456215745838499867346917871888758631010445641/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "2746296362834559476600661651674494800743988318182969665864956916819742013219409/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2746296362834559476600661651674494800743988318182969665864956916819742013226203/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860290281522062820340722934196288367320624992033936347393215757366201565060787/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "715072570380515705085180733549072091830156248008484086848303939341550391266947/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657805519492310282956161794837939443840932000152358123724418813122253966957345/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3657805519492310282956161794837939443840932000152358123724418813122253966966335/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771679469232150182208749489424090171044418852446409858478375070596067245023999/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3771679469232150182208749489424090171044418852446409858478375070596067245033249/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "4568456908157036019726299045479327392995868564408529694843461940590319429570709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "571057113519629502465787380684915924124483570551066211855432742573789928697739/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682237518036792157817088858315762406371976325300570534606538985811774389652709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4682237518036792157817088858315762406371976325300570534606538985811774389664197/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "10700049454135092105763317916180930920080211031471555596277978036865896948617/226156424291633194186662080095093570025917938800079226639565593765455331328", + "power_upper": "2739212660258583579075409386542318315540534024056718232647162377437669618852667/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "5592129530473112703703526414009473445551252277321917733109489784306790537686639/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "5592129530473112703703526414009473445551252277321917733109489784306790537700343/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387826161986614886970210579907873545791051224557544216116948626680334203870297/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "6387826161986614886970210579907873545791051224557544216116948626680334203885947/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "3250732852103901754576096064278951117518966881295066198415115514568436173400311/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "6501465704207803509152192128557902235037933762590132396830231029136872346816459/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "7410324885702497058616589477499769038037287034782615258209994752107499861568783/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3705162442851248529308294738749884519018643517391307629104997376053749930793357/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "3667283255711052006203565282070849207615120331559118114852836427788919995959347/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "14669133022844208024814261128283396830460481326236472459411345711155679983873099/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + }, + "0.0037261023899": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "9962738976101/10000000000000", + "new_minus_old": { + "lower": "-45008298010338189149303463482267018767671548218065978397172061867101/904625697166532776746648320380374280103671755200316906558262375061821325312", + "upper": "-360066384082705513194427707858136150141372385744527827177376487572477/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "230986829093839343603304824460691581648342806005151859351237331690356750215613/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "115493414546919671801652412230345790824171403002575929675618665845178375108147/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 2, + "signed_count": 13776 + }, + { + "power_lower": "345957174953373688590193857287086461072117010393355974509371825962233246968363/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "345957174953373688590193857287086461072117010393355974509371825962233246969321/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 3, + "signed_count": 8928 + }, + { + "power_lower": "460782041038015169921443766147369963158697825426683347841480166178950016311805/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "460782041038015169921443766147369963158697825426683347841480166178950016313025/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 4, + "signed_count": 288 + }, + { + "power_lower": "287749425252412831423779206594776738847606458537547300721676388097413493899349/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "287749425252412831423779206594776738847606458537547300721676388097413493900093/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "345064811297097632502343495431491056048966133859005830956334062729830159053167/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "172532405648548816251171747715745528024483066929502915478167031364915079527023/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "804688895408841947598195339929283341012224791769866022952696616344580575782217/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "402344447704420973799097669964641670506112395884933011476348308172290287892135/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "919186995103098245930747783972396384482542563795127655273123892386790285274709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "919186995103098245930747783972396384482542563795127655273123892386790285277039/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "129203954788765494999586276479736063069113714391284953846677448727537178196519/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "64601977394382747499793138239868031534556857195642476923338724363768589098421/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "916816039600116841012182806155030831948966222896961664289463715190538766949005/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1833632079200233682024365612310061663897932445793923328578927430381077533902445/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "1947794040343582965283760196475636236298022965186548330867105217333632866994687/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "973897020171791482641880098237818118149011482593274165433552608666816433499685/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "1373147933396416732827846293741205369056624579240259212834894776812134037341343/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1373147933396416732827846293741205369056624579240259212834894776812134037344669/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "178768109890900337033939692334264125951415115115057813737622154787235948241381/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "power_upper": "1430144879127202696271517538674113007611320920920462509900977238297887585934471/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657804799006168258089651298501138505056346746849354093730987871633532190725017/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3657804799006168258089651298501138505056346746849354093730987871633532190733811/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "1885839359859890181066215855168613930353778030905847789987725257008943766610107/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "3771678719719780362132431710337227860707556061811695579975450514017887533229261/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "2284227975179933367271583162955361493763264132521039773360125149176137155842615/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "2284227975179933367271583162955361493763264132521039773360125149176137155848097/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682236529814037797523918276525149696766029566657084859854515367638085294691533/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2341118264907018898761959138262574848383014783328542429927257683819042647351385/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "684803014396642886919895502963815339393140135634480284074499192818567468507203/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "1369606028793285773839791005927630678786280271268960568148998385637134937017693/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "699016036694872527414316360327791914440866937884315596112678701323247819024069/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "5592128293558980219314530882622335315526935503074524768901429610585982552205959/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387824700595482692270141384092060702126320671841948691893505111846776277713293/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "199619521893608834133441918252876896941447520995060896621672034745211758679019/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "3250732105139203858330860044595053820324801093292134557281267513346362368402037/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1625366052569601929165430022297526910162400546646067278640633756673181184204893/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "926290390952356873466850842559940581017733978762379887111154527860347010548083/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "1852580781904713746933701685119881162035467957524759774222309055720694021100551/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "114602570087340428049316580288912821574157007285764988661944012406142662811179/904625697166532776746648320380374280103671755200316906558262375061821325312", + "power_upper": "7334564485589787395156261138490420580746048466288959274364416793993130419932931/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 129, + "signed_count": -208 + } + ] + }, + "0.0037261023900": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "99627389761/100000000000", + "new_minus_old": { + "lower": "-104098604081606643648985576425348389230108952602966405612400639878377/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "-13012325510200830456123197053168548653763619075370800701550079125317/904625697166532776746648320380374280103671755200316906558262375061821325312" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "230986829093823332816371537346795179019674289620937868361355541761536204569549/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "57746707273455833204092884336698794754918572405234467090338885440384051142547/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 2, + "signed_count": 13776 + }, + { + "power_lower": "86489293738333920327454547856144052719349154921239536449474039263888912475097/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "172978587476667840654909095712288105438698309842479072898948078527777824950641/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 3, + "signed_count": 8928 + }, + { + "power_lower": "230391020518975645983462069564489064868032826339798825163916919580330241159951/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "460782041037951291966924139128978129736065652679597650327833839160660482321039/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 4, + "signed_count": 288 + }, + { + "power_lower": "143874712626183259970175487385091703645310499237235063554742137899155385251457/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "287749425252366519940350974770183407290620998474470127109484275798310770503605/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "690129622594071610376059208618734845369718925751407828620368761034754309201621/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "690129622594071610376059208618734845369718925751407828620368761034754309203263/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "804688895408685362369354537659067151381698687371977477901817877469113123186417/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "402344447704342681184677268829533575690849343685988738950908938734556561594169/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "919186995102907106368528879604129137964829225470076596809272453798449265420999/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "229796748775726776592132219901032284491207306367519149202318113449612316355795/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "1033631638309896847912729506178272474385513734197826431337846821000713953277549/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1033631638309896847912729506178272474385513734197826431337846821000713953279957/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "1833632079199725291262012917862393836103540718293504490869449477403336253928049/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "57301002474991415351937903683199807378235647446672015339670296168854257935381/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "1947794040343031113677102813556493576503270624213378374616169186872935075440689/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1947794040343031113677102813556493576503270624213378374616169186872935075445057/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "2746295866791960678045819756587792638517566204803607657772086904067829226796117/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "343286983348995084755727469573474079814695775600450957221510863008478653350291/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860289758253484700787538903960787520239220384898372303671074474363273401598557/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2860289758253484700787538903960787520239220384898372303671074474363273401604943/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657804799004900559547916636691222156193238872364117246425636547320551394409929/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "914451199751225139886979159172805539048309718091029311606409136830137848604537/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771678719718461591816139698350277086633076664642443910996399867540063699957579/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1885839359859230795908069849175138543316538332321221955498199933770031849983017/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "4568455950358181486213935929816223560095493653093505530274708600398988337325629/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "71382124224346585722092748903378493126492088329586023910542321881234192770873/1809251394333065553493296640760748560207343510400633813116524750123642650624", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "2341118264906149507622618303556554800862512842820807523039514029083634581444433/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1170559132453074753811309151778277400431256421410403761519757014541817290724841/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "684803014396377785907735048783838639798811963247004420467292639211418693065141/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "2739212057585511143630940195135354559195247852988017681869170556845674772266707/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "1398032073389200965868570037028539551634639709553916792274887664200389853447987/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "2796064146778401931737140074057079103269279419107833584549775328400779706902239/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387824700592911368174275724146934802763029033439518240508970861545018662808389/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3193912350296455684087137862073467401381514516719759120254485430772509331411353/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "6501464210275779141349905913695082087168775405577365316197699458535556511140539/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3250732105137889570674952956847541043584387702788682658098849729267778255577507/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "1852580781903940407970458212257192530416985695662763274808597009018428187541967/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "7410323127615761631881832849028770121667942782651053099234388036073712750184251/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "3667282242793111467204748010536081946446434697209699652285366101211538954940397/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "14669128971172445868818992042144327785785738788838798609141464404846155819794259/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + }, + "0.0037261023901": { + "bits": 256, + "classification": "new_cost_higher", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "9962738976099/10000000000000", + "new_minus_old": { + "lower": "75934587959693714600085985882696852745260696110927285096892672455669/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "151869175919387429200171971765393705490521392221854570193785351198543/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "57746707273451830507359562835670489631591232045712449150959465363427807948157/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "28873353636725915253679781417835244815795616022856224575479732681713903974151/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 2, + "signed_count": 13776 + }, + { + "power_lower": "345957174953297674029442529737592488638527374582603686924872365298975930484681/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "86489293738324418507360632434398122159631843645650921731218091324743982621375/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 3, + "signed_count": 8928 + }, + { + "power_lower": "115195510259471853503101130241487777838999091131263761508961453346325043561997/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "460782041037887414012404520965951111355996364525055046035845813385300174249031/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 4, + "signed_count": 288 + }, + { + "power_lower": "575498850504640416913845500798271593558043860907051397627474304543288617545869/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4496084769567503257139417974986496824672217663336339043964643004244442324587/904625697166532776746648320380374280103671755200316906558262375061821325312", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "690129622593947955747431448530422754410257581680904943001729523381574900838987/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "86266202824243494468428931066302844301282197710113117875216190422696862605061/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "804688895408528777140513765858929561094796926593300244250709441300016589469297/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "804688895408528777140513765858929561094796926593300244250709441300016589471049/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "919186995102715966806310014982216485091725434900039492702073819795795479910005/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "919186995102715966806310014982216485091725434900039492702073819795795479911997/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "258407909577417433957192212605070428265895431469431015588994632519531513147053/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "516815819154834867914384425210140856531790862938862031177989265039063026295209/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "1833632079199216900499660364370575427286146174093216806569739751867541378893183/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1833632079199216900499660364370575427286146174093216806569739751867541378896963/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "1947794040342479262070445586988684508742315132839792690041063889686287339487491/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "486948510085619815517611396747171127185578783209948172510265972421571834872869/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "2746295866791087890435947203069775202535673694792607860728236174368487510666679/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "171643491674442993152246700191860950158479605924537991295514760898030469417023/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "44692027472696312641125672295821756522153016751466414220500277944144834984435/1809251394333065553493296640760748560207343510400633813116524750123642650624", + "power_upper": "2860289758252564009032043026932592417417793072093850510112017788425269439009683/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "914451199750908215251545603558035202230373574510144008717911444545465815131653/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "3657804799003632861006182414232140808921494298040576034871645778181863260534133/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "471459839964642852687481018434045573466769012363762949790958519265165419697623/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "471459839964642852687481018434045573466769012363762949790958519265165419698589/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "2284227975178248118942353077694758905167235546866396880431634588306822064104137/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "571056993794562029735588269423689726291808886716599220107908647076705516027205/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682236529810560232966555583410399525835403688015077021966577040177621962019293/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4682236529810560232966555583410399525835403688015077021966577040177621962028897/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "2739212057584450739582298788919170268040601166452061427641314900502524779160651/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "5478424115168901479164597577838340536081202332904122855282629801005049558332535/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "2796064146777313753817015130302282298663523807281523214160026953678985516523693/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1398032073388656876908507565151141149331761903640761607080013476839492758264711/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6238110059170253949295323339111512280544664838262882966443550046394094286441/113078212145816597093331040047546785012958969400039613319782796882727665664", + "power_upper": "6387824700590340044078411099250188575277736794381192157638195247507552549328673/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "6501464210273150566038092800946531236363134518020739344046460294057271208032787/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3250732105136575283019046400473265618181567259010369672023230147028635604023007/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "3705161563806334138014430124432272493030876606378344825967157622070290254410271/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "3705161563806334138014430124432272493030876606378344825967157622070290254417753/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "1833641121395664618415683158978740600889355793770148202684301967250812021118951/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "7334564485582658473662732635914962403557423175080592810737207869003248084490739/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 129, + "signed_count": -208 + } + ] + }, + "372610238997/100000000000000": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "99627389761003/100000000000000", + "new_minus_old": { + "lower": "-180888938081925300859508332655215063026150635756166970326543548480741/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "-90444469040962650429754166327607531513075317878083485163271770961529/3618502788666131106986593281521497120414687020801267626233049500247285301248" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "230986829093828136052451523364436865684058633210827872764215948096999240674341/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "230986829093828136052451523364436865684058633210827872764215948096999240674949/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 2, + "signed_count": 13776 + }, + { + "power_lower": "172978587476673541746965445372449500250213747231603226441085819243729440286137/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "172978587476673541746965445372449500250213747231603226441085819243729440286563/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 3, + "signed_count": 8928 + }, + { + "power_lower": "230391020518985227676640013152341187091665172587000754058592972471304853965797/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "230391020518985227676640013152341187091665172587000754058592972471304853966341/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 4, + "signed_count": 288 + }, + { + "power_lower": "287749425252380413385379443534939106047896483442221263369115488756587715249319/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "575498850504760826770758887069878212095792966884442526738230977513175430499965/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "690129622594108706764647540965635831932283342177037297587878689310119571027085/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "345064811297054353382323770482817915966141671088518648793939344655059785514327/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "201172223852183084484501693785193438834876545962804252400299620766574218407999/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "402344447704366168969003387570386877669753091925608504800599241533148436816911/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "114898374387870556029649318342655259948385395743543274649658815236966018897247/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "114898374387870556029649318342655259948385395743543274649658815236966018897507/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "1033631638309964981537917712636486630206459926250687277072918165657368516414201/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "516815819154982490768958856318243315103229963125343638536459082828684258208249/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "916816039599938904245359355698164997723747667487123582440570779751108881792117/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1833632079199877808490718711396329995447495334974247164881141559502217763588189/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "1947794040343196669159100012015346347276132113382015565593747704948535732943215/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "486948510085799167289775003003836586819033028345503891398436926237133933236845/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "686573966698055628582195394182908749678203047119126309909278361031657209757605/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "2746295866792222514328781576731634998712812188476505239637113444126628839036347/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860289758253760908314187724859298512552896993448302527889278896711565297343147/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2860289758253760908314187724859298512552896993448302527889278896711565297349239/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "1828902399502640434555218494551179692839074960831007666673557612779693042376061/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1828902399502640434555218494551179692839074960831007666673557612779693042379977/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771678719718857222911027253529913299954651392354940446600419874178611182311091/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3771678719718857222911027253529913299954651392354940446600419874178611182319151/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "4568455950358687060712704983369455052159018449297564272248520009212473578287641/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "71382124224354485323636015365147735189984663270274441753883125143944899660897/1809251394333065553493296640760748560207343510400633813116524750123642650624", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682236529812820649928841040137241978215521361193596742010010808180671440423955/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1170559132453205162482210260034310494553880340298399185502502702045167860108491/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "2739212057585829264845532697048435735442831131500265124354114299816712277824601/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "5478424115171658529691065394096871470885662263000530248708228599633424555660911/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "5592128293557456770226355279531760071743502499773873161759528931996507700319441/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2796064146778728385113177639765880035871751249886936580879764465998253850165695/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387824700593682765403035313450392707005869314488888682889813867006738718434611/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "6387824700593682765403035313450392707005869314488888682889813867006738718448263/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "3250732105138283856971725027377604954706289380487179975251525595412205469080205/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "6501464210276567713943450054755209909412578760974359950503051190824410938174205/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "463145195476043102414857805054931930846530178125904225603804117199464168812073/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "power_upper": "7410323127616689638637724880878910893544482850014467609660865875191426701008777/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "1833641121396823068158381343602557525841539289084986421015586245209811285545735/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "14669128971174584545267050748820460206732314312679891368124689961678490284397027/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + } + } + }, + "peer": { + "bracket": [ + "0.00372604555571", + "0.00372604555572" + ], + "compiler": { + "BIT_margin": "4064444433/100000000000000", + "BIT_pin": "376669/100000000", + "H": "14558800000000000000", + "alpha": [ + 0.9999999999999382, + 0.9999999999999382 + ], + "claim": "9315113889/2500000000000", + "compiler_gap": "1/100000000000000", + "delta": [ + 0.9322377190117992, + 0.9322377190117992 + ], + "derivative_upper": -348613.3290464958, + "gamma": [ + 0.9334323771155476, + 0.9334323771155476 + ], + "input_lift": { + "derivative_upper_on_required_interval": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + "interval_kappa_cap": "376669/100000000", + "margins": { + "372604555567/100000000000000": [ + "25400854236839944168811969910073971827943612210810061720852213229284472466403/20000000000000000000000000000000000000000000000000000000000000000000000000000000", + "63502135592099860422029924775184929569859030527025154302130533073211181166981/50000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "9315113889/2500000000000": [ + "12700427118191787467959187764741998320358523764062379104098810847051285503909/10000000000000000000000000000000000000000000000000000000000000000000000000000000", + "127004271181917874679591877647419983203585237640623791040988108470512855041029/100000000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "source_BIT_wide_crude_bound_would_be": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000" + }, + "minimum_log_power": 2286, + "moment_margin_float": { + "372604555567/100000000000000": [ + 1.668806885163636e-08, + 1.668806885163636e-08 + ], + "372604555571/100000000000000": [ + 2.5401337142140085e-09, + 2.5401337142140085e-09 + ], + "93151138893/25000000000000": [ + -9.968500701412173e-10, + -9.968500701412173e-10 + ] + }, + "moment_margins": { + "372604555567/100000000000000": [ + "52150215161363623842261144221150972839456016083329301170749375087135109/3125000000000000000000000000000000000000000000000000000000000000000000000000000", + "52150215161363623842261144221150972839456016083329301170749375088240387/3125000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "372604555571/100000000000000": [ + "15875835713837552291826628962232052841124379848542910598102864403499321/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "15875835713837552291826628962232052841124379848542910598102864405740439/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "93151138893/25000000000000": [ + "-3115156469191304458068498827493552879195403033025021963016738010322167/3125000000000000000000000000000000000000000000000000000000000000000000000000000", + "-6230312938382608916136997654987105758390806066050043926033476018413129/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "outer": { + "BIT_just_below_effective_rejected": true, + "functional_count": 4, + "minimum_margin": "1/1000000000000000", + "strict_count": 54 + }, + "raw_bracket": [ + "372604555571/100000000000000", + "93151138893/25000000000000" + ], + "tested": "372604555567/100000000000000", + "written_log_power": 2287 + }, + "decimal_claim": "0.0037260455556", + "directed_checks": { + "0.0037260455556": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "2490684886111/2500000000000", + "new_minus_old": { + "lower": "-149975923487221802665958718531258228814033709673447697709475154677989/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-299951846974443605331917437062516457628067419346895395418950301937773/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "230986838193458200866443077844950073536503965491195354151493005462909788778613/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "230986838193458200866443077844950073536503965491195354151493005462909788779299/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 2, + "signed_count": 13760 + }, + { + "power_lower": "345957196554546113514731436580236023267175508538533614009089446038527336804095/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "345957196554546113514731436580236023267175508538533614009089446038527336805061/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 3, + "signed_count": 8960 + }, + { + "power_lower": "230391038671302452837371917617990688356767909039889399604030097412211352391067/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "230391038671302452837371917617990688356767909039889399604030097412211352391679/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 4, + "signed_count": 272 + }, + { + "power_lower": "17984340723326341329776829823604077542962153661155676508422545119626070257399/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "power_upper": "575498903146442922552858554355330481374788917156981648269521443828034248238263/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "345064846436220720773387441934113250272670009517130555910197534397215024724805/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "345064846436220720773387441934113250272670009517130555910197534397215024725691/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "804688984402965583802534144253733142564865097432433746346419149548244001587577/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "201172246100741395950633536063433285641216274358108436586604787387061000397411/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "919187103735936875430894883142765853971109097055392502116104512004643343591941/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "919187103735936875430894883142765853971109097055392502116104512004643343594287/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "1033631767387695153946488066173477352550315527566382630800753849170227950170371/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "516815883693847576973244033086738676275157763783191315400376924585113975086487/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "1833632368140587495222893036590464683383466588097066203948647075294497525666221/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1833632368140587495222893036590464683383466588097066203948647075294497525670687/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "973897176992302949811520247086634950224790279072521710689119425321771174880631/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1947794353984605899623040494173269900449580558145043421378238850643542349765985/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "1373148181417803410960841545884282123895295314797659486845683066895739251323449/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "2746296362835606821921683091768564247790590629595318973691366133791478502653607/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860290281523167650649438766947025280072319229198248626667763803775018199702597/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2860290281523167650649438766947025280072319229198248626667763803775018199709495/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657805519493831521505885731739232701956920281939308543187620019064504745304471/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3657805519493831521505885731739232701956920281939308543187620019064504745313335/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771679469233732706902781592691054529896632947445471660327426030614719630130155/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1885839734616866353451390796345527264948316473722735830163713015307359815069637/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "4568456908159058318145360137272460177459322995016245691042507021550198277096053/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4568456908159058318145360137272460177459322995016245691042507021550198277107095/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682237518038878696991888083899501558976795362356143768034187442949541078918111/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4682237518038878696991888083899501558976795362356143768034187442949541078929433/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "1369606330129928032106873924368902533911474053129375618750146276549669214239679/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "1369606330129928032106873924368902533911474053129375618750146276549669214242989/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "2796064765237862165644745058398134055631843199943813007345193041833010547704129/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "2796064765237862165644745058398134055631843199943813007345193041833010547710877/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "3193913080994850238295582164941345536943295351369154270797538123444561199116321/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "3193913080994850238295582164941345536943295351369154270797538123444561199124033/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "6501465704210957800251174518503151181590538775864278584458347297868040850993869/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "6501465704210957800251174518503151181590538775864278584458347297868040851009483/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "1852581221426552271630207622180951860420063148621114552997692306686895613159383/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "7410324885706209086520830488723807441680252594484458211990769226747582452655205/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "14669133022852762732969341588405869542142996849484777472316654991835742841667301/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "14669133022852762732969341588405869542142996849484777472316654991835742841702511/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + }, + "0.00372604555571": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "99627395444429/100000000000000", + "new_minus_old": { + "lower": "-35904222376829088228416467236735442153112745723993098955519433949/14134776518227074636666380005943348126619871175004951664972849610340958208", + "upper": "-18382961856936493172949231225208546382393725810684466665225943092327/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "230986838193440589000122650813643105986209242029878461160529235468247143717703/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "115493419096720294500061325406821552993104621014939230580264617734123571859179/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 2, + "signed_count": 13760 + }, + { + "power_lower": "172978598277252152751853879939403088021111220107467604705162293078849536053947/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "21622324784656519093981734992425386002638902513433450588145286634856192006801/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "rank": 3, + "signed_count": 8960 + }, + { + "power_lower": "460782077342534639919236072719116802320805318434062090987452384321684239855935/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "460782077342534639919236072719116802320805318434062090987452384321684239857105/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 4, + "signed_count": 272 + }, + { + "power_lower": "575498903146341037279996869556258355590438346478497864919520313507836632718923/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "575498903146341037279996869556258355590438346478497864919520313507836632720355/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "172532423218076355360358234045175186683737615723380884308256838147365278024697/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "172532423218076355360358234045175186683737615723380884308256838147365278025119/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "804688984402793340031760060909454625435943536624817006918023993569874587751509/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "804688984402793340031760060909454625435943536624817006918023993569874587753481/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "229796775933931655471901392601419479772544059928302481350354590937542662134365/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "459593551867863310943802785202838959545088119856604962700709181875085324269847/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "258407941846861332655733481848342386769071897689426810221072496217241477997289/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "129203970923430666327866740924171193384535948844713405110536248108620738998955/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "229204046017503533162022834518568265502560117503787599619113733989489662769013/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "916816184070014132648091338074273062010240470015150398476454935957958651078189/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "243474294247999857844746258638155032622231845962086326197349432243909924880209/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "1947794353983998862757970069105240260977854767696690609578795457951279399046185/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "2746296362834646755377413423093284795973242144908682644294753849165868353094751/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2746296362834646755377413423093284795973242144908682644294753849165868353101161/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860290281522154889533115903959088408226759243360016754983493270671246427236519/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2860290281522154889533115903959088408226759243360016754983493270671246427243117/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "914451379873109263208826358020519965971999747629551067745762809887783577604769/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "1828902759746218526417652716041039931943999495259102135491525619775567155213777/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771679469232282059266585472668668389367977710463879414599718106038814251596563/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3771679469232282059266585472668668389367977710463879414599718106038814251605279/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "2284228454078602272297277051135176318814728541764109869216481051311467127618791/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1142114227039301136148638525567588159407364270882054934608240525655733563812037/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "2341118759018483018040827712466860011252856277527639685051280409280004285604729/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "4682237518036966036081655424933720022505712555055279370102560818560008571220289/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "5478425320517379239007208471628465012370762854987021783918573513344231945285799/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "171200791266168101218975264738389531636586339218344430747455422292007248290577/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "2796064765236665169667845004661720302233669032313512768878838403855759215340819/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "2796064765236665169667845004661720302233669032313512768878838403855759215347279/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387826161986872019438623335478101100706555875401909674490194140356496708058077/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "49904891890522437651864244808422664849269967776577419331954641721535130531819/904625697166532776746648320380374280103671755200316906558262375061821325312", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "3250732852104033183371886967967801720406488486685546145343397731897724933688885/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1625366426052016591685943483983900860203244243342773072671698865948862466848175/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "7410324885702806394275276157414329605607624722860054516247452063446023583021551/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3705162442851403197137638078707164802803812361430027258123726031723011791519225/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "7334566511422460458580258821372417093788536106080419218131773612467927684708829/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "14669133022844920917160517642744834187577072212160838436263547224935855369451329/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + }, + "0.00372604555572": { + "bits": 256, + "classification": "new_cost_higher", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "24906848861107/25000000000000", + "new_minus_old": { + "lower": "3607104758688023652523693795164294881085488895839601403897038418149/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "7214209517376047305047387590328589762170977791679202807794084359101/7237005577332262213973186563042994240829374041602535252466099000494570602496" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "7218338693544968372542695263213704907278850123963006842833878258473106261127/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "power_upper": "115493419096719493960683124211419278516461601983408109485342052135569700178379/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 2, + "signed_count": 13760 + }, + { + "power_lower": "172978598277250252387716440214603898625564063829340528322269357036456071580325/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "345957196554500504775432880429207797251128127658681056644538714072912143161629/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 3, + "signed_count": 8960 + }, + { + "power_lower": "460782077342528252123280822112541953595486989119412855327855070104498857739925/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "28798879833908015757705051382033872099717936819963303457990941881531178608823/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "rank": 4, + "signed_count": 272 + }, + { + "power_lower": "575498903146331774982463990014404639767949920962610286100693837620846447698807/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "575498903146331774982463990014404639767949920962610286100693837620846447700317/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "172532423218073263994327735566434117395078111099471099446534063019146931474911/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "172532423218073263994327735566434117395078111099471099446534063019146931475361/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "402344492201388840753572118489544384650743352217884094139616132722568989078449/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "804688984402777681507144236979088769301486704435768188279232265445137978158997/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "229796775933926876982281181544499234254100451315605667928590296463608114465653/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "459593551867853753964562363088998468508200902631211335857180592927216228932489/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "1033631767387422619411701735952912182060172483558620767935082141402340636621293/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "16150496365428478428307839624264252844690195055603449498985658459411572447249/1809251394333065553493296640760748560207343510400633813116524750123642650624", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "1833632368139977426211936288202087643729472910765017923165842761897556960130403/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "1833632368139977426211936288202087643729472910765017923165842761897556960134935/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "973897176991971838794209110830977728107872919249933673458935944379315505220427/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1947794353983943677588418221661955456215745838499867346917871888758631010445641/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "2746296362834559476600661651674494800743988318182969665864956916819742013219409/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2746296362834559476600661651674494800743988318182969665864956916819742013226203/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860290281522062820340722934196288367320624992033936347393215757366201565060787/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "715072570380515705085180733549072091830156248008484086848303939341550391266947/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657805519492310282956161794837939443840932000152358123724418813122253966957345/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3657805519492310282956161794837939443840932000152358123724418813122253966966335/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771679469232150182208749489424090171044418852446409858478375070596067245023999/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3771679469232150182208749489424090171044418852446409858478375070596067245033249/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "4568456908157036019726299045479327392995868564408529694843461940590319429570709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "571057113519629502465787380684915924124483570551066211855432742573789928697739/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "4682237518036792157817088858315762406371976325300570534606538985811774389652709/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "4682237518036792157817088858315762406371976325300570534606538985811774389664197/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "10700049454135092105763317916180930920080211031471555596277978036865896948617/226156424291633194186662080095093570025917938800079226639565593765455331328", + "power_upper": "2739212660258583579075409386542318315540534024056718232647162377437669618852667/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "5592129530473112703703526414009473445551252277321917733109489784306790537686639/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "5592129530473112703703526414009473445551252277321917733109489784306790537700343/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "6387826161986614886970210579907873545791051224557544216116948626680334203870297/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "6387826161986614886970210579907873545791051224557544216116948626680334203885947/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "3250732852103901754576096064278951117518966881295066198415115514568436173400311/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "6501465704207803509152192128557902235037933762590132396830231029136872346816459/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "7410324885702497058616589477499769038037287034782615258209994752107499861568783/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3705162442851248529308294738749884519018643517391307629104997376053749930793357/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "3667283255711052006203565282070849207615120331559118114852836427788919995959347/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "14669133022844208024814261128283396830460481326236472459411345711155679983873099/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + }, + "372604555567/100000000000000": { + "bits": 256, + "classification": "new_cost_lower", + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "exponent": "99627395444433/100000000000000", + "new_minus_old": { + "lower": "-60385823677098567459210685988678444302588290538654637231066475166033/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-60385823677098567459210685988678444302588290538654637231066471487679/3618502788666131106986593281521497120414687020801267626233049500247285301248" + }, + "quantity": "(new paid - new targets) - (old paid - old targets)", + "schema": "integer-mult-recursive-power-comparison/v1", + "scope": "Exact arithmetic on declared invoices at this exponent only. No circuit, ownership, compiler, applicability or kappa claim is verified. Unresolved is not equality.", + "terms": [ + { + "power_lower": "1", + "power_upper": "1", + "rank": 1, + "signed_count": 63120 + }, + { + "power_lower": "230986838193446993315148260487839624384828615255411688402175543335669660489749/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "230986838193446993315148260487839624384828615255411688402175543335669660490429/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 2, + "signed_count": 13760 + }, + { + "power_lower": "86489299138629877104201819523688092518424353898441007812847917053262087115429/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "172978598277259754208403639047376185036848707796882015625695834106524174231337/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 3, + "signed_count": 8960 + }, + { + "power_lower": "115195519335640047775764269007738187124233288642033130944880429935741391670193/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "460782077342560191103057076030952748496933154568132523779521719742965566681991/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 4, + "signed_count": 272 + }, + { + "power_lower": "575498903146378086470128389214382499446544838327306677175911795026259044662951/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "575498903146378086470128389214382499446544838327306677175911795026259044664433/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 5, + "signed_count": 4544 + }, + { + "power_lower": "86266211609044360412240114257018949818974938355419651353710323753578454829439/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "172532423218088720824480228514037899637949876710839302707420647507156909659315/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "rank": 6, + "signed_count": 688 + }, + { + "power_lower": "804688984402855974130223359677926246890283487999979852051173318708097823108809/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "804688984402855974130223359677926246890283487999979852051173318708097823110861/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 7, + "signed_count": -128 + }, + { + "power_lower": "459593551867901538860764475645518888243253751245426641607420378895658720112697/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "919187103735803077721528951291037776486507502490853283214840757791317440227715/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 8, + "signed_count": 240 + }, + { + "power_lower": "516815883693768087733931349072681078592728041838732774489240734320738960073529/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "1033631767387536175467862698145362157185456083677465548978481468641477920149635/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 9, + "signed_count": -10160 + }, + { + "power_lower": "916816184070115810816584121014983604119217044544534493289289190331215720204797/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "916816184070115810816584121014983604119217044544534493289289190331215720207011/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 16, + "signed_count": 416 + }, + { + "power_lower": "243474294248027450429522184314189419607106494788538330645534187565401235969475/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "243474294248027450429522184314189419607106494788538330645534187565401235970061/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 17, + "signed_count": -416 + }, + { + "power_lower": "1373148181417497935242210268253054926648309105801349196423952830801610024265103/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "2746296362834995870484420536506109853296618211602698392847905661603220048536857/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 24, + "signed_count": 416 + }, + { + "power_lower": "2860290281522523166302687812646218332739689049734293626336302492704966007096315/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "2860290281522523166302687812646218332739689049734293626336302492704966007103159/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 25, + "signed_count": -416 + }, + { + "power_lower": "3657805519492944132351880024993733698247135923762040350703729498795701192762625/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "457225689936618016543985003124216712280891990470255043837966187349462649096427/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 32, + "signed_count": 416 + }, + { + "power_lower": "3771679469232809567497929451757894253411406902651171309040031221412487823344481/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "3771679469232809567497929451757894253411406902651171309040031221412487823353533/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 33, + "signed_count": -416 + }, + { + "power_lower": "571057113519734830508446798950155752187617986430341116781884881206296902087557/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "4568456908157878644067574391601246017500943891442728934255079049650375216711417/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 40, + "signed_count": 416 + }, + { + "power_lower": "1170559379509415387284980438994124279296643792570998512898627037039233086390271/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "4682237518037661549139921755976497117186575170283994051594508148156932345572327/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 41, + "signed_count": -416 + }, + { + "power_lower": "1369606330129556890608191836976135275633883432909931356312113701123532932832801/28948022309329048855892746252171976963317496166410141009864396001978282409984", + "power_upper": "5478425320518227562432767347904541102535533731639725425248454804494131731344345/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 48, + "signed_count": 416 + }, + { + "power_lower": "174754047827318777558260764852474572649326404518755950544852988429521320219937/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "power_upper": "5592129530474200881864344475279186324778444944600190417435295629744682247051391/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 49, + "signed_count": -416 + }, + { + "power_lower": "798478270248487568664034307657984120899202881318911054247170562080210319214391/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "798478270248487568664034307657984120899202881318911054247170562080210319216305/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "rank": 56, + "signed_count": 416 + }, + { + "power_lower": "6501465704209117797110101271721080154395864467415551738847321609309141377290671/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "power_upper": "6501465704209117797110101271721080154395864467415551738847321609309141377306171/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 57, + "signed_count": -416 + }, + { + "power_lower": "3705162442852021868455011503100627725271450025486961148918797247544271213175563/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "power_upper": "3705162442852021868455011503100627725271450025486961148918797247544271213184335/57896044618658097711785492504343953926634992332820282019728792003956564819968", + "rank": 65, + "signed_count": -416 + }, + { + "power_lower": "1833641627855971560818193005880361293407401744797041237817335066783124671481679/14474011154664524427946373126085988481658748083205070504932198000989141204992", + "power_upper": "14669133022847772486545544047042890347259213958376329902538680534264997371888387/115792089237316195423570985008687907853269984665640564039457584007913129639936", + "rank": 129, + "signed_count": -208 + } + ] + } + } + } +} diff --git a/research/p104-role230-banked/evidence/PROVIDER-RESULT.json b/research/p104-role230-banked/evidence/PROVIDER-RESULT.json new file mode 100644 index 0000000000..f1c6f54c70 --- /dev/null +++ b/research/p104-role230-banked/evidence/PROVIDER-RESULT.json @@ -0,0 +1,201 @@ +{ + "actual_signed_grid_and_compiler": { + "candidate": { + "H": 14558800000000000000, + "native_height": 18, + "native_odd": 2025, + "scaled_mass": "55817215425/32" + }, + "peer": { + "H": 14558800000000000000, + "native_height": 18, + "native_odd": 2025, + "scaled_mass": "55817215425/32" + } + }, + "caller_decode": "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf", + "common_exact_root": { + "W": "p+h+2D+3", + "actual_candidate_H_bound": true, + "bounded_depth_guard_bits": 14080, + "caller_height": 9, + "caller_odd": 2025, + "compared_H_values": [ + 14558800000000000000, + 14558800000000000000 + ], + "context_c": 128, + "context_mass_bits": 64, + "grid": "2^-(p+D)", + "native_height": 18, + "native_odd": 2025, + "safe_context_absolute_scaled_mass": "17782499795678641337625/1024", + "safe_native_absolute_scaled_mass": "35871038739015/512", + "temporary": "W+26" + }, + "graphs": { + "candidate": "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150", + "peer": "d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098" + }, + "head": "28b2af322a1fab01b3734365988930920f9dda48", + "native": { + "candidate": { + "actual_form_accumulators": 7643, + "entrance_snapshots": 1501, + "home_slots_with_dummy": 15291, + "literal_bits_num_den": [ + 13, + 9 + ], + "paid_children_and_saved_returns": 6142, + "paid_native_directions": { + "ascending": 6119, + "descending": 23 + }, + "paid_native_ranks": { + "1": 3939, + "2": 882, + "3": 605, + "4": 245, + "5": 362, + "6": 87, + "7": 11, + "8": 7, + "9": 4 + }, + "path_grid": 530841600, + "path_grid_height": 18, + "path_grid_odd": 2025, + "positive_path_mass_bound_unscaled": "2391402582601/69120", + "positive_path_mass_peak_node": 151894, + "private_get_terms": 169349, + "private_homes": 15290, + "scheduled_provider_digest": "1e8e1c44403b9c23242b42dffaed0e99199f66f847e0d79ca572480b4e5d6c0e", + "terminal_installs": 1501 + }, + "peer": { + "actual_form_accumulators": 7643, + "entrance_snapshots": 1501, + "home_slots_with_dummy": 15291, + "literal_bits_num_den": [ + 13, + 9 + ], + "paid_children_and_saved_returns": 6142, + "paid_native_directions": { + "ascending": 6119, + "descending": 23 + }, + "paid_native_ranks": { + "1": 3939, + "2": 881, + "3": 607, + "4": 244, + "5": 362, + "6": 87, + "7": 11, + "8": 7, + "9": 4 + }, + "path_grid": 530841600, + "path_grid_height": 18, + "path_grid_odd": 2025, + "positive_path_mass_bound_unscaled": "2391402582601/69120", + "positive_path_mass_peak_node": 151894, + "private_get_terms": 169343, + "private_homes": 15290, + "scheduled_provider_digest": "acd046f2770d2c3398f2a9b9161bd22693fd9f0bfb02b3885db5cd8435cdf8fe", + "terminal_installs": 1501 + } + }, + "normalized_physical_bounds": { + "candidate": { + "actual_data_homes_per_native": 15290, + "actual_data_homes_raw": 244640, + "actual_odd_scale_and_unscale_conversions": 55104, + "added_separate_stream_cells_per_native": "4(L'+2)", + "addressed_slots_per_native": 15291, + "addressed_slots_raw": 244656, + "baseline_counting_units": "matched guarded finite exact implementation", + "booked_additional_ordinary_work": "guide production/retirement, disjoint staging backing, explicit 34 raw local layout scans, bounded descriptor polynomials, per-stage guard and history spans, all numerical adapters and child view returns", + "complete_wrapper_reset_copy_instructions_per_native_L_and_constant": [ + 395941441360, + 1782238711120 + ], + "layout_shadow_cells_upper": "M+352", + "maximum_literal_or_odd_scale_bits": 13, + "maximum_rebased_selector_instructions_L_and_constant": [ + 214069, + 963637 + ], + "ordinary_elementary_record_upper": 26607454720, + "ordinary_map_slots": 280480, + "per_raw_scalar_services_upper": 117283328, + "positive_recursive_bank_get_copy_reset_charges": 0, + "primitive_reset_services_upper_per_native": 1452520, + "raw_construction_complete_entry_exit_retirement_steps_upper": "34*(256(M+352)+128) plus descriptor polynomial", + "raw_stage_volume_M": "sum_stage[(h+6)(L'+2)+ell(N_c)+ell(W')+max(ell(N_c),ell(W'),ell(h))+max(N_c,h)+max(W',ell(h))+10]", + "scalar_steps_per_padded_payload_cell_upper": 2097152, + "selector_and_stream_tracks_per_stage": 11, + "separate_guarded_streams_per_native": 4, + "separate_guarded_streams_raw": 64, + "separate_stream_functions": [ + "running row accumulator", + "staged read-only donor or field transfer", + "full product and arithmetic work", + "quotient and completed install payload" + ], + "typed_selected_transfers_upper_per_native": 396840, + "view_extent": "L'=N_c(2(W+26)+3)" + }, + "peer": { + "actual_data_homes_per_native": 15290, + "actual_data_homes_raw": 244640, + "actual_odd_scale_and_unscale_conversions": 55104, + "added_separate_stream_cells_per_native": "4(L'+2)", + "addressed_slots_per_native": 15291, + "addressed_slots_raw": 244656, + "baseline_counting_units": "matched guarded finite exact implementation", + "booked_additional_ordinary_work": "guide production/retirement, disjoint staging backing, explicit 34 raw local layout scans, bounded descriptor polynomials, per-stage guard and history spans, all numerical adapters and child view returns", + "complete_wrapper_reset_copy_instructions_per_native_L_and_constant": [ + 395928595684, + 1782180889060 + ], + "layout_shadow_cells_upper": "M+352", + "maximum_literal_or_odd_scale_bits": 13, + "maximum_rebased_selector_instructions_L_and_constant": [ + 214069, + 963637 + ], + "ordinary_elementary_record_upper": 26607454720, + "ordinary_map_slots": 280480, + "per_raw_scalar_services_upper": 117280256, + "positive_recursive_bank_get_copy_reset_charges": 0, + "primitive_reset_services_upper_per_native": 1452472, + "raw_construction_complete_entry_exit_retirement_steps_upper": "34*(256(M+352)+128) plus descriptor polynomial", + "raw_stage_volume_M": "sum_stage[(h+6)(L'+2)+ell(N_c)+ell(W')+max(ell(N_c),ell(W'),ell(h))+max(N_c,h)+max(W',ell(h))+10]", + "scalar_steps_per_padded_payload_cell_upper": 2097152, + "selector_and_stream_tracks_per_stage": 11, + "separate_guarded_streams_per_native": 4, + "separate_guarded_streams_raw": 64, + "separate_stream_functions": [ + "running row accumulator", + "staged read-only donor or field transfer", + "full product and arithmetic work", + "quotient and completed install payload" + ], + "typed_selected_transfers_upper_per_native": 396828, + "view_extent": "L'=N_c(2(W+26)+3)" + } + }, + "same_signed_delta": { + "paid": { + "2": 16, + "3": -32, + "4": 16 + }, + "targets": {} + }, + "scope": "Explicit full held-field, addressed ordinary proof and independent safe context audit; no complete fixed tape or arbitrary-input operator replay", + "status": "PASS_PAIRED_BANKED_PHYSICAL_COST_COMPONENT" +} diff --git a/research/p104-role230-banked/evidence/PROVIDER-SOURCE-REVIEW.md b/research/p104-role230-banked/evidence/PROVIDER-SOURCE-REVIEW.md new file mode 100644 index 0000000000..e3368757da --- /dev/null +++ b/research/p104-role230-banked/evidence/PROVIDER-SOURCE-REVIEW.md @@ -0,0 +1,49 @@ +# Banked 16-call provider and ordinary-cost review + +This review is scoped to the submitted fifteen-pivot comparator, #7674 head `28b2af322a1fab01b3734365988930920f9dda48`, and the one role-230 transfer allowed by the public claim. It inherits `ee251f60…b08d`, the actual `62d94fb9…8dcf` caller and frozen `PIVOTS.json` SHA-256 `fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85`. The source result is `00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38`. The stable final graph digests are a distinct binding. [Pinned proof](https://github.com/aliromman/integer-mult-bounds/blob/28b2af322a1fab01b3734365988930920f9dda48/research/p104-banked-transfer-pivots/PROOF.md) · [Public scope](https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19702865) + +## Source findings + +- `physical.py` counts ordinary phases for both paid/productive adapters, both native main boundaries, QUERY, LAMBDA and signed IDLE. Its budget contains neither a separate line nor a fusion witness for the 3,536 negative-root $q$ translations independently bound on the same literal caller. The matched bound below charges each correction explicitly. At the published 101,824 paid positions and 21,152 targets this gives 280,480 map slots, with 26,607,454,720 elementary records at the retained ambient cap 153. The native and complete paid ranks are unchanged by those monomial corrections. [Original cost formula](https://github.com/aliromman/integer-mult-bounds/blob/28b2af322a1fab01b3734365988930920f9dda48/research/p104-banked-transfer-pivots/physical.py) · [Exact caller binding](APPLICATION-RESULT.json) +- The published finite scalar/overwrite fixtures pass at isolated widths. The proof adds positive selection, alignment, return and guard costs parametrically via $O(K(L+1))$, with $K$ a fixed number of homes per occurrence. The received Python cost record counts reset services and slot/field macro totals. It emits no complete addressed GET/INSTALL machine, nor does the published scalar fixture prove that stale donor reads are impossible in the scheduled graphs. +- The topological schedule in `network.py` checks the chart of each donor snapshot and counts its dependency. Use only the final forward DAG at runtime. The eight transposed pivots are mathematical equivalences used in source generation. They require neither an executed backward caller nor a live copy of an entire second orientation. A preserved snapshot may have arbitrarily many later readers with no destruction until final retirement. Their individual ordinary reads all carry a charge. +- The folded graph uses archival INIT/CLEAR as zero and retirement row operations during construction. The runtime has freshly tagged snapshots, row accumulators and returns. The 235 chronological role-based CLEAR certificates, including the coefficient-one term involving public role 230, belong to the normalization proof. Runtime CLEAR writes its full owned extent directly. The previous 235-home addressed reset fixture supplies the ruler technique. This model uses 15,290 native owned homes and new complete copy, shape and select obligations. [Graph fold, transpose and schedule](https://github.com/aliromman/integer-mult-bounds/blob/28b2af322a1fab01b3734365988930920f9dda48/research/p104-banked-transfer-pivots/network.py) +- The original native checker verifies the least common multiple of the coefficient-denominator products on every DAG path, then verifies elementary term divisions in the serialized row order. The published matched parent native height is 18 after odd scale 2025, and the actual short caller is replayed at height 9 and odd scale 2025. The recorded context $c=118$ belongs to that construction. The merged graph needs its own exact/safe denominators and partial-sum mass, with both native sides rescaled to a common odd scale before selecting the common physical format and depth guard. The older 235-word scalar/selector constants cannot supply that result. [Native grid checker](https://github.com/aliromman/integer-mult-bounds/blob/28b2af322a1fab01b3734365988930920f9dda48/research/p104-banked-transfer-pivots/native.py) · [Actual short caller](https://github.com/aliromman/integer-mult-bounds/blob/28b2af322a1fab01b3734365988930920f9dda48/research/p104-banked-transfer-pivots/caller.py) + +## Common physical completion + +At a native stage grant exclusive field homes $I_r$ for each of $n=1501$ actual entrances, $A_v$ for every paid and terminal row, $R_v$ for each paid return, and four reserved scratch homes. With $k=6142$ physical MOVE nodes this is $2n+2k+4=15290$ homes. The outer compiler tags all homes by actual occurrence, stage, class and role or stable key. A fixed selector uses one charged dummy origin slot plus these 15,290 distinct data homes. An actual raw caller reserves 244,640 numeric homes and 16 dummy slots, as well as a guide and descriptor/control stock for each stage. Keep all ancestor and parked data backed and each actual child in a disjoint view. The dummy, moved/returned snapshots and scratch earn no productive credit. + +Use padded component width $W'=W+26$ for private tapes on both graphs. Use signed extension on staging and a checked view back to width $W$ at numerical or public boundaries. For $N_c$ complete addresses, including spectators, the stage payload is $L'=N_c(2W'+3)\le12N_c(2W+3)$ for $W\ge1$. Physical chart labels have the same complete ambient address order within that stage. The only coordinate changes are the paid MOVE and ordinary monomial adapters. + +The bank selector has one data head. Allocate four further guarded $L'+2$ streams on independently movable tapes. Use them for the running row accumulator, the preserved copy of one donor or field transfer, the full product, and the quotient/installation payload. The guide and its three work tapes serve only the selector. For a copy between two homes on the bank tape, the first visit copies the complete source into a distinct stream. Both heads return to their origins and the stream stays populated. The second visit copies the stream into the chosen target and again returns both heads. Each visit preserves the guide and unselected slots. While selecting a donor, the complete running row accumulator stays on its own guarded stream. Ancestor contexts park their four streams, in addition to the bank and guide data. There are four extra streams per stage and 64 per raw caller. The extra physical tapes, each with separately charged movements, add a fixed number of tracks to the selected multitape model. + +1. Scale each actual entrance, copy its full current array to an independent $I_r$, then retain all such snapshots through the computation. The caller and native scales are applied in place at actual boundaries and their reciprocals are charged at exact full returns. +2. For each scheduled row form, initialize its own zero accumulator. Read each $I_r$ or completed $R_v$ by an addressed coframe copy into scratch. Preserve the donor and all parked views. Form the exact scalar contribution and add in the fixed serialized order. The numerator/quotient scratch and staged arrays have sufficient full precision and both heads return before the next dependent read. An empty row still initializes the declared zero extent. +3. For each paid row execute exactly the already-declared relative chart MOVE with its two absolute-phase adapters. On return from the complete child, commit the returned field to $R_v$ by a whole coframe copy. Commit its completion flag only after field, heads and adapters return. Every dependency can now GET that same immutable saved value. Ordinary byte/layout copy requests no new Gaussian child. +4. Keep all terminal accumulators until the last row returns, then install them on their original independent actual public owners. This is a complete copy of the computed array at its final chart, with the fixed layout and full axis/spectator order. Exactly unscale the completed returns. Clear each full owned extent without reading any proof donor. + +Adapt #7670's fixed positive charged slot selector. It prepares a geometry-only guide, scans all guarded stride slots to the selected one, preserves every unselected payload, makes the full local service, then reverses the scan and clears its counters. The standalone exact RESET service including selection is + +$$ +S(k,L')=(14k+9)L'+24k-7\operatorname{popcount}(k)+27\ell(k)+39k+59. +$$ + +Slot $k$ is statically compiled for the actual form dependency or scheduled job. A selected GET, COPY, stage transfer or INSTALL can reuse the same charged round-trip ruler plus a separately charged typed complete copy/restore. The typed copy uses a finite symbol branch and a complete outward and no-write return scan, with a conservative $128(L'+2)+64$ step bound including local representation markers and heads. Both $S(k,L')$ terms are nondecreasing in $k$. For its fixed term, one increment increases popcount by at most one and does not decrease bit length, so the increment is at least 56. Thus the complete selector-plus-reset maximum is $214069L'+963637$ on slots 1 through 15,290. This bound uses the retained seven-tape microinstruction units, with branch and the two distinct head moves charged separately. Reserve the guide's full span and all binary/unary control histories, plus a layout-tape copy of each actual stage's extents before complete return. When a child view differs, use its own fixed selected representation and positively charged complete layout relabel. Parent and child recenter via the selected depth-first owner/view interface, with their whole backing parked and charged. [All-size addressed reset mechanism](https://github.com/aliromman/integer-mult-bounds/blob/677d23ef1610db9921547ab5d58eecc8c8d4c08b/research/current-shared-guide-banks/PROOF.md) + +Use the same schedule recipe on both banks, with $n,k,t$ for entrance count, MOVE count and nonzero form incidences. For resets use $2h+8(t+k+n)+4n$ calls of $S$ per native stage, where $h=2n+2k+4$. The first part covers initialization and retirement of all homes. The eight covers begin and end services for four independent scratch streams per term or row, with any stage guard writes accounted in setup. The final part covers public entry and installation. For numeric address transfers count at most $2t+2(k+n)+6k+4n$ complete selected access or copy actions. These cover both ends of every logical donor read, accumulator staging, each paid node's selected entrance, return and saved copy, and both ends of public entry and installation. Charge slot $h$ at every action, including the cheaper scan and return at an independent local stream. At the disclosed 169,343 and 169,349 form terms the resulting per-stage reset upper bounds are 1,452,472 and 1,452,520. The bounds on complete staged numerical accesses are 396,828 and 396,840. A common upper tariff can use the larger $t$ and the shared native odd scale and width. + +For each guide production add $c(N_c)+c(W')+22N_cW'+36N_c+7W'+36$, where $c(x)=24x-7\operatorname{popcount}(x)+15\ell(x)+12$ here denotes the retained counter bill. Retiring one guide costs $7L'+10$. Charge stage guards, descriptors, fixed table load and raw layout work in addition. Upper-bound the scalar part using the 13-bit literal and odd-conversion census on the actual caller and both native graphs. The fixed carry and remainder automata for these factors give bounded outward product, exact quotient and signed accumulator scans at retained rate $2^{21}$ steps per padded payload cell per scalar service, including head restoration and sign handling. The complete native and caller monomial movement uses the separate selected physical rate with every elementary record billed and restored. [Guarded guide, counter and retirement bills](https://github.com/aliromman/integer-mult-bounds/blob/677d23ef1610db9921547ab5d58eecc8c8d4c08b/research/current-shared-guide-banks/PROOF.md) · [Retained finite scalar service](https://github.com/aliromman/integer-mult-bounds/blob/28b2af322a1fab01b3734365988930920f9dda48/research/p104-banked-transfer-pivots/physical.py) + +For the 16 distinct stage layouts, reserve the seven selector windows and four independent streams, complete old backing and one actual full stage reference. The explicit combined storage at each stage is + +$$ +(h+6)(L'+2)+\ell(N_c)+\ell(W')+\max(\ell(N_c),\ell(W'),\ell(h)) ++\max(N_c,h)+\max(W',\ell(h))+10. +$$ + +Call the summed stage-owned selector and staging volume $M$. Reserve another $M+352$ cells for its eleven immutable typed layout tracks including the two delimiters for each stage on each track. Charge $34[256(M+352)+128]$ for marker setup and retirement and the 32 entries and exits, plus fixed-degree binary-descriptor work. An entry or exit traverses only the current raw tape tuple. For setup, a fixed collection of binary additions, comparisons and products computes the actual spans. Unary emission with the retained binary counter, complete typed copying and marker retirement each need only a fixed number of linear passes per span. Scan tags are independent of stored numeric values. Each direction branches once on a marker, can move the paired heads separately, and returns at its scheduled ordinal. The selected complete-axis owner/view moves to and from nested child activations, numerical adapters and read/write representation changes remain positive additional charges at the selected complete-volume rate. Retain every suspended ancestor in compiled $O$, and charge resets, numerical copies, all stage and recursive rebase/return, descriptor and fixed table setup in $G$. Only literal positive child calls enter $P$, and the immutable working copies supply no new $T$. [Selected finite-template normalization](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md) + +## Independent audit + +The checker consumes the two authenticated stable-key graph exports, common caller pins and separate signed application output. It checks ordered stage custody for all entrances, paid sources, returned snapshots and terminal installations. It checks every saved read's chart and donor availability, and derives the common grid and absolute mass from the scheduled coefficients. It binds the common root guard to the actual environments in the signed application receipts. The proof supplies an ordinary finite bound with explicit stock, relying on the separate arbitrary-input map evidence and complete native and caller transform interfaces. The measured run checks the full scheduled trace and bound, while the fixed-tape machine for the complete banked multiplier remains a conditional construction. [Guarded audit result](PROVIDER-RESULT.json) diff --git a/research/p104-role230-banked/evidence/WIRE-RESULT.json b/research/p104-role230-banked/evidence/WIRE-RESULT.json new file mode 100644 index 0000000000..976cf96a19 --- /dev/null +++ b/research/p104-role230-banked/evidence/WIRE-RESULT.json @@ -0,0 +1 @@ +{"adjoint":{"differing_internal_rows":[97471,97473,97475],"direction":"adjoint","equal_exposed_noninput_rows":7640,"new_grid":"530841600","new_products":7005237,"old_grid":"530841600","old_products":7004975,"public_outputs":1501},"binding_sha256":"6768e75b9735776a8b53286597bf1cdc0916d170fc573828b749e965775362c0","caller_sha256":"62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf","changed_forms":[97471,97473,97475,97479,101174,101176,102393,102653],"changed_move_keys":[97471,102393],"completed_at":"2026-11-18T07:25:12.722978+00:00","controls":{"cocharted_cycle":"rejected by topological order","nonlocal_chart":"rejected before schedule","same_price_wrong_scalar":"rejected at exposed Z slot 97479"},"direct_child_word":"ab5653d6b6007f8a7987e7ffc6ebab24c662ba852a0d0b446c3a1be19b88db8a","exact_whole_graph_both_orders":true,"forward":{"candidate_native":{"checked_products":8535132,"coefficient_bits":13,"dyadic_height":18,"grid":"530841600","mains":400,"odd":2025,"peak_scaled_mass":"55817215425/32","public":1501,"slots":6142,"terms":169349},"differing_internal_rows":[97471,97473,97475],"direction":"forward","equal_exposed_noninput_rows":7640,"new_grid":"530841600","new_products":8535132,"old_grid":"530841600","old_products":8533666,"public_outputs":1501,"published_native":{"checked_products":8533666,"coefficient_bits":13,"dyadic_height":18,"grid":"530841600","mains":400,"odd":2025,"peak_scaled_mass":"55817215425/32","public":1501,"slots":6142,"terms":169343},"restored_y_in_c":true},"graphs":{"candidate":{"canonical_sha256":"1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150","file":"CANDIDATE-GRAPH.json.gz","gzip_sha256":"8e28c1d403145ca5d72521f4acd7e068603598334c87f18f2fefb738844a1970"},"peer":{"canonical_sha256":"d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098","file":"PEER-GRAPH.json.gz","gzip_sha256":"d293b505f9c572ea56a5ee378d194e5a5b34796ae3fde97467d6f7aace97f84d"}},"input_pins":{"PIVOTS.json":"fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85","RESULT.json":"00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38","native.py":"788465324eb8693a698c75cb3dfdf1b82297324d5583910107ecad4600645e43","network.py":"a9169fd6ad0a13c69cf39bd32649d53256f6d6fa2ed2ceda854f848b64f4c546"},"parent_source_word":"ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d","peer_head":"28b2af322a1fab01b3734365988930920f9dda48","pivot_checks":[{"index":0,"lead":103275,"orientation":"forward","remove":99123,"saved_signal_equal":true},{"index":1,"lead":102748,"orientation":"forward","remove":97031,"saved_signal_equal":true},{"index":2,"lead":88983,"orientation":"transpose","remove":89622,"saved_signal_equal":true},{"index":3,"lead":87777,"orientation":"transpose","remove":89629,"saved_signal_equal":true},{"index":4,"lead":87508,"orientation":"transpose","remove":93636,"saved_signal_equal":true},{"index":5,"lead":99169,"orientation":"transpose","remove":99190,"saved_signal_equal":true},{"index":6,"lead":96713,"orientation":"forward","remove":87508,"saved_signal_equal":true},{"index":7,"lead":97405,"orientation":"forward","remove":87777,"saved_signal_equal":true},{"index":8,"lead":97185,"orientation":"forward","remove":88983,"saved_signal_equal":true},{"index":9,"lead":88940,"orientation":"transpose","remove":89623,"saved_signal_equal":true},{"index":10,"lead":87457,"orientation":"transpose","remove":89630,"saved_signal_equal":true},{"index":11,"lead":87678,"orientation":"transpose","remove":93637,"saved_signal_equal":true},{"index":12,"lead":95049,"orientation":"forward","remove":87457,"saved_signal_equal":true},{"index":13,"lead":94756,"orientation":"forward","remove":87678,"saved_signal_equal":true},{"index":14,"lead":89639,"orientation":"transpose","remove":90064,"saved_signal_equal":true}],"published_native_receipt_reproduced":true,"resource":{"cpu_seconds":40.64,"peak_rss_kib":318652},"scope":"Exact normalized graph construction, exposed rows, stable routes, chronology and fixed saved-signal identities. Physical Gaussian recipes and complete signed application have their own gates.","start_sha256":"be237f07c3c05a014c8ff3f5b79cbbd262af66bf2a96c841e834c7898098e830","started_at":"2026-11-18T07:24:32.070672+00:00","status":"PASS_BANK24_WIRE_COMMUTATION"} diff --git a/research/p104-role230-banked/peer/NOTICE b/research/p104-role230-banked/peer/NOTICE new file mode 100644 index 0000000000..951f081717 --- /dev/null +++ b/research/p104-role230-banked/peer/NOTICE @@ -0,0 +1,7 @@ +Apache License 2.0. Research prepared for Ali Romman with substantial OpenAI Codex assistance. + +New work includes the fifteen certified sender/receiver pivots, the forward and transposed communication construction, the complete native row checker, and the finite stock and precision application for this 16-call program. + +SYLforge supplied the composition, native word reconstruction, published invoice and exact 16-stage caller bytes from PR #7669. Their original PROVENANCE.md is preserved in source/7669-CREDITS.md. It credits the H5B work of SYLforge, DreamingOfClouds' joint native reconstructions, Clear1nsight's coefficient splitting, role-379 and helper work, Rohan Arun's signed caller lineage, and prior contributions from CubeJerry, Douglas Colkitt and others. The source/ directory holds the exact file bytes identified in SOURCE-PINS.json. + +The group-ring caller checker, independent operator checks, bit service, finite-cost method and field guide adapt the corresponding code and arguments of Ali Romman's PR #7663. That package in turn builds on the contributors named in its preserved source/7663-NOTICE. The unchanged directed log/exp gate retains its listed sources in source/gate-NOTICE. Earlier paid-transfer and bank-support constructions include PRs #7434 and #7576. Jerry Chen (CubeJerry) supplied the selected PRs #7000 and #7001 and the typed initializer in PR #7586. The per-call odd-grid induction and the selected application review provide the complete-root realization and finite-cost substitution. Douglas Colkitt and the credited repository authors supplied the pinned operator engines, price evaluator and research workflow. The license accompanies this package. diff --git a/research/p104-role230-banked/peer/PIVOTS.json b/research/p104-role230-banked/peer/PIVOTS.json new file mode 100644 index 0000000000..feede77664 --- /dev/null +++ b/research/p104-role230-banked/peer/PIVOTS.json @@ -0,0 +1,17 @@ +[ + {"direction": "forward","remove": 99123,"pivot": 103275,"source_chart": 1031,"combination": [[103275,"10"],[103472,"-3"]],"sender": [[-1499,"1"]],"receiver": [[102595,"2"],[102596,"-11/2"],[102600,"-11/2"],[102604,"3/4"],[102624,"-5/2"],[102625,"-5/2"],[102744,"3/4"],[102745,"9/2"],[102885,"2"],[102891,"-1"],[102892,"-3/4"],[102952,"-1"],[102953,"-2"],[102954,"-1"],[102955,"2"],[103036,"1"],[103037,"2"],[103085,"-4"],[103086,"1"],[103270,"5/2"],[103432,"-3/4"],[103433,"9/2"]]}, + {"direction": "forward","remove": 97031,"pivot": 102748,"source_chart": 549,"combination": [[102748,"1"]],"sender": [[94976,"-1/2"],[96385,"-1/2"],[97049,"1"]],"receiver": [[103160,"1/2"]]}, + {"direction": "transpose","remove": 89622,"pivot": 88983,"source_chart": 318,"combination": [[88983,"1"]],"sender": [[97185,"2"],[97393,"1"]],"receiver": [[88940,"-1"],[88954,"1"],[88987,"-1"],[88989,"-1"],[89118,"1"],[96568,"-1"]]}, + {"direction": "transpose","remove": 89629,"pivot": 87777,"source_chart": 336,"combination": [[87777,"1/2"]],"sender": [[97386,"1"],[97405,"1/2"]],"receiver": [[87457,"1/2"],[87459,"-1/2"],[87747,"-1/2"],[87784,"-1/2"],[87820,"-1/2"],[90056,"1/2"]]}, + {"direction": "transpose","remove": 93636,"pivot": 87508,"source_chart": 412,"combination": [[87508,"1/2"]],"sender": [[96713,"1/2"],[97697,"1"]],"receiver": [[87510,"-1/2"],[87678,"1/2"],[87686,"-1/2"],[87704,"-1/2"],[87722,"-1/2"],[96707,"1/2"]]}, + {"direction": "transpose","remove": 99190,"pivot": 99169,"source_chart": 603,"combination": [[99169,"-1/4"]],"sender": [[99597,"1"]],"receiver": [[95743,"1/2"]]}, + {"direction": "forward","remove": 87508,"pivot": 96713,"source_chart": 3,"combination": [[96713,"1"]],"sender": [[-1117,"1"],[-1095,"1"],[-969,"1/2"],[-964,"-1/2"],[-935,"1/2"],[-908,"-1/2"]],"receiver": [[97628,"1/2"]]}, + {"direction": "forward","remove": 87777,"pivot": 97405,"source_chart": 3,"combination": [[97405,"2"]],"sender": [[-1474,"1"],[-1472,"4"],[-1471,"3/2"],[-1470,"2"],[-1450,"2"],[-1344,"2/3"],[-1341,"-1"],[-1329,"2"],[-1319,"-1"],[-1312,"1"],[-1308,"-1/2"],[-1288,"1/4"],[-1285,"-1/2"],[-1280,"-1/2"],[-1266,"-1/8"],[-1256,"-1/2"],[-1251,"1/2"],[-1250,"-1/4"],[-1249,"-1/2"],[-1246,"1/2"],[-1243,"-1/2"],[-1241,"1/4"],[-1239,"-1/2"],[-1237,"1"],[-1236,"1/2"],[-1235,"-1/2"],[-1234,"-1/2"],[-1230,"-1/2"],[-1229,"-1/2"],[-1228,"1/2"],[-1223,"-1/2"],[-1216,"-1"],[-1215,"-1"],[-1209,"-2"],[-1203,"-1"],[-1202,"-1"],[-1191,"1/4"],[-1189,"1/4"],[-1188,"1"],[-1185,"-1/2"],[-1177,"-1/2"],[-1176,"-1/2"],[-1173,"1"],[-1172,"-8"],[-1171,"2"],[-1114,"1/2"],[-1107,"1/2"],[-1106,"1/2"],[-1096,"-1/4"],[-1082,"2"],[-1080,"-1/4"],[-1075,"1/4"],[-1074,"1/4"],[-1071,"-1"],[-1069,"-1"],[-1066,"1"],[-1047,"-1"],[-1044,"2"],[-1043,"1/2"],[-1040,"1"],[-1038,"-1"],[-1036,"2"],[-1035,"1/2"],[-1033,"2"],[-1028,"-1"],[-1020,"-2"],[-1014,"-2"],[-1010,"2"],[-964,"-1"],[-958,"-1"],[-914,"-1/2"],[-908,"-1"],[-890,"-1"],[-813,"-1/4"],[-811,"4"],[-790,"-1"],[-757,"-2"],[-753,"1/2"],[-734,"-8"],[-733,"-4"],[-705,"5/2"],[-698,"1/4"],[-660,"-1/2"],[-656,"-1/4"],[-644,"-1/4"],[-642,"-1/4"],[-641,"1/8"],[-636,"-1/4"],[-625,"1/4"],[-620,"1/4"],[-618,"-1/4"],[-612,"-1/2"],[-610,"1/8"],[-609,"1/8"],[-600,"1/2"],[-591,"-1/4"],[-590,"-2"],[-588,"-1/4"],[-584,"-1/4"],[-583,"-1/4"],[-569,"1/2"],[-565,"1/2"],[-564,"1/2"],[-545,"7/2"],[-544,"4"],[-539,"1/2"],[-538,"-2"],[-537,"4"],[-532,"-2"],[-531,"1"],[-529,"7/4"],[-528,"2"],[-523,"-1"],[-518,"2"],[-513,"2"],[-512,"2"],[-498,"1/4"],[-497,"-1"],[-492,"2"],[-480,"1"],[-471,"1"],[-470,"1"],[-449,"2"],[-443,"-1/2"],[-442,"2"],[-441,"-2"],[-440,"-5/4"],[-435,"1/2"],[-430,"-8"],[-418,"-2"],[-415,"2"],[-400,"2"],[-384,"1"],[-364,"-1"],[-361,"2"],[-349,"1/2"],[-337,"3/2"],[-321,"-1/2"],[-320,"-1"],[-317,"3/4"],[-314,"2"],[-312,"1"],[-307,"1/2"],[-284,"3"],[-282,"-1"],[-281,"2"],[-277,"1/4"],[-273,"5/2"],[-269,"4"],[-265,"2"],[-258,"-1"],[-256,"-1/4"],[-237,"-3/2"],[-231,"2"],[-174,"1"],[-151,"1/2"],[-130,"1/2"],[-22,"-1"]],"receiver": [[97385,"-2"]]}, + {"direction": "forward","remove": 88983,"pivot": 97185,"source_chart": 3,"combination": [[97185,"1"]],"sender": [[-1046,"1"],[-1000,"1"],[-972,"1"],[-943,"-1"]],"receiver": [[97188,"-1"]]}, + {"direction": "transpose","remove": 89623,"pivot": 88940,"source_chart": 318,"combination": [[88940,"1"]],"sender": [[90092,"1"],[95202,"-1"]],"receiver": [[88954,"-1"],[89118,"-1"],[89639,"-1"],[90058,"1/2"],[96568,"1/2"]]}, + {"direction": "transpose","remove": 89630,"pivot": 87457,"source_chart": 336,"combination": [[87457,"-2"]],"sender": [[95049,"2"],[95162,"1"]],"receiver": [[87459,"2"],[87747,"2"],[90056,"-1"],[95094,"-1"]]}, + {"direction": "transpose","remove": 93637,"pivot": 87678,"source_chart": 412,"combination": [[87678,"-2"]],"sender": [[94756,"2"],[94777,"1"]],"receiver": [[87686,"2"],[87704,"2"],[94749,"-1"],[96707,"-1"]]}, + {"direction": "forward","remove": 87457,"pivot": 95049,"source_chart": 3,"combination": [[95049,"1"]],"sender": [[-1062,"1"],[-1019,"1"],[-974,"-1"],[-941,"1"]],"receiver": [[95052,"-1"]]}, + {"direction": "forward","remove": 87678,"pivot": 94756,"source_chart": 3,"combination": [[94756,"1/2"]],"sender": [[-1474,"1"],[-1473,"1/16"],[-1467,"1/4"],[-1344,"2/3"],[-1320,"-1/8"],[-1319,"-1/2"],[-1312,"-1/4"],[-1310,"-1/8"],[-1285,"-1/8"],[-1280,"-1/4"],[-1273,"1/2"],[-1266,"1/16"],[-1265,"-1/2"],[-1261,"-1/4"],[-1260,"1/2"],[-1257,"1/2"],[-1256,"-1/4"],[-1254,"1/4"],[-1250,"-1/4"],[-1249,"-1/2"],[-1248,"1/2"],[-1246,"1/2"],[-1245,"3/4"],[-1237,"-1/4"],[-1236,"1/4"],[-1235,"-1/2"],[-1234,"-1/2"],[-1231,"-1/8"],[-1230,"-1/4"],[-1229,"1/4"],[-1211,"-1/2"],[-1209,"1/2"],[-1204,"-1/2"],[-1200,"-1/4"],[-1199,"1/2"],[-1197,"-1/4"],[-1195,"-1/2"],[-1194,"-1/8"],[-1192,"1/4"],[-1189,"1/8"],[-1188,"1"],[-1187,"1/4"],[-1183,"-1/8"],[-1182,"-1/4"],[-1181,"-1/4"],[-1179,"-1/2"],[-1178,"-1/4"],[-1177,"-1/2"],[-1176,"-1/2"],[-1175,"1/4"],[-1174,"1/2"],[-1173,"-1"],[-1170,"-1/4"],[-1167,"-1/4"],[-1165,"1/2"],[-1162,"1"],[-1161,"1/2"],[-1145,"-1/2"],[-1143,"-1/2"],[-1140,"-1/2"],[-1129,"-1/8"],[-1127,"1/2"],[-1125,"1/2"],[-1123,"1/2"],[-1111,"-1/8"],[-1106,"-1/4"],[-1105,"-1/4"],[-1096,"-1/4"],[-1095,"-1/2"],[-1085,"1/8"],[-1078,"-1/2"],[-1073,"1/8"],[-1069,"-1/2"],[-1066,"1/4"],[-1063,"-1/2"],[-1059,"1/2"],[-1056,"1/2"],[-1049,"1/2"],[-1043,"-1/2"],[-1040,"1"],[-1034,"-1/4"],[-1033,"1/2"],[-1028,"-1"],[-1027,"-1/2"],[-1023,"-1/2"],[-1018,"1/2"],[-1012,"1/2"],[-1004,"1/8"],[-1000,"-1/4"],[-992,"-1/2"],[-988,"1/2"],[-985,"1/2"],[-984,"1/2"],[-983,"1/2"],[-982,"1/2"],[-981,"1/2"],[-976,"-1/2"],[-975,"-1/2"],[-974,"1/2"],[-973,"1/2"],[-972,"1/2"],[-969,"-1/2"],[-965,"-1/2"],[-964,"-1/2"],[-962,"-1/2"],[-958,"1/2"],[-957,"-1/2"],[-955,"-1/2"],[-946,"-1/2"],[-945,"-1/2"],[-944,"-1/2"],[-943,"1/2"],[-942,"1/2"],[-941,"1/2"],[-935,"1/2"],[-931,"-1/2"],[-929,"-1/2"],[-928,"-1"],[-927,"-1/2"],[-926,"-1/2"],[-923,"1/2"],[-922,"1/2"],[-921,"1/2"],[-920,"1/2"],[-919,"1/2"],[-917,"-1/2"],[-915,"1/2"],[-914,"-1/4"],[-913,"-1/2"],[-912,"-1/2"],[-908,"1/2"],[-907,"1/2"],[-905,"1/2"],[-904,"1/2"],[-903,"1"],[-901,"-1/2"],[-899,"1/2"],[-898,"-1/2"],[-897,"1/2"],[-896,"-1/2"],[-891,"1/2"],[-890,"-1/2"],[-888,"-1/2"],[-887,"-1/2"],[-883,"-1/2"],[-831,"1/2"],[-813,"1/4"],[-794,"-1/2"],[-761,"1/4"],[-733,"-4"],[-680,"-1/8"],[-665,"-1/2"],[-660,"-3/4"],[-656,"-1/4"],[-644,"-1/4"],[-642,"1/8"],[-641,"1/16"],[-636,"-1/4"],[-618,"1/8"],[-612,"1/4"],[-610,"-1/16"],[-593,"-1/8"],[-591,"1/8"],[-568,"1/4"],[-566,"1/8"],[-563,"-1/4"],[-562,"1/8"],[-561,"-1/2"],[-559,"1/2"],[-553,"-1/4"],[-552,"1/8"],[-551,"1/64"],[-548,"-1"],[-546,"1"],[-544,"-1/2"],[-540,"-1/2"],[-537,"1"],[-526,"-1/4"],[-524,"-1/4"],[-523,"1/2"],[-520,"-1/2"],[-519,"1/2"],[-514,"1/2"],[-509,"-1/2"],[-503,"1/4"],[-495,"1/2"],[-491,"-1/2"],[-485,"-1/16"],[-480,"-1"],[-471,"1"],[-470,"-1"],[-465,"-1/8"],[-462,"-1/4"],[-440,"-1/8"],[-429,"1/4"],[-419,"1/4"],[-408,"1/4"],[-405,"1/4"],[-365,"-1/4"],[-364,"-1"],[-361,"1/4"],[-357,"1/8"],[-355,"-1/16"],[-353,"1/8"],[-349,"1/2"],[-343,"-1/4"],[-335,"-1/16"],[-314,"1/2"],[-303,"1/16"],[-285,"-3/4"],[-284,"1"],[-282,"-1"],[-277,"1/4"],[-273,"1/4"],[-270,"1/8"],[-269,"4"],[-266,"1/128"],[-253,"1/64"],[-248,"-1/4"],[-244,"1/4"],[-243,"-1/4"],[-206,"-1/8"],[-174,"-1"],[-165,"1/4"],[-160,"-1/4"],[-4,"1/32"]],"receiver": []}, + {"direction": "transpose","remove": 90064,"pivot": 89639,"source_chart": 533,"combination": [[89639,"1"]],"sender": [[90844,"-1/2"],[98420,"1"],[98422,"1/2"]],"receiver": [[88940,"1"],[90095,"-1"]]} +] diff --git a/research/p104-role230-banked/peer/RESULT.json b/research/p104-role230-banked/peer/RESULT.json new file mode 100644 index 0000000000..11e0617c58 --- /dev/null +++ b/research/p104-role230-banked/peer/RESULT.json @@ -0,0 +1,471 @@ +{ + "native": { + "grid": "530841600", + "odd": 2025, + "dyadic_height": 18, + "peak_scaled_mass": "55817215425/32", + "checked_products": 8533666, + "terms": 169343, + "slots": 6142, + "coefficient_bits": 13, + "public": 1501, + "mains": 400 + }, + "pivot_checks": 15, + "application": { + "claim": "0.0037260455556", + "parent_upper": "0.0037218793484", + "invoice": { + "contract": { + "ambient_rank": 137, + "boundary": "actual signed caller research candidate with 16 native calls", + "model": "mixed-target-unnormalized-power-v1", + "rank_semantics": "H_r costs r^(1-C); debit surrendered productive fields" + }, + "paid": { + "1": 63408, + "2": 14096, + "3": 9712, + "4": 3904, + "5": 5792, + "6": 1392, + "7": 176, + "8": 752, + "9": 96, + "16": 416, + "24": 416, + "32": 416, + "40": 416, + "48": 416, + "56": 416 + }, + "schema": "integer-mult-recursive-invoice/v1", + "targets": { + "1": 288, + "2": 336, + "3": 752, + "4": 3632, + "5": 1248, + "6": 704, + "7": 304, + "8": 512, + "9": 10256, + "17": 416, + "25": 416, + "33": 416, + "41": 416, + "49": 416, + "57": 416, + "65": 416, + "129": 208 + } + }, + "paid_change": { + "1": -368, + "2": 32, + "3": 80, + "4": 16 + }, + "parent_paid": 102064, + "paid": 101824, + "targets": 21152, + "signed_surplus": 1328, + "caller": { + "paid": { + "8": 640, + "9": 32, + "56": 416, + "48": 416, + "40": 416, + "32": 416, + "24": 416, + "16": 416, + "1": 384 + }, + "targets": { + "129": 208, + "65": 416, + "57": 416, + "49": 416, + "41": 416, + "33": 416, + "25": 416, + "17": 416, + "9": 416 + }, + "uses": { + "ADD": 92400, + "SCALE": 11728, + "IDLE_ONE": 3136, + "LAMBDA": 10672, + "IDLE_ODD": 32, + "SWAP": 240, + "QUERY": 384 + }, + "calls": 16, + "dyadic_height": 9, + "odd_scale": 2025, + "peak_scaled_mass": "495734175/2", + "exact_preproduct_divisions": 153295, + "root_owners": 3536, + "fresh_helpers": 17616 + }, + "stage_owners": [ + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400, + 400 + ], + "pivots": [ + [ + "forward", + 99123, + 103275, + 6156 + ], + [ + "forward", + 97031, + 102748, + 6155 + ], + [ + "transpose", + 89622, + 88983, + 6154 + ], + [ + "transpose", + 89629, + 87777, + 6153 + ], + [ + "transpose", + 93636, + 87508, + 6152 + ], + [ + "transpose", + 99190, + 99169, + 6151 + ], + [ + "forward", + 87508, + 96713, + 6150 + ], + [ + "forward", + 87777, + 97405, + 6149 + ], + [ + "forward", + 88983, + 97185, + 6148 + ], + [ + "transpose", + 89623, + 88940, + 6147 + ], + [ + "transpose", + 89630, + 87457, + 6146 + ], + [ + "transpose", + 93637, + 87678, + 6145 + ], + [ + "forward", + 87457, + 95049, + 6144 + ], + [ + "forward", + 87678, + 94756, + 6143 + ], + [ + "transpose", + 90064, + 89639, + 6142 + ] + ], + "powers": [ + [ + "0.0037218793483", + "lower", + { + "lower": "-115581413614341996474187058928191596648794056289072610410151828119639/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-231162827228683992948374117856383193297588112578145220820303649100105/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ], + [ + "0.0037218793484", + "higher", + { + "lower": "25099189947401472581608269319475629675469453296780090483218745223129/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "25099189947401472581608269319475629675469453296780090483218752144353/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ], + [ + "0.0037260455556", + "higher", + { + "lower": "10676315656068772786401876040842803440271897926827976004135600820172706002715/7237005577332262213973186563042994240829374041602535252466099000494570602496", + "upper": "5338157828034386393200938020421401720135948963413988002067800410086356706747/3618502788666131106986593281521497120414687020801267626233049500247285301248" + } + ], + [ + "0.0037260455556", + "lower", + { + "lower": "-149975923487221802665958718531258228814033709673447697709475154677989/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-299951846974443605331917437062516457628067419346895395418950301937773/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ], + [ + "0.00372604555567", + "lower", + { + "lower": "-60385823677098567459210685988678444302588290538654637231066475166033/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "-60385823677098567459210685988678444302588290538654637231066471487679/3618502788666131106986593281521497120414687020801267626233049500247285301248" + } + ], + [ + "0.00372604555571", + "lower", + { + "lower": "-35904222376829088228416467236735442153112745723993098955519433949/14134776518227074636666380005943348126619871175004951664972849610340958208", + "upper": "-18382961856936493172949231225208546382393725810684466665225943092327/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ], + [ + "0.00372604555572", + "higher", + { + "lower": "3607104758688023652523693795164294881085488895839601403897038418149/3618502788666131106986593281521497120414687020801267626233049500247285301248", + "upper": "7214209517376047305047387590328589762170977791679202807794084359101/7237005577332262213973186563042994240829374041602535252466099000494570602496" + } + ] + ], + "compiler": { + "claim": "9315113889/2500000000000", + "tested": "372604555567/100000000000000", + "raw_bracket": [ + "372604555571/100000000000000", + "93151138893/25000000000000" + ], + "moment_margins": { + "372604555571/100000000000000": [ + "15875835713837552291826628962232052841124379848542910598102864403499321/6250000000000000000000000000000000000000000000000000000000000000000000000000000", + "15875835713837552291826628962232052841124379848542910598102864405740439/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "93151138893/25000000000000": [ + "-3115156469191304458068498827493552879195403033025021963016738010322167/3125000000000000000000000000000000000000000000000000000000000000000000000000000", + "-6230312938382608916136997654987105758390806066050043926033476018413129/6250000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "372604555567/100000000000000": [ + "52150215161363623842261144221150972839456016083329301170749375087135109/3125000000000000000000000000000000000000000000000000000000000000000000000000000", + "52150215161363623842261144221150972839456016083329301170749375088240387/3125000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "moment_margin_float": { + "372604555571/100000000000000": [ + 2.5401337142140085e-09, + 2.5401337142140085e-09 + ], + "93151138893/25000000000000": [ + -9.968500701412173e-10, + -9.968500701412173e-10 + ], + "372604555567/100000000000000": [ + 1.668806885163636e-08, + 1.668806885163636e-08 + ] + }, + "derivative_upper": -348613.3290464958, + "alpha": [ + 0.9999999999999382, + 0.9999999999999382 + ], + "gamma": [ + 0.9334323771155476, + 0.9334323771155476 + ], + "delta": [ + 0.9322377190117992, + 0.9322377190117992 + ], + "minimum_log_power": 2286, + "written_log_power": 2287, + "compiler_gap": "1/100000000000000", + "H": "14558800000000000000", + "BIT_pin": "376669/100000000", + "BIT_margin": "4064444433/100000000000000", + "outer": { + "strict_count": 54, + "functional_count": 4, + "minimum_margin": "1/1000000000000000", + "BIT_just_below_effective_rejected": true + }, + "input_lift": { + "margins": { + "9315113889/2500000000000": [ + "12700427118191787467959187764741998320358523764062379104098810847051285503909/10000000000000000000000000000000000000000000000000000000000000000000000000000000", + "127004271181917874679591877647419983203585237640623791040988108470512855041029/100000000000000000000000000000000000000000000000000000000000000000000000000000000" + ], + "372604555567/100000000000000": [ + "25400854236839944168811969910073971827943612210810061720852213229284472466403/20000000000000000000000000000000000000000000000000000000000000000000000000000000", + "63502135592099860422029924775184929569859030527025154302130533073211181166981/50000000000000000000000000000000000000000000000000000000000000000000000000000000" + ] + }, + "interval_kappa_cap": "376669/100000000", + "derivative_upper_on_required_interval": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + "source_BIT_wide_crude_bound_would_be": "-2299831290525933154178526076272396899996972093654613095735772838275432653960006518819/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000" + } + }, + "physical": { + "odd_conversions": 55104, + "coefficient_bits": 13, + "scalar_test_cases": 4038, + "raw_private_homes": 244640, + "homes_per_native": 15290, + "reset_services_upper": 11816384, + "scalar_services_upper": 117280256, + "scalar_steps_per_bit_upper": 2097152, + "monomial_slots_upper": 276944, + "elementary_records_upper": 26272015616, + "dyadic_height": 27, + "context_mass_upper": "27670501239509649375/64", + "context_mass_bits": 59, + "context_c": 118, + "depth_guard_bits": 14080, + "H": 14558800000000000000 + } + }, + "catalogue": [ + { + "slice": 0, + "total": 3024, + "checked": 504, + "columns": [ + [ + 3, + 318 + ], + [ + 3, + 533 + ], + [ + 3, + 571 + ], + [ + 3, + 720 + ], + [ + 3, + 744 + ], + [ + 549, + 127 + ] + ], + "ports": 104, + "recipes_sha256": "85397b3c3c825fdcdc1c0f9645de09b68d94de993162b88f5f8e9df86353f76e" + }, + { + "slice": 1, + "total": 3024, + "checked": 504, + "columns": [ + [ + 3, + 603 + ] + ], + "ports": 0, + "recipes_sha256": "a0ddba81d51e13c08ed992bc41745162fcfc5e7a783ecd2cfb53629aaa6a0844" + }, + { + "slice": 2, + "total": 3024, + "checked": 504, + "columns": [ + [ + 1031, + 127 + ] + ], + "ports": 0, + "recipes_sha256": "3add2c15ba2c35e006eaba30aef64b1123ed321f8ff0cf896e7f41e3c86751b9" + }, + { + "slice": 3, + "total": 3024, + "checked": 504, + "columns": [ + [ + 3, + 521 + ] + ], + "ports": 0, + "recipes_sha256": "62117424de94d6fd37bbd00f2a086ed91d98b25c209e95caa0a2c80fc8e6dbd7" + }, + { + "slice": 4, + "total": 3024, + "checked": 504, + "columns": [ + [ + 3, + 717 + ] + ], + "ports": 0, + "recipes_sha256": "f2a265277d90114f5a3b905a118644b3cc29f31dd5ed7392ed8c8f444745de37" + }, + { + "slice": 5, + "total": 3024, + "checked": 504, + "columns": [], + "ports": 0, + "recipes_sha256": "342b912d277c857cd2be7ad744c550c3981a59518570895c6079ce8eac0e2a6a" + } + ] +} diff --git a/research/p104-role230-banked/peer/SOURCE-PINS.json b/research/p104-role230-banked/peer/SOURCE-PINS.json new file mode 100644 index 0000000000..489f8a60e9 --- /dev/null +++ b/research/p104-role230-banked/peer/SOURCE-PINS.json @@ -0,0 +1,58 @@ +[ + { + "file": "source/K372-2-WORD.json.gz", + "commit": "eaef5d1580e5761feaed09262b964871f3e5f553", + "path": "research/ee251f60-composition/data/K372-2-WORD.json.gz", + "sha256": "631babeca90e78c5caac713484fe618328b9beee8294baef6ac45ffc9a75dd3b", + "git_blob": "1273c83178693e1627a2324680907f9b0e95e995" + }, + { + "file": "source/source-edits.json", + "commit": "eaef5d1580e5761feaed09262b964871f3e5f553", + "path": "research/ee251f60-composition/EDIT.json", + "sha256": "05b84f9578fddc7adc7805f20afdfe5ea679d298b2232d7f718193185f471656", + "git_blob": "23368c8750e6d981ee10664187c6a2c3859be542" + }, + { + "file": "source/caller.json.gz", + "commit": "eaef5d1580e5761feaed09262b964871f3e5f553", + "path": "research/ee251f60-composition/data/CALLER.json.gz", + "sha256": "d889996a337f648087208ab51c98eaf052705d4fca88b5d01b6e9257a829897a", + "git_blob": "26a75a1ae32cb4944a65281cfb08775967cb39a0" + }, + { + "file": "source/parent-invoice.json", + "commit": "eaef5d1580e5761feaed09262b964871f3e5f553", + "path": "research/ee251f60-composition/data/INVOICE.json", + "sha256": "c79d8c51ad34c7c14134c41d3ae132ab91101e8e24674b52a2abfa191de3fd00", + "git_blob": "4cfe4f0fe98a820153cac58747dd80fb2a2402e6" + }, + { + "file": "source/7669-CREDITS.md", + "commit": "eaef5d1580e5761feaed09262b964871f3e5f553", + "path": "research/ee251f60-composition/PROVENANCE.md", + "sha256": "706c6c852e87e371ddf1828244b2f0c2b00279728818023aa911c8947d69ab83", + "git_blob": "bbee2437f012c3268eb5cd920adfa37394c1de72" + }, + { + "file": "source/interval_gate.py", + "commit": "b81f40997de646de30749d367484d89e59fc3013", + "path": "research/p104-joint-chart-banks/source/interval_gate.py", + "sha256": "60a743d13f668ef86db4b8215b4d5d04430a671ba6f1fe06d9c1c4c3dfe86da5", + "git_blob": "e24dc46079b4c25152f5afc096dda2ce8ee58ff5" + }, + { + "file": "source/gate-NOTICE", + "commit": "b81f40997de646de30749d367484d89e59fc3013", + "path": "research/p104-joint-chart-banks/source/independent-NOTICE", + "sha256": "cadbc642ca84311d2c7a6cf704c7828cb4cf77e3c784b66e4c6e8a5c28002fb8", + "git_blob": "1bc9b4da2b8398954cd7a49356eb9d397785d0a6" + }, + { + "file": "source/7663-NOTICE", + "commit": "b81f40997de646de30749d367484d89e59fc3013", + "path": "research/p104-joint-chart-banks/NOTICE", + "sha256": "5fd4367578d2339fbdcd7dc116b6c12cb4fa72e92d2e3d67be537a36c8bd9d40", + "git_blob": "6ce1bc49a3612c9e906df02de81bcba84be8e803" + } +] diff --git a/research/p104-role230-banked/peer/SOURCES.json b/research/p104-role230-banked/peer/SOURCES.json new file mode 100644 index 0000000000..f51fc62b8a --- /dev/null +++ b/research/p104-role230-banked/peer/SOURCES.json @@ -0,0 +1,42 @@ +{ + "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/shared-wire-split-composition/frozen/clifford_exact.py", + "usage": "input", + "git_blob": "166841a037f069249f6f7f6dedb89248812f59e2", + "sha256": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962" + }, + { + "path": "research/shared-wire-split-composition/frozen/native_verify.py", + "usage": "input", + "git_blob": "2c209dfa9cfade3bc20ac5fc9d876b433a147f8c", + "sha256": "3049471905b47b385c88378a1a3be7a18b8858aadd035b8a6da2f4a03b470f38" + }, + { + "path": "scripts/compare_recursive_invoices.py", + "usage": "input", + "git_blob": "fda2a852e9937e42fe40df0707694465ca7c1b48", + "sha256": "3930c22c11da7bc6042cfeb6e459ecb06e4478430037bee3469d034353855fc6" + }, + { + "path": "scripts/evaluate_recursive_power.py", + "usage": "input", + "git_blob": "ca50f8021fc3238a58fd420383f4619a8d008ace", + "sha256": "52b20f41fd0bb55fa88dccd6015af2ce358917817b9506720f3e60ce681cc3ad" + } + ] +} diff --git a/research/p104-role230-banked/peer/caller.py b/research/p104-role230-banked/peer/caller.py new file mode 100644 index 0000000000..945c27d8c4 --- /dev/null +++ b/research/p104-role230-banked/peer/caller.py @@ -0,0 +1,129 @@ +"""Replay the signed caller over the Gaussian group ring and price its actual entries.""" +from collections import Counter +from fractions import Fraction +from functools import cache +from pathlib import Path +import sys + +HERE = Path(__file__).resolve().parent +sys.path.insert(0, str(HERE)) +from network import main_roles, need, rational + + +def divided(value, denominator): + quotient, remainder = divmod(value, denominator) + need(remainder == 0, "caller grid remainder") + return quotient + + +def caller_replay(caller, word): + stages = caller["stages"] + cs = 2025 + height = 9 + unit = cs << height + zero = (0,) * stages + rows = [{(r, 0, zero): (unit, 0)} for r in range(caller["roles"])] + peak = unit + checks = 0 + paid = Counter() + targets = Counter() + uses = Counter() + stages_seen = [] + types = caller["types"] + need(types["A"]["ports"] == word["hosted"]["Dports"] and sorted(types["A"]["ports"] + types["B"]["ports"]) == list(range(len(word["ports"]))), "port allocation") + need(9 + 8 * stages == caller["ambient_rank"] <= 153, "caller geometry") + role_sets = {name: set(range(ty["offset"], ty["offset"] + ty["roles"])) for name, ty in types.items()} + need(role_sets["A"].isdisjoint(role_sets["B"]) and role_sets["A"] | role_sets["B"] == set(range(len(rows))), "type owners") + + @cache + def shifted(exponents, shift): + exponents = list(exponents) + for k in shift: + exponents[k - 1] += 1 + return tuple(exponents) + + def term(row, ar=1, ai=0, denominator=1, phase=0, shift=()): + nonlocal peak, checks + out = {} + for (r, q, powers), (x, y) in row.items(): + u, v = ar * x - ai * y, ar * y + ai * x + if denominator != 1: + u, v = divided(u, denominator), divided(v, denominator) + checks += 1 + out[r, (q + phase) % 4, shifted(powers, shift) if shift else powers] = (u, v) + peak = max(peak, sum(abs(x) + abs(y) for x, y in out.values())) + return out + + def plus(a, b): + nonlocal peak + out = a.copy() + for k, (u, v) in b.items(): + x, y = out.get(k, (0, 0)) + if x + u or y + v: + out[k] = (x + u, y + v) + else: + out.pop(k, None) + peak = max(peak, sum(abs(x) + abs(y) for x, y in out.values())) + return out + + for event in caller["events"]: + ty = event[0] + if ty == "J": + _, stage, (x, y, u, v), (a, b, alpha, beta) = event + need(stage == len(stages_seen) + 1 and alpha == "-1" and beta == "1/2" and types["A"]["alpha2"] == "-1", "joint coefficients") + need(len({x, y, u, v}) == 4 and {x, y, u, v} <= role_sets["A"] and a != b and {a, b} <= role_sets["B"], "joint owner alias") + stages_seen.append(stage) + rows[y] = plus(rows[y], term(rows[x], phase=-1)) + rows[u] = plus(rows[u], term(rows[v], -1, phase=1)) + r, s = rows[a], rows[b] + rows[a] = plus(r, term(s, -1, phase=1)) + rows[b] = plus(term(s, denominator=2), term(r, denominator=2, phase=-1)) + for role in (x, y, u, v, a, b): + rows[role] = term(rows[role], shift=(stage,)) + continue + _, op, r, *args = event + need(r in role_sets[ty], "local caller owner") + count = len(types[ty]["ports"]) + uses[op] += count + if op in ("ADD", "SWAP", "QUERY"): + need(args[0] in role_sets[ty] and args[0] != r, "caller donor") + if op == "SWAP": + s = args[0] + rows[r], rows[s] = rows[s], rows[r] + elif op == "QUERY": + s, q = args + need(q in (-1, 1), "query sign") + rows[r] = plus(rows[r], term(rows[s], phase=q)) + paid[1] += count + elif op in ("SCALE", "ADD"): + amount = rational(args[-1]) + if op == "SCALE": + rows[r] = term(rows[r], amount.numerator, denominator=amount.denominator) + else: + rows[r] = plus(rows[r], term(rows[args[0]], amount.numerator, denominator=amount.denominator)) + elif op == "LAMBDA": + sign = args[0] + need(sign in (-1, 1), "lambda sign") + original = rows[r] + rows[r] = plus(term(original, 1, sign, 2), term(original, 1, -sign, 2, phase=2)) + else: + need(op in ("IDLE_ONE", "IDLE_ODD"), "caller operation") + block = tuple(args[0]) + need(len(set(block)) == len(block) and all(1 <= k <= stages for k in block), "idle stages") + phase = args[1] if op == "IDLE_ODD" else 0 + need(op != "IDLE_ODD" or phase in (-1, 1), "idle sign") + rows[r] = term(rows[r], phase=phase, shift=block) + paid[8 * len(block) + phase % 2] += count + need(stages_seen == list(range(1, stages + 1)), "all native calls") + for ty in types.values(): + for offset, (phase, coefficient_phase, *powers) in enumerate(ty["diagonal"]): + r = ty["offset"] + offset + need(coefficient_phase == 0 and len(powers) == stages and set(powers) <= {0, 1}, "positive root boundary") + need(rows[r] == {(r, phase % 4, tuple(powers)): (unit, 0)}, "complete signed caller endpoint") + rank = 8 * sum(powers) + phase % 2 + need(rank > 0 and any(powers), "empty root credit") + targets[rank] += len(ty["ports"]) + return dict(paid=dict(paid), targets=dict(targets), uses=dict(uses), calls=stages, + dyadic_height=height, odd_scale=cs, peak_scaled_mass=str(Fraction(peak, 2**height)), + exact_preproduct_divisions=checks, root_owners=sum(targets.values()), + fresh_helpers=stages * (word["public"] - len(main_roles(word)))) diff --git a/research/p104-role230-banked/peer/catalogue.py b/research/p104-role230-banked/peer/catalogue.py new file mode 100644 index 0000000000..3ac4634c21 --- /dev/null +++ b/research/p104-role230-banked/peer/catalogue.py @@ -0,0 +1,104 @@ +"""Check every native transfer, helper job and main-port adapter.""" +from collections import Counter +from functools import cache +from hashlib import sha256 +from pathlib import Path +import copy +import sys + +HERE = Path(__file__).resolve().parent +sys.path.insert(0, str(HERE)) +from network import encoded, main_roles, need, networks, read, source_word + +ROOT = HERE.parents[1] +sys.path.insert(0, str(ROOT / "research/shared-wire-split-composition/frozen")) +import clifford_exact as producer +import native_verify as checker + + +def span(basis): + points = {0} + for v in basis: + need(type(v) is int and 0 < v < 512 and v not in points, "independent native axes") + points |= {x ^ v for x in points} + return sum(1 << x for x in points) + + +def rank_data(word, net): + masks = [span(b) for b in word["frames"]] + dimensions = [len(b) for b in word["frames"]] + + def rank(pair): + a, b = pair + need(0 <= a < len(masks) and 0 <= b < len(masks), "frame index") + intersection = (masks[a] & masks[b]).bit_count() + need(intersection in (1 << dimensions[a], 1 << dimensions[b]) and a != b, "positive nested pair") + return abs(dimensions[a] - dimensions[b]) + + mains = main_roles(word) + helper_pairs = [(net.initial[r], net.final[r]) for r in range(len(net.initial)) if r not in mains] + return Counter(map(rank, net.moves.values())), Counter(map(rank, helper_pairs)), set(helper_pairs) + + +def verify(shard, parts=6): + word = source_word() + parent, net, _ = networks(word) + _, _, helpers = rank_data(word, net) + pairs = sorted(set(net.moves.values()) | helpers) + rerouted = {pair for node, pair in net.moves.items() if pair != parent.moves[node]} + basis = word["frames"] + + @cache + def chart(i): + return producer.canonical_frame(9, tuple(basis[i])) + + @cache + def frame(i): + return checker.frame(basis[i], 9) + + records = [] + exhaustive = [] + for a, b in pairs[shard::parts]: + recipe, _ = producer.lower_child(chart(a).adjoint().then(chart(b))) + need(recipe["rank"] == abs(len(basis[a]) - len(basis[b])) > 0, "physical rank") + actual = checker.recipe(recipe) + target = checker.adjoint(frame(a)) + frame(b) + checker.equal(actual, target, "signed Pauli action and Gaussian phase") + if (a, b) in rerouted: + for u, v in ((actual, target), (checker.adjoint(actual), checker.adjoint(target))): + for col in range(512): + need(checker.state(u, col) == checker.state(v, col), "literal Gaussian column") + exhaustive.append([a, b]) + if not records: + wrong = copy.deepcopy(recipe) + wrong["left"]["phase"] = (wrong["left"]["phase"] + 1) % 4 + bad = checker.recipe(wrong) + need(checker.tableau(bad) == checker.tableau(actual), "phase-only mutation") + try: + checker.equal(bad, target, "altered phase") + except ValueError: + pass + else: + raise ValueError("incorrect absolute phase accepted") + records.append([a, b, recipe]) + ports = 0 + if shard == 0: + for x, q in zip(word["live"], word["ports"], strict=True): + a, b = net.initial[x], net.final[x + 112] + first, _ = producer.lower_child(producer.cgate(9, q, 1).adjoint().then(chart(a))) + last, _ = producer.lower_child(chart(b).adjoint().then(producer.cgate(9, q, -1).then(producer.fourier(9)))) + need(first["rank"] == last["rank"] == 0 and not basis[net.initial[x + 112]], "main adapters") + checker.equal(checker.recipe(first), (("C", q, -1),) + frame(a), "main input phase") + checker.equal(checker.recipe(last), checker.adjoint(frame(b)) + (("C", q, -1),) + checker.fourier(9), "main output phase") + checker.equal(frame(net.final[x]), checker.fourier(9), "full main endpoint") + ports += 1 + return dict(slice=shard, total=len(pairs), checked=len(records), columns=exhaustive, + ports=ports, recipes_sha256=sha256(encoded(records)).hexdigest()) + + +if __name__ == "__main__": + shard = int(sys.argv[1]) + need(sys.flags.optimize == 0 and 0 <= shard < 6, "catalogue configuration") + result = verify(shard) + need(result == read(HERE / "RESULT.json")["catalogue"][shard], "catalogue receipt") + print("PASS_PIVOT_CATALOGUE", shard, result["checked"], len(result["columns"])) diff --git a/research/p104-role230-banked/peer/native.py b/research/p104-role230-banked/peer/native.py new file mode 100644 index 0000000000..3e09f65fe3 --- /dev/null +++ b/research/p104-role230-banked/peer/native.py @@ -0,0 +1,132 @@ +"""Check exact rational signals, all endpoints, and the common integer grid.""" +from fractions import Fraction +from math import lcm +from pathlib import Path +import sys + +HERE = Path(__file__).resolve().parent +sys.path.insert(0, str(HERE)) +from network import add_scaled, coefficients, fold, main_roles, need, pivot, read, source_word + + +def grid(net, order): + denominators = {~r: 1 for r in range(len(net.initial))} + common = 1 + for node in order: + bound = 1 + for donor, factor in net.forms[node].items(): + bound = lcm(bound, denominators[donor] * factor.denominator) + denominators[node] = bound + common = lcm(common, bound) + return common + + +def evaluate(net, requested=None): + order = net.schedule() + if requested is not None: + active = set(requested) + for k in reversed(order): + if k in active: + active.update(net.forms[k]) + order = [k for k in order if k in active] + unit = grid(net, order) + values = {~r: {r: unit} for r in range(len(net.initial))} + mass = {~r: unit for r in range(len(net.initial))} + peak = unit + work = 0 + for k in order: + row = {} + bound = 0 + for donor, factor in sorted(net.forms[k].items()): + a, b = factor.numerator, factor.denominator + bound += abs(a) * mass[donor] // b + for i, value in values[donor].items(): + quotient, remainder = divmod(a * value, b) + need(remainder == 0, "native term left the grid") + new = row.get(i, 0) + quotient + if new: + row[i] = new + else: + row.pop(i, None) + work += len(values[donor]) + peak = max(peak, bound) + values[k] = row + mass[k] = sum(map(abs, row.values())) + return unit, values, peak, work + + +def expected(word, unit): + n = word["public"] + out = [{r: unit} for r in range(n)] + hosted = word["hosted"] + a_ports = set(hosted["Dports"]) + for j, x in enumerate(word["live"]): + y = x + 112 + if j in a_ports: + out[y][x] = unit + else: + need(unit % 2 == 0, "butterfly half") + out[x][y] = -unit + out[y] = {x: unit // 2, y: unit // 2} + for x, y in zip(hosted["X2"], hosted["Y2"], strict=True): + out[x][y] = -unit + return out + + +def check_endpoints(net, word): + unit, rows, peak, terms = evaluate(net) + targets = expected(word, unit) + need([rows[net.first_output + r] for r in range(len(targets))] == targets, "native output matrix") + power = (unit & -unit).bit_length() - 1 + numerator_bits = max(abs(c.numerator).bit_length() for row in net.forms.values() for c in row.values()) + denominator_bits = max(c.denominator.bit_length() for row in net.forms.values() for c in row.values()) + return dict(grid=str(unit), odd=unit >> power, dyadic_height=power, peak_scaled_mass=str(Fraction(peak, 1 << power)), + checked_products=terms, terms=sum(map(len, net.forms.values())), slots=len(net.moves), + coefficient_bits=max(numerator_bits, denominator_bits), public=len(targets), mains=len(main_roles(word))) + + +def verify_pivot(net, edit): + combo = coefficients(edit["combination"]) + source = coefficients(edit["sender"]) + side = coefficients(edit["receiver"]) + _, values, _, _ = evaluate(net, combo.keys() | source.keys() | side.keys()) + target = {} + for m, a in combo.items(): + add_scaled(target, values[m], a) + for m, a in side.items(): + add_scaled(target, values[m], a) + got = {} + for m, a in source.items(): + add_scaled(got, values[m], a) + need(target == got, "saved signal identity") + + +def check_pivots(): + word = source_word() + net = fold(word) + edits = read(HERE / "PIVOTS.json") + checked = 0 + for i, edit in enumerate(edits): + if edit["direction"] == "transpose": + net = net.transpose() + verify_pivot(net, edit) + if i == 0: + donor, weight = edit["sender"][0] + corrupted = dict(edit, sender=[[donor, str(-Fraction(weight))], *edit["sender"][1:]]) + try: + verify_pivot(net, corrupted) + except ValueError as exc: + need(str(exc) == "saved signal identity", "sender sign control reason") + else: + raise ValueError("incorrect sender sign accepted") + checked += 1 + net = pivot(net, edit) + if edit["direction"] == "transpose": + net = net.transpose() + return checked + + +if __name__ == "__main__": + checked = check_pivots() + need(checked == read(HERE / "RESULT.json")["pivot_checks"], "pivot coverage") + print("PASS_EXACT_PIVOTS", checked) diff --git a/research/p104-role230-banked/peer/network.py b/research/p104-role230-banked/peer/network.py new file mode 100644 index 0000000000..0ebc1925c4 --- /dev/null +++ b/research/p104-role230-banked/peer/network.py @@ -0,0 +1,217 @@ +"""Construct the communication circuit and apply the rational pivots.""" +from dataclasses import dataclass +from fractions import Fraction +from functools import cache +from graphlib import TopologicalSorter +from hashlib import sha1, sha256 +from pathlib import Path +import gzip +import json + +HERE = Path(__file__).resolve().parent +PARENT = "ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d" + + +def need(condition, message): + if not condition: + raise ValueError(message) + + +def encoded(value): + return json.dumps(value, sort_keys=True, separators=(",", ":")).encode() + + +def read(path): + raw = path.read_bytes() + return json.loads(gzip.decompress(raw) if path.suffix == ".gz" else raw) + + +def source_word(): + for pin in read(HERE / "SOURCE-PINS.json"): + raw = (HERE / pin["file"]).read_bytes() + need(sha256(raw).hexdigest() == pin["sha256"], "source SHA-256") + need(sha1(f"blob {len(raw)}\0".encode() + raw).hexdigest() == pin["git_blob"], "source Git blob") + base = read(HERE / "source/K372-2-WORD.json.gz") + patch = read(HERE / "source/source-edits.json") + need(sha256(encoded(base)).hexdigest() == patch["source"], "source edit origin") + result = [] + cursor = 0 + for edit in patch["edits"]: + start, stop = edit["start"], edit["stop"] + need(cursor <= start <= stop <= len(base["program"]), "source edit range") + need(base["program"][start:stop] == edit["before"], "source edit preimage") + result.extend(base["program"][cursor:start]) + result.extend(edit["after"]) + cursor = stop + result.extend(base["program"][cursor:]) + word = dict(base, program=result) + need(sha256(encoded(word)).hexdigest() == patch["candidate"] == PARENT, "parent word") + return word + + +def main_roles(word): + h = word["hosted"] + return set(word["live"]) | {i + 112 for i in word["live"]} | set(h["X2"]) | set(h["Y2"]) + + +@cache +def rational(literal): + return Fraction(literal) + + +def add_scaled(row, donor, factor): + for index, value in donor.items(): + new = row.get(index, 0) + factor * value + if new: + row[index] = new + else: + row.pop(index, None) + + +@dataclass +class Network: + first_output: int + initial: list + final: list + moves: dict + forms: dict + + def schedule(self): + for node, form in self.forms.items(): + chart = self.moves[node][0] if node < self.first_output else self.final[node - self.first_output] + for donor in form: + if donor < 0: + need(0 <= ~donor < len(self.initial), "input owner") + donor_chart = self.initial[~donor] + else: + need(donor in self.moves, "missing donor") + donor_chart = self.moves[donor][1] + need(donor_chart == chart, "nonlocal scalar") + need(set(self.forms) == self.moves.keys() | set(range(self.first_output, self.first_output + len(self.final))), + "output inventory") + dependencies = {node: sorted(i for i in self.forms[node] if i >= 0) for node in sorted(self.forms)} + return list(TopologicalSorter(dependencies).static_order()) + + def transpose(self): + def reverse(node): + if node < 0: + return self.first_output + ~node + if node >= self.first_output: + return ~(node - self.first_output) + return node + + edges = {k: {} for k in self.moves} + edges.update({self.first_output + r: {} for r in range(len(self.initial))}) + for node, form in self.forms.items(): + for donor, coefficient in form.items(): + edges[reverse(donor)][reverse(node)] = coefficient + moves = {k: (b, a) for k, (a, b) in self.moves.items()} + return Network(self.first_output, self.final, self.initial, moves, edges) + + +def fold(word): + n = word["public"] + rows = [{~r: 1} for r in range(n)] + [None] * word["owned_fields"] + charts = word["initial"][:] + [None] * word["owned_fields"] + forms, moves = {}, {} + for clock, event in enumerate(word["program"]): + op, r = event[:2] + if op == "INIT": + need(r >= n and rows[r] is None, "private birth") + rows[r], charts[r] = {}, event[2] + continue + need(rows[r] is not None, "inactive register") + if op == "MOVE": + _, _, a, b, owned = event + need(charts[r] == a and owned == (r >= n), "original transfer") + moves[clock], forms[clock] = (a, b), rows[r] + rows[r], charts[r] = {clock: 1}, b + else: + need(charts[r] == event[-1], "original scalar chart") + if op == "CLEAR": + need(r >= n, "public retirement") + rows[r], charts[r] = None, None + elif op == "SCALE": + rows[r] = {k: v * rational(event[2]) for k, v in rows[r].items()} + else: + need(op == "ADD" and event[2] != r and charts[event[2]] == charts[r], "original donor") + add_scaled(rows[r], rows[event[2]], rational(event[3])) + need(charts[:n] == word["final"] and all(f is None for f in charts[n:]), "original exit") + first = len(word["program"]) + forms.update({first + r: rows[r] for r in range(n)}) + return Network(first, word["initial"], word["final"], moves, forms) + + +def coefficients(entries): + result = {k: rational(v) for k, v in entries} + need(len(entries) == len(result) and all(result.values()), "sparse coefficient list") + return result + + +def pivot(net, edit): + drop, lead = edit["remove"], edit["pivot"] + combination = coefficients(edit["combination"]) + sender = coefficients(edit["sender"]) + side = coefficients(edit["receiver"]) + need(lead in combination and drop in net.moves and lead in net.moves, "pivot slots") + _, middle = net.moves[drop] + old, destination = net.moves[lead] + uses = {m: row[drop] for m, row in net.forms.items() if drop in row} + need(old == middle and combination.keys() <= uses.keys(), "pivot combination") + need(all(net.moves.get(m) == (middle, destination) for m in uses), "shared destination") + aggregate = {} + for m, weight in combination.items(): + add_scaled(aggregate, net.forms[m], weight) + response = aggregate.get(drop, 0) + need(response, "zero pivot response") + + forms = net.forms.copy() + del forms[drop] + forms[lead] = sender + for m, weight in uses.items(): + if m != lead: + residual = net.forms[m].copy() + add_scaled(residual, aggregate, -Fraction(weight, response)) + need(drop not in residual, "uncancelled transfer") + forms[m] = residual + + combined = {lead: 1} + add_scaled(combined, side, -1) + recovered = {} + for m, weight in uses.items(): + if m == lead: + row = {k: -v / combination[lead] for k, v in combination.items() if k != lead} + else: + row = {m: 1} + add_scaled(row, combined, Fraction(weight, response)) + recovered[m] = row + for k, row in list(forms.items()): + affected = row.keys() & recovered.keys() + if affected: + new = {i: v for i, v in row.items() if i not in affected} + for i in affected: + add_scaled(new, recovered[i], row[i]) + forms[k] = new + moves = net.moves.copy() + del moves[drop] + moves[lead] = (edit["source_chart"], destination) + return Network(net.first_output, net.initial, net.final, moves, forms) + + +def networks(word): + parent = fold(word) + net = parent + receipts = [] + for edit in read(HERE / "PIVOTS.json"): + direction = edit["direction"] + need(direction in ("forward", "transpose"), "pivot direction") + if direction == "transpose": + net = net.transpose() + before = len(net.moves) + net = pivot(net, edit) + if direction == "transpose": + net = net.transpose() + net.schedule() + need(len(net.moves) == before - 1, "paid slot count") + receipts.append([direction, edit["remove"], edit["pivot"], len(net.moves)]) + return parent, net, receipts diff --git a/research/p104-role230-banked/peer/physical.py b/research/p104-role230-banked/peer/physical.py new file mode 100644 index 0000000000..2ec7f5e01b --- /dev/null +++ b/research/p104-role230-banked/peer/physical.py @@ -0,0 +1,95 @@ +"""Price the finite bank program and exercise its exact scalar and reset services.""" +from fractions import Fraction +from network import need + + +def scalar_bits(x, factor): + a, b = abs(factor.numerator), factor.denominator + magnitude = abs(x) + carry = 0 + bits = [] + for j in range(max(1, magnitude.bit_length()) + a.bit_length() + 1): + carry += a * ((magnitude >> j) & 1) + bits.append(carry & 1) + carry >>= 1 + need(carry == 0, "product width") + quotient = remainder = 0 + for bit in reversed(bits): + trial = 2 * remainder + bit + next_bit = int(trial >= b) + remainder = trial - next_bit * b + quotient = 2 * quotient + next_bit + need(remainder == 0, "physical grid remainder") + return -quotient if (x < 0) != (factor.numerator < 0) else quotient + + +def overwrite(guide, bank, clear): + need(guide is not bank and guide[0] == ("left", "") and guide[-1] == ("right", ""), "typed guide") + pos = 1 + steps = 1 + while guide[pos][0] == "cell": + bank[pos] = "_" if clear else guide[pos][1] + pos += 1 + steps += 1 + need(guide[pos][0] == "right", "guide terminator") + pos -= 1 + steps += 1 + while guide[pos][0] == "cell": + pos -= 1 + steps += 1 + need(pos == 0, "head return") + return steps + 1 + + +def services(factors): + cases = 0 + for factor in factors: + for k in (0, -127, -1, 1, 19, (1 << 68) + 1): + value = k * factor.denominator + need(scalar_bits(value, factor) == k * factor.numerator, "finite scalar service") + cases += 1 + try: + scalar_bits(1, Fraction(1, 2)) + except ValueError as exc: + need(str(exc) == "physical grid remainder", "odd-tick reason") + else: + raise ValueError("odd last tick escaped") + for payload in ("", "0:0|_", ("0" * 19 + ":" + "0" * 19 + "|_") * 32): + guide = [("left", "")] + [("cell", c) for c in payload] + [("right", "")] + bank = ["left guard"] + ["_" if i % 2 else "#" for i in range(len(payload))] + ["right guard"] + for clear in (False, True): + expected = "_" * len(payload) if clear else payload + need(overwrite(guide, bank, clear) == 2 * len(payload) + 3, "two-head cost") + need(bank == ["left guard", *expected, "right guard"], "guard or extent") + return cases + + +def budget(net, caller, raw, audit, paid, targets, signed): + n, k, terms = raw["public"], raw["slots"], raw["terms"] + calls, roots = audit["calls"], audit["root_owners"] + uses = audit["uses"] + factors = {Fraction(c) for row in net.forms.values() for c in row.values()} + factors.update(Fraction(e[-1]) for e in caller["events"] if e[0] != "J" and e[1] in ("SCALE", "ADD")) + for scale in (raw["odd"], audit["odd_scale"], 2): + factors.update((Fraction(scale), Fraction(1, scale), Fraction(-1, scale))) + bits = max(max(abs(c.numerator).bit_length(), c.denominator.bit_length()) for c in factors) + cases = services(factors) + conversions = 2 * (roots + calls * n) + homes = 2 * n + 2 * k + 4 + resets = calls * (2 * homes + 4 * (terms + k + n)) + scalar_count = 32 * (calls * (terms + 4 * (k + n) + 2 * n + homes) + sum(uses.values()) + conversions) + maps = (2 * sum(paid.values()) + 2 * sum(targets.values()) + 2 * calls * raw["mains"] + + 2 * (uses["IDLE_ODD"] + uses["IDLE_ONE"]) + 3 * uses["QUERY"] + uses["LAMBDA"] + uses["IDLE_ODD"]) + height = raw["dyadic_height"] + audit["dyadic_height"] + mass = Fraction(raw["peak_scaled_mass"]) * Fraction(audit["peak_scaled_mass"]) + mass_bits = ((mass.numerator + mass.denominator - 1) // mass.denominator).bit_length() + c = 2 * max(height, mass_bits) + h = int(signed["H"]) + depth = 1920 * 153**1920 * (h + 1)**2 + need((c * depth).bit_length() < h, "root exactness guard") + return dict(odd_conversions=conversions, coefficient_bits=bits, scalar_test_cases=cases, + raw_private_homes=calls * homes, homes_per_native=homes, reset_services_upper=resets, + scalar_services_upper=scalar_count, scalar_steps_per_bit_upper=2**max(20, bits + 8), + monomial_slots_upper=maps, elementary_records_upper=maps * 4 * 154**2, + dyadic_height=height, context_mass_upper=str(mass), context_mass_bits=mass_bits, + context_c=c, depth_guard_bits=(c * depth).bit_length(), H=h) diff --git a/research/p104-role230-banked/peer/source/7663-NOTICE b/research/p104-role230-banked/peer/source/7663-NOTICE new file mode 100644 index 0000000000..6ce1bc49a3 --- /dev/null +++ b/research/p104-role230-banked/peer/source/7663-NOTICE @@ -0,0 +1,7 @@ +Apache-2.0. Ali Romman with substantial OpenAI Codex assistance. + +The new material is the joint chart assignment, its source-bound operator and caller checks, and the fresh-cost complete-root scalar and private-bank specialization. The parent data are from Clear1nsight's PR #7660 on DreamingOfClouds' PRs #7658 and #7641 and SYLforge's PR #7637. The contributors credited in those sources retain their credit. Original notices are in source/parent-NOTICE, source/physical-NOTICE and source/word-NOTICE. + +Rohan Arun supplied the 17-stage signed caller in PR #7113. The unmodified interval gate and the exact caller data come from its pinned source. See source/caller-NOTICE and source/independent-NOTICE, and the source file inventory for all consumed bytes. The two operator engines and integer power evaluator come from the declared current-main inputs. + +Jerry Chen (CubeJerry) supplied selected PRs #7000 and #7001. The selected application and its phase, common-root, finite-cost and compiler arguments, the odd-native common-grid package, the prior typed six-Gamma reset of PR #7586 and the contributors credited in those records provided the foundations used here. PR #7661 independently derives the fixed caller residuals. PR #7662 supplies a rounded parent-clock alternative. This package uses neither implementation. diff --git a/research/p104-role230-banked/peer/source/7669-CREDITS.md b/research/p104-role230-banked/peer/source/7669-CREDITS.md new file mode 100644 index 0000000000..bbee2437f0 --- /dev/null +++ b/research/p104-role230-banked/peer/source/7669-CREDITS.md @@ -0,0 +1,43 @@ +# Provenance, credit and scope + +This is a cumulative contribution. Thank you to everyone who has made their constructions, exact inputs, failure cases and careful reviews available. Those contributions made this composition possible; the small increment here should not obscure the much larger body of work it rests on. We aim to leave equally inspectable material for the next researcher. + +## Direct lineage and reused methods + +- **SYLforge, #7637:** the H5B frame-restored233-CLEAR construction is the published ancestor of this research. The present K372-2 source retains its descendants rather than starting a new independent construction. [PR7637](https://github.com/CrocSwap/integer-mult-bounds/pull/7637). +- **DreamingOfClouds, #7641 and #7658:** #7641 combines20 edits over #7637. #7658 supplies the large-neighbourhood construction and its exact joint hub reconstruction: helper360/537 SWAP-NULL relabel, main176 bypass, helper236 contact re-chart, helper370 last-stay removal and helper461 first-stay removal. The source explicitly credits its #7630/#7636 relabel lineage and #7634 swap law. Our source descends from this word; those gains are not claimed as new work here. [PR7641](https://github.com/CrocSwap/integer-mult-bounds/pull/7641), [PR7658](https://github.com/CrocSwap/integer-mult-bounds/pull/7658). +- **Clear1nsight:** the contact re-chart type from #7612 and the24-bit coefficient-splitting report are part of the construction's lineage. #7626 contributed source isolation/portable materialization, and #7631/#7633 are credited by the parent lineage. #7660 separately published the role379 shortcut already present in our source; we do not count its rediscovery as another improvement. [PR7612](https://github.com/CrocSwap/integer-mult-bounds/pull/7612), [coefficient report](https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19691406), [PR7660](https://github.com/CrocSwap/integer-mult-bounds/pull/7660). +- **ToikY, #7643:** the contact re-chart work is explicitly credited by #7658 alongside Clear1nsight's #7612. Its74-erasure contract and κ are not added to this candidate. No shared CI repair is copied by this PR. [PR7643](https://github.com/CrocSwap/integer-mult-bounds/pull/7643). +- **Rohan Arun, #7113:** the signed caller/accounting lineage underlies the actual16-call composition. Its original source commit is07a76c5e2738882c0cb322278e56f6cae3c9885d. We recount the literal16-call input here; we do not substitute historical17-call constants. [PR7113](https://github.com/CrocSwap/integer-mult-bounds/pull/7113). +- **Ali Romman and upstream contributors:** #7605 supplies an earlier exact protected/application checkpoint cited by the #7637 lineage. The two unmodified directed invoice comparison files are copied from canonical upstream base e54523517d0f03e58352e647c403a5af3e525a57, retaining their attribution and Apache-2.0 headers. Their arithmetic is not a full scientific acceptance gate. [PR7605](https://github.com/CrocSwap/integer-mult-bounds/pull/7605). +- **CubeJerry, Douglas Colkitt and the earlier source contributors:** the retained framework, primitive/service work and repository infrastructure form part of the inherited basis. This package does not claim that their open supplier obligations are resolved by a successful finite replay. + +## What this contribution adds + +The predecessor K372-2 supplies five EARLY edits (1188,1013,940,1141,1195, with940/1141 sharing one ADD). This construction recomputes the1517/770 bypass on that actual source and combined it with a three-field triangle repair. The new contribution is their compatible composition, exact12-block edit, final235 CLEAR witnesses and a small reproducible publication package. Substantial OpenAI Codex assistance was used for research and packaging. New work is Apache-2.0. + +Exact source canonical:3dd1199d95291ee96e6c0aeb6f55f86244a569b1d4975840bf0207e2dcf9c025. Exact candidate canonical:ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d. Byte hashes are in MANIFEST.json. The12 edit blocks specify every changed event and leave all other fields unchanged. The parent research generators are not silently imported; this publication uses the transparent exact edit as its deterministic reconstruction recipe. + +## Related work, not automatically incorporated + +Ali Romman's #7662 studies one half-ADD rounding-error propagation with CubeJerry's service contract. Nick Petalas's #7654 provides a scoped minimal-rank interpolation result used as background when assessing structural repairs. Neither is a substitute for this candidate's entire rounded caller or physical supply proof. Their actual domains and assumptions must be checked before application. [PR7662](https://github.com/CrocSwap/integer-mult-bounds/pull/7662), [PR7654](https://github.com/CrocSwap/integer-mult-bounds/pull/7654). + +At the publication checkpoint, upstream main remained e54523517d0f03e58352e647c403a5af3e525a57. Ali Romman's #7663 uses a separate17-call full-private-bank model and changed helper endpoints; Clear1nsight's #7664 concerns180erasures/17calls; #7666 charges bank selection and return without claiming a new κ. K372-4 is later, separate research with changed helper-boundary conditions. None is silently folded into ee251f60 or used to assert identical physical assumptions. This is not a claim to the greatest bound across all models. + +## Fresh versus reused evidence + +Publication replay freshly reconstructs the whole word, runs exact rows/CLEAR, recounts native/caller histograms and checks the four directed price points. Normal, optimized Python and a Git-free committed-byte export were tested. The recorded ordinary/precision/native-phase/owner evidence retains its narrower scope and original source identifiers; it is not advertised as freshly rerun. No selected record, frozen predecessor package or common verifier is changed. + +## Editorial normalization of publication labels + +The follow-up editorial commit replaces workstation labels with construction terminology. It changes no candidate, edit, certificate, invoice, numeric result, executable code or contributor attribution. The original recorded bytes remain retrievable at commit `95d476623f1468822057554475dc8badb19bfa44`. Evidence JSON field labels and descriptive scopes are normalized, not recomputed scientific results. In NATIVE-EVIDENCE-REUSE.json, `predecessor-receipt:K372-2/NATIVE-NEW.json` is a historical receipt identifier, not a packaged file path. In PRICE-SUMMARY.json, recorded command invoice arguments now use the equivalent packaged `data/INVOICE.json` path; this is a portability transcription, not the verbatim original command. The fresh replay constructs and runs its own package-relative command. MANIFEST.json authenticates the edited publication bytes. + +Evidence byte-custody mapping (original -> editorially normalized SHA-256): + +- `evidence/BUILD.json`: `4744201691120223ded62a3e0d55ea1029203f3ea996305163e7db8d9e3679a4` -> `a0bafbb3f44920ed6ac1ed3d83385f025f5bbbcf5e9c8013ab1ca55ccf23c32d`. + +- `evidence/NATIVE-EVIDENCE-REUSE.json`: `6615b8a051ac9e4d8c73b5decf8a70d2a33d14da0c4c369574dec946984aa351` -> `84bab14d5c584aa8853b8e1025b562541ac6657e458d120ec803f2bc149c3eb8`. + +- `evidence/ROLE770-BUILD.json`: `c4ee72317678791d4b801479df0af052f3a50662c11ce3f3393b2151368fc92d` -> `1c400f16efbc427c40c811a57dc656fe97c2c84f94c71529e2c5c0598b146369`. + +- `evidence/PRICE-SUMMARY.json`: `c2777382c677634f7017b68c55dbd831a40945b77057f26b738f857c17ee8759` -> `d13741fe3217a01edd0b79b40dad037e644e441fbbc300838df99c0b050a5f42`. diff --git a/research/p104-role230-banked/peer/source/K372-2-WORD.json.gz b/research/p104-role230-banked/peer/source/K372-2-WORD.json.gz new file mode 100644 index 0000000000..1273c83178 Binary files /dev/null and b/research/p104-role230-banked/peer/source/K372-2-WORD.json.gz differ diff --git a/research/p104-role230-banked/peer/source/caller.json.gz b/research/p104-role230-banked/peer/source/caller.json.gz new file mode 100644 index 0000000000..26a75a1ae3 Binary files /dev/null and b/research/p104-role230-banked/peer/source/caller.json.gz differ diff --git a/research/p104-role230-banked/peer/source/gate-NOTICE b/research/p104-role230-banked/peer/source/gate-NOTICE new file mode 100644 index 0000000000..1bc9b4da2b --- /dev/null +++ b/research/p104-role230-banked/peer/source/gate-NOTICE @@ -0,0 +1,13 @@ +# Attribution and source reuse + +New independent operator/invoice verification and fixed-grid interval implementation: OpenAI Codex-assisted research session, 2026-11-10. Apache-2.0. + +DreamingOfClouds supplied the #6936 native predecessor and #6937 shared-wire backup/E-free root. CubeJerry supplied #6912 caller blocks, #6980's QUERY-only caller and #6970/#6985 precision methods. Preserve Ali Romman's #5599 helper-split attribution, icekylinx's #104 odd-grid attribution and unpaidmoon's #6930 width-phase attribution in the parent construction. + +Three unchanged source files are authenticated by exact SHA256 and source commit/path in `INDEPENDENT-SOURCES.json`: + +- #6970 `independent_bounds.py`: fixed integer-grid and positive caller-transfer engine. +- #6985 `envelopes.py`: positive forward envelopes and backward covector witnesses. +- #6985 `source_binding.py`: retained helper functions for the envelope engine. + +The adapter applies only two literal helper-census substitutions in memory and records them. It does not call that adaptation an independent mathematical implementation. The new reverse native operator, formal caller ring and elementary interval engine do not import the source authors' operator or invoice checkers. diff --git a/research/p104-role230-banked/peer/source/interval_gate.py b/research/p104-role230-banked/peer/source/interval_gate.py new file mode 100644 index 0000000000..e24dc46079 --- /dev/null +++ b/research/p104-role230-banked/peer/source/interval_gate.py @@ -0,0 +1,128 @@ +#!/usr/bin/env python3 +"""Independent certified fixed-grid intervals (80 decimal places). +ln via 2 atanh after binary range reduction; exp(-x) via alternating +Taylor brackets. Uses only integer floor/ceiling, not Decimal transcendents. +""" +from fractions import Fraction as F +from functools import lru_cache +from pathlib import Path +import json,argparse +if not __debug__: raise RuntimeError('Run without -O; assertions are proof checks.') +B=10**80 + +def ceildiv(a,b):return -((-a)//b) +def exact(q): + q=F(q);return q.numerator*B//q.denominator,ceildiv(q.numerator*B,q.denominator) +def add(a,b):return a[0]+b[0],a[1]+b[1] +def sub(a,b):return a[0]-b[1],a[1]-b[0] +def mul(a,b): + p=[a[i]*b[j] for i in (0,1) for j in (0,1)];return min(p)//B,ceildiv(max(p),B) +def div(a,b): + assert b[0]>0 + p=[F(a[i]*B,b[j]) for i in (0,1) for j in (0,1)] + return min(p).__floor__(),max(p).__ceil__() +def smul(a,q):return mul(a,exact(q)) +def atanh_log(y): + yi=exact(y);yy=mul(yi,yi);p=yi;s=(0,0) + for j in range(100):s=add(s,smul(p,F(2,2*j+1)));p=mul(p,yy) + # 0 <= tail <= 2 y^201/[201(1-y^2)] < 3*(1/3)^201. + return s[0],s[1]+ceildiv(3*B,3**201) +@lru_cache(None) +def log(r): + assert r>=1 + k=r.bit_length()-1;y=F(r-2**k,r+2**k) + a=atanh_log(y);b=atanh_log(F(1,3));return add(a,smul(b,k)) +def expminus(x): + assert 0<=x[0]<=x[1]0 and margins[str(hi)][1]<0 and margins[str(tested)][0]>0 + target=moment(T,tested);paid=moment(P,tested) + alpha=div(paid,target) + # Tail exponent = 1-tested+1/7; argument exp may not be negative. + # r^(1-tested+1/7)=r^(1-tested)* exp(log(r)/7). + def exppos(x): + assert 0<=x[0]<=x[1]0 and gap.numerator==1;step=gap.denominator + wins=lambda j:(step*j+1)**written<2**j + l,h=1,2 + while not wins(h):l,h=h,2*h + while h-l>1: + m=(l+h)//2 + if wins(m):h=m + else:l=m + assert wins(h) and not wins(h-1) + # Monotonicity: upper derivative bound on [0, cap]. + derivative=(0,0) + for rr in T.keys()|P.keys(): + c=T.get(rr,0)-P.get(rr,0);r=int(rr) + term=mul(power(r,cap if c>=0 else 0),log(r));derivative=add(derivative,smul(term,-c)) + assert derivative[1]<0 + result=dict(claim=str(claim),tested=str(tested),raw_bracket=[str(lo),str(hi)],moment_margins={k:show(v) for k,v in margins.items()},moment_margin_float={k:value(v) for k,v in margins.items()},derivative_upper=float(F(derivative[1],B)),alpha=value(alpha),gamma=value(gamma),delta=value(delta),minimum_log_power=lp,written_log_power=written,compiler_gap=str(gap),H=str(step*h),BIT_pin=str(cap),BIT_margin=str(cap-tested)) + # Outer formulas evaluated independently after algebraically substituting + # b=k+5g,a=k+4g,q=k+3g,epsilon=1-g,beta=1-3g. + k=claim;g=gap;b=k+5*g;a=k+4*g;q=k+3*g;ep=1-g;be=1-3*g;r0=g/10;stop=layout=g + sig=1-b;tau=1-a;internal=tau+(1-stop)*max(sig-tau,0);leaf=sig+stop*(1-sig);lam=1-(q+a)/2;xi=ep*(1+q)-F(3,32)+layout;key=be+1-ep + M=[ep*q,a,1-ep+q*be,1-ep+a*be,1-ep+be,F(3,32)+xi-ep,xi+F(1,2)-ep,ep,1-(ep+be+48-128+2)] + checks=[cap-a,b-a,q,b-q,a-q,stop,1-stop,(1-stop)*b-a,1-internal-q,1-leaf-q,lam-tau,lam-sig,lam-internal,1-q-lam,1-q-leaf,ep,1-ep,xi-F(1,2),ep-xi,be,ep-be,1-be,1-(2*xi-2)-r0-be,1-(2*xi-2)-be,1-ep-r0,1-ep,r0,1-key,1-be-2*(1-ep),128-48-be,layout,ep-a,F(1,32)-b,F(2**45-7**16),F(2),2-xi,F(5),1-be,1-be,1-ep,M[2]-M[0],g,k-F('.001730970419199163702738'),1-ep,F(11,2)]+[x-k for x in M] + functional=[1-be,be*(1-F(3,1000)),128-48-ep-be-1,be*(1-F(1,250))] + assert len(checks)==54 and len(functional)==4 and min(checks+functional)>0 + result['outer']=dict(strict_count=54,functional_count=4,minimum_margin=str(min(checks+functional)),BIT_just_below_effective_rejected=(a-F(1,10**12))-a<0) + # Input-lift is only needed on [1-tested_complex,1]. A stronger BIT + # pin is irrelevant to this interval; the source's crude BIT-wide bound + # is not imported beyond its valid range. + pos={7:1,3:1,5:1};neg={9:1,4:1,1:2};d1=(0,0);curvature=(0,0) + for hist,sign in ((pos,1),(neg,-1)): + for r,c in hist.items(): + d1=add(d1,smul(log(r),sign*c*r)) + curvature=add(curvature,smul(mul(log(r),log(r)),c*r)) + lift_cap=cap if cap<=F('.00376669') else tested + assert tested<=lift_cap and F(d1[1],B)+lift_cap*F(curvature[1],B)<0 + lifts={} + for price in (claim,tested): + lift=sub(moment(pos,price),moment(neg,price));assert lift[0]>0 + assert price*(-F(d1[1],B))-price*price*F(curvature[1],B)/2>0 + lifts[str(price)]=show(lift) + result['input_lift']=dict(margins=lifts,interval_kappa_cap=str(lift_cap),derivative_upper_on_required_interval=str(F(d1[1],B)+lift_cap*F(curvature[1],B)),source_BIT_wide_crude_bound_would_be=str(F(d1[1],B)+cap*F(curvature[1],B))) + return result +if __name__=='__main__': + p=argparse.ArgumentParser();p.add_argument('audit');p.add_argument('--claim',default='.00362852408');p.add_argument('--tested',default='.00362852408007');p.add_argument('--lower',default='.00362852408398727978896072723289');p.add_argument('--upper',default='.00362852408398727978896072723290');p.add_argument('--out',required=True);p.add_argument('--bit-pin',default='.00376669');a=p.parse_args() + r=gate(json.loads(Path(a.audit).read_text())['invoice'],a.claim,a.tested,a.lower,a.upper,a.bit_pin);Path(a.out).write_text(json.dumps(r,indent=2)+'\n');print(json.dumps(r,indent=2)) diff --git a/research/p104-role230-banked/peer/source/parent-invoice.json b/research/p104-role230-banked/peer/source/parent-invoice.json new file mode 100644 index 0000000000..4cfe4f0fe9 --- /dev/null +++ b/research/p104-role230-banked/peer/source/parent-invoice.json @@ -0,0 +1 @@ +{"contract":{"ambient_rank":137,"boundary":"actual signed caller research candidate with 16 native calls","model":"mixed-target-unnormalized-power-v1","rank_semantics":"H_r costs r^(1-C); debit surrendered productive fields"},"paid":{"1":63776,"16":416,"2":14064,"24":416,"3":9632,"32":416,"4":3888,"40":416,"48":416,"5":5792,"56":416,"6":1392,"7":176,"8":752,"9":96},"schema":"integer-mult-recursive-invoice/v1","targets":{"1":288,"129":208,"17":416,"2":336,"25":416,"3":752,"33":416,"4":3632,"41":416,"49":416,"5":1248,"57":416,"6":704,"65":416,"7":304,"8":512,"9":10256}} \ No newline at end of file diff --git a/research/p104-role230-banked/peer/source/source-edits.json b/research/p104-role230-banked/peer/source/source-edits.json new file mode 100644 index 0000000000..23368c8750 --- /dev/null +++ b/research/p104-role230-banked/peer/source/source-edits.json @@ -0,0 +1,979 @@ +{ + "schema": "source-bound-exact-event-edit/v1", + "source": "3dd1199d95291ee96e6c0aeb6f55f86244a569b1d4975840bf0207e2dcf9c025", + "candidate": "ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d", + "unchanged_headers": true, + "edits": [ + { + "start": 0, + "stop": 0, + "before": [], + "after": [ + [ + "ADD", + 112, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 113, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 114, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 116, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 117, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 118, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 119, + 607, + "1/2", + 3 + ], + [ + "ADD", + 120, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 122, + 607, + "1/2", + 3 + ], + [ + "ADD", + 123, + 607, + "1/2", + 3 + ], + [ + "ADD", + 137, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 138, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 139, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 140, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 141, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 142, + 607, + "-1", + 3 + ], + [ + "ADD", + 169, + 607, + "1/2", + 3 + ], + [ + "ADD", + 170, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 171, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 172, + 607, + "-1", + 3 + ], + [ + "ADD", + 173, + 607, + "1/4", + 3 + ], + [ + "ADD", + 174, + 607, + "1/2", + 3 + ], + [ + "ADD", + 175, + 607, + "1/2", + 3 + ], + [ + "ADD", + 176, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 177, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 178, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 179, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 180, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 181, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 182, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 183, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 184, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 185, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 186, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 187, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 191, + 607, + "1/2", + 3 + ], + [ + "ADD", + 192, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 193, + 607, + "1/2", + 3 + ], + [ + "ADD", + 194, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 195, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 196, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 198, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 199, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 200, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 201, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 202, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 203, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 204, + 607, + "1/2", + 3 + ], + [ + "ADD", + 206, + 607, + "1/2", + 3 + ], + [ + "ADD", + 207, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 208, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 209, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 228, + 607, + "1/4", + 3 + ], + [ + "ADD", + 236, + 607, + "1/4", + 3 + ], + [ + "ADD", + 255, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 272, + 607, + "1/4", + 3 + ], + [ + "ADD", + 279, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 306, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 311, + 607, + "-1", + 3 + ], + [ + "ADD", + 313, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 316, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 336, + 607, + "1/4", + 3 + ], + [ + "ADD", + 347, + 607, + "1/4", + 3 + ], + [ + "ADD", + 351, + 607, + "1/4", + 3 + ], + [ + "ADD", + 436, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 437, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 438, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 439, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 522, + 607, + "1", + 3 + ], + [ + "ADD", + 530, + 607, + "1", + 3 + ], + [ + "ADD", + 536, + 607, + "1/4", + 3 + ], + [ + "ADD", + 599, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 600, + 607, + "1/4", + 3 + ], + [ + "ADD", + 609, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 611, + 607, + "1/4", + 3 + ], + [ + "ADD", + 617, + 607, + "1/4", + 3 + ], + [ + "ADD", + 625, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 627, + 607, + "1/4", + 3 + ], + [ + "ADD", + 635, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 640, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 655, + 607, + "1/4", + 3 + ], + [ + "ADD", + 697, + 607, + "-1/4", + 3 + ], + [ + "ADD", + 752, + 607, + "17/8", + 3 + ], + [ + "ADD", + 812, + 607, + "1/2", + 3 + ], + [ + "ADD", + 1079, + 607, + "1/2", + 3 + ], + [ + "ADD", + 1122, + 607, + "-1", + 3 + ], + [ + "ADD", + 1176, + 607, + "-1/4", + 3 + ], + [ + "ADD", + 1228, + 607, + "1/8", + 3 + ], + [ + "ADD", + 1233, + 607, + "1/8", + 3 + ], + [ + "ADD", + 1234, + 607, + "1/4", + 3 + ], + [ + "ADD", + 1255, + 607, + "1/4", + 3 + ], + [ + "ADD", + 1265, + 607, + "-1/2", + 3 + ], + [ + "ADD", + 1279, + 607, + "1/8", + 3 + ], + [ + "ADD", + 1331, + 607, + "-1/2", + 3 + ] + ] + }, + { + "start": 87321, + "stop": 87321, + "before": [], + "after": [ + [ + "INIT", + 1551, + 115 + ], + [ + "ADD", + 1551, + 770, + "1", + 115 + ] + ] + }, + { + "start": 96905, + "stop": 96905, + "before": [], + "after": [ + [ + "ADD", + 1279, + 1551, + "-1", + 115 + ] + ] + }, + { + "start": 96959, + "stop": 96961, + "before": [ + [ + "MOVE", + 1517, + 549, + 115, + true + ], + [ + "ADD", + 1517, + 1518, + "1/4", + 115 + ] + ], + "after": [ + [ + "MOVE", + 1517, + 549, + 593, + true + ] + ] + }, + { + "start": 96963, + "stop": 96964, + "before": [ + [ + "MOVE", + 1517, + 115, + 593, + true + ] + ], + "after": [] + }, + { + "start": 97747, + "stop": 97749, + "before": [ + [ + "MOVE", + 236, + 265, + 751, + false + ], + [ + "ADD", + 544, + 236, + "-2", + 751 + ] + ], + "after": [ + [ + "ADD", + 236, + 1000, + "1/4", + 265 + ], + [ + "ADD", + 1000, + 236, + "-2", + 265 + ], + [ + "MOVE", + 236, + 265, + 927, + false + ] + ] + }, + { + "start": 97750, + "stop": 97750, + "before": [], + "after": [ + [ + "ADD", + 544, + 1000, + "1/2", + 751 + ] + ] + }, + { + "start": 97751, + "stop": 97752, + "before": [ + [ + "ADD", + 236, + 1000, + "1/4", + 751 + ] + ], + "after": [] + }, + { + "start": 97753, + "stop": 97753, + "before": [], + "after": [ + [ + "ADD", + 544, + 236, + "-1", + 927 + ], + [ + "ADD", + 236, + 544, + "1/2", + 927 + ] + ] + }, + { + "start": 99687, + "stop": 99687, + "before": [], + "after": [ + [ + "ADD", + 614, + 1551, + "1", + 115 + ] + ] + }, + { + "start": 100116, + "stop": 100117, + "before": [ + [ + "MOVE", + 236, + 751, + 127, + false + ] + ], + "after": [ + [ + "MOVE", + 236, + 927, + 127, + false + ] + ] + }, + { + "start": 150409, + "stop": 150409, + "before": [], + "after": [ + [ + "ADD", + 278, + 770, + "1/2", + 127 + ], + [ + "ADD", + 566, + 770, + "1", + 127 + ], + [ + "ADD", + 567, + 770, + "1/2", + 127 + ], + [ + "ADD", + 612, + 770, + "1", + 127 + ], + [ + "ADD", + 613, + 770, + "1", + 127 + ], + [ + "ADD", + 614, + 770, + "1", + 127 + ], + [ + "ADD", + 1078, + 770, + "1/2", + 127 + ], + [ + "ADD", + 1204, + 770, + "-1/4", + 127 + ], + [ + "ADD", + 1259, + 770, + "-1/4", + 127 + ], + [ + "ADD", + 1280, + 770, + "1", + 127 + ], + [ + "ADD", + 1368, + 770, + "1", + 127 + ], + [ + "ADD", + 1374, + 770, + "2", + 127 + ], + [ + "SCALE", + 770, + "-1", + 127 + ], + [ + "CLEAR", + 1551, + 115 + ] + ] + } + ] +} diff --git a/research/p104-role230-banked/peer/verify.py b/research/p104-role230-banked/peer/verify.py new file mode 100644 index 0000000000..2de8722b80 --- /dev/null +++ b/research/p104-role230-banked/peer/verify.py @@ -0,0 +1,127 @@ +"""Verify the complete application and compare it with the published parent.""" +from collections import Counter +from fractions import Fraction +from graphlib import CycleError +from pathlib import Path +import json +import sys + +HERE = Path(__file__).resolve().parent +sys.path[:0] = [str(HERE), str(HERE / "source"), str(HERE.parents[1] / "scripts")] +from caller import caller_replay +from catalogue import rank_data +from evaluate_recursive_power import evaluate +from interval_gate import gate +from native import check_endpoints +from network import Network, need, networks, read, source_word +from physical import budget + +CLAIM = "0.0037260455556" +PROBE = "0.00372604555567" +LOWER = "0.00372604555571" +UPPER = "0.00372604555572" +BIT = "0.00376669" + + +def complete(word, net, audited): + native, helper, _ = rank_data(word, net) + calls = audited["calls"] + paid = Counter({r: calls * count for r, count in native.items()}) + target = Counter({r: calls * count for r, count in helper.items()}) + paid.update(audited["paid"]) + target.update(audited["targets"]) + return paid, target + + +def histogram(counter): + return {str(i): n for i, n in sorted(counter.items())} + + +def ownership(word, caller): + h = word["hosted"] + hosted = dict(zip(h["Dports"], zip(h["X2"], h["Y2"], strict=True), strict=True)) + geom = [] + for e in caller["events"]: + if e[0] != "J": + continue + pairs = [] + for j, x in enumerate(word["live"]): + y = x + 112 + if j in hosted: + u, v = hosted[j] + for side in ("initial", "final"): + need(word[side][u] == word[side][x] and word[side][v] == word[side][y], "second-plane chart") + pairs.extend(zip((x, y, u, v), ((j, r) for r in e[2]), strict=True)) + else: + pairs.extend(zip((x, y), ((j, r) for r in e[3][:2]), strict=True)) + need(len(pairs) == len(dict(pairs)) == len({who for _, who in pairs}) == 400, "stage owners") + geom.append(len(pairs)) + need(len(geom) == caller["stages"], "stage bindings") + return geom + + +def controls(net): + # A self-dependency and a wrong coframe must both fail before execution. + node = next(iter(net.moves)) + move = net.moves[node] + moves = net.moves.copy() + moves[node] = (move[1], move[1]) + cyclic = Network(net.first_output, net.initial, net.final, moves, dict(net.forms)) + cyclic.forms[node] = {node: 1} + try: + cyclic.schedule() + except CycleError: + pass + else: + raise ValueError("causal cycle accepted") + moves = net.moves.copy() + moves[node] = (move[1], move[1]) + try: + Network(net.first_output, net.initial, net.final, moves, net.forms).schedule() + except ValueError as exc: + need(str(exc) == "nonlocal scalar", "coframe control reason") + else: + raise ValueError("incorrect sender chart accepted") + + +def application(): + word = source_word() + parent, net, edits = networks(word) + controls(net) + caller = read(HERE / "source/caller.json.gz") + audited = caller_replay(caller, word) + owners = ownership(word, caller) + origin = read(HERE / "source/parent-invoice.json") + old_paid, old_targets = complete(word, parent, audited) + need(histogram(old_paid) == origin["paid"] and histogram(old_targets) == origin["targets"], "published parent invoice") + paid, targets = complete(word, net, audited) + need(targets == old_targets, "productive boundary") + cur = dict(origin, paid=histogram(paid), targets=histogram(targets)) + empty = dict(origin, paid={}, targets={}) + signed = gate({"P": paid, "T": targets}, CLAIM, PROBE, LOWER, UPPER, BIT) + signs = [] + for data, at, sign in ((origin, "0.0037218793483", "lower"), (origin, "0.0037218793484", "higher"), + (origin, CLAIM, "higher"), (cur, CLAIM, "lower"), (cur, PROBE, "lower"), + (cur, LOWER, "lower"), (cur, UPPER, "higher")): + result = evaluate(empty, data, 1 - Fraction(at), 256) + need(result["classification"] == "new_cost_" + sign, "independent price") + signs.append([at, sign, result["new_minus_old"]]) + norm = check_endpoints(net, word) + physical = budget(net, caller, norm, audited, paid, targets, signed) + delta = {str(i): paid[i] - old_paid[i] for i in sorted(paid.keys() | old_paid.keys()) if paid[i] != old_paid[i]} + return dict(native=norm, pivot_checks=len(edits), + application=dict(claim=CLAIM, parent_upper="0.0037218793484", invoice=cur, paid_change=delta, + parent_paid=sum(old_paid.values()), paid=sum(paid.values()), targets=sum(targets.values()), + signed_surplus=sum(r * (targets[r] - paid[r]) for r in paid.keys() | targets.keys()), + caller=audited, stage_owners=owners, pivots=edits, powers=signs, compiler=signed, + physical=physical)) + + +if __name__ == "__main__": + need(sys.flags.optimize == 0, "directed gate requires assertions") + result = application() + stored = read(HERE / "RESULT.json") + # JSON object keys are strings in the published receipt. + need(json.loads(json.dumps(result)) == {k: stored[k] for k in result}, "application receipt") + a = result["application"] + print("PASS_BANKED_APPLICATION", a["claim"], a["paid"], a["targets"]) diff --git a/research/p104-role230-banked/verify.py b/research/p104-role230-banked/verify.py new file mode 100644 index 0000000000..97c728e396 --- /dev/null +++ b/research/p104-role230-banked/verify.py @@ -0,0 +1,242 @@ +#!/usr/bin/env python3 +# SPDX-License-Identifier: Apache-2.0 +"""Authenticate and replay the matched role-230 banked construction.""" + +import argparse +import gzip +from hashlib import sha1, sha256 +import json +from pathlib import Path, PurePosixPath +import resource +import subprocess +import sys +from tempfile import TemporaryDirectory +import time + + +ROOT = Path(__file__).resolve().parent +BASE = "e54523517d0f03e58352e647c403a5af3e525a57" +PEER_HEAD = "28b2af322a1fab01b3734365988930920f9dda48" +SCIENCE = "26b6c469aa6c4aa04322ce25a22150f90e5fb14e" +SOURCE = "ee251f6005d2a92b887c5b804bd7aac05989d278b2c9ccb3c3091b50d533b08d" +PEER_GRAPH = "d81ec9f47740852a4bf7bd83100feff5cb66b70e1973466e1609bbac8af75098" +CANDIDATE_GRAPH = "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150" +CALLER = "62d94fb992acab0a71c3d12f22be4ce63f4f65e5cbe3f420b93aa1393ffa8dcf" +PIVOTS = "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85" +PEER_RESULT = "00340c699fd7e2895d31a41d1eb60aebf91d7ba2c1c193dc002f69315298cd38" +WIRE_RESULT = "cde8b602d182ece20f55616decab1bf5c2b64e877770c20106afca44ff08752d" +INDEPENDENT_PRICE_PLAN = "509c44b078561a8868b68dab9f50b0b7d87d0976361d927bc8cc6bfdf1239393" +PEER_GRAPH_FILE = "PEER-GRAPH.json.gz" +CANDIDATE_GRAPH_FILE = "CANDIDATE-GRAPH.json.gz" + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def digest(raw): + return sha256(raw).hexdigest() + + +def file(root, relative): + name = PurePosixPath(relative) + require(name.parts and not name.is_absolute() and ".." not in name.parts + and name.as_posix() == relative, f"invalid asset path: {relative}") + original = root.joinpath(*name.parts) + require(original.resolve() == original and original.is_file(), f"missing or aliased asset: {relative}") + return original + + +def read(path): + return json.loads(path.read_bytes()) + + +def write(path, value): + with path.open("x", encoding="utf-8") as stream: + json.dump(value, stream, indent=2, sort_keys=True) + stream.write("\n") + + +def authenticate(root): + manifest = read(file(root, "ASSETS.json")) + comparator = manifest["comparator"] + require(manifest["schema_version"] == 1 and manifest["base_commit"] == BASE + and (comparator["pr"], comparator["head"], comparator["science"]) == (7674, PEER_HEAD, SCIENCE) + and comparator["source_word"] == SOURCE and comparator["caller_sha256"] == CALLER, + "exact matched source and caller") + verified = {} + for row in manifest["files"]: + name = row["path"] + require(name not in verified, f"duplicate asset: {name}") + raw = file(root, name).read_bytes() + require(len(raw) == row["bytes"] and digest(raw) == row["sha256"], f"asset bytes: {name}") + if "git_blob" in row: + blob = sha1(f"blob {len(raw)}\0".encode() + raw).hexdigest() + require(blob == row["git_blob"], f"upstream Git blob: {name}") + verified[name] = row["sha256"] + require(verified["peer/PIVOTS.json"] == comparator["pivot_sha256"] == PIVOTS + and verified["peer/RESULT.json"] == comparator["published_receipt_sha256"] == PEER_RESULT + and verified["evidence/WIRE-RESULT.json"] == WIRE_RESULT, + "frozen peer inputs and actual completed graph receipt") + actual_caller = gzip.decompress(file(root, "peer/source/caller.json.gz").read_bytes()) + require(digest(actual_caller) == CALLER, "literal decoded 16-call caller") + return verified + + +def invoke(root, scratch, script, args, seconds): + command = [sys.executable, "-I", "-B", "-X", f"pycache_prefix={scratch / 'fresh-bytecode'}", + str(file(root, script)), *(str(arg) for arg in args)] + subprocess.run(command, check=True, cwd=root, timeout=seconds) + + +def compare_reports(fresh, recorded, observed_fields=()): + require({key: value for key, value in fresh.items() if key not in observed_fields} + == {key: value for key, value in recorded.items() if key not in observed_fields}, + "fresh result matches every reproducible field") + + +def graph(root, out, materialize=False): + original = root / "evidence/WIRE-RESULT.json" + args = ["--peer-package", root / "peer", "--contacts-file", root / "data/CONTACTS.json", "--out", out] + if materialize: + args += ["--materialize-only", original] + invoke(root, out, "engines/graph.py", args, 80 if materialize else 105) + expected = read(original) + result_path = out / ("MATERIALIZATION.json" if materialize else "RESULT.json") + result = read(result_path) + require(result["graphs"] == expected["graphs"], "frozen canonical and packed graph identities") + for name, raw_pin in ((PEER_GRAPH_FILE, PEER_GRAPH), (CANDIDATE_GRAPH_FILE, CANDIDATE_GRAPH)): + require(digest(gzip.decompress((out / name).read_bytes())) == raw_pin, f"canonical graph bytes: {name}") + if materialize: + require(result["status"] == "PASS_BANK24_MATERIALIZATION_ONLY" and result["exact_result_sha256"] == WIRE_RESULT, + "materialized exact replay identities") + else: + compare_reports(result, expected, ("started_at", "completed_at", "start_sha256", "binding_sha256", "resource")) + require(result["status"] == "PASS_BANK24_WIRE_COMMUTATION" and len(result["pivot_checks"]) == 15 + and result["exact_whole_graph_both_orders"] is True, "paired exact wire and unchanged pivot proof") + return result + + +def paired(root, out): + out.mkdir(exist_ok=False) + graph_out = out / "graphs" + wire = graph(root, graph_out) + app_out = out / "application" + invoke(root, out, "engines/application/verify.py", ( + "--package", root / "peer", "--engine-dir", root / "engines/frozen", + "--parent-graph", graph_out / PEER_GRAPH_FILE, "--candidate-graph", graph_out / CANDIDATE_GRAPH_FILE, + "--graph-receipt", root / "evidence/WIRE-RESULT.json", "--out", app_out + ), 120) + application = read(app_out / "RESULT.json") + compare_reports(application, read(file(root, "evidence/APPLICATION-RESULT.json"))) + require(application["status"] == "PASS_BANK24_ACTUAL16_APPLICATION_COMPONENT", "full signed application status") + physical_path = out / "PHYSICAL.json" + invoke(root, out, "engines/check_banked_provider_cost.py", ( + "--binding", graph_out / "GRAPH-BINDING.json", "--peer-result", root / "peer/RESULT.json", + "--caller", root / "peer/source/caller.json.gz", "--application-dir", app_out, "--out", physical_path + ), 20) + physical = read(physical_path) + compare_reports(physical, read(file(root, "evidence/PROVIDER-RESULT.json"))) + price_path = out / "INDEPENDENT-PRICE.json" + invoke(root, out, "engines/check_price.py", ( + "--invoices", app_out / "INVOICES.json", "--outer", app_out / "PRICE-OUTER.json", + "--application", app_out / "RESULT.json", "--peer-result", root / "peer/RESULT.json", + "--plan-sha256", INDEPENDENT_PRICE_PLAN, "--out", price_path + ), 10) + price = read(price_path) + compare_reports(price, read(file(root, "evidence/INDEPENDENT-PRICE.json"))) + require(price["status"] == "PASS_BANK24_REVIEW_INDEPENDENT_DIRECTED_PRICE", "bounded independent signed margins") + result = {"status": "PASS_ROLE230_BANKED_PAIRED_APPLICATION", "source_graph": PEER_GRAPH, + "candidate_graph": CANDIDATE_GRAPH, "caller_sha256": CALLER, + "candidate_conditional_lower": application["candidate_directed_conditional_lower"], + "paired_wire_exact": wire["exact_whole_graph_both_orders"], + "artifacts": {str(path.relative_to(out)): digest(path.read_bytes()) for path in + (graph_out / "RESULT.json", app_out / "RESULT.json", physical_path, price_path)}} + write(out / "RESULT.json", result) + return result + + +def native(root, out): + out.mkdir(exist_ok=False) + deadline = time.monotonic() + 385 + graph_out = out / "graphs" + graph(root, graph_out, materialize=True) + + def run(script, args, seconds): + remaining = deadline - time.monotonic() + require(remaining > 0, "paired native replay deadline") + invoke(root, out, "engines/native/" + script + ".py", args, min(seconds, remaining)) + + common = ("--peer-package", root / "peer", "--engine-dir", root / "engines/frozen", "--graphs", graph_out) + phase_out = out / "phase" + run("bank_phase", (*common, "--custody", root / "engines/native/MAP-CUSTODY.json.gz", + "--expect-peer", PEER_GRAPH, "--expect-child", CANDIDATE_GRAPH, "--out", phase_out), 85) + phase_path = phase_out / "RESULT.json" + phase = read(phase_path) + compare_reports(phase, read(file(root, "evidence/PHASE-RESULT.json")), ("complete_at", "artifact_sha256")) + require(phase["status"] == "PASS_PAIRED_BANK24_EXACT_NATIVE_MAPS", "complete paired native phase catalogue") + for name, pin in phase["artifact_sha256"].items(): + require(digest(file(phase_out, name).read_bytes()) == pin, f"fresh phase artifact: {name}") + records = {} + for prime in (1000000009, 998244353): + dense_out = out / f"dense-{prime}" + run("bank_dense", (*common, "--field-engine", root / "engines/frozen/field_interpreter.py", + "--phase", phase_out, "--prime", prime, "--out", dense_out), + 115 if prime == 1000000009 else 85) + path = dense_out / "RESULT.json" + report = read(path) + observed = ("observed_at", "completed_at", "phase_sha256") + compare_reports(report, read(file(root, f"evidence/DENSE-{prime}.json")), observed) + require(report["status"] == "PASS_PAIRED_BANK24_ACTUAL_HELD_ARRAYS" + and report["phase_sha256"] == digest(phase_path.read_bytes()), "native dense result and fresh phase binding") + controls = report["actual_negative_controls"] + if prime == 1000000009: + require(set(controls) == {"quarter phase", "same-price sign"} + and all(len(set(control["changed_public_roles"])) == 53 for control in controls.values()), + "both actual first-prime fault controls affect 53 distinct public roles") + else: + require(not controls, "second prime replays the unmodified graph") + records[str(prime)] = digest(path.read_bytes()) + sealed_path = out / "NATIVE-COMPONENT.json" + run("bank_complete", ("--phase", phase_out, "--dense-first", out / "dense-1000000009", + "--dense-second", out / "dense-998244353", "--out", sealed_path), 10) + sealed = read(sealed_path) + expected = read(file(root, "evidence/NATIVE-RESULT.json")) + compare_reports(sealed, expected, ("phase_sha256", "dense")) + require(sealed["status"] == "PASS_PAIRED_BANK24_NATIVE_QUALIFICATION_COMPONENT", + "complete native exact and held-array comparison") + result = {"status": "PASS_ROLE230_BANKED_PAIRED_NATIVE", "source_graph": PEER_GRAPH, + "candidate_graph": CANDIDATE_GRAPH, "caller_sha256": CALLER, + "phase_result_sha256": digest(phase_path.read_bytes()), "dense_result_sha256": records, + "sealed_native_component_sha256": digest(sealed_path.read_bytes())} + write(out / "RESULT.json", result) + return result + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("stage", choices=("integrity", "graph", "paired", "native")) + parser.add_argument("--out", type=Path) + args = parser.parse_args() + require(sys.version_info[:2] == (3, 12) and sys.flags.isolated and sys.dont_write_bytecode and __debug__, + "use Python 3.12 -I -B with assertions") + authenticated = authenticate(ROOT) + if args.stage == "integrity": + require(args.out is None, "integrity uses read-only inputs") + print(json.dumps({"status": "PASS_BANK24_CAPSULE_INTEGRITY", "assets": len(authenticated)})) + return + bound = 2 * 1024**3 + resource.setrlimit(resource.RLIMIT_AS, (bound, bound)) + stage = {"graph": graph, "paired": paired, "native": native}[args.stage] + if args.out is None: + with TemporaryDirectory(prefix="p104-banked-") as scratch: + result = stage(ROOT, Path(scratch) / "replay") + else: + result = stage(ROOT, args.out.resolve()) + require(authenticated == authenticate(ROOT), "source bytes throughout replay") + print(json.dumps(result, sort_keys=True)) + + +if __name__ == "__main__": + main() diff --git a/research/p104-role230-banked/witness-controls/EXPECTED.json b/research/p104-role230-banked/witness-controls/EXPECTED.json new file mode 100644 index 0000000000..bfa3e1b493 --- /dev/null +++ b/research/p104-role230-banked/witness-controls/EXPECTED.json @@ -0,0 +1,46 @@ +{ + "banked_wire_receipt_sha256": "cde8b602d182ece20f55616decab1bf5c2b64e877770c20106afca44ff08752d", + "candidate": "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150", + "endpoint_preserving_gauge": { + "column": 17, + "entry_zero_based": 2, + "expected_residual_reproduced": true, + "gauge_token": 97185, + "gauged_value": "-2", + "orientation": "transpose", + "original_residual_sender_minus_combination_minus_receiver": "0", + "original_token_value": "2", + "paid_slots": 6155, + "pivot": 88983, + "public_endpoints_equal_by_algebra": true, + "readers": [ + 89622, + 89623, + 94136 + ], + "remove": 89622, + "same_order": true, + "source_checker": "saved signal identity", + "stale_residual_sender_minus_combination_minus_receiver": "-8" + }, + "fixed_pivots_sha256": "fb22afc8aaf543e62709fa682f222577e6bdf4e1f1994d307784468314c3da85", + "graph_driver_sha256": "7acf26e997e8d659b8c61fbaa675d6478fcdffff1600f45c6722824497fdea37", + "omitted_c_reader_incidence": { + "correct_exposed_value": "0", + "corrupted_exposed_value": "1/12", + "corrupted_minus_correct": "1/12", + "expected_exposed_change_reproduced": true, + "exposed_slot": 101174, + "helper_column": 39, + "paid_slots": 6142, + "physical_route": [ + 912, + 148 + ], + "removed_coefficient": "-1/3", + "scheduled_nodes": 7643, + "source_column_coefficient": "1/4", + "source_slot": 97471 + }, + "status": "PASS_SAVED_WITNESS_CONTROLS" +} diff --git a/research/p104-role230-banked/witness-controls/README.md b/research/p104-role230-banked/witness-controls/README.md new file mode 100644 index 0000000000..cf0fe6ff14 --- /dev/null +++ b/research/p104-role230-banked/witness-controls/README.md @@ -0,0 +1,17 @@ +# Exact saved-witness controls + +These two optional checks distinguish equality of the exposed operator from correctness of the internal pivot witness and its scheduled reads. ChatGPT Pro proposed both mutations. Clear1nsight's role-transfer review reproduced them with substantial OpenAI Codex assistance. The public adapter preserves that exact algebra, using Ali Romman's fixed fifteen-pivot source and the released banked graph builder. [Fixed pivot witnesses](../peer/PIVOTS.json) · [Whole exact wire result](../evidence/WIRE-RESULT.json) + +| Mutation | What the checker verifies | +|---|---| +| Flip the sign of internal token 97185 and invert all three readers in the first transposed pivot's entry circuit | Conjugating the scalar incidences by those signs preserves every public normalized endpoint and all 6,155 paid slots and their order. On public input column 17 the internal value goes from `2` to `−2`. The original pivot witness has residual `0` on the original circuit and residual `−8` after the mutation. The retained source verifier rejects the stale saved-signal identity. | +| Omit the coefficient `−1/3` of chart-912 token 97471 from the source form at slot 101174 | The resulting graph still schedules all 7,643 forms and retains the same 6,142 paid slots and routes. On independent helper column 39 the exact exposed value at slot 101174 changes from `0` to `1/12`. | + +From the package directory, replay with Linux CPython 3.12 and the standard library. + +```sh +python3.12 -I -B witness-controls/check_saved_witness_controls.py \ + --out /path/to/new-saved-witness-receipt.json +``` + +The adapter rebuilds the exact candidate graph in temporary storage, or consumes a retained wire output through `--candidate /path/to/CANDIDATE-GRAPH.json.gz`. It binds the fixed pivots, exact graph driver, canonical and packed candidate and actual wire receipt. The result must equal [EXPECTED.json](EXPECTED.json) and emits `PASS_SAVED_WITNESS_CONTROLS`. The inner wall limit is 75 seconds and the address-space limit is 2 GiB. The original guarded controls took 5.33 seconds wall on their already materialized inputs. This optional check has its own receipt and leaves the two registered commands and their budget intact. diff --git a/research/p104-role230-banked/witness-controls/check_saved_witness_controls.py b/research/p104-role230-banked/witness-controls/check_saved_witness_controls.py new file mode 100644 index 0000000000..1def59e457 --- /dev/null +++ b/research/p104-role230-banked/witness-controls/check_saved_witness_controls.py @@ -0,0 +1,229 @@ +#!/usr/bin/env python3 +# SPDX-License-Identifier: Apache-2.0 +"""Replay the two exact rare saved-witness controls on the frozen banked graph. + +The algebra and incidence checks are retained from Clear1nsight's guarded +role-transfer review, with substantial OpenAI Codex assistance. This adapter +uses only the public release package and exact source pins. +""" + +from argparse import ArgumentParser +from fractions import Fraction +import gzip +from hashlib import sha256 +from importlib.util import module_from_spec, spec_from_file_location +import json +from pathlib import Path +import resource +import signal +import subprocess +import sys +from tempfile import TemporaryDirectory + + +HERE = Path(__file__).resolve().parent +DRIVER = "7acf26e997e8d659b8c61fbaa675d6478fcdffff1600f45c6722824497fdea37" +CHILD = "1f082936ada08b5138b7d13e33368bd21c6f46632c5319a348e2f2a8e0021150" +CHILD_GZIP = "8e28c1d403145ca5d72521f4acd7e068603598334c87f18f2fefb738844a1970" +RECEIPT = "cde8b602d182ece20f55616decab1bf5c2b64e877770c20106afca44ff08752d" +EXPECTED = "b4c9d7dca9b3416572d48496f03ddee122dd0194d1b0388d4ea2000fa5bde3aa" + + +def require(ok, detail): + if not ok: + raise ValueError(detail) + + +def sha(data): + return sha256(data).hexdigest() + + +def pinned(path, digest): + data = path.read_bytes() + require(sha(data) == digest, f"exact input bytes: {path.name}") + return data + + +def graph_driver(path): + pinned(path, DRIVER) + spec = spec_from_file_location("banked_control_graph_driver", path) + driver = module_from_spec(spec) + spec.loader.exec_module(driver) + return driver + + +def with_rows(engine, net, rows): + return engine.Network(net.first_output, net.initial, net.final, net.moves, rows) + + +def column(net, order, index): + values = {~index: Fraction(1)} + for node in order: + value = sum(coefficient * values[donor] for donor, coefficient in net.forms[node].items() if donor in values) + if value: + values[node] = value + return values + + +def dot(entries, values): + return sum(Fraction(amount) * values.get(key, 0) for key, amount in entries) + + +def residual(witness, values): + return dot(witness["sender"], values) - dot(witness["combination"], values) - dot(witness["receiver"], values) + + +def gauge_control(driver, peer, contacts): + engine, word, direct, keys = driver.bind_words(peer, None, None, contacts) + pivots = json.loads(pinned(peer / "PIVOTS.json", driver.PINS["PIVOTS.json"])) + net = driver.stable_fold(engine, word, direct, keys) + for edit in pivots[:2]: + require(edit["direction"] == "forward", "first two physical pivots") + net = engine.pivot(net, edit) + witness = pivots[2] + require((witness["direction"], witness["remove"], witness["pivot"]) == ("transpose", 89622, 88983), + "third fixed pivot") + net = net.transpose() + token = 97185 + require(token in net.moves and token not in net.forms[token], "internal token only") + readers = sorted(j for j, row in net.forms.items() if token in row) + require(readers, "nonempty real consumer set") + changed = net.forms.copy() + changed[token] = {donor: -value for donor, value in changed[token].items()} + for node in readers: + changed[node] = {**changed[node], token: -changed[node][token]} + gauged = with_rows(engine, net, changed) + old_order, new_order = net.schedule(), gauged.schedule() + require(old_order == new_order and net.moves == gauged.moves, "same causal order and paid transfers") + + # Verify every scalar incidence c'_(j,k) = s_j c_(j,k) s_k. + # All external signs are +1. Induction in the common schedule therefore + # gives h'_j = s_j h_j on every column, preserving every external row. + for node, row in net.forms.items(): + mutated = changed[node] + require(mutated.keys() == row.keys(), "same scalar incidence") + sign = -1 if node == token else 1 + for donor, coefficient in row.items(): + require(mutated[donor] == sign * coefficient * (-1 if donor == token else 1), + "exact conjugate sign on each scalar incidence") + old, new = column(net, old_order, 17), column(gauged, new_order, 17) + require(set(old) == set(new) and all(new[j] == (-v if j == token else v) for j, v in old.items()), + "observed complete column obeys the algebraic gauge") + original, stale = residual(witness, old), residual(witness, new) + require(original == 0 and stale != 0, "unchanged witness must reject the endpoint-preserving mutation") + verifier = driver.peer_module(peer, reference=True) + verifier.verify_pivot(net, witness) + try: + verifier.verify_pivot(gauged, witness) + except ValueError as error: + require(str(error) == "saved signal identity", "stale witness rejected on the exact saved identity") + else: + raise ValueError("endpoint-preserving mutation accepted the stale saved-signal witness") + return {"orientation": "transpose", "entry_zero_based": 2, "remove": 89622, "pivot": 88983, + "gauge_token": token, "readers": readers, "public_endpoints_equal_by_algebra": True, + "same_order": True, "paid_slots": len(net.moves), "column": 17, + "original_token_value": str(old.get(token, 0)), "gauged_value": str(new.get(token, 0)), + "original_residual_sender_minus_combination_minus_receiver": str(original), + "stale_residual_sender_minus_combination_minus_receiver": str(stale), + "source_checker": "saved signal identity", + "expected_residual_reproduced": (old.get(token, 0), stale) == (2, -8)} + + +def omitted_read_control(driver, peer, candidate, receipt): + record = json.loads(pinned(receipt, RECEIPT)) + require(record["status"] == "PASS_BANK24_WIRE_COMMUTATION" + and record["graphs"]["candidate"]["canonical_sha256"] == CHILD + and record["graphs"]["candidate"]["gzip_sha256"] == CHILD_GZIP, "candidate receipt binding") + raw = gzip.decompress(pinned(candidate, CHILD_GZIP)) + require(sha(raw) == CHILD, "exact final candidate graph") + graph = json.loads(raw) + engine = driver.peer_module(peer) + moves = {key: (start, end) for key, start, end in graph["moves"]} + forms = {key: {donor: Fraction(amount) for donor, amount in row} for key, row in graph["forms"]} + net = engine.Network(graph["first_output"], graph["initial"], graph["final"], moves, forms) + require(net.moves[101174] == (912, 148), "retained exposed outgoing chart route") + owner = 39 + coefficient = forms[101174][97471] + require(coefficient == Fraction(-1, 3), "exact recovery term under test") + after = forms.copy() + after[101174] = {k: v for k, v in forms[101174].items() if k != 97471} + bad = with_rows(engine, net, after) + order, bad_order = net.schedule(), bad.schedule() + require(order == graph["schedule"] and set(bad_order) == set(order) + and len(order) == 7643 and len(moves) == 6142 and net.moves == bad.moves, + "both graphs remain legal at the same paid invoice") + old, new = column(net, order, owner), column(bad, bad_order, owner) + expected, corrupt = old.get(101174, 0), new.get(101174, 0) + difference = corrupt - expected + require(difference == -coefficient * old.get(97471, 0) and difference, + "missing incidence must change the exposed row") + return {"source_slot": 97471, "exposed_slot": 101174, "helper_column": owner, + "removed_coefficient": str(coefficient), "paid_slots": len(moves), "scheduled_nodes": len(order), + "physical_route": [912, 148], "source_column_coefficient": str(old.get(97471, 0)), + "correct_exposed_value": str(expected), "corrupted_exposed_value": str(corrupt), + "corrupted_minus_correct": str(difference), "expected_exposed_change_reproduced": difference == Fraction(1, 12)} + + + +def execute(package, candidate): + peer = package / "peer" + contacts = package / "data/CONTACTS.json" + receipt = package / "evidence/WIRE-RESULT.json" + driver_path = package / "engines/graph.py" + driver = graph_driver(driver_path) + gauge = gauge_control(driver, peer, contacts) + omission = omitted_read_control(driver, peer, candidate, receipt) + result = {"status": "PASS_SAVED_WITNESS_CONTROLS", "candidate": CHILD, + "graph_driver_sha256": DRIVER, "fixed_pivots_sha256": driver.PINS["PIVOTS.json"], + "banked_wire_receipt_sha256": RECEIPT, "endpoint_preserving_gauge": gauge, + "omitted_c_reader_incidence": omission} + require(result == json.loads(pinned(HERE / "EXPECTED.json", EXPECTED)), + "all controls reproduce the exact guarded readback") + return result + + +def main(): + parser = ArgumentParser(description=__doc__) + parser.add_argument("--package", type=Path, default=HERE.parent) + parser.add_argument("--candidate", type=Path, help="use the rebuilt candidate from a retained exact core run") + parser.add_argument("--out", required=True, type=Path, help="fresh JSON result path") + args = parser.parse_args() + require(sys.version_info[:2] == (3, 12) and sys.flags.isolated and sys.dont_write_bytecode and __debug__, + "use Linux Python 3.12 -I -B with assertions") + output = args.out.resolve() + require(not output.exists(), "fresh result file") + package = args.package.resolve() + cap = 2 * 1024**3 + resource.setrlimit(resource.RLIMIT_AS, (cap, cap)) + + def timed_out(_signum, _frame): + raise TimeoutError("saved-witness replay exceeded its 75-second inner wall limit") + + signal.signal(signal.SIGALRM, timed_out) + signal.alarm(75) + try: + with TemporaryDirectory(prefix="banked-witness-") as scratch: + work = Path(scratch) + sys.pycache_prefix = str(work / "fresh-bytecode") + if args.candidate is not None: + result = execute(package, args.candidate.resolve()) + else: + graph_out = work / "graphs" + driver = package / "engines/graph.py" + pinned(driver, DRIVER) + subprocess.run([sys.executable, "-I", "-B", "-X", f"pycache_prefix={work / 'fresh-bytecode'}", + str(driver), "--peer-package", str(package / "peer"), + "--contacts-file", str(package / "data/CONTACTS.json"), + "--materialize-only", str(package / "evidence/WIRE-RESULT.json"), + "--out", str(graph_out)], check=True, timeout=60) + result = execute(package, graph_out / "CANDIDATE-GRAPH.json.gz") + with output.open("x", encoding="utf-8") as stream: + json.dump(result, stream, indent=2, sort_keys=True) + stream.write("\n") + finally: + signal.alarm(0) + print(result["status"], sha(output.read_bytes()), flush=True) + + +if __name__ == "__main__": + main()