diff --git a/docs/multicut-delayed-inverse-checkpoint/EXPECTED_ARTIFACTS.json b/docs/multicut-delayed-inverse-checkpoint/EXPECTED_ARTIFACTS.json new file mode 100644 index 0000000000..5134a6ccca --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/EXPECTED_ARTIFACTS.json @@ -0,0 +1,116 @@ +{ + "artifacts": { + "QA.json": { + "bytes": 7818, + "sha256": "dc935e22f2faf24470d1e127a93c43af605fb22b406dc666d7966bb69f13642e" + }, + "connection_index.json": { + "bytes": 36873, + "sha256": "da88b1f0c87a9e8b92a6c17dc9bb16e4f5de03b2f2b2efa46725f5dd414e515b" + }, + "diagram_model.json": { + "bytes": 39774, + "sha256": "14f67e096fb726a510cfc913479bd215faaadaa601103283afd174756666c9da" + }, + "functional_architecture.pdf": { + "bytes": 855018, + "sha256": "21cce9f08282a13775f6282f0bc9802c6ca6449f9c899bac75d26ca91842f556" + }, + "hierarchy_edges.json": { + "bytes": 60136, + "sha256": "67245af1a5fa49e41e1da97cb91852440462554bad24bc747b8cd606eb9589cc" + }, + "hierarchy_reconciliation.json": { + "bytes": 278089, + "sha256": "1c5c41d6375440ffc3074e39fbca92a785b7b335fc8a09afa4312395904ba8ec" + }, + "requirement_traceability.json": { + "bytes": 3505, + "sha256": "bb30053247fbe438bd0efb43d48821b35b27d866ba1bd3698c02f0dd38ea3f4e" + }, + "scientific_reproduction.json": { + "bytes": 2016, + "sha256": "7e88f2e7bd1989ac4455586ae4fe23d270d9e8eb3f04b8205d5153150c429ee3" + }, + "source_binding.json": { + "bytes": 14978, + "sha256": "239c881aa348e078dc013ac6c8c7c26478ce7dcd1cf80f7c8015171e6106ee12" + }, + "source_index.json": { + "bytes": 14010, + "sha256": "c5a1d01d20529458312806c6271e8d0f9f83dbe6b7083799239b80beb3a0645d" + }, + "summary-functional.svg": { + "bytes": 5124, + "sha256": "478e620e928e23b78d5387de9570abe652380d7b2138fc3330564ba8f861bade" + } + }, + "construction_pr": "https://github.com/CrocSwap/integer-mult-bounds/pull/277", + "public_source_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "publication_allowlist": { + "excluded_generated": [ + "logical_wiring.pdf", + "complete_system.pdf", + "summary-logical.svg", + "logical/combined per-page SVGs" + ], + "excluded_static": [ + "JOINT259_CONNECTION_BANK_MAP.json", + "JOINT259_CONNECTION_EXTRACT.py", + "JOINT259_CONNECTION_MANIFEST.json", + "JOINT259_CONNECTION_README.md", + "JOINT259_CONNECTION_SCHEMA.json", + "JOINT259_CONNECTION_SUMMARY.json", + "JOINT259_CONNECTION_TESTS.py", + "JOINT259_CONNECTION_VALIDATION.json" + ], + "generated_files": [ + "functional_architecture.pdf", + "summary-functional.svg", + "QA.json", + "connection_index.json", + "diagram_model.json", + "hierarchy_edges.json", + "hierarchy_reconciliation.json", + "requirement_traceability.json", + "scientific_reproduction.json", + "source_binding.json", + "source_index.json", + "incremental_receipt.json" + ], + "notes": "Exactly 18 static and 12 generated artifacts; optional linked functional SVG pages remain local.", + "other_exclusions": [ + "private PR draft", + "transport files", + "caches", + "partial event shards", + "giant traces", + "local single-page extract" + ], + "schema": "functional-architecture-publication-allowlist/1", + "static_files": [ + "EXPECTED_ARTIFACTS.json", + "README.md", + "joint259_system_docs_build.py", + "joint259_system_docs_evidence.json", + "joint259_system_docs_hierarchy.json", + "joint259_system_docs_hierarchy_edges.json", + "joint259_system_docs_hierarchy_views.py", + "joint259_system_docs_incremental.py", + "joint259_system_docs_incremental_README.md", + "joint259_system_docs_incremental_test.py", + "joint259_system_docs_incremental_test_report.json", + "joint259_system_docs_independent_review.json", + "joint259_system_docs_independent_review_addendum.json", + "joint259_system_docs_model.json", + "joint259_system_docs_previews.py", + "joint259_system_docs_requirements.txt", + "joint259_system_docs_source_binding.json", + "joint259_system_docs_sources.py" + ] + }, + "runtime_note": "incremental_receipt.json records actual Python/dependency/converter configuration and is intentionally not pinned across runtimes. Linked functional SVG pages are local optional outputs.", + "schema": "functional-architecture-expected-artifacts/2", + "scientific_archive_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "scope": "Architecture reference material with workflow views, not a complete wiring schematic or 51-page diagram. Fresh functional-only tests replace historical 161-page evidence for this closure." +} diff --git a/docs/multicut-delayed-inverse-checkpoint/QA.json b/docs/multicut-delayed-inverse-checkpoint/QA.json new file mode 100644 index 0000000000..8037209a8d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/QA.json @@ -0,0 +1,301 @@ +{ + "Graphviz": "not used", + "block_count": 21, + "byte_identical_rebuilds": true, + "pdfs": { + "functional_architecture.pdf": { + "blocks": [ + "F01", + "F02", + "F03", + "F04", + "F05", + "F06", + "F07", + "F08", + "F09", + "F10", + "F11", + "F12", + "F13", + "F14", + "F15", + "F16", + "F17", + "F18", + "F19", + "F20", + "F21" + ], + "internal_links": 756, + "pages": [ + { + "id": "CONTENTS", + "page": 1, + "title": "The selected construction, at three levels" + }, + { + "id": "H_SYSTEM", + "page": 2, + "title": "Functional hierarchy | integers to exact product" + }, + { + "id": "H_TRANSFORMS", + "page": 3, + "title": "Functional hierarchy | source-transform internals" + }, + { + "id": "FVIEW1", + "page": 4, + "title": "Functional architecture | local supplier" + }, + { + "id": "FVIEW2", + "page": 5, + "title": "Functional architecture | complete conditional closure" + }, + { + "id": "CATALOG", + "page": 6, + "title": "Functional blocks | F01 + F02" + }, + { + "id": "CATALOG02", + "page": 7, + "title": "Functional blocks | F03 + F04" + }, + { + "id": "CATALOG04", + "page": 8, + "title": "Functional blocks | F05 + F06" + }, + { + "id": "CATALOG06", + "page": 9, + "title": "Functional blocks | F07 + F08" + }, + { + "id": "CATALOG08", + "page": 10, + "title": "Functional blocks | F09 + F10" + }, + { + "id": "CATALOG10", + "page": 11, + "title": "Functional blocks | F11 + F12" + }, + { + "id": "CATALOG12", + "page": 12, + "title": "Functional blocks | F13 + F14" + }, + { + "id": "CATALOG14", + "page": 13, + "title": "Functional blocks | F15 + F16" + }, + { + "id": "CATALOG16", + "page": 14, + "title": "Functional blocks | F17 + F18" + }, + { + "id": "CATALOG18", + "page": 15, + "title": "Functional blocks | F19 + F20" + }, + { + "id": "CATALOG20", + "page": 16, + "title": "Functional blocks | F21" + }, + { + "id": "H_CATALOG", + "page": 17, + "title": "Full hierarchy | blocks 1-6 of 87" + }, + { + "id": "H_CATALOG6", + "page": 18, + "title": "Full hierarchy | blocks 7-12 of 87" + }, + { + "id": "H_CATALOG12", + "page": 19, + "title": "Full hierarchy | blocks 13-18 of 87" + }, + { + "id": "H_CATALOG18", + "page": 20, + "title": "Full hierarchy | blocks 19-24 of 87" + }, + { + "id": "H_CATALOG24", + "page": 21, + "title": "Full hierarchy | blocks 25-30 of 87" + }, + { + "id": "H_CATALOG30", + "page": 22, + "title": "Full hierarchy | blocks 31-36 of 87" + }, + { + "id": "H_CATALOG36", + "page": 23, + "title": "Full hierarchy | blocks 37-42 of 87" + }, + { + "id": "H_CATALOG42", + "page": 24, + "title": "Full hierarchy | blocks 43-48 of 87" + }, + { + "id": "H_CATALOG48", + "page": 25, + "title": "Full hierarchy | blocks 49-54 of 87" + }, + { + "id": "H_CATALOG54", + "page": 26, + "title": "Full hierarchy | blocks 55-60 of 87" + }, + { + "id": "H_CATALOG60", + "page": 27, + "title": "Full hierarchy | blocks 61-66 of 87" + }, + { + "id": "H_CATALOG66", + "page": 28, + "title": "Full hierarchy | blocks 67-72 of 87" + }, + { + "id": "H_CATALOG72", + "page": 29, + "title": "Full hierarchy | blocks 73-78 of 87" + }, + { + "id": "H_CATALOG78", + "page": 30, + "title": "Full hierarchy | blocks 79-84 of 87" + }, + { + "id": "H_CATALOG84", + "page": 31, + "title": "Full hierarchy | blocks 85-87 of 87" + }, + { + "id": "H_CONNECTIONS", + "page": 32, + "title": "Preserved interface connections | 1-10 of 53" + }, + { + "id": "H_CONNECTIONS10", + "page": 33, + "title": "Preserved interface connections | 11-20 of 53" + }, + { + "id": "H_CONNECTIONS20", + "page": 34, + "title": "Preserved interface connections | 21-30 of 53" + }, + { + "id": "H_CONNECTIONS30", + "page": 35, + "title": "Preserved interface connections | 31-40 of 53" + }, + { + "id": "H_CONNECTIONS40", + "page": 36, + "title": "Preserved interface connections | 41-50 of 53" + }, + { + "id": "H_CONNECTIONS50", + "page": 37, + "title": "Preserved interface connections | 51-53 of 53" + }, + { + "id": "H_REQUIREMENTS", + "page": 38, + "title": "Original requirement vocabulary | 1-5" + }, + { + "id": "H_REQUIREMENTS5", + "page": 39, + "title": "Original requirement vocabulary | 6-10" + }, + { + "id": "H_REQUIREMENTS10", + "page": 40, + "title": "Original requirement vocabulary | 11-15" + }, + { + "id": "H_REQUIREMENTS15", + "page": 41, + "title": "Original requirement vocabulary | 16-16" + }, + { + "id": "REQUIREMENTS", + "page": 42, + "title": "Requirement traceability | 1-6" + }, + { + "id": "REQUIREMENTS2", + "page": 43, + "title": "Requirement traceability | 7-12" + }, + { + "id": "SOURCES", + "page": 44, + "title": "Source anchors | 1-8" + }, + { + "id": "SOURCES8", + "page": 45, + "title": "Source anchors | 9-16" + }, + { + "id": "SOURCES16", + "page": 46, + "title": "Source anchors | 17-24" + }, + { + "id": "SOURCES24", + "page": 47, + "title": "Source anchors | 25-32" + }, + { + "id": "SOURCES32", + "page": 48, + "title": "Source anchors | 33-40" + }, + { + "id": "SOURCES40", + "page": 49, + "title": "Source anchors | 41-46" + }, + { + "id": "SCOPE", + "page": 50, + "title": "Coverage and publication boundary" + }, + { + "id": "BUILD", + "page": 51, + "title": "Reproduce the architecture reference" + } + ], + "sha256": "21cce9f08282a13775f6282f0bc9802c6ca6449f9c899bac75d26ca91842f556" + } + }, + "requirements": 12, + "science_replay": "not run by documentation build", + "scientific_archive_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "source_anchors": 46, + "source_binding_configuration_sha256": "53acbfc4c9cb93404f951789e866339a315ae84d6218a32932638a6ecc6d961c", + "source_files": 136, + "source_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "status": "PASS_DOCUMENT_STRUCTURE_AND_DETERMINISM", + "typed_block_edges": 53, + "visual_review": "separate; not inferred from structural checks" +} diff --git a/docs/multicut-delayed-inverse-checkpoint/README.md b/docs/multicut-delayed-inverse-checkpoint/README.md new file mode 100644 index 0000000000..61d71cbb68 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/README.md @@ -0,0 +1,68 @@ +# Architecture Reference and Workflow Diagrams for PR #277 + +Architecture reference material for the older verified construction checkpoint +in [PR #277](https://github.com/CrocSwap/integer-mult-bounds/pull/277). +Conditional kappa is 0.000711045547624400; the inspected later PR266 checkpoint +is stronger. + +![High-level architecture overview](summary-functional.svg) + +[Open the architecture reference PDF](functional_architecture.pdf). +Pages 2–5 contain visual architecture and compiler-workflow views. The other +pages contain contents, explanations, requirements, source references and +coverage limits. This is not a 51-page diagram or a complete wiring schematic. +The local compiler workflow has ten connected blocks; the overview shows the +operand-to-product process with separate supplier support. + +## Rebuild the retained architecture + +Use Python 3.11+ and a fresh isolated environment: + + python -m pip install -r joint259_system_docs_requirements.txt + python -B joint259_system_docs_incremental.py --source /path/to/verified/construction --output /new/architecture-build --svg + +Use a new output directory outside the construction package. The optional +--svg flag requires Poppler pdftocairo and creates linked per-page architecture +SVGs locally; they are not published in this PR. Without --svg the build uses +Python only. Graphviz is not used. Reuse a --cache path for later builds, or +use --clean to ignore the cache. + +The default build emits only the functional PDF family and functional summary. +It also emits local source, requirement and dependency indexes. The public output set contains the functional PDF and summary, QA/runtime +receipts, and generated architecture-dependency, source, requirement, model, +hierarchy and scientific-reproduction indexes: exactly 12 generated artifacts +with 18 static build/support files. EXPECTED_ARTIFACTS.json pins eleven hashes; +the incremental runtime receipt is intentionally environment-specific. +The page cache is local build state and is not a proof receipt. + +The retained Python modules and JSON models form the dependency closure for +functional rendering. Separate event/wiring extraction tools, logical/combined render families and +logical previews have been removed from the public package. The original +independent reviews are retained as historical records, with fresh +functional-only test evidence recorded separately. All local originals remain +preserved. + +## Verification and scientific boundary + +The renderer requires deterministic PDF rebuilds, valid block/port relations, +resolved internal links, nonempty page text and unchanged admitted source +files. QA.json records these finite documentation checks. Inspect changed +pages visually; documentation generation does not replay science. + +The public construction manifest is +0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e. +Its 117 numerical pins are unchanged from the 143-file archive that freshly +passed all eight mandatory scientific stages. The scientific archive manifest +is 9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89. +The certificate SHA256 is +7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b. + +The all-size compiler, chart, routing, prime, recovery and analytic interfaces +remain inherited hypotheses. Functional blocks and arrows summarize roles and +compiler flow; they do not establish a complete physical circuit or prove the +unexpanded theorem internals. Source lineage, licenses and contributor credits +remain in the construction's heritage record. + +[Focused cache and navigation verification](joint259_system_docs_incremental_README.md) + + python -B joint259_system_docs_incremental_test.py --source /path/to/verified/construction --raster-dpi 40 diff --git a/docs/multicut-delayed-inverse-checkpoint/connection_index.json b/docs/multicut-delayed-inverse-checkpoint/connection_index.json new file mode 100644 index 0000000000..877494302d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/connection_index.json @@ -0,0 +1,1033 @@ +{ + "block_edges": [ + { + "from": "F01", + "id": "E01", + "in": "recipes", + "out": "recipes", + "to": "F02" + }, + { + "from": "F02", + "id": "E02", + "in": "context", + "out": "context", + "to": "F03" + }, + { + "from": "F03", + "id": "E03", + "in": "word", + "out": "word", + "to": "F04" + }, + { + "from": "F04", + "id": "E04", + "in": "word", + "out": "word", + "to": "F05" + }, + { + "from": "F05", + "id": "E05", + "in": "word", + "out": "word", + "to": "F06" + }, + { + "from": "F06", + "id": "E06", + "in": "base", + "out": "base", + "to": "F07" + }, + { + "from": "F06", + "id": "E07", + "in": "base/cohorts", + "out": "base", + "to": "F08" + }, + { + "from": "F07", + "id": "E08", + "in": "base/cohorts", + "out": "cohorts", + "to": "F08" + }, + { + "from": "F08", + "id": "E09", + "in": "word", + "out": "word", + "to": "F09" + }, + { + "from": "F09", + "id": "E10", + "in": "finalword", + "out": "finalword", + "to": "F10" + }, + { + "from": "F09", + "id": "E11", + "in": "finalword", + "out": "finalword", + "to": "F11" + }, + { + "from": "F11", + "id": "E12", + "in": "global", + "out": "global", + "to": "F12" + }, + { + "from": "F12", + "id": "E13", + "in": "packing", + "out": "packing", + "to": "F13" + }, + { + "from": "F13", + "id": "E14", + "in": "packing/charts", + "out": "normalizers", + "to": "F14" + }, + { + "from": "F11", + "id": "E15", + "in": "global", + "out": "global", + "to": "F14" + }, + { + "from": "F09", + "id": "E16", + "in": "final/global", + "out": "finalword", + "to": "F15" + }, + { + "from": "F11", + "id": "E17", + "in": "final/global", + "out": "global", + "to": "F15" + }, + { + "from": "F01", + "id": "E18", + "in": "complexpins", + "out": "recipes", + "to": "F16" + }, + { + "from": "F14", + "id": "E19", + "in": "literal", + "out": "literal", + "to": "F17" + }, + { + "from": "F16", + "id": "E20", + "in": "complex", + "out": "complex", + "to": "F17" + }, + { + "from": "F17", + "id": "E21", + "in": "rates", + "out": "rates", + "to": "F18" + }, + { + "from": "F18", + "id": "E22", + "in": "ordinary", + "out": "ordinary", + "to": "F19" + }, + { + "from": "F16", + "id": "E23", + "in": "complex", + "out": "guard", + "to": "F19" + }, + { + "from": "F10", + "id": "E24", + "in": "semantics/primes/rates", + "out": "semantics", + "to": "F20" + }, + { + "from": "F15", + "id": "E25", + "in": "semantics/primes/rates", + "out": "primes", + "to": "F20" + }, + { + "from": "F17", + "id": "E26", + "in": "semantics/primes/rates", + "out": "rates", + "to": "F20" + }, + { + "from": "F14", + "id": "E27", + "in": "final/global/literal", + "out": "literal", + "to": "F20" + }, + { + "from": "F19", + "id": "E28", + "in": "math", + "out": "bound", + "to": "F21" + }, + { + "from": "F20", + "id": "E29", + "in": "finite", + "out": "finite", + "to": "F21" + }, + { + "from": "F02", + "id": "E30", + "in": "sourceword", + "out": "sourceword", + "to": "F10" + }, + { + "from": "F01", + "id": "E31", + "in": "selection", + "out": "recipes", + "to": "F05" + }, + { + "from": "F01", + "id": "E32", + "in": "selection", + "out": "recipes", + "to": "F06" + }, + { + "from": "F01", + "id": "E33", + "in": "candidates", + "out": "recipes", + "to": "F07" + }, + { + "from": "F01", + "id": "E34", + "in": "selection", + "out": "recipes", + "to": "F07" + }, + { + "from": "F01", + "id": "E35", + "in": "intervals", + "out": "recipes", + "to": "F08" + }, + { + "from": "F01", + "id": "E36", + "in": "selection", + "out": "recipes", + "to": "F09" + }, + { + "from": "F09", + "id": "E37", + "in": "paths", + "out": "paths", + "to": "F11" + }, + { + "from": "F09", + "id": "E38", + "in": "entrances", + "out": "entrances", + "to": "F12" + }, + { + "from": "F09", + "id": "E39", + "in": "registry", + "out": "registry", + "to": "F13" + }, + { + "from": "F12", + "id": "E40", + "in": "packing/charts", + "out": "packing", + "to": "F14" + }, + { + "from": "F09", + "id": "E41", + "in": "context", + "out": "context", + "to": "F15" + }, + { + "from": "F09", + "id": "E42", + "in": "final/global/literal", + "out": "finalword", + "to": "F20" + }, + { + "from": "F11", + "id": "E43", + "in": "final/global/literal", + "out": "global", + "to": "F20" + }, + { + "from": "F09", + "id": "E44", + "in": "raw", + "out": "raw", + "to": "F21" + }, + { + "from": "F11", + "id": "E45", + "in": "bit", + "out": "global", + "to": "F21" + }, + { + "from": "F15", + "id": "E46", + "in": "bit", + "out": "geometry", + "to": "F21" + }, + { + "from": "F10", + "id": "E47", + "in": "scalar", + "out": "semantics", + "to": "F21" + }, + { + "from": "F15", + "id": "E48", + "in": "primes", + "out": "primes", + "to": "F21" + }, + { + "from": "F14", + "id": "E49", + "in": "banks", + "out": "bankword", + "to": "F21" + }, + { + "from": "F16", + "id": "E50", + "in": "complex", + "out": "complex", + "to": "F21" + }, + { + "from": "F17", + "id": "E51", + "in": "complex", + "out": "rates", + "to": "F19" + }, + { + "from": "F10", + "id": "E52", + "in": "semantics/primes/rates", + "out": "prefix", + "to": "F20" + }, + { + "from": "F10", + "id": "E53", + "in": "scalar", + "out": "prefix", + "to": "F21" + } + ], + "blocks": [ + { + "brief": "Byte-bound recipes and witnesses", + "heritage": "Current composition; imported sources retain their own notices.", + "id": "F01", + "inputs": [ + "package: immutable files and MANIFEST.json" + ], + "invariants": [ + "Manifest SHA256 is 9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89.", + "Assertions enabled; no saved execution receipt is a verifier input." + ], + "name": "Pinned source inputs", + "outputs": [ + "pins: manifest digest and complete file census", + "recipes: exact witness bytes" + ], + "requirements": [ + "R01", + "R11" + ], + "sources": [ + "verify.py|def integrity()", + "PR259-PROVENANCE.md|# PR259 lineage" + ], + "what": "Read the selected package manifest, source527 recipes, PR259 candidate gzip, exact interval and retiming witnesses, and the independent complex certificate. Reject missing, extra, changed or symlinked package files.", + "why": "Every later identity and price must refer to one reproducible construction, rather than a compatible-looking saved histogram." + }, + { + "brief": "Owned sources and arbitrary dirty roles", + "heritage": "Source527 integrates PR210, PR230, PR216, PR207, PR211, PR200 and retained dependencies; exact source for this composition is PR249.", + "id": "F02", + "inputs": [ + "recipes: pinned source and selection files" + ], + "invariants": [ + "v=1,760; h=24; 16,587 independent helper roles; 20,107 formal local columns.", + "Producer context and defining signed decoder remain unchanged by the new hybrid." + ], + "name": "Source527 producer", + "outputs": [ + "context: W, C, regs, borrow, SOURCE_TEXT", + "sourceword: defining scalar program" + ], + "requirements": [ + "R01", + "R02", + "R03" + ], + "sources": [ + "prepare.py|def prepare()", + "source527/word.py|def" + ], + "what": "Reconstruct the fixed source program, physical ownership, source aliases, target aggregation, rank/echelon transforms, borrowed roles and exact frame registry. The 527 source aliases are inherited, not newly searched by this documentation build.", + "why": "The selected transformations need a fully defined semantic producer and ownership map. Arbitrary dirty contents cannot be replaced with zero-filled conveniences." + }, + { + "brief": "Literal MOVE / ADD / COPY / ERASE", + "heritage": "PR234 five-stage/source-bound physical interface, adapted to source527.", + "id": "F03", + "inputs": [ + "context: owned roles, frames and source text" + ], + "invariants": [ + "COPY source is immutable during its window; no stale temporary read or inverse erasure.", + "Every positive MOVE increment and center copy contributes to the paid histogram." + ], + "name": "Physical event emitter", + "outputs": [ + "word: six-field physical records", + "paths: initial/final frames, required uses, categories" + ], + "requirements": [ + "R02", + "R03", + "R04" + ], + "sources": [ + "code/physical527.py|def run(" + ], + "what": "Instrument the reconstructed source program to emit six-integer local records, exact required-use frame paths and tagged scalar events. A single temporary serves 24 copied-center episodes; each has a rank-22 paid copy and 220 scatter reads.", + "why": "A literal physical word binds algebra to movement cost and copied-center lifetime. A scalar identity alone does not price the construction." + }, + { + "brief": "Delete even ADDs; telescope uses", + "heritage": "PR244 parity-filtered/common-frame source lineage; primary bit scalar contract retained.", + "id": "F04", + "inputs": [ + "word: defining physical records" + ], + "invariants": [ + "1,783,196 even ADDs removed; 786,621 surviving ADDs before later transforms.", + "COPY/ERASE, old endpoints, stage boundaries and odd-prime address arithmetic remain intact." + ], + "name": "F2 payload fusion", + "outputs": [ + "word: parity-filtered physical records", + "ledger: recomputed forward/reflected MOVE widths" + ], + "requirements": [ + "R02", + "R03", + "R04", + "R06" + ], + "sources": [ + "parity_transform.py|def run(", + "proof/PARITY-CONTRACT.md|## Operator proof" + ], + "what": "Remove even-coefficient payload additions, preserve all surviving odd additions in order, and fuse monotone frame moves only between surviving uses and required boundaries. Rebuild forward and reflected paid paths.", + "why": "Payload scalars are binary even though address geometry is rational and uses odd primes. Removing an F2 identity can eliminate otherwise unnecessary alignment work." + }, + { + "brief": "Existing common delivery frames", + "heritage": "PR244 and exact PR249 base lineage.", + "id": "F05", + "inputs": [ + "word: parity-filtered records", + "selection: retiming-selection.json" + ], + "invariants": [ + "364 events, including 353 unborrowed pair mixes, use their existing common delivery frames.", + "No change to input/output frames or copied-center lifetimes." + ], + "name": "Inherited 364 retimings", + "outputs": [ + "word: inherited-retimed records", + "ledger: exact local histogram" + ], + "requirements": [ + "R03", + "R04" + ], + "sources": [ + "retiming_transform.py|def run(", + "raw_ledger.py|def rebind_retiming(" + ], + "what": "Apply the already selected 364 common-frame event retimings and reconstruct operand paths and ledgers. These are part of the exact PR249 base and are distinct from the final 25 scalar-keyed retimings.", + "why": "Use legal later common frames to combine paid movement while preserving scalar order, data endpoints and copy lifetimes." + }, + { + "brief": "Exact PR249 compensation transport", + "heritage": "PR249 96495746c786d6d0339dbb38c7f553d4af3f88ed, eumemic.", + "id": "F06", + "inputs": [ + "word: inherited-retimed records", + "selection: regauge-selection.json" + ], + "invariants": [ + "21 added entrances, total added entrance rank 325.", + "Base raw SHA256 2e0bc2a5c54cf8caf26fa30a1a2949702d842f620b28023ca2ba59140ecbed1a.", + "The sixteen extra PR251 entrances are absent." + ], + "name": "21 transported entrances", + "outputs": [ + "base: exact PR249 physical word", + "entrances: actual nonzero input frames" + ], + "requirements": [ + "R02", + "R03", + "R04" + ], + "sources": [ + "regauge_transform.py|def run(", + "raw_ledger.py|def rebind_regauge(" + ], + "what": "Apply the 21 selected PR249 gauge entrances, checking exact compensation transport, untouched helpers before the semantic cut and target-only prefix noise. Keep producer and execution contexts separate.", + "why": "Raise selected helper entrances only when their earlier payload effect can be transported exactly, reducing residual movement without changing the source producer." + }, + { + "brief": "Retained PR259 kernel basis changes", + "heritage": "PR259 a53ec0ca4d59634f16630dd16adf035c9f12595c, Dugongue; candidate gzip included byte-for-byte.", + "id": "F07", + "inputs": [ + "base: PR249 word", + "candidates: 518 exact PR259 cohorts", + "selection: five removed pivots" + ], + "invariants": [ + "Removed pivots: 17207, 17222, 17246, 17255, 17273.", + "Unique pivot support; no pivot/donor collision; basis contained in each actual first-use frame.", + "Within each cut use (dimension,pivot) order; the newly installed cohort-plus-interval entrance rank is 1,422." + ], + "name": "513 multicut cohorts", + "outputs": [ + "cohorts: 513 retained groups", + "word: kernel basis and inverse events", + "entrances: cohort pivot frames" + ], + "requirements": [ + "R01", + "R02", + "R03", + "R04" + ], + "sources": [ + "hybrid_transform.py|def run(", + "hybrid-selection.json|\"removed_pivots\"", + "PR259-PROVENANCE.md|PR249:" + ], + "what": "Read all 518 pinned PR259 candidates, remove the five conflicting rank-11 quartets and install the remaining 513 exact entrance bases. At each declared cut emit donor += pivot, and emit literal inverses at the common full endpoint.", + "why": "Share a pivot contribution through an admissible kernel basis, replacing many target reads with paid, source-bound basis changes." + }, + { + "brief": "Rank-5 / 14 compensation; rank-20 undo", + "heritage": "New source-bound hybrid composition of delayed-inverse intervals with PR259; inherited target-recoding and bank ideas retain credit.", + "id": "F08", + "inputs": [ + "base/cohorts: surviving event word", + "intervals: 14 helpers, 28 target IDs and exact bases" + ], + "invariants": [ + "Every interval has an exact six-column integer identity preserving arbitrary old targets.", + "The 14 signed prefix columns vanish on every retained-cohort operand at all four cuts.", + "No external helper/source observer survives inside a closed interval; newly installed cohort-plus-interval entrance rank is 1,422." + ], + "name": "Seven closed target intervals", + "outputs": [ + "word: seven eight-ADD local replacement blocks", + "entrances: seven rank-5 and seven rank-14 frames" + ], + "requirements": [ + "R02", + "R03", + "R04", + "R06" + ], + "sources": [ + "hybrid_transform.py| local=[", + "PROOF.md|## Kernel and observation boundaries" + ], + "what": "For each interval precondition three targets against a pivot at frame zero, compensate the pivot from low/high helpers at nested rank-5 and rank-14 frames, and undo the target preconditioner at a legal common rank-20 frame.", + "why": "The delayed inverse changes the paid movement partition. Restricting the inverse to the high frame would describe a different family and miss this selected construction." + }, + { + "brief": "Apply PR258/260 gate set once", + "heritage": "PR258 cf82ca09322d1327ab887cfd1cce97591b8d3cfa (amanforindia); PR260 87aa555a455cca84a3e3296ced2440623d39fc4d (Rohan Arun).", + "id": "F09", + "inputs": [ + "word: replacement raw 6ab38175...", + "selection: retiming25-selection.json" + ], + "invariants": [ + "No new chart; scalar/COPY projection and all endpoints byte-identical.", + "Histogram delta: 2:-2, 4:+24, 5:-48, 6:+25, 11:-1, 13:+2, 17:-1.", + "PR258 and PR260 identify the same 25 gates; apply once." + ], + "name": "25 final paid retimings", + "outputs": [ + "finalword: raw acf510b1...", + "ledger: 96,117 calls; rank mass 432,755", + "paths: required-use frame paths after every selected transform", + "registry: actual final frame bases and annihilators", + "entrances: exact nonzero helper input frames", + "context: final execution W/C/role registry", + "raw: fully rebound selected source ledger" + ], + "requirements": [ + "R01", + "R03", + "R04" + ], + "sources": [ + "retiming25.py|def transform(", + "hybrid_transform.py| out,retiming=" + ], + "what": "Match 25 unique scalar keys against their exact old basis hashes, move those events to nominated existing successor frames, and re-emit all operand paths. This adapter runs after the combined kernel/interval replacement.", + "why": "The retiming is a compatible physical improvement, not a second copy of either contributor's same-gate result." + }, + { + "brief": "All 20,107 columns in both directions", + "heritage": "Inherited source decoder plus current hybrid all-column F2 and prefix proof.", + "id": "F10", + "inputs": [ + "finalword: physical records", + "sourceword: unchanged defining program" + ], + "invariants": [ + "760,383 weighted events; 763,023 unit-expanded additions locally.", + "All source and dirty columns restored; arbitrary old target contents preserved.", + "No assertion that the new chosen integer lift equals the old signed decoder endpoint." + ], + "name": "Payload and prefix proof", + "outputs": [ + "semantics: all-column F2 identity and inverse", + "prefix: 73,095 forward; 3,396,290 inverse" + ], + "requirements": [ + "R02", + "R06", + "R11" + ], + "sources": [ + "scalar_check.py|def replay_projection(", + "scalar_check.py|def run(" + ], + "what": "Independently replay the emitted word and literal reverse on all formal F2 source, old-target and arbitrary-dirty columns. Separately compute cancellation-free signed-lift prefix majorants. The unchanged defining source receives its own signed decoder tests and 25 hostile controls.", + "why": "F2 equality, signed source evidence and chosen-lift growth are different claims. Keeping them separate prevents an invalid old-integer-endpoint requirement or an uncharged precision assumption." + }, + { + "brief": "Forward, reflected and boundary streams", + "heritage": "Henry Grant / hcg890 PR234 five-stage architecture and finite interfaces.", + "id": "F11", + "inputs": [ + "finalword: local physical records", + "paths: frame projectors and entrances" + ], + "invariants": [ + "Active pairs: (X1,Y1),(Y1,X1),(X1,Y1),(Y2,X2),(X2,Y2).", + "Every reverse stage copies freshly from the original center; 120 center episodes per replica.", + "Cover expansion is phase-major; terminal exchange is a paid complete-stream permutation." + ], + "name": "Five-stage logical assembly", + "outputs": [ + "global: eight-field logical records and phase schedule", + "completions: 2,827 exact entrance tags", + "ledger: unbanked global histogram" + ], + "requirements": [ + "R02", + "R03", + "R04", + "R05" + ], + "sources": [ + "code/global_lowering.py|class Lowerer:", + "portable_bit.py|def phase_major_templates(" + ], + "what": "Lower the same local word into five stage-specific renamed streams with orientations F,R,F,R,F. After stages 1,2,4, emit exact idle paths and six bridge families; after all stages emit tagged entrance completions and final complete-stream exchanges.", + "why": "Compose the local supplier into the actual width-120 global architecture, binding matrix routes and role names rather than merely multiplying a local histogram by five." + }, + { + "brief": "Forty replicas; 18 full patterns", + "heritage": "Completed-bank lineage includes PR197 and PR237 width-120 precedent; this exact 40-replica packing/assignment is current integration.", + "id": "F12", + "inputs": [ + "entrances: actual helper role census and gauges", + "global: stage/replica coordinates" + ], + "invariants": [ + "867,045 live families; external work separate.", + "3,317,400 stage/replica/role assignments; no rounded, unused or fractional bank capacity.", + "All 18 patterns partition 120 coordinates exactly." + ], + "name": "Literal bank packing", + "outputs": [ + "packing: 117,089 banks per stage", + "stock: 585,445 helper-bank and 281,600 data families" + ], + "requirements": [ + "R04", + "R05" + ], + "sources": [ + "bank_template.py|class BankPlan:", + "bank_check.py|def census(", + "BANK-PROOF.md|## Literal capacity" + ], + "what": "Partition residual helper widths into 18 exact width-120 bank patterns across forty literal replicas. Enumerate every original role occurrence, sorted by residual family, and assign it to one contiguous block in a stage-private bank.", + "why": "Complete banks can replace independent completion calls only when all coordinates and all dirty-role ownership are covered with integer capacity." + }, + { + "brief": "770 chart IDs; exact rational routes", + "heritage": "Actual-form chart implementation in current bank integration; inherited common-ancestor chart theorem remains conditional.", + "id": "F13", + "inputs": [ + "registry: actual source bases and annihilators", + "packing: assigned stage/window/block" + ], + "invariants": [ + "BA=AB=dI; each projector acts correctly on every chart column.", + "At most 576 chart factors; conservative normalizer tariff remains 838.", + "Outside-column witnesses distinguish full routes even when chart bytes coincide." + ], + "name": "Actual-form bank charts", + "outputs": [ + "charts: 770 frame-ID charts, 459 distinct entrance bases", + "normalizers: N and exact inverse factor program" + ], + "requirements": [ + "R03", + "R04", + "R05", + "R07" + ], + "sources": [ + "bank_check.py|def run(", + "bank_template.py| def normalizer(", + "BANK-PROOF.md|## Generic charts" + ], + "what": "For every consumed entrance frame construct residual columns from 15a - sum(a)1, append the actual source basis, compute both exact chart inverses and replay rational factors. Build N=(block+1) Pi embed_stage(B^-1).", + "why": "A correct chart must use the actual form 9I-J. Generic construction handles entrances for which a norm-four rank-one shortcut is false." + }, + { + "brief": "Full (family, route) identity", + "heritage": "Current stage-private adapter; preserves PR234 logical semantics and inherited completed-bank obligations.", + "id": "F14", + "inputs": [ + "global: logical records and completion tags", + "packing/charts: exact addresses and normalizers" + ], + "invariants": [ + "Helper class maps d*tau_i to d*tau_i*N^-1, in that order.", + "All 200 complete stage/replica namespaces injective; ADD/COPY full addresses nonaliasing.", + "Subtract exactly 2,827 tags per replica; retain ordinary children sharing widths 5,10,15,20,50." + ], + "name": "Banked address lowering", + "outputs": [ + "bankword: actual callable banked streams", + "literal: 19,786,600 children; mass 103,869,400" + ], + "requirements": [ + "R02", + "R04", + "R05" + ], + "sources": [ + "bank_template.py| def map_stage_row(", + "bank_template.py| def map_boundary_row(", + "bank_check.py|class BankLowerer:" + ], + "what": "Rewrite only stream operands in the logical records to full banked addresses. Preserve every scalar, frame, projection, stage and reversal field. Match all tagged completions, prove the complete bank endpoint, then subtract their exact counts.", + "why": "Family equality is insufficient for alias testing. Completion savings require a complete bank proof and cannot be implemented as silent opcode suppression." + }, + { + "brief": "Exact frames, paths and determinants", + "heritage": "PR234 geometric interface plus source527/current entrance inventory; retained exact-prime framework.", + "id": "F15", + "inputs": [ + "context: actual bases, frames and routes", + "final/global: consumed inventory" + ], + "invariants": [ + "770 actual entrance frame IDs represent 459 distinct entrance bases; these counts must not be conflated.", + "q>2^80 after fixed exclusions; prime supply is an inherited theorem dependency.", + "Every physical basis plus all defining-source and added-transform bases is covered." + ], + "name": "Geometry and prime inventory", + "outputs": [ + "geometry: exact operator/path checks", + "primes: source-bound determinant inventory and six controls" + ], + "requirements": [ + "R03", + "R07", + "R11" + ], + "sources": [ + "code/geometry527.py|def run(", + "prime_check.py|def run(" + ], + "what": "Check exact rational projectors, all relevant frame inclusions, reflected orientations, routes and terminal boundary identities. Rebuild the inventory of every actual physical or defining-source basis and evaluate exact Gram determinants and admissible-prime exclusions.", + "why": "Equal dimensions or frame IDs do not prove equality of subspaces or legality over an eligible odd-prime address ring." + }, + { + "brief": "Pinned labels, scalar splice and guard", + "heritage": "Jacob Sussman source f010392c923279e3dd59ef3aa5fedad23affc5fd; Avi Eisenberg / ikeboy PR193 helper and retained Claude assistance disclosures.", + "id": "F16", + "inputs": [ + "complexpins: certificate, source theorems and exact matrices" + ], + "invariants": [ + "Rank mass 1,613,040; deficit 3,080; largest child 46.", + "Three forward plus two backward calls use 7,577,864 real-component primitive steps.", + "Denominators 1,2,3,6; no return rounding; source symbolic/analytic theorems remain dependencies." + ], + "name": "Independent complex supplier", + "outputs": [ + "complex: m=110, W=14,692, 361,405 children", + "guard: row coefficient 20,161; exact denominator grid" + ], + "requirements": [ + "R04", + "R06", + "R10", + "R11" + ], + "sources": [ + "portable_complex.py|def run(", + "portable_complex.py|def finite_guard(" + ], + "what": "Reconstruct the pinned complex gcert/1 certificate, both scalar orientations, temporary lifetimes, label/scalar splice, all final climbs and finite precision/row guards. Feed its independent profile into the outer assembly.", + "why": "The integer-multiplication closure uses both a bit supplier and a complex supplier. The complex theorem is not implied by a successful bit-word check." + }, + { + "brief": "Full rare fallback; adjacent grid rejected", + "heritage": "Inherited weighted moment interface; independently implemented current literal repricing.", + "id": "F17", + "inputs": [ + "literal: bit histogram, m=120, W=867,045", + "complex: independent supplier profile" + ], + "invariants": [ + "Bit max child 50 < 120/2; literal deficit 176,000.", + "Fallback adds 10^-16 times 32*m^2 rank-one calls per paid child.", + "Two independent interval engines agree; decimals are display/proposal only." + ], + "name": "Independent directed moments", + "outputs": [ + "rates: strict bit/complex moment enclosures", + "grid: next bit-grid exclusion" + ], + "requirements": [ + "R04", + "R08", + "R09" + ], + "sources": [ + "math_check.py|def run(", + "moment.py|def moment(", + "base_two_moment.py|def moment(" + ], + "what": "Price the literal banked bit histogram and unchanged complex histogram with outward exact-rational bounds. Independently cross-check the bit moment with the base-two engine and include the entire rare fallback allowance.", + "why": "Concavity-based savings are only admissible with a rigorous strict gap and every paid residual, including the low-probability expensive branch." + }, + { + "brief": "Three completed finite levels", + "heritage": "Retained ordinary-bootstrap and restored-row framework, freshly evaluated for this literal construction.", + "id": "F18", + "inputs": [ + "rates: exact coarse bit c and inherited ordinary a0" + ], + "invariants": [ + "Every a_j < a_(j+1) < c < 1-a_(j+1).", + "Each stage includes an inherited-constant-dependent finite cutoff and old-leaf fallback." + ], + "name": "Finite ordinary bootstrap", + "outputs": [ + "ordinary: three-step exact chain and positive gaps" + ], + "requirements": [ + "R08", + "R09" + ], + "sources": [ + "math_check.py| chain=[", + "finite_check.py|chain=[" + ], + "what": "Start with completed ordinary a0=384599/10^10 and repeat a_(j+1)=(1-c)c+c*a_j exactly three times. Require every atom, borrowing, remainder and row-stock gap to remain positive.", + "why": "The bit moment rate is converted to an actual completed ordinary supplier through a finite induction, rather than using an unattained limiting rate." + }, + { + "brief": "Balanced two-supplier closure", + "heritage": "Inherited balanced outer assembly, re-evaluated for current construction.", + "id": "F19", + "inputs": [ + "ordinary: completed bit saving", + "complex: rate and finite row/precision bridge" + ], + "invariants": [ + "kappa decimal 0.000711045547624400; bit is binding.", + "Adjacent kappa grid point is rejected separately.", + "Full all-size, recovery, symbolic and analytic interfaces remain conditional." + ], + "name": "Outer 47-constraint assembly", + "outputs": [ + "bound: kappa=1777613869061/2500000000000000", + "margins: 47 strict constraints and seven margins" + ], + "requirements": [ + "R09", + "R10" + ], + "sources": [ + "outer.py|def assembly(", + "math_check.py| assembly=outer.assembly(" + ], + "what": "Combine the finite ordinary bit saving with the complex saving, row/recovery bridge, eta=10^-12 and stopping fraction beta=10^-9. Check all 47 strict inequalities and seven margins before choosing the admissible rational kappa grid point.", + "why": "A local helper saving is not the integer-multiplication exponent. The full coupled outer system determines which supplier and margin is binding." + }, + { + "brief": "Pay every literal mechanism", + "heritage": "Current finite re-bill over inherited bit/row/copy primitives; exact theorem bytes remain pinned.", + "id": "F20", + "inputs": [ + "final/global/literal: bound physical evidence", + "semantics/primes/rates: proof outputs" + ], + "invariants": [ + "Coefficient below 2^80; prefix is 98 bits and below 2^104.", + "Selector allowance 667,542,305,600 < 2^40; normalizer tariff 838.", + "One-level max-child half-shrink holds; no recursive child hidden in a fixed constant." + ], + "name": "Full finite bill and cutoff", + "outputs": [ + "finite: coefficient 62,644,197,182,478,801", + "prefix: 288305228198350917154735200000", + "cutoff: all inherited constants retained" + ], + "requirements": [ + "R04", + "R06", + "R07", + "R08", + "R09" + ], + "sources": [ + "finite_check.py|def run(", + "finite_check.py|def cutoff_log2(" + ], + "what": "Bind the selected word, tags, global streams, banks, geometry, prime inventory and moment profile. Add scalar primitives, movement, bridges, routes, chart normalizers, selectors, matrix preparation, copy/erase, fallback and restored-row costs.", + "why": "Neither a better histogram nor a displayed finite coefficient can replace the complete accounting and full inherited-constant cutoff rule." + }, + { + "brief": "Eight stages; source unchanged", + "heritage": "Current source-bound verification orchestrator and separately scoped review/admission receipts.", + "id": "F21", + "inputs": [ + "raw: freshly reconstructed source ledger", + "bit: physical/global/geometry proof", + "scalar: F2, signed source and chosen-lift prefix proof", + "primes: current basis/determinant evidence", + "banks: callable full-address banked word and census", + "complex: pinned source, splice and finite guard", + "math: moments, bootstrap and outer47", + "finite: complete bill and cutoff" + ], + "invariants": [ + "Standalone verify.py executes all eight stages; output must be new and outside source.", + "Recorded cloud admission freshly ran changed stages and reused byte/AST-bound unchanged signed-source and complex evidence.", + "Mac standalone reproduction passes all eight stages with 143 source files unchanged; certificate SHA256 7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b. The construction remains mathematically conditional and is below the later PR266 frontier." + ], + "name": "Conditional admission gate", + "outputs": [ + "certificate: conditional finite-construction result", + "verification: timings, stage coverage and immutable-source status" + ], + "requirements": [ + "R01", + "R11", + "R12" + ], + "sources": [ + "verify.py|def main()", + "verify.py|def validate_required(" + ], + "what": "Run all eight mandatory stages from inputs, check complete result coverage and expected rational kappa, then recheck the source manifest before emitting the certificate. Omitted stages must fail hostile controls.", + "why": "The certificate must close every proof port and bind one immutable package. Documentation regeneration is not a substitute for scientific replay." + } + ], + "complete_individual_operation_inventory": false, + "coverage_limits": [ + "Block dependencies describe architecture and compiler/proof flow, not individual physical-operation wires.", + "The visual views and reference indexes do not expand inherited theorem internals." + ], + "level": "functional architecture block dependencies", + "schema": "selected-functional-architecture/1", + "scientific_archive_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "source_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "unexpanded": [ + "all-size weighted compiler internals", + "full GL-cover and common-ancestor charts", + "restored-row and routing primitive internals", + "prime-supply theorem", + "recovery theorem", + "complex symbolic and analytic theorems" + ] +} diff --git a/docs/multicut-delayed-inverse-checkpoint/diagram_model.json b/docs/multicut-delayed-inverse-checkpoint/diagram_model.json new file mode 100644 index 0000000000..75ba7e062d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/diagram_model.json @@ -0,0 +1,1105 @@ +{ + "blocks": [ + { + "brief": "Byte-bound recipes and witnesses", + "heritage": "Current composition; imported sources retain their own notices.", + "id": "F01", + "inputs": [ + "package: immutable files and MANIFEST.json" + ], + "invariants": [ + "Manifest SHA256 is 9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89.", + "Assertions enabled; no saved execution receipt is a verifier input." + ], + "name": "Pinned source inputs", + "outputs": [ + "pins: manifest digest and complete file census", + "recipes: exact witness bytes" + ], + "requirements": [ + "R01", + "R11" + ], + "sources": [ + "verify.py|def integrity()", + "PR259-PROVENANCE.md|# PR259 lineage" + ], + "what": "Read the selected package manifest, source527 recipes, PR259 candidate gzip, exact interval and retiming witnesses, and the independent complex certificate. Reject missing, extra, changed or symlinked package files.", + "why": "Every later identity and price must refer to one reproducible construction, rather than a compatible-looking saved histogram." + }, + { + "brief": "Owned sources and arbitrary dirty roles", + "heritage": "Source527 integrates PR210, PR230, PR216, PR207, PR211, PR200 and retained dependencies; exact source for this composition is PR249.", + "id": "F02", + "inputs": [ + "recipes: pinned source and selection files" + ], + "invariants": [ + "v=1,760; h=24; 16,587 independent helper roles; 20,107 formal local columns.", + "Producer context and defining signed decoder remain unchanged by the new hybrid." + ], + "name": "Source527 producer", + "outputs": [ + "context: W, C, regs, borrow, SOURCE_TEXT", + "sourceword: defining scalar program" + ], + "requirements": [ + "R01", + "R02", + "R03" + ], + "sources": [ + "prepare.py|def prepare()", + "source527/word.py|def" + ], + "what": "Reconstruct the fixed source program, physical ownership, source aliases, target aggregation, rank/echelon transforms, borrowed roles and exact frame registry. The 527 source aliases are inherited, not newly searched by this documentation build.", + "why": "The selected transformations need a fully defined semantic producer and ownership map. Arbitrary dirty contents cannot be replaced with zero-filled conveniences." + }, + { + "brief": "Literal MOVE / ADD / COPY / ERASE", + "heritage": "PR234 five-stage/source-bound physical interface, adapted to source527.", + "id": "F03", + "inputs": [ + "context: owned roles, frames and source text" + ], + "invariants": [ + "COPY source is immutable during its window; no stale temporary read or inverse erasure.", + "Every positive MOVE increment and center copy contributes to the paid histogram." + ], + "name": "Physical event emitter", + "outputs": [ + "word: six-field physical records", + "paths: initial/final frames, required uses, categories" + ], + "requirements": [ + "R02", + "R03", + "R04" + ], + "sources": [ + "code/physical527.py|def run(" + ], + "what": "Instrument the reconstructed source program to emit six-integer local records, exact required-use frame paths and tagged scalar events. A single temporary serves 24 copied-center episodes; each has a rank-22 paid copy and 220 scatter reads.", + "why": "A literal physical word binds algebra to movement cost and copied-center lifetime. A scalar identity alone does not price the construction." + }, + { + "brief": "Delete even ADDs; telescope uses", + "heritage": "PR244 parity-filtered/common-frame source lineage; primary bit scalar contract retained.", + "id": "F04", + "inputs": [ + "word: defining physical records" + ], + "invariants": [ + "1,783,196 even ADDs removed; 786,621 surviving ADDs before later transforms.", + "COPY/ERASE, old endpoints, stage boundaries and odd-prime address arithmetic remain intact." + ], + "name": "F2 payload fusion", + "outputs": [ + "word: parity-filtered physical records", + "ledger: recomputed forward/reflected MOVE widths" + ], + "requirements": [ + "R02", + "R03", + "R04", + "R06" + ], + "sources": [ + "parity_transform.py|def run(", + "proof/PARITY-CONTRACT.md|## Operator proof" + ], + "what": "Remove even-coefficient payload additions, preserve all surviving odd additions in order, and fuse monotone frame moves only between surviving uses and required boundaries. Rebuild forward and reflected paid paths.", + "why": "Payload scalars are binary even though address geometry is rational and uses odd primes. Removing an F2 identity can eliminate otherwise unnecessary alignment work." + }, + { + "brief": "Existing common delivery frames", + "heritage": "PR244 and exact PR249 base lineage.", + "id": "F05", + "inputs": [ + "word: parity-filtered records", + "selection: retiming-selection.json" + ], + "invariants": [ + "364 events, including 353 unborrowed pair mixes, use their existing common delivery frames.", + "No change to input/output frames or copied-center lifetimes." + ], + "name": "Inherited 364 retimings", + "outputs": [ + "word: inherited-retimed records", + "ledger: exact local histogram" + ], + "requirements": [ + "R03", + "R04" + ], + "sources": [ + "retiming_transform.py|def run(", + "raw_ledger.py|def rebind_retiming(" + ], + "what": "Apply the already selected 364 common-frame event retimings and reconstruct operand paths and ledgers. These are part of the exact PR249 base and are distinct from the final 25 scalar-keyed retimings.", + "why": "Use legal later common frames to combine paid movement while preserving scalar order, data endpoints and copy lifetimes." + }, + { + "brief": "Exact PR249 compensation transport", + "heritage": "PR249 96495746c786d6d0339dbb38c7f553d4af3f88ed, eumemic.", + "id": "F06", + "inputs": [ + "word: inherited-retimed records", + "selection: regauge-selection.json" + ], + "invariants": [ + "21 added entrances, total added entrance rank 325.", + "Base raw SHA256 2e0bc2a5c54cf8caf26fa30a1a2949702d842f620b28023ca2ba59140ecbed1a.", + "The sixteen extra PR251 entrances are absent." + ], + "name": "21 transported entrances", + "outputs": [ + "base: exact PR249 physical word", + "entrances: actual nonzero input frames" + ], + "requirements": [ + "R02", + "R03", + "R04" + ], + "sources": [ + "regauge_transform.py|def run(", + "raw_ledger.py|def rebind_regauge(" + ], + "what": "Apply the 21 selected PR249 gauge entrances, checking exact compensation transport, untouched helpers before the semantic cut and target-only prefix noise. Keep producer and execution contexts separate.", + "why": "Raise selected helper entrances only when their earlier payload effect can be transported exactly, reducing residual movement without changing the source producer." + }, + { + "brief": "Retained PR259 kernel basis changes", + "heritage": "PR259 a53ec0ca4d59634f16630dd16adf035c9f12595c, Dugongue; candidate gzip included byte-for-byte.", + "id": "F07", + "inputs": [ + "base: PR249 word", + "candidates: 518 exact PR259 cohorts", + "selection: five removed pivots" + ], + "invariants": [ + "Removed pivots: 17207, 17222, 17246, 17255, 17273.", + "Unique pivot support; no pivot/donor collision; basis contained in each actual first-use frame.", + "Within each cut use (dimension,pivot) order; the newly installed cohort-plus-interval entrance rank is 1,422." + ], + "name": "513 multicut cohorts", + "outputs": [ + "cohorts: 513 retained groups", + "word: kernel basis and inverse events", + "entrances: cohort pivot frames" + ], + "requirements": [ + "R01", + "R02", + "R03", + "R04" + ], + "sources": [ + "hybrid_transform.py|def run(", + "hybrid-selection.json|\"removed_pivots\"", + "PR259-PROVENANCE.md|PR249:" + ], + "what": "Read all 518 pinned PR259 candidates, remove the five conflicting rank-11 quartets and install the remaining 513 exact entrance bases. At each declared cut emit donor += pivot, and emit literal inverses at the common full endpoint.", + "why": "Share a pivot contribution through an admissible kernel basis, replacing many target reads with paid, source-bound basis changes." + }, + { + "brief": "Rank-5 / 14 compensation; rank-20 undo", + "heritage": "New source-bound hybrid composition of delayed-inverse intervals with PR259; inherited target-recoding and bank ideas retain credit.", + "id": "F08", + "inputs": [ + "base/cohorts: surviving event word", + "intervals: 14 helpers, 28 target IDs and exact bases" + ], + "invariants": [ + "Every interval has an exact six-column integer identity preserving arbitrary old targets.", + "The 14 signed prefix columns vanish on every retained-cohort operand at all four cuts.", + "No external helper/source observer survives inside a closed interval; newly installed cohort-plus-interval entrance rank is 1,422." + ], + "name": "Seven closed target intervals", + "outputs": [ + "word: seven eight-ADD local replacement blocks", + "entrances: seven rank-5 and seven rank-14 frames" + ], + "requirements": [ + "R02", + "R03", + "R04", + "R06" + ], + "sources": [ + "hybrid_transform.py| local=[", + "PROOF.md|## Kernel and observation boundaries" + ], + "what": "For each interval precondition three targets against a pivot at frame zero, compensate the pivot from low/high helpers at nested rank-5 and rank-14 frames, and undo the target preconditioner at a legal common rank-20 frame.", + "why": "The delayed inverse changes the paid movement partition. Restricting the inverse to the high frame would describe a different family and miss this selected construction." + }, + { + "brief": "Apply PR258/260 gate set once", + "heritage": "PR258 cf82ca09322d1327ab887cfd1cce97591b8d3cfa (amanforindia); PR260 87aa555a455cca84a3e3296ced2440623d39fc4d (Rohan Arun).", + "id": "F09", + "inputs": [ + "word: replacement raw 6ab38175...", + "selection: retiming25-selection.json" + ], + "invariants": [ + "No new chart; scalar/COPY projection and all endpoints byte-identical.", + "Histogram delta: 2:-2, 4:+24, 5:-48, 6:+25, 11:-1, 13:+2, 17:-1.", + "PR258 and PR260 identify the same 25 gates; apply once." + ], + "name": "25 final paid retimings", + "outputs": [ + "finalword: raw acf510b1...", + "ledger: 96,117 calls; rank mass 432,755", + "paths: required-use frame paths after every selected transform", + "registry: actual final frame bases and annihilators", + "entrances: exact nonzero helper input frames", + "context: final execution W/C/role registry", + "raw: fully rebound selected source ledger" + ], + "requirements": [ + "R01", + "R03", + "R04" + ], + "sources": [ + "retiming25.py|def transform(", + "hybrid_transform.py| out,retiming=" + ], + "what": "Match 25 unique scalar keys against their exact old basis hashes, move those events to nominated existing successor frames, and re-emit all operand paths. This adapter runs after the combined kernel/interval replacement.", + "why": "The retiming is a compatible physical improvement, not a second copy of either contributor's same-gate result." + }, + { + "brief": "All 20,107 columns in both directions", + "heritage": "Inherited source decoder plus current hybrid all-column F2 and prefix proof.", + "id": "F10", + "inputs": [ + "finalword: physical records", + "sourceword: unchanged defining program" + ], + "invariants": [ + "760,383 weighted events; 763,023 unit-expanded additions locally.", + "All source and dirty columns restored; arbitrary old target contents preserved.", + "No assertion that the new chosen integer lift equals the old signed decoder endpoint." + ], + "name": "Payload and prefix proof", + "outputs": [ + "semantics: all-column F2 identity and inverse", + "prefix: 73,095 forward; 3,396,290 inverse" + ], + "requirements": [ + "R02", + "R06", + "R11" + ], + "sources": [ + "scalar_check.py|def replay_projection(", + "scalar_check.py|def run(" + ], + "what": "Independently replay the emitted word and literal reverse on all formal F2 source, old-target and arbitrary-dirty columns. Separately compute cancellation-free signed-lift prefix majorants. The unchanged defining source receives its own signed decoder tests and 25 hostile controls.", + "why": "F2 equality, signed source evidence and chosen-lift growth are different claims. Keeping them separate prevents an invalid old-integer-endpoint requirement or an uncharged precision assumption." + }, + { + "brief": "Forward, reflected and boundary streams", + "heritage": "Henry Grant / hcg890 PR234 five-stage architecture and finite interfaces.", + "id": "F11", + "inputs": [ + "finalword: local physical records", + "paths: frame projectors and entrances" + ], + "invariants": [ + "Active pairs: (X1,Y1),(Y1,X1),(X1,Y1),(Y2,X2),(X2,Y2).", + "Every reverse stage copies freshly from the original center; 120 center episodes per replica.", + "Cover expansion is phase-major; terminal exchange is a paid complete-stream permutation." + ], + "name": "Five-stage logical assembly", + "outputs": [ + "global: eight-field logical records and phase schedule", + "completions: 2,827 exact entrance tags", + "ledger: unbanked global histogram" + ], + "requirements": [ + "R02", + "R03", + "R04", + "R05" + ], + "sources": [ + "code/global_lowering.py|class Lowerer:", + "portable_bit.py|def phase_major_templates(" + ], + "what": "Lower the same local word into five stage-specific renamed streams with orientations F,R,F,R,F. After stages 1,2,4, emit exact idle paths and six bridge families; after all stages emit tagged entrance completions and final complete-stream exchanges.", + "why": "Compose the local supplier into the actual width-120 global architecture, binding matrix routes and role names rather than merely multiplying a local histogram by five." + }, + { + "brief": "Forty replicas; 18 full patterns", + "heritage": "Completed-bank lineage includes PR197 and PR237 width-120 precedent; this exact 40-replica packing/assignment is current integration.", + "id": "F12", + "inputs": [ + "entrances: actual helper role census and gauges", + "global: stage/replica coordinates" + ], + "invariants": [ + "867,045 live families; external work separate.", + "3,317,400 stage/replica/role assignments; no rounded, unused or fractional bank capacity.", + "All 18 patterns partition 120 coordinates exactly." + ], + "name": "Literal bank packing", + "outputs": [ + "packing: 117,089 banks per stage", + "stock: 585,445 helper-bank and 281,600 data families" + ], + "requirements": [ + "R04", + "R05" + ], + "sources": [ + "bank_template.py|class BankPlan:", + "bank_check.py|def census(", + "BANK-PROOF.md|## Literal capacity" + ], + "what": "Partition residual helper widths into 18 exact width-120 bank patterns across forty literal replicas. Enumerate every original role occurrence, sorted by residual family, and assign it to one contiguous block in a stage-private bank.", + "why": "Complete banks can replace independent completion calls only when all coordinates and all dirty-role ownership are covered with integer capacity." + }, + { + "brief": "770 chart IDs; exact rational routes", + "heritage": "Actual-form chart implementation in current bank integration; inherited common-ancestor chart theorem remains conditional.", + "id": "F13", + "inputs": [ + "registry: actual source bases and annihilators", + "packing: assigned stage/window/block" + ], + "invariants": [ + "BA=AB=dI; each projector acts correctly on every chart column.", + "At most 576 chart factors; conservative normalizer tariff remains 838.", + "Outside-column witnesses distinguish full routes even when chart bytes coincide." + ], + "name": "Actual-form bank charts", + "outputs": [ + "charts: 770 frame-ID charts, 459 distinct entrance bases", + "normalizers: N and exact inverse factor program" + ], + "requirements": [ + "R03", + "R04", + "R05", + "R07" + ], + "sources": [ + "bank_check.py|def run(", + "bank_template.py| def normalizer(", + "BANK-PROOF.md|## Generic charts" + ], + "what": "For every consumed entrance frame construct residual columns from 15a - sum(a)1, append the actual source basis, compute both exact chart inverses and replay rational factors. Build N=(block+1) Pi embed_stage(B^-1).", + "why": "A correct chart must use the actual form 9I-J. Generic construction handles entrances for which a norm-four rank-one shortcut is false." + }, + { + "brief": "Full (family, route) identity", + "heritage": "Current stage-private adapter; preserves PR234 logical semantics and inherited completed-bank obligations.", + "id": "F14", + "inputs": [ + "global: logical records and completion tags", + "packing/charts: exact addresses and normalizers" + ], + "invariants": [ + "Helper class maps d*tau_i to d*tau_i*N^-1, in that order.", + "All 200 complete stage/replica namespaces injective; ADD/COPY full addresses nonaliasing.", + "Subtract exactly 2,827 tags per replica; retain ordinary children sharing widths 5,10,15,20,50." + ], + "name": "Banked address lowering", + "outputs": [ + "bankword: actual callable banked streams", + "literal: 19,786,600 children; mass 103,869,400" + ], + "requirements": [ + "R02", + "R04", + "R05" + ], + "sources": [ + "bank_template.py| def map_stage_row(", + "bank_template.py| def map_boundary_row(", + "bank_check.py|class BankLowerer:" + ], + "what": "Rewrite only stream operands in the logical records to full banked addresses. Preserve every scalar, frame, projection, stage and reversal field. Match all tagged completions, prove the complete bank endpoint, then subtract their exact counts.", + "why": "Family equality is insufficient for alias testing. Completion savings require a complete bank proof and cannot be implemented as silent opcode suppression." + }, + { + "brief": "Exact frames, paths and determinants", + "heritage": "PR234 geometric interface plus source527/current entrance inventory; retained exact-prime framework.", + "id": "F15", + "inputs": [ + "context: actual bases, frames and routes", + "final/global: consumed inventory" + ], + "invariants": [ + "770 actual entrance frame IDs represent 459 distinct entrance bases; these counts must not be conflated.", + "q>2^80 after fixed exclusions; prime supply is an inherited theorem dependency.", + "Every physical basis plus all defining-source and added-transform bases is covered." + ], + "name": "Geometry and prime inventory", + "outputs": [ + "geometry: exact operator/path checks", + "primes: source-bound determinant inventory and six controls" + ], + "requirements": [ + "R03", + "R07", + "R11" + ], + "sources": [ + "code/geometry527.py|def run(", + "prime_check.py|def run(" + ], + "what": "Check exact rational projectors, all relevant frame inclusions, reflected orientations, routes and terminal boundary identities. Rebuild the inventory of every actual physical or defining-source basis and evaluate exact Gram determinants and admissible-prime exclusions.", + "why": "Equal dimensions or frame IDs do not prove equality of subspaces or legality over an eligible odd-prime address ring." + }, + { + "brief": "Pinned labels, scalar splice and guard", + "heritage": "Jacob Sussman source f010392c923279e3dd59ef3aa5fedad23affc5fd; Avi Eisenberg / ikeboy PR193 helper and retained Claude assistance disclosures.", + "id": "F16", + "inputs": [ + "complexpins: certificate, source theorems and exact matrices" + ], + "invariants": [ + "Rank mass 1,613,040; deficit 3,080; largest child 46.", + "Three forward plus two backward calls use 7,577,864 real-component primitive steps.", + "Denominators 1,2,3,6; no return rounding; source symbolic/analytic theorems remain dependencies." + ], + "name": "Independent complex supplier", + "outputs": [ + "complex: m=110, W=14,692, 361,405 children", + "guard: row coefficient 20,161; exact denominator grid" + ], + "requirements": [ + "R04", + "R06", + "R10", + "R11" + ], + "sources": [ + "portable_complex.py|def run(", + "portable_complex.py|def finite_guard(" + ], + "what": "Reconstruct the pinned complex gcert/1 certificate, both scalar orientations, temporary lifetimes, label/scalar splice, all final climbs and finite precision/row guards. Feed its independent profile into the outer assembly.", + "why": "The integer-multiplication closure uses both a bit supplier and a complex supplier. The complex theorem is not implied by a successful bit-word check." + }, + { + "brief": "Full rare fallback; adjacent grid rejected", + "heritage": "Inherited weighted moment interface; independently implemented current literal repricing.", + "id": "F17", + "inputs": [ + "literal: bit histogram, m=120, W=867,045", + "complex: independent supplier profile" + ], + "invariants": [ + "Bit max child 50 < 120/2; literal deficit 176,000.", + "Fallback adds 10^-16 times 32*m^2 rank-one calls per paid child.", + "Two independent interval engines agree; decimals are display/proposal only." + ], + "name": "Independent directed moments", + "outputs": [ + "rates: strict bit/complex moment enclosures", + "grid: next bit-grid exclusion" + ], + "requirements": [ + "R04", + "R08", + "R09" + ], + "sources": [ + "math_check.py|def run(", + "moment.py|def moment(", + "base_two_moment.py|def moment(" + ], + "what": "Price the literal banked bit histogram and unchanged complex histogram with outward exact-rational bounds. Independently cross-check the bit moment with the base-two engine and include the entire rare fallback allowance.", + "why": "Concavity-based savings are only admissible with a rigorous strict gap and every paid residual, including the low-probability expensive branch." + }, + { + "brief": "Three completed finite levels", + "heritage": "Retained ordinary-bootstrap and restored-row framework, freshly evaluated for this literal construction.", + "id": "F18", + "inputs": [ + "rates: exact coarse bit c and inherited ordinary a0" + ], + "invariants": [ + "Every a_j < a_(j+1) < c < 1-a_(j+1).", + "Each stage includes an inherited-constant-dependent finite cutoff and old-leaf fallback." + ], + "name": "Finite ordinary bootstrap", + "outputs": [ + "ordinary: three-step exact chain and positive gaps" + ], + "requirements": [ + "R08", + "R09" + ], + "sources": [ + "math_check.py| chain=[", + "finite_check.py|chain=[" + ], + "what": "Start with completed ordinary a0=384599/10^10 and repeat a_(j+1)=(1-c)c+c*a_j exactly three times. Require every atom, borrowing, remainder and row-stock gap to remain positive.", + "why": "The bit moment rate is converted to an actual completed ordinary supplier through a finite induction, rather than using an unattained limiting rate." + }, + { + "brief": "Balanced two-supplier closure", + "heritage": "Inherited balanced outer assembly, re-evaluated for current construction.", + "id": "F19", + "inputs": [ + "ordinary: completed bit saving", + "complex: rate and finite row/precision bridge" + ], + "invariants": [ + "kappa decimal 0.000711045547624400; bit is binding.", + "Adjacent kappa grid point is rejected separately.", + "Full all-size, recovery, symbolic and analytic interfaces remain conditional." + ], + "name": "Outer 47-constraint assembly", + "outputs": [ + "bound: kappa=1777613869061/2500000000000000", + "margins: 47 strict constraints and seven margins" + ], + "requirements": [ + "R09", + "R10" + ], + "sources": [ + "outer.py|def assembly(", + "math_check.py| assembly=outer.assembly(" + ], + "what": "Combine the finite ordinary bit saving with the complex saving, row/recovery bridge, eta=10^-12 and stopping fraction beta=10^-9. Check all 47 strict inequalities and seven margins before choosing the admissible rational kappa grid point.", + "why": "A local helper saving is not the integer-multiplication exponent. The full coupled outer system determines which supplier and margin is binding." + }, + { + "brief": "Pay every literal mechanism", + "heritage": "Current finite re-bill over inherited bit/row/copy primitives; exact theorem bytes remain pinned.", + "id": "F20", + "inputs": [ + "final/global/literal: bound physical evidence", + "semantics/primes/rates: proof outputs" + ], + "invariants": [ + "Coefficient below 2^80; prefix is 98 bits and below 2^104.", + "Selector allowance 667,542,305,600 < 2^40; normalizer tariff 838.", + "One-level max-child half-shrink holds; no recursive child hidden in a fixed constant." + ], + "name": "Full finite bill and cutoff", + "outputs": [ + "finite: coefficient 62,644,197,182,478,801", + "prefix: 288305228198350917154735200000", + "cutoff: all inherited constants retained" + ], + "requirements": [ + "R04", + "R06", + "R07", + "R08", + "R09" + ], + "sources": [ + "finite_check.py|def run(", + "finite_check.py|def cutoff_log2(" + ], + "what": "Bind the selected word, tags, global streams, banks, geometry, prime inventory and moment profile. Add scalar primitives, movement, bridges, routes, chart normalizers, selectors, matrix preparation, copy/erase, fallback and restored-row costs.", + "why": "Neither a better histogram nor a displayed finite coefficient can replace the complete accounting and full inherited-constant cutoff rule." + }, + { + "brief": "Eight stages; source unchanged", + "heritage": "Current source-bound verification orchestrator and separately scoped review/admission receipts.", + "id": "F21", + "inputs": [ + "raw: freshly reconstructed source ledger", + "bit: physical/global/geometry proof", + "scalar: F2, signed source and chosen-lift prefix proof", + "primes: current basis/determinant evidence", + "banks: callable full-address banked word and census", + "complex: pinned source, splice and finite guard", + "math: moments, bootstrap and outer47", + "finite: complete bill and cutoff" + ], + "invariants": [ + "Standalone verify.py executes all eight stages; output must be new and outside source.", + "Recorded cloud admission freshly ran changed stages and reused byte/AST-bound unchanged signed-source and complex evidence.", + "Mac standalone reproduction passes all eight stages with 143 source files unchanged; certificate SHA256 7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b. The construction remains mathematically conditional and is below the later PR266 frontier." + ], + "name": "Conditional admission gate", + "outputs": [ + "certificate: conditional finite-construction result", + "verification: timings, stage coverage and immutable-source status" + ], + "requirements": [ + "R01", + "R11", + "R12" + ], + "sources": [ + "verify.py|def main()", + "verify.py|def validate_required(" + ], + "what": "Run all eight mandatory stages from inputs, check complete result coverage and expected rational kappa, then recheck the source manifest before emitting the certificate. Omitted stages must fail hostile controls.", + "why": "The certificate must close every proof port and bind one immutable package. Documentation regeneration is not a substitute for scientific replay." + } + ], + "edges": [ + { + "from": "F01", + "id": "E01", + "in": "recipes", + "out": "recipes", + "to": "F02" + }, + { + "from": "F02", + "id": "E02", + "in": "context", + "out": "context", + "to": "F03" + }, + { + "from": "F03", + "id": "E03", + "in": "word", + "out": "word", + "to": "F04" + }, + { + "from": "F04", + "id": "E04", + "in": "word", + "out": "word", + "to": "F05" + }, + { + "from": "F05", + "id": "E05", + "in": "word", + "out": "word", + "to": "F06" + }, + { + "from": "F06", + "id": "E06", + "in": "base", + "out": "base", + "to": "F07" + }, + { + "from": "F06", + "id": "E07", + "in": "base/cohorts", + "out": "base", + "to": "F08" + }, + { + "from": "F07", + "id": "E08", + "in": "base/cohorts", + "out": "cohorts", + "to": "F08" + }, + { + "from": "F08", + "id": "E09", + "in": "word", + "out": "word", + "to": "F09" + }, + { + "from": "F09", + "id": "E10", + "in": "finalword", + "out": "finalword", + "to": "F10" + }, + { + "from": "F09", + "id": "E11", + "in": "finalword", + "out": "finalword", + "to": "F11" + }, + { + "from": "F11", + "id": "E12", + "in": "global", + "out": "global", + "to": "F12" + }, + { + "from": "F12", + "id": "E13", + "in": "packing", + "out": "packing", + "to": "F13" + }, + { + "from": "F13", + "id": "E14", + "in": "packing/charts", + "out": "normalizers", + "to": "F14" + }, + { + "from": "F11", + "id": "E15", + "in": "global", + "out": "global", + "to": "F14" + }, + { + "from": "F09", + "id": "E16", + "in": "final/global", + "out": "finalword", + "to": "F15" + }, + { + "from": "F11", + "id": "E17", + "in": "final/global", + "out": "global", + "to": "F15" + }, + { + "from": "F01", + "id": "E18", + "in": "complexpins", + "out": "recipes", + "to": "F16" + }, + { + "from": "F14", + "id": "E19", + "in": "literal", + "out": "literal", + "to": "F17" + }, + { + "from": "F16", + "id": "E20", + "in": "complex", + "out": "complex", + "to": "F17" + }, + { + "from": "F17", + "id": "E21", + "in": "rates", + "out": "rates", + "to": "F18" + }, + { + "from": "F18", + "id": "E22", + "in": "ordinary", + "out": "ordinary", + "to": "F19" + }, + { + "from": "F16", + "id": "E23", + "in": "complex", + "out": "guard", + "to": "F19" + }, + { + "from": "F10", + "id": "E24", + "in": "semantics/primes/rates", + "out": "semantics", + "to": "F20" + }, + { + "from": "F15", + "id": "E25", + "in": "semantics/primes/rates", + "out": "primes", + "to": "F20" + }, + { + "from": "F17", + "id": "E26", + "in": "semantics/primes/rates", + "out": "rates", + "to": "F20" + }, + { + "from": "F14", + "id": "E27", + "in": "final/global/literal", + "out": "literal", + "to": "F20" + }, + { + "from": "F19", + "id": "E28", + "in": "math", + "out": "bound", + "to": "F21" + }, + { + "from": "F20", + "id": "E29", + "in": "finite", + "out": "finite", + "to": "F21" + }, + { + "from": "F02", + "id": "E30", + "in": "sourceword", + "out": "sourceword", + "to": "F10" + }, + { + "from": "F01", + "id": "E31", + "in": "selection", + "out": "recipes", + "to": "F05" + }, + { + "from": "F01", + "id": "E32", + "in": "selection", + "out": "recipes", + "to": "F06" + }, + { + "from": "F01", + "id": "E33", + "in": "candidates", + "out": "recipes", + "to": "F07" + }, + { + "from": "F01", + "id": "E34", + "in": "selection", + "out": "recipes", + "to": "F07" + }, + { + "from": "F01", + "id": "E35", + "in": "intervals", + "out": "recipes", + "to": "F08" + }, + { + "from": "F01", + "id": "E36", + "in": "selection", + "out": "recipes", + "to": "F09" + }, + { + "from": "F09", + "id": "E37", + "in": "paths", + "out": "paths", + "to": "F11" + }, + { + "from": "F09", + "id": "E38", + "in": "entrances", + "out": "entrances", + "to": "F12" + }, + { + "from": "F09", + "id": "E39", + "in": "registry", + "out": "registry", + "to": "F13" + }, + { + "from": "F12", + "id": "E40", + "in": "packing/charts", + "out": "packing", + "to": "F14" + }, + { + "from": "F09", + "id": "E41", + "in": "context", + "out": "context", + "to": "F15" + }, + { + "from": "F09", + "id": "E42", + "in": "final/global/literal", + "out": "finalword", + "to": "F20" + }, + { + "from": "F11", + "id": "E43", + "in": "final/global/literal", + "out": "global", + "to": "F20" + }, + { + "from": "F09", + "id": "E44", + "in": "raw", + "out": "raw", + "to": "F21" + }, + { + "from": "F11", + "id": "E45", + "in": "bit", + "out": "global", + "to": "F21" + }, + { + "from": "F15", + "id": "E46", + "in": "bit", + "out": "geometry", + "to": "F21" + }, + { + "from": "F10", + "id": "E47", + "in": "scalar", + "out": "semantics", + "to": "F21" + }, + { + "from": "F15", + "id": "E48", + "in": "primes", + "out": "primes", + "to": "F21" + }, + { + "from": "F14", + "id": "E49", + "in": "banks", + "out": "bankword", + "to": "F21" + }, + { + "from": "F16", + "id": "E50", + "in": "complex", + "out": "complex", + "to": "F21" + }, + { + "from": "F17", + "id": "E51", + "in": "complex", + "out": "rates", + "to": "F19" + }, + { + "from": "F10", + "id": "E52", + "in": "semantics/primes/rates", + "out": "prefix", + "to": "F20" + }, + { + "from": "F10", + "id": "E53", + "in": "scalar", + "out": "prefix", + "to": "F21" + } + ], + "evidence_status": { + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "controls": { + "omitted_stages": 8, + "primes": 6, + "scalar": 25 + }, + "mac_reproduction": "PASS all eight mandatory stages", + "provenance": "Verified FINAL_REPRODUCTION_RECEIPT.json SHA256 327b8b0d5b7b27bc3f25e17222168262671364a3a698e4915a249bed863a8b06; sanitized facts in joint259_system_docs_evidence.json", + "publication": "Verified checkpoint; later PR266 is stronger. Construction PR #277: https://github.com/CrocSwap/integer-mult-bounds/pull/277.", + "python": "3.14.2", + "seconds": 580.9, + "source_files_unchanged": 143, + "sympy": "1.14.0" + }, + "external_inputs": [ + { + "block": "F01", + "definition": "Complete immutable source package with the selected manifest.", + "kind": "pinned_source_files", + "port": "package" + } + ], + "final_raw_sha256": "acf510b1377a6bd96eea50577de1aa049382499335fa7e5cac9b0300ecb377c7", + "requirements": [ + { + "id": "R01", + "name": "Immutable construction", + "text": "All numerical code, witness bytes and exact source pins must remain bound to one manifest." + }, + { + "id": "R02", + "name": "Payload and restoration", + "text": "All arbitrary input, old-target and dirty columns satisfy the F2 supplier contract and reverse restoration." + }, + { + "id": "R03", + "name": "Legal actual geometry", + "text": "Every used frame, inclusion, complement, chart and boundary must be checked as an exact subspace/operator, not by rank alone." + }, + { + "id": "R04", + "name": "Complete physical price", + "text": "Every recursive child, scalar primitive, move, copy, bridge, route, selector and fallback must remain accounted for." + }, + { + "id": "R05", + "name": "Full bank address safety", + "text": "Every literal helper occurrence is assigned once; complete banks cover all coordinates; full addresses are nonaliasing." + }, + { + "id": "R06", + "name": "Separate lift and precision claims", + "text": "F2 semantic equality and chosen signed-lift prefix majorants remain distinct from the unchanged source's signed decoder." + }, + { + "id": "R07", + "name": "Complete prime coverage", + "text": "Every physically consumed and defining-source basis has exact determinant/exclusion evidence for eligible odd q." + }, + { + "id": "R08", + "name": "Strict directed moment gap", + "text": "Both interval engines and the full rare fallback establish strict moment bounds and reject the adjacent grid." + }, + { + "id": "R09", + "name": "Finite ordinary closure", + "text": "Use three finite bootstrap levels, all outer inequalities and the full inherited-constant cutoff, with old-leaf fallback." + }, + { + "id": "R10", + "name": "Inherited theorem boundary", + "text": "All-size compiler, covers/charts, restored rows, routing, prime supply, recovery, complex-symbolic and analytic hypotheses stay explicit." + }, + { + "id": "R11", + "name": "Evidence honesty", + "text": "Describe which stages ran freshly, what unchanged evidence was reused, and which cross-platform checks remain pending." + }, + { + "id": "R12", + "name": "Documentation provenance", + "text": "Preserve historical artifacts, licenses and contributor credit; describe the selected construction rather than additive historical gains." + } + ], + "schema": "selected-construction-architecture/1", + "source_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "title": "[Info Docs] Architecture Reference and Workflow Diagrams for PR #277" +} diff --git a/docs/multicut-delayed-inverse-checkpoint/functional_architecture.pdf b/docs/multicut-delayed-inverse-checkpoint/functional_architecture.pdf new file mode 100644 index 0000000000..3bb0b1cd4c Binary files /dev/null and b/docs/multicut-delayed-inverse-checkpoint/functional_architecture.pdf differ diff --git a/docs/multicut-delayed-inverse-checkpoint/hierarchy_edges.json b/docs/multicut-delayed-inverse-checkpoint/hierarchy_edges.json new file mode 100644 index 0000000000..e2ea9b2c69 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/hierarchy_edges.json @@ -0,0 +1,1778 @@ +{ + "documentary_edges": 75, + "relations": [ + { + "id": "HT001", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0a.out", + "target": "A0b.in", + "type": "Descriptors" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0a", + "target_block": "A0b" + }, + { + "id": "HT002", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0b.out", + "target": "A0c.in", + "type": "Descriptors" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0b", + "target_block": "A0c" + }, + { + "id": "HT003", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0c.out", + "target": "A0d.in", + "type": "Descriptors" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0c", + "target_block": "A0d" + }, + { + "id": "HT004", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0d.out", + "target": "A1.in", + "type": "Descriptors" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0d", + "target_block": "A1" + }, + { + "id": "HT005", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A1.out", + "target": "A2.in", + "type": "Digits" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A1", + "target_block": "A2" + }, + { + "id": "HT006", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A2.out", + "target": "A3a.in", + "type": "ScaledInputs" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A2", + "target_block": "A3a" + }, + { + "id": "HT007", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A3a.out", + "target": "A3b.in", + "type": "PaddedInputs" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A3a", + "target_block": "A3b" + }, + { + "id": "HT008", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A3b.out", + "target": "A4a.in", + "type": "CRTInputs" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A3b", + "target_block": "A4a" + }, + { + "id": "HT009", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4a.out", + "target": "A4b.in", + "type": "WorkingTensor" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4a", + "target_block": "A4b" + }, + { + "id": "HT010", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4b.out", + "target": "A4c.in", + "type": "WorkingSpectrum" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b", + "target_block": "A4c" + }, + { + "id": "HT011", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4c.out", + "target": "A4d.in", + "type": "SourceSpectrum" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c", + "target_block": "A4d" + }, + { + "id": "HT012", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4d.out", + "target": "A5.in", + "type": "PairedSpectrum" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4d", + "target_block": "A5" + }, + { + "id": "HT013", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A5.out", + "target": "A6.in", + "type": "SpectrumProduct" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A5", + "target_block": "A6" + }, + { + "id": "HT014", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A6.out", + "target": "A7a.in", + "type": "ScaledConvolution" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A6", + "target_block": "A7a" + }, + { + "id": "HT015", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A7a.out", + "target": "A7b.in", + "type": "PartialRecovery" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A7a", + "target_block": "A7b" + }, + { + "id": "HT016", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A7b.out", + "target": "A8.in", + "type": "NearIntegerCoefficients" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A7b", + "target_block": "A8" + }, + { + "id": "HT017", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A8.out", + "target": "A9.in", + "type": "IntegerCoefficients" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A8", + "target_block": "A9" + }, + { + "id": "HT018", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b1.out", + "target": "A4b2.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b1", + "target_block": "A4b2" + }, + { + "id": "HT019", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2.out", + "target": "A4b3.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2", + "target_block": "A4b3" + }, + { + "id": "HT020", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b3.out", + "target": "A4b4.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b3", + "target_block": "A4b4" + }, + { + "id": "HT021", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b4.out", + "target": "A4b5.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b4", + "target_block": "A4b5" + }, + { + "id": "HT022", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2a.out", + "target": "A4b2b.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2a", + "target_block": "A4b2b" + }, + { + "id": "HT023", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2b.out", + "target": "A4b2c.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2b", + "target_block": "A4b2c" + }, + { + "id": "HT024", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2c.out", + "target": "A4b2d.in", + "type": "SyntheticState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2c", + "target_block": "A4b2d" + }, + { + "id": "HT025", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4c1.out", + "target": "A4c2.in", + "type": "ResamplingState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c1", + "target_block": "A4c2" + }, + { + "id": "HT026", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4c2.out", + "target": "A4c3.in", + "type": "ResamplingState" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c2", + "target_block": "A4c3" + }, + { + "id": "HT027", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B1.out", + "target": "B2.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B1", + "target_block": "B2" + }, + { + "id": "HT028", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B2.out", + "target": "B3.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B2", + "target_block": "B3" + }, + { + "id": "HT029", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B3.out", + "target": "B4.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B3", + "target_block": "B4" + }, + { + "id": "HT030", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B4.out", + "target": "B5.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B4", + "target_block": "B5" + }, + { + "id": "HT031", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B8a.out", + "target": "B8b.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B8a", + "target_block": "B8b" + }, + { + "id": "HT032", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B8b.out", + "target": "B9a.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B8b", + "target_block": "B9a" + }, + { + "id": "HT033", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B9a.out", + "target": "B9b.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B9a", + "target_block": "B9b" + }, + { + "id": "HT034", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B9b.out", + "target": "B10.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B9b", + "target_block": "B10" + }, + { + "id": "HT035", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B10.out", + "target": "B11.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B10", + "target_block": "B11" + }, + { + "id": "HT036", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B11.out", + "target": "B12.in", + "type": "BitState" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B11", + "target_block": "B12" + }, + { + "id": "HT037", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C1.out", + "target": "C2.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C1", + "target_block": "C2" + }, + { + "id": "HT038", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C2.out", + "target": "C3.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C2", + "target_block": "C3" + }, + { + "id": "HT039", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C3.out", + "target": "C4.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C3", + "target_block": "C4" + }, + { + "id": "HT040", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C4.out", + "target": "C5.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C4", + "target_block": "C5" + }, + { + "id": "HT041", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C5.out", + "target": "C6.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C5", + "target_block": "C6" + }, + { + "id": "HT042", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C6.out", + "target": "C7.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C6", + "target_block": "C7" + }, + { + "id": "HT043", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C7.out", + "target": "C8.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C7", + "target_block": "C8" + }, + { + "id": "HT044", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C12a.out", + "target": "C12b.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C12a", + "target_block": "C12b" + }, + { + "id": "HT045", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C12b.out", + "target": "C12c.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C12b", + "target_block": "C12c" + }, + { + "id": "HT046", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "A4b2b.call_B0", + "target": "B0.in", + "type": "BitState" + }, + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions.", + "selected_status": "retained_bit_interface_contract", + "source_block": "A4b2b", + "target_block": "B0" + }, + { + "id": "HT047", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "B0.return_A4b2b", + "target": "A4b2b.receive_B0", + "type": "BitState" + }, + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions.", + "selected_status": "retained_bit_interface_contract", + "source_block": "B0", + "target_block": "A4b2b" + }, + { + "id": "HT048", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "A4b2b.call_C1", + "target": "C1.in", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "A4b2b", + "target_block": "C1" + }, + { + "id": "HT049", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "C1.return_A4b2b", + "target": "A4b2b.receive_C1", + "type": "ComplexState" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C1", + "target_block": "A4b2b" + }, + { + "id": "HT050", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "B9a.call_R1", + "target": "R1.in", + "type": "ResidualRequest" + }, + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions.", + "selected_status": "retained_bit_interface_contract", + "source_block": "B9a", + "target_block": "R1" + }, + { + "id": "HT051", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "R1.return_B9a", + "target": "B9a.receive_R1", + "type": "ResidualResponse" + }, + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions.", + "selected_status": "retained_bit_interface_contract", + "source_block": "R1", + "target_block": "B9a" + }, + { + "id": "HT052", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "C13.call_R1", + "target": "R1.in", + "type": "ResidualRequest" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "C13", + "target_block": "R1" + }, + { + "id": "HT053", + "inventory": "typed_edges", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "R1.return_C13", + "target": "C13.receive_R1", + "type": "ResidualResponse" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "R1", + "target_block": "C13" + }, + { + "id": "HD001", + "inventory": "documentary_edges", + "original": { + "from": "A0a", + "kind": "data", + "to": "A0b" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0a", + "target_block": "A0b" + }, + { + "id": "HD002", + "inventory": "documentary_edges", + "original": { + "from": "A0b", + "kind": "data", + "to": "A0c" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0b", + "target_block": "A0c" + }, + { + "id": "HD003", + "inventory": "documentary_edges", + "original": { + "from": "A0c", + "kind": "data", + "to": "A0d" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0c", + "target_block": "A0d" + }, + { + "id": "HD004", + "inventory": "documentary_edges", + "original": { + "from": "A0d", + "kind": "data", + "to": "A1" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A0d", + "target_block": "A1" + }, + { + "id": "HD005", + "inventory": "documentary_edges", + "original": { + "from": "A1", + "kind": "data", + "to": "A2" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A1", + "target_block": "A2" + }, + { + "id": "HD006", + "inventory": "documentary_edges", + "original": { + "from": "A2", + "kind": "data", + "to": "A3a" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A2", + "target_block": "A3a" + }, + { + "id": "HD007", + "inventory": "documentary_edges", + "original": { + "from": "A3a", + "kind": "data", + "to": "A3b" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A3a", + "target_block": "A3b" + }, + { + "id": "HD008", + "inventory": "documentary_edges", + "original": { + "from": "A3b", + "kind": "data", + "to": "A4a" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A3b", + "target_block": "A4a" + }, + { + "id": "HD009", + "inventory": "documentary_edges", + "original": { + "from": "A4a", + "kind": "data", + "to": "A4b" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4a", + "target_block": "A4b" + }, + { + "id": "HD010", + "inventory": "documentary_edges", + "original": { + "from": "A4b", + "kind": "data", + "to": "A4c" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b", + "target_block": "A4c" + }, + { + "id": "HD011", + "inventory": "documentary_edges", + "original": { + "from": "A4c", + "kind": "data", + "to": "A4d" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c", + "target_block": "A4d" + }, + { + "id": "HD012", + "inventory": "documentary_edges", + "original": { + "from": "A4d", + "kind": "data", + "to": "A5" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4d", + "target_block": "A5" + }, + { + "id": "HD013", + "inventory": "documentary_edges", + "original": { + "from": "A5", + "kind": "data", + "to": "A6" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A5", + "target_block": "A6" + }, + { + "id": "HD014", + "inventory": "documentary_edges", + "original": { + "from": "A6", + "kind": "data", + "to": "A7a" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A6", + "target_block": "A7a" + }, + { + "id": "HD015", + "inventory": "documentary_edges", + "original": { + "from": "A7a", + "kind": "data", + "to": "A7b" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A7a", + "target_block": "A7b" + }, + { + "id": "HD016", + "inventory": "documentary_edges", + "original": { + "from": "A7b", + "kind": "data", + "to": "A8" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A7b", + "target_block": "A8" + }, + { + "id": "HD017", + "inventory": "documentary_edges", + "original": { + "from": "A8", + "kind": "data", + "to": "A9" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A8", + "target_block": "A9" + }, + { + "id": "HD018", + "inventory": "documentary_edges", + "original": { + "from": "A4b1", + "kind": "data", + "to": "A4b2" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b1", + "target_block": "A4b2" + }, + { + "id": "HD019", + "inventory": "documentary_edges", + "original": { + "from": "A4b2", + "kind": "data", + "to": "A4b3" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2", + "target_block": "A4b3" + }, + { + "id": "HD020", + "inventory": "documentary_edges", + "original": { + "from": "A4b3", + "kind": "data", + "to": "A4b4" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b3", + "target_block": "A4b4" + }, + { + "id": "HD021", + "inventory": "documentary_edges", + "original": { + "from": "A4b4", + "kind": "data", + "to": "A4b5" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b4", + "target_block": "A4b5" + }, + { + "id": "HD022", + "inventory": "documentary_edges", + "original": { + "from": "A4b2a", + "kind": "data", + "to": "A4b2b" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2a", + "target_block": "A4b2b" + }, + { + "id": "HD023", + "inventory": "documentary_edges", + "original": { + "from": "A4b2b", + "kind": "data", + "to": "A4b2c" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2b", + "target_block": "A4b2c" + }, + { + "id": "HD024", + "inventory": "documentary_edges", + "original": { + "from": "A4b2c", + "kind": "data", + "to": "A4b2d" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2c", + "target_block": "A4b2d" + }, + { + "id": "HD025", + "inventory": "documentary_edges", + "original": { + "from": "A4c1", + "kind": "data", + "to": "A4c2" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c1", + "target_block": "A4c2" + }, + { + "id": "HD026", + "inventory": "documentary_edges", + "original": { + "from": "A4c2", + "kind": "data", + "to": "A4c3" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c2", + "target_block": "A4c3" + }, + { + "id": "HD027", + "inventory": "documentary_edges", + "original": { + "from": "B1", + "kind": "data", + "to": "B2" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B1", + "target_block": "B2" + }, + { + "id": "HD028", + "inventory": "documentary_edges", + "original": { + "from": "B2", + "kind": "data", + "to": "B3" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B2", + "target_block": "B3" + }, + { + "id": "HD029", + "inventory": "documentary_edges", + "original": { + "from": "B3", + "kind": "data", + "to": "B4" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B3", + "target_block": "B4" + }, + { + "id": "HD030", + "inventory": "documentary_edges", + "original": { + "from": "B4", + "kind": "data", + "to": "B5" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B4", + "target_block": "B5" + }, + { + "id": "HD031", + "inventory": "documentary_edges", + "original": { + "from": "B8a", + "kind": "data", + "to": "B8b" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B8a", + "target_block": "B8b" + }, + { + "id": "HD032", + "inventory": "documentary_edges", + "original": { + "from": "B8b", + "kind": "data", + "to": "B9a" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B8b", + "target_block": "B9a" + }, + { + "id": "HD033", + "inventory": "documentary_edges", + "original": { + "from": "B9a", + "kind": "data", + "to": "B9b" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B9a", + "target_block": "B9b" + }, + { + "id": "HD034", + "inventory": "documentary_edges", + "original": { + "from": "B9b", + "kind": "data", + "to": "B10" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B9b", + "target_block": "B10" + }, + { + "id": "HD035", + "inventory": "documentary_edges", + "original": { + "from": "B10", + "kind": "data", + "to": "B11" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B10", + "target_block": "B11" + }, + { + "id": "HD036", + "inventory": "documentary_edges", + "original": { + "from": "B11", + "kind": "data", + "to": "B12" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B11", + "target_block": "B12" + }, + { + "id": "HD037", + "inventory": "documentary_edges", + "original": { + "from": "C1", + "kind": "data", + "to": "C2" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C1", + "target_block": "C2" + }, + { + "id": "HD038", + "inventory": "documentary_edges", + "original": { + "from": "C2", + "kind": "data", + "to": "C3" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C2", + "target_block": "C3" + }, + { + "id": "HD039", + "inventory": "documentary_edges", + "original": { + "from": "C3", + "kind": "data", + "to": "C4" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C3", + "target_block": "C4" + }, + { + "id": "HD040", + "inventory": "documentary_edges", + "original": { + "from": "C4", + "kind": "data", + "to": "C5" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C4", + "target_block": "C5" + }, + { + "id": "HD041", + "inventory": "documentary_edges", + "original": { + "from": "C5", + "kind": "data", + "to": "C6" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C5", + "target_block": "C6" + }, + { + "id": "HD042", + "inventory": "documentary_edges", + "original": { + "from": "C6", + "kind": "data", + "to": "C7" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C6", + "target_block": "C7" + }, + { + "id": "HD043", + "inventory": "documentary_edges", + "original": { + "from": "C7", + "kind": "data", + "to": "C8" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C7", + "target_block": "C8" + }, + { + "id": "HD044", + "inventory": "documentary_edges", + "original": { + "from": "C12a", + "kind": "data", + "to": "C12b" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C12a", + "target_block": "C12b" + }, + { + "id": "HD045", + "inventory": "documentary_edges", + "original": { + "from": "C12b", + "kind": "data", + "to": "C12c" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C12b", + "target_block": "C12c" + }, + { + "id": "HD046", + "inventory": "documentary_edges", + "original": { + "from": "D1", + "kind": "evidence", + "to": "D0" + }, + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission.", + "selected_status": "current_proof_reallocation", + "source_block": "D1", + "target_block": "D0" + }, + { + "id": "HD047", + "inventory": "documentary_edges", + "original": { + "from": "D0", + "kind": "evidence", + "to": "D2" + }, + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission.", + "selected_status": "current_proof_reallocation", + "source_block": "D0", + "target_block": "D2" + }, + { + "id": "HD048", + "inventory": "documentary_edges", + "original": { + "from": "D2", + "kind": "evidence", + "to": "D3" + }, + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission.", + "selected_status": "current_proof_reallocation", + "source_block": "D2", + "target_block": "D3" + }, + { + "id": "HD049", + "inventory": "documentary_edges", + "original": { + "from": "D3", + "kind": "evidence", + "to": "D4" + }, + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission.", + "selected_status": "current_proof_reallocation", + "source_block": "D3", + "target_block": "D4" + }, + { + "id": "HD050", + "inventory": "documentary_edges", + "original": { + "from": "D4", + "kind": "evidence", + "to": "D5" + }, + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission.", + "selected_status": "current_proof_reallocation", + "source_block": "D4", + "target_block": "D5" + }, + { + "id": "HD051", + "inventory": "documentary_edges", + "original": { + "from": "D5", + "kind": "evidence", + "to": "D6" + }, + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission.", + "selected_status": "current_proof_reallocation", + "source_block": "D5", + "target_block": "D6" + }, + { + "id": "HD052", + "inventory": "documentary_edges", + "original": { + "from": "A4b", + "kind": "detail", + "to": "A4b1" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b", + "target_block": "A4b1" + }, + { + "id": "HD053", + "inventory": "documentary_edges", + "original": { + "from": "A4b2", + "kind": "detail", + "to": "A4b2a" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b2", + "target_block": "A4b2a" + }, + { + "id": "HD054", + "inventory": "documentary_edges", + "original": { + "from": "A4b4", + "kind": "detail", + "to": "A4b4a" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b4", + "target_block": "A4b4a" + }, + { + "id": "HD055", + "inventory": "documentary_edges", + "original": { + "from": "A4c", + "kind": "detail", + "to": "A4c1" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c", + "target_block": "A4c1" + }, + { + "id": "HD056", + "inventory": "documentary_edges", + "original": { + "from": "A4a", + "kind": "support", + "to": "A4io" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4a", + "target_block": "A4io" + }, + { + "id": "HD057", + "inventory": "documentary_edges", + "original": { + "from": "A4c3", + "kind": "support", + "to": "A4io" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4c3", + "target_block": "A4io" + }, + { + "id": "HD058", + "inventory": "documentary_edges", + "original": { + "from": "A4b", + "kind": "support", + "to": "A4p1" + }, + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals.", + "selected_status": "retained_outer_contract", + "source_block": "A4b", + "target_block": "A4p1" + }, + { + "id": "HD059", + "inventory": "documentary_edges", + "original": { + "from": "A4b2b", + "kind": "support", + "to": "B0" + }, + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions.", + "selected_status": "retained_bit_interface_contract", + "source_block": "A4b2b", + "target_block": "B0" + }, + { + "id": "HD060", + "inventory": "documentary_edges", + "original": { + "from": "A4b2b", + "kind": "support", + "to": "C1" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "A4b2b", + "target_block": "C1" + }, + { + "id": "HD061", + "inventory": "documentary_edges", + "original": { + "from": "B0", + "kind": "detail", + "to": "B1" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B0", + "target_block": "B1" + }, + { + "id": "HD062", + "inventory": "documentary_edges", + "original": { + "from": "B2", + "kind": "detail", + "to": "B6a" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B2", + "target_block": "B6a" + }, + { + "id": "HD063", + "inventory": "documentary_edges", + "original": { + "from": "B4", + "kind": "detail", + "to": "B7a" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B4", + "target_block": "B7a" + }, + { + "id": "HD064", + "inventory": "documentary_edges", + "original": { + "from": "B5", + "kind": "support", + "to": "B8a" + }, + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative.", + "selected_status": "historical_order_replaced", + "source_block": "B5", + "target_block": "B8a" + }, + { + "id": "HD065", + "inventory": "documentary_edges", + "original": { + "from": "B9a", + "kind": "support", + "to": "R5a" + }, + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions.", + "selected_status": "retained_bit_interface_contract", + "source_block": "B9a", + "target_block": "R5a" + }, + { + "id": "HD066", + "inventory": "documentary_edges", + "original": { + "from": "A4b2a", + "kind": "support", + "to": "R5b" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "A4b2a", + "target_block": "R5b" + }, + { + "id": "HD067", + "inventory": "documentary_edges", + "original": { + "from": "C2", + "kind": "support", + "to": "C13" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C2", + "target_block": "C13" + }, + { + "id": "HD068", + "inventory": "documentary_edges", + "original": { + "from": "C4", + "kind": "detail", + "to": "C9" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C4", + "target_block": "C9" + }, + { + "id": "HD069", + "inventory": "documentary_edges", + "original": { + "from": "C4", + "kind": "detail", + "to": "C10" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C4", + "target_block": "C10" + }, + { + "id": "HD070", + "inventory": "documentary_edges", + "original": { + "from": "C8", + "kind": "support", + "to": "C12a" + }, + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace.", + "selected_status": "retained_complex_interface", + "source_block": "C8", + "target_block": "C12a" + }, + { + "id": "HD071", + "inventory": "documentary_edges", + "original": { + "from": "R5a", + "kind": "support", + "to": "R1" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "R5a", + "target_block": "R1" + }, + { + "id": "HD072", + "inventory": "documentary_edges", + "original": { + "from": "C13", + "kind": "support", + "to": "R1" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "C13", + "target_block": "R1" + }, + { + "id": "HD073", + "inventory": "documentary_edges", + "original": { + "from": "R1", + "kind": "support", + "to": "R2" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "R1", + "target_block": "R2" + }, + { + "id": "HD074", + "inventory": "documentary_edges", + "original": { + "from": "R2", + "kind": "support", + "to": "R3" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "R2", + "target_block": "R3" + }, + { + "id": "HD075", + "inventory": "documentary_edges", + "original": { + "from": "R2", + "kind": "support", + "to": "R4" + }, + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20.", + "selected_status": "inherited_recursive_contract", + "source_block": "R2", + "target_block": "R4" + } + ], + "schema": "historical-edge-reconciliation/1", + "source_graph_sha256": "b70e794473cb75f76941e190ed102c236a15b9a868c4d277eb28e05f843d116c", + "typed_edges": 53 +} diff --git a/docs/multicut-delayed-inverse-checkpoint/hierarchy_reconciliation.json b/docs/multicut-delayed-inverse-checkpoint/hierarchy_reconciliation.json new file mode 100644 index 0000000000..195d496bb4 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/hierarchy_reconciliation.json @@ -0,0 +1,5243 @@ +{ + "blocks": [ + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3" + ], + "id": "A0a", + "logical_functions": [ + "L0", + "L1" + ], + "name": "Read operands and lengths", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Bits", + "out": "Descriptors" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-5" + ], + "id": "A0b", + "logical_functions": [ + "L1" + ], + "name": "Select admissible sizes and precision", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Descriptors", + "out": "Descriptors" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3" + ], + "id": "A0c", + "logical_functions": [ + "L1" + ], + "name": "Generate descriptors", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Descriptors", + "out": "Descriptors" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3" + ], + "id": "A0d", + "logical_functions": [ + "L1" + ], + "name": "Select ordinary cutoff and guards", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Descriptors", + "out": "Descriptors" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1" + ], + "id": "A1", + "logical_functions": [ + "L0", + "L1" + ], + "name": "Extract radix digits", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Descriptors", + "out": "Digits" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1" + ], + "id": "A2", + "logical_functions": [ + "L0", + "L1" + ], + "name": "Scale bounded inputs", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Digits", + "out": "ScaledInputs" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1" + ], + "id": "A3a", + "logical_functions": [ + "L0", + "L2" + ], + "name": "Zero-pad operands", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "ScaledInputs", + "out": "PaddedInputs" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1" + ], + "id": "A3b", + "logical_functions": [ + "L0", + "L2", + "L6" + ], + "name": "Apply convolution-preserving CRT index map", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "PaddedInputs", + "out": "CRTInputs" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "id": "A4a", + "logical_functions": [ + "L0", + "L2", + "L3" + ], + "name": "Gaussian expansion", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "CRTInputs", + "out": "WorkingTensor" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "id": "A4b", + "logical_functions": [ + "L2", + "L3" + ], + "name": "Chirp source transform", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "WorkingTensor", + "out": "WorkingSpectrum" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b1", + "logical_functions": [ + "L7" + ], + "name": "Twist into negacyclic ring", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b2", + "logical_functions": [ + "L7" + ], + "name": "Two normalized synthetic transforms", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b2a", + "logical_functions": [ + "L6" + ], + "name": "Arrange stored tensor layout", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b2b", + "logical_functions": [ + "L7" + ], + "name": "Execute normalized butterfly rounds", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "call_B0": "BitState", + "call_C1": "ComplexState", + "in": "SyntheticState", + "out": "SyntheticState", + "receive_B0": "BitState", + "receive_C1": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b2c", + "logical_functions": [ + "L7" + ], + "name": "Apply exact signed polynomial twiddle", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b2d", + "logical_functions": [ + "L7" + ], + "name": "Truncate round and clear work", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b3", + "logical_functions": [ + "L7" + ], + "name": "Packed ring record products", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b4", + "logical_functions": [ + "L7" + ], + "name": "Opposite synthetic transform", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b4a", + "logical_functions": [ + "L6" + ], + "name": "Opposite rounds and normalization", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4b5", + "logical_functions": [ + "L7" + ], + "name": "Untwist ring coefficients", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "id": "A4c", + "logical_functions": [ + "L2", + "L3" + ], + "name": "Gaussian compression", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "WorkingSpectrum", + "out": "SourceSpectrum" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4c1", + "logical_functions": [ + "L7" + ], + "name": "Select ordered source samples", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "ResamplingState", + "out": "ResamplingState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4c2", + "logical_functions": [ + "L7" + ], + "name": "Apply bounded Neumann correction", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "ResamplingState", + "out": "ResamplingState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4c3", + "logical_functions": [ + "L7" + ], + "name": "Apply diagonal Gaussian correction", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "ResamplingState", + "out": "ResamplingState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "id": "A4d", + "logical_functions": [ + "L2", + "L3" + ], + "name": "Return ordered source transforms", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SourceSpectrum", + "out": "PairedSpectrum" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4io", + "logical_functions": [ + "L6" + ], + "name": "Adapt records and axis layout", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "WorkingTensor", + "out": "WorkingTensor" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4p1", + "logical_functions": [ + "L7" + ], + "name": "Generate chirp and twist phase descriptors", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "Descriptors", + "out": "PhaseDescriptor" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4p2", + "logical_functions": [ + "L7" + ], + "name": "Evaluate bounded complex exponential", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "PhaseDescriptor", + "out": "Factors" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "A4p3", + "logical_functions": [ + "L7" + ], + "name": "Multiply phase factor and truncate", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "PhaseApplicationInput", + "out": "WorkingTensor" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1" + ], + "id": "A5", + "logical_functions": [ + "L0", + "L3" + ], + "name": "Multiply matching Fourier entries", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "PairedSpectrum", + "out": "SpectrumProduct" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1" + ], + "id": "A6", + "logical_functions": [ + "L0", + "L3" + ], + "name": "Apply opposite-sign source transform", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "SpectrumProduct", + "out": "ScaledConvolution" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-5", + "ARC-4" + ], + "id": "A7a", + "logical_functions": [ + "L0", + "L4" + ], + "name": "First recovery normalization", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "ScaledConvolution", + "out": "PartialRecovery" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-5", + "ARC-4" + ], + "id": "A7b", + "logical_functions": [ + "L0", + "L4" + ], + "name": "Complete recovery normalization and coefficient layout", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "PartialRecovery", + "out": "NearIntegerCoefficients" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-5", + "ARC-4" + ], + "id": "A8", + "logical_functions": [ + "L0", + "L4" + ], + "name": "Round exact integer coefficients", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "NearIntegerCoefficients", + "out": "IntegerCoefficients" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "ARC-4" + ], + "id": "A9", + "logical_functions": [ + "L0", + "L5" + ], + "name": "Carry and serialize exact product", + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "ports": { + "in": "IntegerCoefficients", + "out": "Product" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_outer_contract" + }, + { + "current_blocks": [ + "F10", + "F11", + "F14", + "F20" + ], + "historical_requirements": [ + "SYS-2", + "IF-1" + ], + "id": "B0", + "logical_functions": [ + "L7" + ], + "name": "Bit address-interchange contract", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState", + "return_A4b2b": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02", + "F10" + ], + "historical_requirements": [ + "IF-2" + ], + "id": "B1", + "logical_functions": [ + "L7" + ], + "name": "Compensate old dirty response", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F11" + ], + "historical_requirements": [ + "IF-6", + "ARC-1" + ], + "id": "B10", + "logical_functions": [ + "L10" + ], + "name": "Compose five phase-major bit windows", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F12", + "F13", + "F14" + ], + "historical_requirements": [ + "SYS-2", + "IF-3", + "IF-6", + "ARC-2" + ], + "id": "B11", + "logical_functions": [ + "L9" + ], + "name": "Complete independent dirty frames", + "note": "Independent completions are discharged only by the current full-bank proof and exact tags. The historical exterior-completion realization is replaced.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F11" + ], + "historical_requirements": [ + "SYS-2" + ], + "id": "B12", + "logical_functions": [ + "L9" + ], + "name": "Exchange terminal banks", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02", + "F03", + "F07", + "F08" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "B2", + "logical_functions": [ + "L7" + ], + "name": "Compute framed helper word", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F03", + "F11" + ], + "historical_requirements": [ + "IF-3" + ], + "id": "B3", + "logical_functions": [ + "L7", + "L8" + ], + "name": "Manage copied centers", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F03", + "F08", + "F10" + ], + "historical_requirements": [ + "IF-2" + ], + "id": "B4", + "logical_functions": [ + "L7" + ], + "name": "Deliver target updates", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F10" + ], + "historical_requirements": [ + "SYS-2", + "IF-2" + ], + "id": "B5", + "logical_functions": [ + "L7", + "L9" + ], + "name": "Restore scalar source and dirt", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "id": "B6a", + "logical_functions": [ + "L8" + ], + "name": "Start source loan", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "id": "B6b", + "logical_functions": [ + "L8" + ], + "name": "Mix source carrier", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "id": "B6c", + "logical_functions": [ + "L8" + ], + "name": "Use loan alias", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02", + "F10" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "id": "B6d", + "logical_functions": [ + "L8", + "L9" + ], + "name": "Restore borrowed source", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02", + "F10" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "id": "B6e", + "logical_functions": [ + "L8", + "L9" + ], + "name": "Undo carrier mix", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F02", + "F06" + ], + "historical_requirements": [ + "IF-2" + ], + "id": "B7a", + "logical_functions": [ + "L8" + ], + "name": "Prepare source-owned compensation", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F06", + "F08" + ], + "historical_requirements": [ + "IF-2" + ], + "id": "B7b", + "logical_functions": [ + "L8" + ], + "name": "Deliver compensated target response", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F06", + "F08", + "F10" + ], + "historical_requirements": [ + "IF-2" + ], + "id": "B7c", + "logical_functions": [ + "L8" + ], + "name": "Keep only desired signal", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F11", + "F14" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-2" + ], + "id": "B8a", + "logical_functions": [ + "L6" + ], + "name": "Describe full address identity", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-2" + ], + "id": "B8b", + "logical_functions": [ + "L6" + ], + "name": "Execute charged complete-stream route", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F11", + "F17", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-3" + ], + "id": "B9a", + "logical_functions": [ + "L6" + ], + "name": "Call exact nested recursive residual", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "call_R1": "ResidualRequest", + "in": "BitState", + "out": "BitState", + "receive_R1": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F03", + "F04" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4" + ], + "id": "B9b", + "logical_functions": [ + "L6" + ], + "name": "Apply equal-frame scalar gate", + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + }, + "status": "current_supplier_reallocation" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "IF-1" + ], + "id": "C1", + "logical_functions": [ + "L7", + "L8" + ], + "name": "Compensate old complex response", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState", + "return_A4b2b": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "IF-3" + ], + "id": "C10", + "logical_functions": [ + "L8" + ], + "name": "Backward transposed-center macro", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "id": "C11a", + "logical_functions": [ + "L8" + ], + "name": "Copy scalar work", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "id": "C11b", + "logical_functions": [ + "L8" + ], + "name": "Scale exact rational coefficient", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "id": "C11c", + "logical_functions": [ + "L8" + ], + "name": "Accumulate scalar update", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "id": "C11d", + "logical_functions": [ + "L8" + ], + "name": "Clear scalar work", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "ARC-1" + ], + "id": "C12a", + "logical_functions": [ + "L6" + ], + "name": "Route complex owner labels", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean", + "sha256": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "ARC-1" + ], + "id": "C12b", + "logical_functions": [ + "L10" + ], + "name": "Compose five complex windows", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean", + "sha256": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "ARC-1" + ], + "id": "C12c", + "logical_functions": [ + "L9" + ], + "name": "Complete terminal complex exchange", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean", + "sha256": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-3" + ], + "id": "C13", + "logical_functions": [ + "L6", + "L7" + ], + "name": "Synthesize phase-correct residual", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "call_R1": "ResidualRequest", + "in": "ComplexState", + "out": "ComplexState", + "receive_R1": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "IF-4" + ], + "id": "C2", + "logical_functions": [ + "L7" + ], + "name": "Adapt exact complex entry labels", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "C3", + "logical_functions": [ + "L7" + ], + "name": "Perform phase A live climbs", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "C4", + "logical_functions": [ + "L7" + ], + "name": "Run retained copied centers", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "id": "C5", + "logical_functions": [ + "L7" + ], + "name": "Perform phase B live climbs", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "IF-2" + ], + "id": "C6", + "logical_functions": [ + "L7" + ], + "name": "Finish live climbs", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "IF-2", + "IF-4" + ], + "id": "C7", + "logical_functions": [ + "L7" + ], + "name": "Adapt exact complex exit labels", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-2", + "IF-2" + ], + "id": "C8", + "logical_functions": [ + "L7", + "L9" + ], + "name": "Restore complex borrowed payload", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "IF-3" + ], + "id": "C9", + "logical_functions": [ + "L8" + ], + "name": "Forward copied-center macro", + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "retained_complex_recipe" + }, + { + "current_blocks": [ + "F02" + ], + "historical_requirements": [ + "SYS-5" + ], + "id": "D0", + "logical_functions": [ + "L11" + ], + "name": "Reconstruct source recipe", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F01", + "F21" + ], + "historical_requirements": [ + "SYS-5" + ], + "id": "D1", + "logical_functions": [ + "L11" + ], + "name": "Check source pins and preflight", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F10" + ], + "historical_requirements": [ + "SYS-5" + ], + "id": "D2", + "logical_functions": [ + "L11" + ], + "name": "Check complete bit columns and inverse", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F11", + "F13", + "F14", + "F15" + ], + "historical_requirements": [ + "SYS-5" + ], + "id": "D3", + "logical_functions": [ + "L11" + ], + "name": "Check physical frames routes and primes", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F16" + ], + "historical_requirements": [ + "SYS-5" + ], + "id": "D4", + "logical_functions": [ + "L11" + ], + "name": "Check complex splice and declarations", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F17", + "F18", + "F19", + "F20" + ], + "historical_requirements": [ + "SYS-5", + "IF-6", + "ARC-5" + ], + "id": "D5", + "logical_functions": [ + "L11" + ], + "name": "Check finite bill and exact outer inequalities", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F21" + ], + "historical_requirements": [ + "SYS-5" + ], + "id": "D6", + "logical_functions": [ + "L11" + ], + "name": "Expose inherited theorem obligations", + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + }, + "status": "current_evidence_allocation" + }, + { + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-6" + ], + "id": "R1", + "logical_functions": [ + "L10" + ], + "name": "Form completed residual request", + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse", + "return_B9a": "ResidualResponse", + "return_C13": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "inherited_recursive_contract" + }, + { + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-6" + ], + "id": "R2", + "logical_functions": [ + "L10" + ], + "name": "Call smaller completed transform", + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "inherited_recursive_contract" + }, + { + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-6", + "ARC-5" + ], + "id": "R3", + "logical_functions": [ + "L10" + ], + "name": "Stop at attained ordinary leaf", + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "inherited_recursive_contract" + }, + { + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "historical_requirements": [ + "SYS-2", + "SYS-3", + "SYS-5", + "IF-3", + "IF-6", + "ARC-5" + ], + "id": "R4", + "logical_functions": [ + "L9", + "L10" + ], + "name": "Restore borrowed high rows", + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + }, + "status": "inherited_recursive_contract" + }, + { + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-4", + "IF-6", + "ARC-3" + ], + "id": "R5a", + "logical_functions": [ + "L10" + ], + "name": "Dispatch good and bad q-local edges", + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_recursive_contract" + }, + { + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-4", + "IF-6" + ], + "id": "R5b", + "logical_functions": [ + "L6" + ], + "name": "Repair exceptional layout records", + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + }, + "status": "inherited_recursive_contract" + } + ], + "completeness": "All87 original selected-realization block IDs accounted for; inherited/opaque internals are not promoted to executed operation coverage.", + "frozen_graph_sha256": "b70e794473cb75f76941e190ed102c236a15b9a868c4d277eb28e05f843d116c", + "historical_baseline": "PR234 frozen V8; not the selected source527 realization", + "logical_functions": [ + { + "id": "L0", + "input_ports": { + "I0": "two valid nonnegative n-bit operands U and V" + }, + "interface": "Only the externally specified product semantics are universal; transform, layout and storage choices belong to the selected realization.", + "name": "Produce the exact integer product", + "output_ports": { + "OUT": "exact UV in the requested output format" + }, + "purpose": "Return the specified mathematical result.", + "realization_blocks": [ + "A0a", + "A1", + "A2", + "A3a", + "A3b", + "A4a", + "A5", + "A6", + "A7a", + "A7b", + "A8", + "A9" + ], + "subfunctions": [ + "L1", + "L2", + "L3", + "L4", + "L5" + ], + "support_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ] + }, + { + "id": "L1", + "input_ports": { + "I0": "valid operand bit strings" + }, + "interface": "Encoding and scale are explicit and must preserve recoverable numeric values. A radix or particular precision formula is a realization choice.", + "name": "Accept and represent operands", + "output_ports": { + "P0": "preserved operands and admissible representation descriptors" + }, + "purpose": "Preserve operand values while making their representation usable.", + "realization_blocks": [ + "A0a", + "A0b", + "A0c", + "A0d", + "A1", + "A2" + ], + "subfunctions": [] + }, + { + "id": "L2", + "input_ports": { + "P0": "represented operands and descriptors" + }, + "interface": "The selected system pads, reindexes and transforms; the logical function does not require CRT, Fourier transforms or a particular decomposition.", + "name": "Make operands usable for product computation", + "output_ports": { + "P1": "valid inputs to the chosen product-computation interface" + }, + "purpose": "Provide the organization required by the chosen product method.", + "realization_blocks": [ + "A3a", + "A3b", + "A4a", + "A4b", + "A4c", + "A4d" + ], + "subfunctions": [] + }, + { + "id": "L3", + "input_ports": { + "P1": "valid represented operands" + }, + "interface": "The selected Fourier realization uses P2 matching-coordinate arrays internally. Different methods may satisfy the same goal with different internal ports.", + "name": "Compute sufficient product information", + "output_ports": { + "P3": "information sufficient to recover the exact product" + }, + "purpose": "Establish the product relation in the internal representation.", + "realization_blocks": [ + "A4a", + "A4b", + "A4c", + "A4d", + "A5", + "A6" + ], + "subfunctions": [] + }, + { + "id": "L4", + "input_ports": { + "P3": "internal product information plus validity/error guarantees" + }, + "interface": "If approximate arithmetic is used, recovery needs a sufficient exactness margin. The present two S factors, rounding and inverse CRT are conditional on this representation.", + "name": "Recover exact result values", + "output_ports": { + "E0": "exact values sufficient for output encoding" + }, + "purpose": "Resolve internal scales or approximations into exact integer information.", + "realization_blocks": [ + "A7a", + "A7b", + "A8" + ], + "subfunctions": [] + }, + { + "id": "L5", + "input_ports": { + "E0": "exact internal result values" + }, + "interface": "Frozen outer proof uses carries and exactly 2n output bits. An output-format change is possible only with a revised boundary contract.", + "name": "Normalize and emit the result", + "output_ports": { + "OUT": "the requested product bit string" + }, + "purpose": "Meet the requested external representation contract.", + "realization_blocks": [ + "A9" + ], + "subfunctions": [] + }, + { + "id": "L6", + "input_ports": { + "LOC_IN": "complete payload streams and logical owners" + }, + "interface": "Value identity, owner bijections, exact frame interpretation and movement cost must remain valid. The chosen address geometry is not universal.", + "name": "Place data at required interfaces", + "output_ports": { + "LOC_OUT": "the same intended values at the requested owners/frames" + }, + "purpose": "Deliver corresponding values to the locations and representations consumed by an operation.", + "realization_blocks": [ + "A3b", + "A4b2a", + "A4b4a", + "A4io", + "B8a", + "B8b", + "B9a", + "B9b", + "C12a", + "C13", + "R5b" + ], + "subfunctions": [] + }, + { + "id": "L7", + "input_ports": { + "MAP_IN": "payload and exact requested operator contract" + }, + "interface": "F\u2082 payload, rational-address and exact-complex phase contracts are different operator domains and cannot be interchanged by matching rank alone.", + "name": "Evaluate required component maps", + "output_ports": { + "MAP_OUT": "the requested output action at valid endpoint representations" + }, + "purpose": "Realize each caller-requested arithmetic or linear operator.", + "realization_blocks": [ + "A4b1", + "A4b2", + "A4b3", + "A4b4", + "A4b5", + "A4b2b", + "A4b2c", + "A4b2d", + "A4c1", + "A4c2", + "A4c3", + "A4p1", + "A4p2", + "A4p3", + "B0", + "B1", + "B2", + "B3", + "B4", + "B5", + "C1", + "C2", + "C3", + "C4", + "C5", + "C6", + "C7", + "C8", + "C13" + ], + "subfunctions": [] + }, + { + "id": "L8", + "input_ports": { + "WORK_IN": "live values, declared dirty/clean workspace and ownership" + }, + "interface": "The number of banks, ownership schedule and dirty-versus-clean choice are architectural. Any replacement must preserve alias, lifetime and resource contracts.", + "name": "Manage temporary and shared storage", + "output_ports": { + "WORK_OUT": "valid live values and legal work lifetimes" + }, + "purpose": "Give operations usable storage without undeclared interference.", + "realization_blocks": [ + "B3", + "B6a", + "B6b", + "B6c", + "B6d", + "B6e", + "B7a", + "B7b", + "B7c", + "C1", + "C9", + "C10", + "C11a", + "C11b", + "C11c", + "C11d" + ], + "subfunctions": [] + }, + { + "id": "L9", + "input_ports": { + "BORROWED_IN": "declared borrowed values/rows/frames" + }, + "interface": "Restoration is required where the caller grants a loan. Payload restoration, temporary erasure and address-frame completion are separate conditions.", + "name": "Restore borrowed state", + "output_ports": { + "BORROWED_OUT": "the specified restored state and completed frame effect" + }, + "purpose": "Prevent a subroutine from corrupting externally owned values or representations.", + "realization_blocks": [ + "B5", + "B6d", + "B6e", + "B11", + "B12", + "C8", + "C12c", + "R4" + ], + "subfunctions": [] + }, + { + "id": "L10", + "input_ports": { + "CHILD_IN": "an exact residual problem and allowed resources" + }, + "interface": "Recursion, stage count and fallback strategy are realization choices. The chosen proof requires valid proper children, finite leaves, paid exceptional work and composable boundaries.", + "name": "Complete and compose subproblems", + "output_ports": { + "CHILD_OUT": "a completed result with required state returned" + }, + "purpose": "Close each delegated computation under its caller\u2019s endpoint and cost contracts.", + "realization_blocks": [ + "B10", + "C12b", + "R1", + "R2", + "R3", + "R4", + "R5a" + ], + "subfunctions": [] + }, + { + "id": "L11", + "input_ports": { + "EVIDENCE_IN": "pinned sources, declared interfaces and reconstructed finite recipes" + }, + "interface": "This is an assurance function, not another runtime multiplication step. A passed finite check does not replace an inherited theorem.", + "name": "Establish the evidence for system claims", + "output_ports": { + "EVIDENCE_OUT": "checked finite facts plus explicit remaining theorem dependencies" + }, + "purpose": "Separate executable finite checks from retained assumptions and justify stated bounds.", + "realization_blocks": [ + "D0", + "D1", + "D2", + "D3", + "D4", + "D5", + "D6" + ], + "subfunctions": [] + } + ], + "requirement_definitions": [ + { + "classification": "outcome", + "id": "SYS-1", + "logical_functions": [ + "L0", + "L1", + "L2", + "L3", + "L4", + "L5" + ], + "overconstraint_audit": { + "escape_route": "Change any internal representation or algorithm while preserving the external product meaning; revise the external contract explicitly if input/output meaning changes.", + "reopened_obligations": "Affected encoding, product relation, decoding, and cost dependencies.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "This is the requested mathematical result.", + "realization_blocks": [ + "A1", + "A2", + "A3a", + "A3b", + "A4a", + "A4b", + "A4c", + "A4d", + "A5", + "A6", + "A7a", + "A7b", + "A8", + "A9" + ], + "sources": [ + "P1", + "P7" + ], + "statement": "For every allowed input, output represents the exact integer product.", + "status": "conditional_retained_proof", + "title": "Exact integer product", + "verification_method": "Composed encoding/product/decoding proof." + }, + { + "classification": "outcome_relative_to_promised_interface", + "id": "SYS-2", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Retire or reassign owned state under a changed caller contract; restoration is required only where promised.", + "reopened_obligations": "Affected caller observations, ownership, live versions, endpoints and storage bill.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Endpoint-only equality can hide corrupted intermediate users.", + "realization_blocks": [ + "B0", + "B5", + "B6a", + "B6b", + "B6c", + "B6d", + "B6e", + "B11", + "B12", + "C8", + "R4" + ], + "sources": [ + "P2", + "P3", + "P4", + "P6" + ], + "statement": "Preserve caller-promised values and properties at every required observation.", + "status": "source_specific_local_and_inherited_evidence", + "title": "Honor promised state and observations", + "verification_method": "Full boundary and trace relation on arbitrary allowed state." + }, + { + "classification": "model", + "id": "SYS-3", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Change machine model or compiler with an explicit translation or new theorem.", + "reopened_obligations": "Cost model, lowering, routing, workspace and composed complexity claims.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Algebra alone is not a physical cost proof.", + "realization_blocks": [ + "A0a", + "A0b", + "A0c", + "A0d", + "B8a", + "B8b", + "B9a", + "B9b", + "C11a", + "C11b", + "C11c", + "C11d", + "C13", + "R1", + "R2", + "R3", + "R4", + "R5a", + "R5b" + ], + "sources": [ + "P2", + "P5", + "P8" + ], + "statement": "Implement every operation and movement claimed in the stated model with legal resources.", + "status": "inherited_model_interfaces_with_open_sparse_tariff", + "title": "Realizable execution in the declared model", + "verification_method": "Frame, routing, workspace and lowering arguments." + }, + { + "classification": "outcome", + "id": "SYS-4", + "logical_functions": [ + "L1", + "L2", + "L3", + "L4", + "L5", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Use exact arithmetic or another successful decoder; neither rounding nor fixed dyadic precision is universal.", + "reopened_obligations": "Affected approximation propagation, normalization, widths, decoder and physical cost.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Local exact algebra does not bound accumulated numerical error.", + "realization_blocks": [ + "A0b", + "A4a", + "A4b", + "A4c", + "A4d", + "A7a", + "A7b", + "A8", + "A9", + "C11a", + "C11b", + "C11c", + "C11d" + ], + "sources": [ + "P7" + ], + "statement": "Prove every numerical approximation affecting the result is compatible with exact decoding.", + "status": "conditional_retained_precision_proof", + "title": "Justified exact recovery", + "verification_method": "Complete error/range/width/decoding proof." + }, + { + "classification": "model_and_claim_dependent_outcome", + "id": "SYS-5", + "logical_functions": [ + "L0", + "L6", + "L7", + "L8", + "L9", + "L10", + "L11" + ], + "overconstraint_audit": { + "escape_route": "A correctness experiment need not improve an exponent; an implementation may stay within an unchanged envelope.", + "reopened_obligations": "Only the changed costs and downstream claims that consume them.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Omitted costs and conflated evidence can reverse a comparison.", + "realization_blocks": [ + "R1", + "R2", + "R3", + "R4", + "R5a", + "R5b", + "D0", + "D1", + "D2", + "D3", + "D4", + "D5", + "D6" + ], + "sources": [ + "P2", + "P5", + "P8" + ], + "statement": "Account for all resources relevant to the claimed result and bind evidence to exact sources and scope.", + "status": "source_specific_conditional_bounds", + "title": "Complete support for the claimed cost", + "verification_method": "Complete net inventory, recurrence, finite/outer argument and evidence binding." + }, + { + "classification": "model_and_interface", + "id": "IF-1", + "logical_functions": [ + "L1", + "L6", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Change field, encoding, integer lift or address model with a new interface proof.", + "reopened_obligations": "Semantics, primes, geometry and numerical bounds.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-1", + "SYS-3" + ], + "rationale": "Equal notation across fields may denote different maps.", + "realization_blocks": [ + "B0", + "B8a", + "B8b", + "B9a", + "B9b", + "C1", + "C13", + "A4a", + "A4b", + "A4c", + "A4d" + ], + "sources": [ + "P2", + "P3", + "P4" + ], + "statement": "Specify payload/address domains, sizes, legal inputs and inherited hypotheses.", + "status": "explicit_in_retained_bit_contract", + "title": "Declared mathematical domains", + "verification_method": "Algebraic model and domain checks." + }, + { + "classification": "outcome_and_interface", + "id": "IF-2", + "logical_functions": [ + "L2", + "L3", + "L4", + "L5", + "L6", + "L7", + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Change private intermediate values or enlarge the closed interval.", + "reopened_obligations": "Every newly enclosed consumer, observation and source version.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-1", + "SYS-2" + ], + "rationale": "An unobserved intermediate coordinate need not be fixed.", + "realization_blocks": [ + "B1", + "B4", + "B5", + "B7a", + "B7b", + "B7c", + "C6", + "C7", + "C8" + ], + "sources": [ + "P2", + "P4" + ], + "statement": "Specify endpoint and every required observation at semantic events.", + "status": "local_exact_interval_pass_global_composite_pending", + "title": "Complete boundary and observations", + "verification_method": "Full operator/trace relation; all-column check when linearity is proved." + }, + { + "classification": "interface", + "id": "IF-3", + "logical_functions": [ + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Use different sharing/loan/retirement contracts accepted by affected callers.", + "reopened_obligations": "Owners, aliasing, copy/erase, inverse dependencies and actual stock.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-2", + "SYS-3" + ], + "rationale": "Forward last-use is not inverse restoration.", + "realization_blocks": [ + "B3", + "B6a", + "B6b", + "B6c", + "B6d", + "B6e", + "B11", + "C9", + "C10", + "C11a", + "C11b", + "C11c", + "C11d", + "R4" + ], + "sources": [ + "P2", + "P3", + "P4", + "P6" + ], + "statement": "Declare owners, live versions, dirty/old state, loans, retirement and copy/erase conditions in both directions.", + "status": "source_specific_exact_checks", + "title": "Ownership and lifetimes", + "verification_method": "Dependency/lifetime proof and arbitrary-state endpoint." + }, + { + "classification": "model_and_interface", + "id": "IF-4", + "logical_functions": [ + "L6", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Choose different legal bases, frame plateaus, factorizations or routes.", + "reopened_obligations": "Actual projector identities, primes, cover/namespace, observers and paid movement.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-3" + ], + "rationale": "Equal ranks or small address-matrix similarity are insufficient.", + "realization_blocks": [ + "B8a", + "B8b", + "B9a", + "B9b", + "C2", + "C7", + "C13", + "R5a", + "R5b" + ], + "sources": [ + "P2", + "P5", + "P6" + ], + "statement": "Specify exact frames/labels and complete address action, spectators, inverse and simultaneous injectivity.", + "status": "semantic_route_pass_sparse_tariff_open", + "title": "Physical representations and routes", + "verification_method": "Exact projectors/charts, complete payload action and route proof." + }, + { + "classification": "interface", + "id": "IF-5", + "logical_functions": [ + "L1", + "L2", + "L3", + "L4", + "L5", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Use a different lift or a tighter bound; old coefficients need not match.", + "reopened_obligations": "Any downstream assumption exceeded by the new envelope.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-4", + "SYS-5" + ], + "rationale": "A new representative may be valid but have different growth.", + "realization_blocks": [ + "A0b", + "A4a", + "A4b", + "A4c", + "A4d", + "A7a", + "A7b", + "A8", + "C11a", + "C11b", + "C11c", + "C11d" + ], + "sources": [ + "P2", + "P4", + "P7" + ], + "statement": "Bound coefficients, signed growth, norms, errors and record widths consumed by callers.", + "status": "source_specific_exact_and_inherited_proofs", + "title": "Consumed numerical envelope", + "verification_method": "Signed prefix bounds and full analytic error propagation." + }, + { + "classification": "model_and_interface", + "id": "IF-6", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Change counts, width, replicas, stage count or recurrence type with complete new accounting.", + "reopened_obligations": "Stock/lifetime compatibility, full profile, finite constants, fallback, leaf and outer consumers.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-3", + "SYS-5" + ], + "rationale": "Lower call count is not equivalent to lower paid moment.", + "realization_blocks": [ + "B10", + "B11", + "R1", + "R2", + "R3", + "R4", + "R5a", + "R5b", + "D5" + ], + "sources": [ + "P2", + "P3", + "P8" + ], + "statement": "Declare net child inventory, true stock, replicas, finite costs, fallback, shrink and normalization.", + "status": "whole_supplier_evidence_is_source_specific", + "title": "Complete paid resource interface", + "verification_method": "Full ledger and applicable scalar/stateful recurrence." + }, + { + "classification": "selected_architecture", + "id": "ARC-1", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Use a different proved schedule or different stage topology.", + "reopened_obligations": "Observation/owner/route dependencies, joint endpoints and full schedule bill.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-2", + "IF-3", + "IF-4" + ], + "rationale": "Interleaving may expose unfinished state.", + "realization_blocks": [ + "B10", + "C12a", + "C12b", + "C12c" + ], + "sources": [ + "P3" + ], + "statement": "When retaining the current global theorem, respect complete-cover phase barriers and dependencies.", + "status": "conditional_on_retained_stage_theorem", + "title": "Retained phase-major composition", + "verification_method": "Source schedule and endpoint-composition proof." + }, + { + "classification": "selected_architecture", + "id": "ARC-2", + "logical_functions": [ + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Change to coupled completion or a new live helper.", + "reopened_obligations": "Joint payload endpoint, ownership/lifetimes, complete routing and resulting recurrence.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-3", + "IF-4", + "IF-6" + ], + "rationale": "Volume and ranks alone do not complete a bank.", + "realization_blocks": [ + "B8a", + "B8b", + "B11" + ], + "sources": [ + "P3", + "P6" + ], + "statement": "When using independent banks, actual routed block projectors are disjoint and sum to each required bank endpoint.", + "status": "source_bound_bank_proof_not_new_composite_admission", + "title": "Independent completed bank realization", + "verification_method": "Actual chart identities, census, injectivity, endpoint and reverse schedule." + }, + { + "classification": "selected_architecture_and_model", + "id": "ARC-3", + "logical_functions": [ + "L6", + "L7", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Choose different bases, prime set or reduction.", + "reopened_obligations": "Complete new prime coverage, good/bad dispatch and fallback.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-1", + "IF-4" + ], + "rationale": "Invalid denominators make routing undefined.", + "realization_blocks": [ + "B9a", + "C13", + "R5a" + ], + "sources": [ + "P3", + "P5" + ], + "statement": "For the rational-chart reduction, every consumed inverse/scaling exists at each eligible prime/ring.", + "status": "source_bound_prime_evidence", + "title": "Eligible chart arithmetic", + "verification_method": "Cleared Gram and denominator factors; unit checks." + }, + { + "classification": "selected_architecture", + "id": "ARC-4", + "logical_functions": [ + "L4", + "L5" + ], + "overconstraint_audit": { + "escape_route": "Change representation, normalization or decoder with a complete alternative recovery proof.", + "reopened_obligations": "Affected error, scales, layout, widths, carry and finite costs.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-5" + ], + "rationale": "The decoder's input assumptions must be established.", + "realization_blocks": [ + "A7a", + "A7b", + "A8", + "A9" + ], + "sources": [ + "P7" + ], + "statement": "For this recovery, restore both normalizations and coefficient order and achieve pre-rounding error below one half.", + "status": "conditional_retained_analytic_proof", + "title": "Retained approximate convolution recovery", + "verification_method": "Exact scaling/width equations, inverse layout, nearest-integer and carry proofs." + }, + { + "classification": "selected_architecture", + "id": "ARC-5", + "logical_functions": [ + "L10", + "L11" + ], + "overconstraint_audit": { + "escape_route": "Change bootstrap depth, balanced family or outer reduction.", + "reopened_obligations": "The replacement recurrence/leaf bridge and all affected analytic inequalities.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-6" + ], + "rationale": "A limiting coarse rate is not a completed leaf.", + "realization_blocks": [ + "R3", + "R4", + "D5" + ], + "sources": [ + "P8" + ], + "statement": "For this bound, use attained ordinary savings and valid bridge data in the selected outer inequalities.", + "status": "finite_rational_checks_plus_inherited_analytic_interfaces", + "title": "Selected ordinary-leaf and outer assembly", + "verification_method": "Three levels, 47 strict constraints and seven margins in current source." + } + ], + "schema": "full-hierarchy-reconciliation/1", + "selected_manifest": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "types": { + "BitState": { + "address": "rational charts then eligible odd-prime address ring", + "meaning": "versioned complete source/target/dirty arrays with exact frames and owners", + "payload": "F2" + }, + "Bits": { + "meaning": "two nonnegative n-bit operands", + "payload": "N", + "shape": "U,V,n" + }, + "CRTInputs": { + "address": "coprime source-axis product", + "meaning": "convolution-preserving CRT layout", + "payload": "dyadic complex grid" + }, + "ComplexState": { + "address": "exact phase-sensitive frame labels", + "meaning": "versioned source/target/tableau/work streams", + "payload": "exact complex linear action plus chosen dyadic realization" + }, + "Descriptors": { + "meaning": "preserved U,V plus selected size, radix, precision and guards", + "payload": "N and exact metadata" + }, + "Digits": { + "meaning": "U=sum u_i 2^(bi); V=sum v_i 2^(bi)", + "payload": "Z", + "shape": "two N-digit arrays, base 2^b" + }, + "Evidence": { + "meaning": "version-bound proof claim, checked receipt, inherited hypothesis or open obligation", + "payload": "no runtime payload" + }, + "Factors": { + "meaning": "generated chirp/Gaussian factors and precision descriptors", + "payload": "dyadic approximations plus exact bounds" + }, + "IntegerCoefficients": { + "meaning": "exact uncarried convolution coefficients", + "payload": "Z" + }, + "NearIntegerCoefficients": { + "meaning": "all scales and inverse coefficient layout restored; error <1/2", + "payload": "dyadic complex grid" + }, + "PaddedInputs": { + "meaning": "zero-padded length S>2N-2", + "payload": "dyadic complex grid" + }, + "PairedSpectrum": { + "meaning": "both operand spectra in the same retained R order", + "payload": "dyadic complex grid" + }, + "PartialRecovery": { + "meaning": "after first recovery scale; nearest integer is not yet justified", + "payload": "dyadic complex grid" + }, + "PhaseApplicationInput": { + "meaning": "factor approximation, bounded values and precision contract", + "payload": "dyadic factor and dyadic complex tensor" + }, + "PhaseDescriptor": { + "meaning": "chirp or twist exponent for the numerical factor routine", + "payload": "exact address/axis/precision metadata" + }, + "Product": { + "meaning": "requested exact serialization of UV", + "payload": "N" + }, + "ResamplingState": { + "meaning": "ordered sample-selection/Neumann/diagonal-correction state, with exact axis/width refinements", + "payload": "dyadic complex grid" + }, + "ResidualRequest": { + "meaning": "full residual, m,r,n,w, required entry/exit frames and borrowed-row contract", + "payload": "tagged bit or complex operator" + }, + "ResidualResponse": { + "meaning": "completed smaller residual and promised restored rows", + "payload": "same operator tag as request" + }, + "ScaledConvolution": { + "meaning": "approximation to (a*b)/S^2", + "payload": "dyadic complex grid" + }, + "ScaledInputs": { + "meaning": "two digit arrays scaled by 2^(-b-2)", + "payload": "dyadic complex grid" + }, + "SourceSpectrum": { + "meaning": "resampled RF_s output; F_s normalized by 1/S", + "payload": "dyadic complex grid" + }, + "SpectrumProduct": { + "meaning": "pointwise product with declared rounding envelope", + "payload": "dyadic complex grid" + }, + "SyntheticState": { + "meaning": "normalized ring records; exact phase and LB order supplied by refinement", + "payload": "dyadic complex polynomial ring" + }, + "WorkingSpectrum": { + "meaning": "chirp-normalized QF_t tensor", + "payload": "dyadic complex grid" + }, + "WorkingTensor": { + "address": "power-of-two axes", + "meaning": "Gaussian-expanded tensor", + "payload": "dyadic complex grid" + } + } +} diff --git a/docs/multicut-delayed-inverse-checkpoint/incremental_receipt.json b/docs/multicut-delayed-inverse-checkpoint/incremental_receipt.json new file mode 100644 index 0000000000..9d6fd01d86 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/incremental_receipt.json @@ -0,0 +1,194 @@ +{ + "auxiliary_models": { + "joint259_system_docs_hierarchy.json": "5254b3b9c8c29d29e482e8b5ad2ec0469c1541b3c09ac817eff86f66e3a3ab4c", + "joint259_system_docs_hierarchy_edges.json": "53a1d2d2e37e3d30c15d174993a1115e0ea793d9bda88fd7c8169b6c8b90ae1a" + }, + "dependencies": { + "configuration": { + "font": "Vera", + "height": 790, + "invariant": 1, + "pdf_compression": 0, + "width": 1120 + }, + "extra": {}, + "files": { + "cache_implementation": "d8b68721b990d470f2df1a9a71631eddc177a8fdd13712f7f7ef45c157031e9b", + "font_Vera.ttf": "c4c45690b345435b2cba52ecabe275f05e49b389b39fe68ad03afbb551288d3d", + "font_VeraBd.ttf": "cc037385e4d55bfde89b13e03091ee93bf40c0c52ddd391ff031ab276f13b8e9", + "renderer": "b95275e4aeb973e54ff48772b89f5694cff53d410e83b2ef3146a08ee727600e", + "renderer_module_hierarchy_views": "defdda0f0434bd6ec7200e6c2863916e52425445729d381af751dfc791a07353", + "renderer_module_previews": "13673f01cce4e69531e6f1436d1d15f0808fe73c4b26af8abfd2a6eff5909671", + "renderer_module_source_views": "b87a69833347df7f56d93c83b185fb3be3c616df22c860555385f33ea485be2c", + "requirements": "a9dbb802817bb330332628dc8c98fac5178600766e0837e9cd042438e159d9c3", + "source_binding": "53acbfc4c9cb93404f951789e866339a315ae84d6218a32932638a6ecc6d961c" + }, + "packages": { + "Pillow": "12.3.0", + "charset-normalizer": "3.5.1", + "pypdf": "6.10.0", + "reportlab": "4.4.9" + }, + "python_version": [ + 3, + 14, + 2 + ], + "schema": "joint259-vector-page-cache/1", + "source_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89" + }, + "dependency_sha256": "584e62b411bd5b77569851d5296b31bb5867db5e6348c8aa67f81f03a972ea56", + "model_sha256": "90bb02f05c9413c36900ec1e12cc45e030c37ac873426e95f3d19eb4147d8b06", + "page_cache_validation": "Schema, dependency and drawing-plan keys, PDF hash and single-page structure checked before reuse.", + "pdfs": { + "functional_architecture.pdf": "21cce9f08282a13775f6282f0bc9802c6ca6449f9c899bac75d26ca91842f556" + }, + "schema": "joint259-vector-page-cache/1", + "scope": "Vector-page rendering cache only; science replay is separate.", + "source_binding": { + "accepted_public_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "consumed_manifest_members": 136, + "consumed_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "consumed_total_paths": 137, + "documentation_only_edits": [ + "BANK-PROOF.md", + "NOTICE.md", + "PR259-PROVENANCE.md", + "PROOF.md", + "README.md", + "UPSTREAM-PR234-PROOF.md", + "proof/FINITE_BIT_ACCOUNTING.md", + "proof/INTEGRATED_PROOF.md" + ], + "public_manifest_members": 136, + "public_paths": 137, + "retained_numerical_pins": { + "LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "bank_check.py": "64790d1d45032e7f8ae2252d592759ff82def8033544107f9f0dd3bbc6841581", + "bank_template.py": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965", + "base_two_moment.py": "aee70c242a2f1d225528fabe2002e1564d1dc884797c07d28a831c7878ee9098", + "code/complex_basis.py": "52d68781eaf6d9decf02446a532a7336fcf15924a9f6781ba0833d038decb9f8", + "code/complex_labels.py": "ff5d5e914ef1be0f0cc30283a1ee39089b77e4b572f09543e7313d126bd26256", + "code/complex_scalars.py": "fa035447c1f3a5e878dfc18a900942aa180d8bfde03cdce2d21d9bf8b8409429", + "code/complex_splice.py": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c", + "code/geometry527.py": "bff96140e93c0cea01ed618b49b913f913c12d99ebb0e4e4342336cf5a102800", + "code/global_lowering.py": "c888c4d3c38d4a59b48f8a328fc495b3b38ee36ede133495522d8d76c100794b", + "code/physical527.py": "1723a5c53ec236529e46980c8eb2c45134c61275ac7fb85c8ad92223784de07c", + "finite_check.py": "dfb8dd62c4d068417434f6a43e15e5f69dfa40b4d95b7a8d4995b6950c095c61", + "hybrid-selection.json": "0229c2fad3b448d33ad1f21900ad67d13ab1e0c8e716ced9ec66b4ab0445c0b1", + "hybrid_transform.py": "c06837bbc6ccf068362e1f09f110319f20135588f42e3cb3f8bc753436802e09", + "inputs/complex/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "inputs/complex/NOTICE": "9419dd03a2f52cf8bdfc4d18216ce29f263ab583b27f01ced8e420985bcb7c81", + "inputs/complex/gcert1-p11-pr193.json.gz": "15251deb0c11e0504d7b297c9786818888a93f08b92b03c6c122784b70488633", + "inputs/complex/retained/FINITE_BRIDGE.txt": "66d8f4ea8752abd89952d6674a636575a0db16e18b1c16e293f48f64242f0c46", + "inputs/complex/retained/compact-control-layout.tex": "2bc28e50f3eb092195294cafa81213e520f6d42e7935e9905ad8a6199e2a7c87", + "inputs/complex/retained/compact-control-movement.tex": "b963c3d2f4e1b7059aa289bb4b4ac89b688920bcf42f5b20d7698cdef0132cc6", + "inputs/complex/retained/copied-centers-assembly.tex": "00117892971ae766188ace0af03030c44164fda105e42b70d84f52c3339a7dcb", + "inputs/complex/retained/copied-centers-lemma.tex": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe", + "inputs/complex/retained/endpoint-gauge-complex.tex": "dfee33b0281e5551bb6927f757ff0240abade60ae1800f715afd88853ae0191e", + "inputs/complex/retained/general-clifford-frames.tex": "c9bb9655b594583c6b4bab8cb485233f1d1e588f83858cf1e4c3530cee8fed54", + "inputs/complex/retained/stopped-product-complex.tex": "4738089103a4b263b3b0ef458f5ef35519c696f1ea871ae79e508d3720f5870a", + "inputs/complex/source-pins.json": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569", + "inputs/complex/sources/Work__Bridge__Cert.lean": "5c24746a6330907b9b37d6064095035a58575d64ce793d6d7c9881121fdc3980", + "inputs/complex/sources/Work__Bridge__Net.lean": "cf7d7d330b1bffe2e66712c873e647b13dc32db1ccfc0e0f4cd62ee6caf584f0", + "inputs/complex/sources/Work__Carrier__Live.lean": "6d0649eb62589e66057f044e1e2103fc42f3f57a1498f82a26565bd8eb4026d0", + "inputs/complex/sources/Work__Carrier__Phases.lean": "71dc3dda23dfe510d5d53cbada3a6c540cd1dc2825503fda618a5bd6cfc3e812", + "inputs/complex/sources/Work__Fourier__Main.lean": "2e8e88efd4dcbdf0b1a6e39ce7eea8c5fd5ffee2faf360a8c0c9cba84c0e4ef3", + "inputs/complex/sources/Work__GCert__Chain__Geom.lean": "c302f5834287421f11f3b0da7112fcde876cbc702896f2af4145b2d72ee393a2", + "inputs/complex/sources/Work__GCert__Chain__InvThm.lean": "ade7e7873da75ca63a4b5ce2f562dde9c12bfbb69d87d7ae831039ff790e5adb", + "inputs/complex/sources/Work__GCert__Chain__NetCert.lean": "22ae34809466b4ac2a2c5cdde526f51ff246f5189f7c142b38aa4c0dcffb04a4", + "inputs/complex/sources/Work__GCert__Chain__NetDef.lean": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520", + "inputs/complex/sources/Work__GCert__Chain__NetStage.lean": "c122bc01392a6fdcc0bee918fed81804d3c9b1d3e071016dab65a4ed804ef0b6", + "inputs/complex/sources/Work__GCert__Chain__Phased.lean": "0de429c80231334f1ce92575c1e8ac382ca2d5e7d956767b547639a8941d9a8c", + "inputs/complex/sources/Work__GCert__Chain__WinB.lean": "c33ec3fce09c0971c32ddcbb86d9383ffbe4c6d05cf36f20460005e6547bb845", + "inputs/complex/sources/Work__GCert__Data__B2Gp193Main.lean": "cb61f304da51f1dd0a2ec25bca4b63eb095eeb2863289e1e2bdee7c82beff48b", + "inputs/complex/sources/Work__GCert__Data__Glue.lean": "d5314f2b93a7f0e1c949fb502331825bfc6d9d8762d35f865443e7c95b6c7ef7", + "inputs/complex/sources/Work__GCert__Data__InstB2Gp193.lean": "9587ddb9961f44938032b609307ab91c0b0e757e3991f1ad95480dd50fd4f72b", + "inputs/complex/sources/Work__GCert__Data__P193Cert.lean": "d92ee6889be4753fc99f467bd84039743325123a1165128378b9c906a04f2703", + "inputs/complex/sources/Work__GCert__Data__P193Price.lean": "0299bcd0fe255960eec682eef0f045f7e5cb1e4711af2aab4393526eae2caea3", + "inputs/complex/sources/Work__GCert__Data__P193ScalOK.lean": "479434815822e98f015e335361089c3788d00dc3dd39c2944f75410aa0c158fe", + "inputs/complex/sources/Work__GCert__Data__RateB2Gp193x.lean": "6b40cac1481c931d47b1a092e382d04716ede0e785c492a2f2983e886a257c3f", + "inputs/complex/sources/Work__GCert__Data__Raw.lean": "aba94a004c94dcae7cf3047c88a6da9561555f4ebe8ab92e299e6ce09ee7aa66", + "inputs/complex/sources/Work__GCert__Data__SolutionB2Gp193x.lean": "45c768c9d71a7cc18bd6db74cb036db880d89580ca60557bb4a492280296b169", + "inputs/complex/sources/Work__GFrame__Engine__Adapt.lean": "feec0a3828867968a5c7c2c30b86ed70449abc3c660a60ada67203a75bae2ef7", + "inputs/complex/sources/Work__GFrame__Engine__Letters.lean": "34906dbf5ae16b5174db00b4881a5cc1d2e583b8c8806db6523a5e2f86565f09", + "inputs/complex/sources/Work__GFrame__Engine__Level.lean": "80fb3daa9a45de0ed6da570eb4476b9104734be65d0116f58bcfcbcd67f771d0", + "inputs/complex/sources/tools__gx__gxbind.py": "9c9dcfac47f0535bf3aa8ebf7c662cdef0ebda50a9f0a9282b8f3cf34809f835", + "inputs/complex/sources/tools__gx__gxconv.py": "dab7fec9f44c2d368ed334055d7126e202017feb46e41a8d86e2d998720f67c2", + "inputs/complex/sources/tools__gx__gxcore.py": "eb972c06fe8c322db2d9a8d9a7d05596e8f40c4ca8e5f42eb6df3c7361b5d517", + "kernel-candidates.json.gz": "5f6863ad27eb9f2fcb14db10320c00607451c01e12da303def13e48eda7a5d2d", + "loader/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/SOURCE_PINS.json": "5a4fa413ea0ecc74050359329e90521723151e421cc0c19f774b92bd608a3ac9", + "loader/expected_ledger.json": "4910004287e016f7f2db10f0a54eed24bf1912aa148b347b3cb4795fa3ac63f5", + "loader/expected_semantics.json": "b7de3178436c824b6be6d99842270a82e1821b8008dda66d8b18519ad347da2d", + "loader/raw_ledger.py": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32", + "loader/source_inputs/base_bit/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/source_inputs/base_bit/NOTICE": "c9850418622aea8d1382a230306c940947b5da818f4854b4b272ed60cf239f6c", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/bit/base_word.py": "9fe3a81b7561d2b09c086f63fac4626e88a32369ef8bc5579c94878de1218a89", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/bit/word.py": "85822e9cca5b1b2335c3704a3df2f3c6ef01e42d8328daacb33701d30cee80ab", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/references/pr168-v4/research/paired-cube-bit/check_paired_cube_bit.py": "4d7c86cd999a1519e0dfb6dcf33a8f26e442a353c3665a0f06881216a260fbf3", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/frames_p12.json.gz": "ad8e2705652b68476713d7647a8592505e222f2b3ccd1728dedce153aac6d462", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/graph_p12.json": "31a09a55920e64c8bfbac8b845dc01754c112aa6e207812e2fd1f4939d8f64cb", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/kchron_p12.json": "0fab548e84cf5ca7c04e8bd19b5810850463f36e0f92180efe73aeff17105e39", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/profile_p12.json": "c44ef8640cbcbcc9bac3a30e13373bd79efddde55d7cea514354ca2cdb60d66d", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/sinks.json": "c00ff70c564829d4b97740f92796fc6ce14fbcd5ca519663828650552b80249d", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/word_p12.json.gz": "1cb7e8ed45cf542e304fddc4b12247dbb248a0dc84dedbd832f336b2d172793a", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/NOTICE": "9fc5561c0995892dbdde777c713899486920c32d3562392f5f72377a4953bf98", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/frames/opframe-bases.json": "687496f3c15818e7cad1beb5fdf3812b8e38825ea302bfd60aea7ac23f3516b4", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/gaugeb/selection.json": "b0f9f0e67f94a3c21069f393ea27f9483d315bff2f53f77270163065a6345d1c", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/joint-selection.json": "13f6420d6c341c22235c9d136d5f7c32896974bb165a893fecd7e583b790d133", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/joint_word.py": "de37cbed753fc6f13a7e5dc25c8346279cfee5f1868df8c12a5fcb6ca8f631c0", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/pairs.json": "da54b863601b5cbc21d27fc5cd623bf805f974a3e47b81ed29a85aa5bad0fa05", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/schedule.json": "ab39d61fff7a2cfcb13e2c10d65f2c603e76a91013d197260d6c7b645ccb27a1", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/selection.json": "d94ef4e0b8ca98a7385b364cf245816a7cad08f850a60ce8b67aab4c3a89f3f4", + "loader/source_loader.py": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291", + "loader/test_public.py": "2103c953b37cf447d1a2bbb86c26f96fa5569a3ab018567e93884c12ebde8a2d", + "math_check.py": "bb7c80571104d9b9c30ce7be53654090dc006583ba1838557a5307b8a9db4a39", + "moment.py": "9d465c716c6b910ff66e1453e3bf0057608a787b5f5361be93781f42cb3370f7", + "outer.py": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c", + "parity_transform.py": "ef6f5224b91c409c30fc0886143787a0839a13cc6b148e42ca5db858d502ec4d", + "portable_bit.py": "51760a4ba5b431d55b245aca2036ef51249942503fdcd5d9317d515ce411b87c", + "portable_complex.py": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82", + "prepare.py": "fc109fe81d7d9d3f53483ce7d648dc9fcf6d9fb71b8fde1c867ece5283fadbcc", + "prime_check.py": "80b764f53b92b299569a401754047b1a86f80ba4046502bfbfea924f6ec95e0e", + "prime_witnesses.py": "98cd03bc9582e7bd0ab194c191ea8eea940539e510051443ab9fd3e572a364ab", + "proof/copied-centers-lemma.tex": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe", + "proof/primary/03-motifs.tex": "ed76761194988a01af77ead0ea6469cb5dcd29690ab985a0b5a4006b0f2b69bb", + "proof/primary/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "proof/three-stage-cover-bit.tex": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511", + "proof/three-stage-cover-rows.tex": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8", + "raw_ledger.py": "d5dae7b56d403adb778251e4b42903695632d522c1392505723e2125162cef78", + "regauge-selection.json": "135e314f37bd611a021776991c9d786377b3829f84ca576d5006696c2d8bfbed", + "regauge_transform.py": "baa1c7390f449722e7e700fa1ce9afc3d00cd4c0f7faa5f41693ff88ec02fd61", + "requirements.txt": "25f9f1fb1988b230147a1d3092d34e09c069eb7a6c6d6df46b3973b9f2d36efc", + "retiming-selection.json": "b173080a2884d5bfb28e35ed5b4256e233cafc6275cbfe5a76619b406f2ce989", + "retiming25-selection.json": "e66ba924727efa06f6d2f75357a3d5d4eea97c5eb0eccdc786e5814eb877ce14", + "retiming25.py": "5e9e835730aac1b0752019530daa1e75c8938686bf8a8a01640ab69ceada90f2", + "retiming_transform.py": "483cb8da83a1444cbc8b1bbe60473e571a27e6e589fa64f9a26910ca0d678407", + "scalar_check.py": "13ac9a3ef3c131739478ac1ba5903acd638cf5a41c6fa463fa3e27325413c7f9", + "source527/echelon/selection.json": "8e6ce5e257aa7656898ab46bc3421df4a619497b1e9f5956d2c546b3014050a7", + "source527/extra/selection.json": "791f6ddeb19add7026ba37461256c13efe3d35bba0bccf1cb9787a01fc16f0f2", + "source527/fresh/selection.json": "4df5f96064349415882ece4ac9abd19cc778f18c0306a27b3d65027dcb04b6c7", + "source527/paired-selection.json": "67a24896e5ff6a16735efdff57fbb875aa411aba00cbabb22c43a91cdf63e084", + "source527/pr230/NOTICE": "7dfbad087ee49b74fd5075d517eaa263c5dd3d4fbd4c69bfba34ee1cb55e837f", + "source527/pr230/PROVENANCE.json": "19957e28a8ad26281bfe8bfaf8ae16191be53e729a8870a6154671b3384959d4", + "source527/pr230/active-opframe-bases.json": "9a2bba5c72aebc9ee4f21e59b10ce810b2da98a1fa1748fbc44c50a080e584ff", + "source527/rank/selection.json": "5c97c6413f1eb56c7b8f9ba9e839329d212fae7ac3a08c29e9efdee42f5048a0", + "source527/targetagg/selection.json": "b7a4d5eb2a6d2f7df867f9be5af7da1d1aa99cfbd5214195967b0ff60642d77a", + "source527/word.py": "e675d4eb9d90ff0b44279fae0b46f1a8b39f65421cc38454b70a6b75d0e10b42", + "verify.py": "489bee6d23fbed6732e60d62f8fa98e7d2dfb2d2b7f75fd2bd3bc4a920155f10" + }, + "schema": "selected-docs-source-binding/1", + "scientific_archive_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "scope": "Public extraction reuses the exact117 numerical inputs from the all-eight-stage tested143-file archive. It is not a second all-eight-stage execution of the137-file tree.", + "source_binding_configuration_sha256": "53acbfc4c9cb93404f951789e866339a315ae84d6218a32932638a6ecc6d961c" + }, + "svg_converter": { + "executable_sha256": "95a779ec46131bb296cccef9526e6d6a73fd6c11df3b119531e767f0f00ee734", + "version": "pdftocairo version 26.02.0\nCopyright 2005-2026 The Poppler Developers - http://poppler.freedesktop.org\nCopyright 1996-2011, 2022 Glyph & Cog, LLC" + } +} diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_build.py b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_build.py new file mode 100644 index 0000000000..1423c09e8d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_build.py @@ -0,0 +1,285 @@ +#!/usr/bin/env python3 +"""Regenerate the selected functional architecture reference and its indexes. + +No Graphviz is used. Diagrams are vector paths in deterministic ReportLab PDFs. +The source package is read-only. The default build writes only to a new --output. +--emit-json produces the same ASCII artifacts on stdout for managed write tools. +""" +from __future__ import annotations +import argparse, base64, hashlib, io, json, math, re, sys +import reportlab +from pathlib import Path +from collections import Counter +from reportlab.pdfgen import canvas +from reportlab.lib.colors import HexColor, white +from reportlab.lib.utils import simpleSplit +from pypdf import PdfReader, PdfWriter +from pypdf.generic import NameObject, StreamObject +from reportlab.pdfbase import pdfmetrics +from reportlab.pdfbase.ttfonts import TTFont +import joint259_system_docs_hierarchy_views as hierarchy_views +import joint259_system_docs_previews as previews +import joint259_system_docs_sources as source_views +BASE=Path(__file__).resolve().parent +PREFIX="joint259_system_docs" +MODEL=BASE/(PREFIX+"_model.json") +W,H=1120,790 +INK="#142D3A"; BLUE="#176B8B"; TEAL="#147D77"; GOLD="#B2761B"; PALE="#EAF4F7"; MUTED="#526873"; RED="#99432F" +FONT="Vera" +for name,file in [(FONT,"Vera.ttf"),(FONT+"-Bold","VeraBd.ttf")]: + pdfmetrics.registerFont(TTFont(name,str(Path(reportlab.__file__).parent/"fonts"/file))) +def sha(b):return hashlib.sha256(b).hexdigest() +def stable(obj):return json.dumps(obj,sort_keys=True,indent=2,ensure_ascii=True)+"\n" +def validate_model(model): + blocks={b['id']:b for b in model['blocks']} + if len(blocks)!=len(model['blocks']):raise ValueError('Duplicate block ID') + req={r['id']for r in model['requirements']} + if len(req)!=len(model['requirements']):raise ValueError('Duplicate requirement ID') + ids=set();fed=set() + for b in blocks.values(): + if not set(b['requirements'])<=req:raise ValueError('Unknown requirement '+b['id']) + for edge in model['edges']: + if edge['id'] in ids:raise ValueError('Duplicate edge ID') + ids.add(edge['id']) + if edge['from'] not in blocks or edge['to'] not in blocks:raise ValueError('Unknown edge endpoint') + for direction,bid,field in [('outputs',edge['from'],'out'),('inputs',edge['to'],'in')]: + ports={p.split(':',1)[0]for p in blocks[bid][direction]} + if edge[field] not in ports:raise ValueError('Undeclared port '+edge['id']+' '+bid+'.'+edge[field]) + fed.add((edge['to'],edge['in'])) + for e in model.get('external_inputs',[]): + if e['block'] not in blocks or e['port'] not in {p.split(':',1)[0]for p in blocks[e['block']]['inputs']}:raise ValueError('Unknown external port') + fed.add((e['block'],e['port'])) + required={(b['id'],p.split(':',1)[0])for b in blocks.values()for p in b['inputs']} + if required-fed:raise ValueError('Unbound input ports: '+str(sorted(required-fed))) +def source_index(root,model): + refs={} + for b in model["blocks"]: + for token in b["sources"]: + path,anchor=token.split("|",1) + text=(root/path).read_text();lines=text.splitlines() + found=[i for i,line in enumerate(lines) if anchor in line] + if not found:raise ValueError("Missing source anchor: "+token) + i=found[0];key="S%02d"%(len(refs)+1) + if token in refs:continue + refs[token]={"id":key,"path":path,"anchor":anchor,"line":i+1,"sha256":sha((root/path).read_bytes()),"excerpt":" ".join(lines[i:i+2]).strip()[:205]} + return refs +class Doc: + def __init__(self,kind,model,refs): + self.kind,self.model,self.refs=kind,model,refs + self.buf=io.BytesIO();self.c=canvas.Canvas(self.buf,pagesize=(W,H),pageCompression=0,invariant=1) + self.c.setTitle(model["title"]);self.c.setAuthor("Henry Grant; prepared with OpenAI assistance") + self.n=0;self.ids=set();self.links=[];self.used_blocks=set();self.pages=[];self.boxes=[] + def text(self,x,y,text,size=12,color=INK,width=990,bold=False,leading=None): + initial_y=y + self.c.setFillColor(HexColor(color));self.c.setFont(FONT+("-Bold" if bold else ""),size) + leading=leading or size*1.35 + for line in str(text).split("\n"): + pieces=simpleSplit(line,FONT+("-Bold" if bold else ""),size,width) or [""] + for p in pieces:self.c.drawString(x,y,p);y-=leading + if initial_y>39 and y<39:raise ValueError("Text overflow page %s: %s"%(self.n,str(text)[:90])) + return y + def link(self,x,y,text,target,width=None,size=10): + width=width or self.c.stringWidth(text,FONT,size) + self.text(x,y,text,size,BLUE,width=width+8) + self.c.linkRect("",target,(x,y-3,x+width,y+size+2),relative=0,thickness=0) + self.links.append((self.n,target)) + def page(self,key,title,kicker): + if self.n:self.c.showPage() + self.n+=1;self.ids.add(key);self.pages.append({"id":key,"title":title,"page":self.n}) + self.c.bookmarkPage(key);self.c.addOutlineEntry(title,key,0,False) + self.c.setFillColor(HexColor("#F7FAFB"));self.c.rect(0,0,W,H,fill=1,stroke=0) + self.text(42,H-33,kicker.upper(),10,TEAL,bold=True) + self.text(42,H-71,title,25,INK,bold=True) + self.text(42,23,"SELECTED HYBRID | science archive 9f6d8637... | conditional construction",9,MUTED) + self.text(W-95,23,str(self.n),10,MUTED) + if key!="CONTENTS":self.link(W-160,H-33,"Contents","CONTENTS",100) + def panel(self,x,y,w,h,title,text,color=BLUE,compact=False): + self.c.setFillColor(white);self.c.setStrokeColor(HexColor("#C8D9DF")) + self.c.roundRect(x,y,w,h,8,fill=1,stroke=1) + self.c.setFillColor(HexColor(color));self.c.roundRect(x,y+h-6,w,6,2,fill=1,stroke=0) + yy=self.text(x+15,y+h-28,title,11.5 if compact else 13,color,w-30,True) + yy=self.text(x+15,yy-7,text,9.5 if compact else 11,INK,w-30,leading=12.5 if compact else 15) + if yyx1:p=(x1+w1,y1+h1/2);q=(x2,y2+h2/2) + else:p=(x1,y1+h1/2);q=(x2+w2,y2+h2/2) + else: + p=(x1+w1/2,y1 if y2" + obj[NameObject("/Filter")]=NameObject("/ASCII85Decode") + obj.pop(NameObject("/DecodeParms"),None) + if hasattr(obj,"decoded_self"):obj.decoded_self=None + buf=io.BytesIO();writer.write(buf);raw=buf.getvalue() + # ReportLab's four high-bit header bytes are a binary-file marker only. + # Replace with same-length ASCII so this PDF can be persisted losslessly + # through a text patch. Streams use ASCII85; offsets stay unchanged. + raw=raw.replace(b"%\x93\x8c\x8b\x9e",b"%ASCI",1).replace(b"%\xe2\xe3\xcf\xd3",b"%ASCI",1) + raw.decode("ascii") + r=PdfReader(io.BytesIO(raw));assert len(r.pages)==self.n + for page in r.pages:assert (page.extract_text()or"").strip() + return raw,{"pages":self.pages,"internal_links":len(self.links),"blocks":sorted(self.used_blocks),"sha256":sha(raw)} +def cover(d): + d.page("CONTENTS","The selected construction, at three levels","Functional architecture and compiler workflow") + d.text(42,673,d.model["title"],14,INK,width=1000,bold=True) + d.panel(42,458,500,155,"THE NUMERICAL CONTRACT","513 retained PR259 cohorts + seven delayed-inverse intervals + the same 25 PR258/260 retimings applied once.\nConditional kappa: 0.000711045547624400.\nLiteral stock 867,045; 19,786,600 paid children.",TEAL) + d.panel(566,458,512,155,"HOW TO READ THE CONNECTIONS",str(len(d.model['blocks']))+" current blocks and "+str(len(d.model['edges']))+" typed block dependencies. All 87 original hierarchy IDs are reconciled separately.\nArchitecture views show high-level process and compiler flow. Inherited all-size internals remain contracts.",GOLD) + y=418 + d.link(46,y,"Full integer-product hierarchy and all 87 original blocks","H_SYSTEM",850,12);y-=27 + for key,t in [("FVIEW1","Functional: source-bound local supplier"),("FVIEW2","Functional: global assembly and exact closure")]: + d.link(46,y,t,key,600,13);y-=29 + for key,t in [("CATALOG","Block catalog: what, why, ports, requirements and proof"),("REQUIREMENTS","Requirements and source traceability"),("SOURCES","Exact source anchors and hashes"),("SCOPE","Coverage, heritage and reproduction boundary")]: + d.link(46,y,t,key,820,12);y-=27 + d.text(46,y-12,"Navigation: clickable blocks open the catalog; source IDs open exact proof anchors; every page returns here.",11,MUTED,width=1000) +def fviews(d): + d.page("FVIEW1","Functional architecture | local supplier","Actual compiler flow; not experiment chronology") + positions={} + ids=["F01","F02","F03","F04","F05","F06","F07","F08","F09","F10"] + for i,b in enumerate(ids): + row=i//5;col=i%5 if row==0 else 4-i%5 + positions[b]=d.node(b,42+col*210,496-row*181,190,113) + for i in range(9):d.arrow(positions[ids[i]],positions[ids[i+1]]) + d.text(42,663,"Pinned source recipes -> literal records -> selected compatible transformations -> independently checked payload.",13,MUTED) + d.panel(42,126,510,141,"ONE COMPOSITION","The kernel and interval transforms share the exact PR249 base. Five conflicting quartets are removed before the seven intervals enter. The interval helper prefix columns are checked against all retained cohort operands.",TEAL) + d.panel(575,126,503,141,"STABLE IDENTITIES","F06 output: 2e0bc2a5... (exact PR249 base)\nF08 output: 6ab38175... (joint replacement)\nF09 output: acf510b1... (25 retimings once)\nFull digests are in the catalog and source index.",BLUE) + d.text(44,82,"Cross-edges: F01 supplies all selections; F06 supplies the interval witness base. F09 also feeds F11/F15 on the next sheet.",11,MUTED) + d.page("FVIEW2","Functional architecture | complete conditional closure","Independent evidence flows meet before admission") + pos={} + for bid,x,y in [("F11",42,509),("F12",253,509),("F13",464,509),("F14",675,509),("F15",886,509),("F16",42,327),("F17",253,327),("F18",464,327),("F19",675,327),("F20",886,327),("F21",675,142)]: + pos[bid]=d.node(bid,x,y,190,118) + for a,b in [("F11","F12"),("F12","F13"),("F13","F14"),("F16","F17"),("F17","F18"),("F18","F19"),("F15","F20"),("F19","F21"),("F20","F21")]:d.arrow(pos[a],pos[b]) + d.arrow(pos["F14"],pos["F17"],"literal profile") + d.text(42,663,"The bit and complex suppliers remain distinct. Scalar, geometric, bank, moment and finite proof ports must all close.",13,MUTED) + d.panel(42,128,589,135,"SIDE INPUTS AND BOUNDARIES","F10 semantics/prefix and F15 geometry/primes feed F20. F11 records feed F14; F16 guards also feed F19. The connection index names all declared block inputs.\nF21 requires raw, bit, scalar, primes, banks, complex, math and finite results, then rechecks the source manifest.",TEAL) + d.text(42,77,"The arrows are compiler/proof dataflow. No local optimization or individual PR contributes an independent additive kappa gain.",11,MUTED) +def catalog(d): + for i in range(0,len(d.model["blocks"]),2): + bs=d.model["blocks"][i:i+2] + d.page("CATALOG" if i==0 else "CATALOG%02d"%i,"Functional blocks | "+" + ".join(b["id"] for b in bs),"What / why / ports / invariants / heritage / proof") + for n,b in enumerate(bs): + d.bookmark("B_"+b["id"]);d.used_blocks.add(b["id"]) + x=43+n*530;y=669 + y=d.text(x,y,b["id"]+" "+b["name"],20,INK,495,True)-6 + for title,value in [("WHAT",b["what"]),("WHY",b["why"]),("INPUT PORTS","; ".join(b["inputs"])),("OUTPUT PORTS","; ".join(b["outputs"])),("REQUIREMENTS"," ".join(b["requirements"])),("INVARIANTS"," ".join(b["invariants"])),("HERITAGE",b["heritage"])]: + y=d.text(x,y,title,9,TEAL,495,True)-1 + y=d.text(x,y,value,11,INK,495,leading=14.2)-10 + y=d.text(x,y,"PROOF / IMPLEMENTATION",9,TEAL,495,True)-3 + for token in b["sources"]: + r=d.refs[token];d.link(x,y,r["id"]+" "+r["path"]+" : "+str(r["line"]),"SRC_"+r["id"],480,9);y-=18 + if y<58:raise ValueError("Block catalog overflow "+b["id"]) +def requirements(d): + for start in [0,6]: + d.page("REQUIREMENTS" if start==0 else "REQUIREMENTS2","Requirement traceability | %d-%d"%(start+1,start+6),"Derived construction obligations; not a new theorem specification") + y=673 + for r in d.model["requirements"][start:start+6]: + owners=[b["id"] for b in d.model["blocks"] if r["id"] in b["requirements"]] + y=d.text(43,y,r["id"]+" "+r["name"],15,TEAL,bold=True) + y=d.text(43,y-5,r["text"],12,INK,1020) + x=43 + for bid in owners:d.link(x,y-2,bid,"B_"+bid,46,10);x+=53 + y-=39 +def sources(d): + values=list(d.refs.values()) + for i in range(0,len(values),8): + d.page("SOURCES" if i==0 else "SOURCES%d"%i,"Source anchors | %d-%d"%(i+1,min(i+8,len(values))),"Pinned active implementation and proof locations") + y=672 + for r in values[i:i+8]: + d.bookmark("SRC_"+r["id"]) + y=d.text(43,y,r["id"]+" "+r["path"]+" : "+str(r["line"]),13,TEAL,bold=True) + y=d.text(43,y-2,r["anchor"],10,INK,1010) + y=d.text(43,y-1,"SHA256 "+r["sha256"],9,MUTED,1010)-17 +def scope(d): + d.page("SCOPE","Coverage and publication boundary","Source-faithful documents; scientific replay is separate") + sections=[ + ("Selected active heritage","PR249's 21 transported entrances -> PR259's 513 retained cohorts (five quartets removed) + seven new delayed-inverse intervals -> 25 same-gate PR258/PR260 retimings once. PR254 is ancestry, not another additive saving. PR251's extra sixteen entrances are excluded."), + ("Architectural and theorem heritage","PR234 supplies Henry Grant / hcg890's five-stage architecture and finite interfaces. PR237 is a prior width-120 bank extension; no exclusive priority is claimed. The source527 and completed-bank chains retain all upstream licenses and contributor notices. Complex source is Jacob Sussman's f010392 snapshot; PR209 is its documentation pointer, and PR193 supplies the helper lineage."), + ("Coverage stated exactly","The current architecture catalog and dependency index account for every declared block input port. All 87 original hierarchy IDs are explicitly reconciled. The visual views summarize architecture and compiler flow; reference pages preserve source and requirement traceability. Inherited theorem internals remain unexpanded."), + ("Evidence and pending checks","The recorded cloud admission freshly executed changed stages and reused byte/AST-bound unchanged signed-source and complex evidence. Mac standalone replay has now reported all eight stages passing with 143 unchanged source files. This explicit PR259 hybrid checkpoint remains mathematically conditional and is below the later PR266 frontier. Documentation checks are separate from scientific replay."), + ("Public follow-up only","Construction checkpoint PR #277: https://github.com/CrocSwap/integer-mult-bounds/pull/277. Public source commit c2f07d311bfdad0d89bf961e4da133ee97bb78de is linked in README.md. Source anchors retain exact relative paths, symbols, line numbers and hashes. The historical combined_system_schematic_20261010 generator is preserved unchanged.") + ] + y=666 + for title,body in sections: + y=d.text(43,y,title,15,TEAL,bold=True)-4;y=d.text(43,y,body,12,INK,1018)-21 + d.page("BUILD","Reproduce the architecture reference","Pinned Python dependencies; no Graphviz requirement") + y=672 + for title,body in [ + ("Install","Python 3.11+; python -m pip install -r joint259_system_docs_requirements.txt. Pinned reportlab 4.4.9, pypdf 6.10.0, Pillow 12.3.0, charset-normalizer 3.5.1. Graphviz is not used or required."), + ("Architecture build command","python -B joint259_system_docs_incremental.py --source /path/to/public-package --output joint259-docs-build --svg. An admitted source ZIP also works. Actual consumed manifest is recorded separately from the tested science archive in source_binding.json and QA.json."), + ("Outputs","functional_architecture.pdf; summary-functional.svg; QA.json; incremental_receipt.json. The retained renderer also emits local source, requirement and dependency indexes from the same pinned source."), + ("Automatic reproducibility checks","Build every PDF twice in memory and require byte-identical SHA256, unchanged manifest, no missing/extra source files, valid proof anchors, all catalog block IDs present, all internal links resolved, nonempty extractable page text and no layout overflow. QA.json records counts, pins and output digests."), + ("Independent visual check","Use Poppler: pdftoppm -png -r 100 functional_architecture.pdf review/page. Inspect every page for clipping, missing glyphs and readable connectors. Poppler is an optional renderer, not a generation dependency; record its actual version in visual QA."), + ("Scientific verification remains separate","From a clean source package, use Python 3.11+ and SymPy 1.14.0 with assertions enabled: python -B verify.py --output /new/output/directory. Never write inside the immutable source package; never use -O. A successful documentation build is not an all-eight-stage science replay.") + ]: + y=d.text(43,y,title,15,TEAL,bold=True)-5;y=d.text(43,y,body,12,INK,1015)-25 +def render(kind,model,refs): + if kind != "functional":raise ValueError("Unsupported architecture output kind") + validate_model(model) + d=Doc(kind,model,refs);cover(d) + hierarchy_views.overview(d);hierarchy_views.transforms(d) + fviews(d) + catalog(d);hierarchy_views.catalog(d);hierarchy_views.connections(d);hierarchy_views.requirements(d);requirements(d);sources(d);scope(d) + return d.finish() +def integrity(root,expected): + return source_views.integrity(root,expected) +def main(source_override=None): + ap=argparse.ArgumentParser(description=__doc__);ap.add_argument("--source",type=Path,required=True);ap.add_argument("--output",type=Path);ap.add_argument("--emit-json",action="store_true");args=ap.parse_args() + model=json.loads(MODEL.read_text());root=source_views.open_source(source_override if source_override is not None else args.source.resolve());count=integrity(root,model["source_manifest_sha256"]);refs=source_index(root,model) + consumed_manifest=sha((root/'MANIFEST.json').read_bytes()) + source_binding={**source_views.BINDING,'consumed_manifest_sha256':consumed_manifest,'consumed_manifest_members':count,'consumed_total_paths':count+1,'source_binding_configuration_sha256':sha((BASE/'joint259_system_docs_source_binding.json').read_bytes())} + files={};reports={} + for kind,name in [("functional","functional_architecture.pdf")]: + one,report=render(kind,model,refs);two,_=render(kind,model,refs) + if one!=two:raise ValueError("Nondeterministic "+kind) + files[name]=one.decode("ascii");reports[name]=report + index={"schema":"selected-functional-architecture/1","source_manifest_sha256":model["source_manifest_sha256"],"level":"functional architecture block dependencies","complete_individual_operation_inventory":False,"blocks":model["blocks"],"block_edges":model["edges"],"unexpanded":["all-size weighted compiler internals","full GL-cover and common-ancestor charts","restored-row and routing primitive internals","prime-supply theorem","recovery theorem","complex symbolic and analytic theorems"],"coverage_limits":["Block dependencies describe architecture and compiler/proof flow, not individual physical-operation wires.","The visual views and reference indexes do not expand inherited theorem internals."]} + files["connection_index.json"]=stable(index) + index['source_manifest_sha256']=consumed_manifest + index['scientific_archive_manifest_sha256']=model['source_manifest_sha256'] + files["connection_index.json"]=stable(index) + files['source_binding.json']=stable(source_binding) + files["source_index.json"]=stable(list(refs.values())) + files["requirement_traceability.json"]=stable([{**r,"blocks":[b["id"]for b in model["blocks"]if r["id"]in b["requirements"]]}for r in model["requirements"]]) + files["diagram_model.json"]=stable(model) + files["hierarchy_reconciliation.json"]=stable(hierarchy_views.DATA) + files["hierarchy_edges.json"]=stable(hierarchy_views.EDGES) + files.update(previews.files(model)) + files["scientific_reproduction.json"]=(BASE/'joint259_system_docs_evidence.json').read_text() + integrity(root,model["source_manifest_sha256"]) + qa={"status":"PASS_DOCUMENT_STRUCTURE_AND_DETERMINISM","source_files":count,"source_manifest_sha256":model["source_manifest_sha256"],"block_count":len(model["blocks"]),"typed_block_edges":len(model["edges"]),"requirements":len(model["requirements"]),"source_anchors":len(refs),"pdfs":reports,"byte_identical_rebuilds":True,"visual_review":"separate; not inferred from structural checks","science_replay":"not run by documentation build","Graphviz":"not used"} + files["QA.json"]=stable(qa) + qa['source_manifest_sha256']=consumed_manifest + qa['scientific_archive_manifest_sha256']=model['source_manifest_sha256'] + qa['source_binding_configuration_sha256']=source_binding['source_binding_configuration_sha256'] + files['QA.json']=stable(qa) + if args.emit_json:print(stable(files),end="") + else: + if not args.output:ap.error("--output or --emit-json required") + args.output.mkdir(parents=True,exist_ok=False) + for name,content in files.items():(args.output/name).write_bytes(content.encode("ascii")) + print(stable(qa),end="") +if __name__=="__main__":main() + diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_evidence.json b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_evidence.json new file mode 100644 index 0000000000..cad55bc86d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_evidence.json @@ -0,0 +1,54 @@ +{ + "status": "PASS_LOCAL_ALL_EIGHT_FRESH_STAGES", + "archive_sha256": "0461e04fbf0fa0951534e3a41371e004adde8c71e2e2fe56b039c17a0f775412", + "manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "source_files": 143, + "source_drift": [], + "assertions_enabled": true, + "started_at_utc": "2026-10-10T03:06:46.003930+00:00", + "completed_at_utc": "2026-10-10T03:16:26.881867+00:00", + "exit_status": 0, + "elapsed_seconds": 580.8764400000218, + "verifier_seconds": 580.0584316670429, + "fresh_stages": [ + "banks", + "bit", + "complex", + "finite", + "math", + "primes", + "raw", + "scalar" + ], + "stage_timings_seconds": { + "banks": 56.94726499996614, + "bit": 95.11896820901893, + "complex": 43.77407150005456, + "finite": 0.16010216693393886, + "math": 0.6504860840504989, + "primes": 17.10306049999781, + "raw": 10.393582792021334, + "scalar": 328.12508979195263 + }, + "kappa_exact": "1777613869061/2500000000000000", + "kappa_decimal": "0.000711045547624400", + "scalar_negative_controls": 25, + "prime_negative_controls": 6, + "omitted_stage_negative_controls": [ + "omitted banks stage", + "omitted bit stage", + "omitted complex stage", + "omitted finite stage", + "omitted math stage", + "omitted primes stage", + "omitted raw stage", + "omitted scalar stage" + ], + "scope": "Conditional finite construction; inherited all-size compiler, weighted selector, common-ancestor chart, restored-row, routing, prime, recovery, complex symbolic and analytic interfaces remain assumptions.", + "original_receipt_sha256": "327b8b0d5b7b27bc3f25e17222168262671364a3a698e4915a249bed863a8b06", + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "python": "3.14.2", + "sympy": "1.14.0", + "platform": "macOS arm64", + "scope_note": "Sanitized scientific reproduction facts; local account paths and process details omitted. Public source closure will have a separate documentation manifest." +} diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy.json b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy.json new file mode 100644 index 0000000000..686a43b1c6 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy.json @@ -0,0 +1,5243 @@ +{ + "schema": "full-hierarchy-reconciliation/1", + "frozen_graph_sha256": "b70e794473cb75f76941e190ed102c236a15b9a868c4d277eb28e05f843d116c", + "historical_baseline": "PR234 frozen V8; not the selected source527 realization", + "selected_manifest": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "blocks": [ + { + "id": "A0a", + "name": "Read operands and lengths", + "ports": { + "in": "Bits", + "out": "Descriptors" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L1" + ], + "historical_requirements": [ + "SYS-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A0b", + "name": "Select admissible sizes and precision", + "ports": { + "in": "Descriptors", + "out": "Descriptors" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L1" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A0c", + "name": "Generate descriptors", + "ports": { + "in": "Descriptors", + "out": "Descriptors" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L1" + ], + "historical_requirements": [ + "SYS-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A0d", + "name": "Select ordinary cutoff and guards", + "ports": { + "in": "Descriptors", + "out": "Descriptors" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L1" + ], + "historical_requirements": [ + "SYS-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A1", + "name": "Extract radix digits", + "ports": { + "in": "Descriptors", + "out": "Digits" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L1" + ], + "historical_requirements": [ + "SYS-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A2", + "name": "Scale bounded inputs", + "ports": { + "in": "Digits", + "out": "ScaledInputs" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L1" + ], + "historical_requirements": [ + "SYS-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A3a", + "name": "Zero-pad operands", + "ports": { + "in": "ScaledInputs", + "out": "PaddedInputs" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L2" + ], + "historical_requirements": [ + "SYS-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A3b", + "name": "Apply convolution-preserving CRT index map", + "ports": { + "in": "PaddedInputs", + "out": "CRTInputs" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L2", + "L6" + ], + "historical_requirements": [ + "SYS-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4a", + "name": "Gaussian expansion", + "ports": { + "in": "CRTInputs", + "out": "WorkingTensor" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L2", + "L3" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b", + "name": "Chirp source transform", + "ports": { + "in": "WorkingTensor", + "out": "WorkingSpectrum" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L2", + "L3" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b1", + "name": "Twist into negacyclic ring", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b2", + "name": "Two normalized synthetic transforms", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b2a", + "name": "Arrange stored tensor layout", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b2b", + "name": "Execute normalized butterfly rounds", + "ports": { + "call_B0": "BitState", + "call_C1": "ComplexState", + "in": "SyntheticState", + "out": "SyntheticState", + "receive_B0": "BitState", + "receive_C1": "ComplexState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b2c", + "name": "Apply exact signed polynomial twiddle", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b2d", + "name": "Truncate round and clear work", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b3", + "name": "Packed ring record products", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b4", + "name": "Opposite synthetic transform", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b4a", + "name": "Opposite rounds and normalization", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4b5", + "name": "Untwist ring coefficients", + "ports": { + "in": "SyntheticState", + "out": "SyntheticState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4c", + "name": "Gaussian compression", + "ports": { + "in": "WorkingSpectrum", + "out": "SourceSpectrum" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L2", + "L3" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4c1", + "name": "Select ordered source samples", + "ports": { + "in": "ResamplingState", + "out": "ResamplingState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4c2", + "name": "Apply bounded Neumann correction", + "ports": { + "in": "ResamplingState", + "out": "ResamplingState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4c3", + "name": "Apply diagonal Gaussian correction", + "ports": { + "in": "ResamplingState", + "out": "ResamplingState" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4d", + "name": "Return ordered source transforms", + "ports": { + "in": "SourceSpectrum", + "out": "PairedSpectrum" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L2", + "L3" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-1", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4io", + "name": "Adapt records and axis layout", + "ports": { + "in": "WorkingTensor", + "out": "WorkingTensor" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4p1", + "name": "Generate chirp and twist phase descriptors", + "ports": { + "in": "Descriptors", + "out": "PhaseDescriptor" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4p2", + "name": "Evaluate bounded complex exponential", + "ports": { + "in": "PhaseDescriptor", + "out": "Factors" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A4p3", + "name": "Multiply phase factor and truncate", + "ports": { + "in": "PhaseApplicationInput", + "out": "WorkingTensor" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A5", + "name": "Multiply matching Fourier entries", + "ports": { + "in": "PairedSpectrum", + "out": "SpectrumProduct" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L3" + ], + "historical_requirements": [ + "SYS-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A6", + "name": "Apply opposite-sign source transform", + "ports": { + "in": "SpectrumProduct", + "out": "ScaledConvolution" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L3" + ], + "historical_requirements": [ + "SYS-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/integration_v2/upstream/build/references.bib": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/references.bib", + "sha256": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476" + }, + "processor_architectures/integration_v2/upstream/build/sections/06-transforms.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/06-transforms.tex", + "sha256": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A7a", + "name": "First recovery normalization", + "ports": { + "in": "ScaledConvolution", + "out": "PartialRecovery" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L4" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-5", + "ARC-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A7b", + "name": "Complete recovery normalization and coefficient layout", + "ports": { + "in": "PartialRecovery", + "out": "NearIntegerCoefficients" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L4" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-5", + "ARC-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A8", + "name": "Round exact integer coefficients", + "ports": { + "in": "NearIntegerCoefficients", + "out": "IntegerCoefficients" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L4" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "IF-5", + "ARC-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "A9", + "name": "Carry and serialize exact product", + "ports": { + "in": "IntegerCoefficients", + "out": "Product" + }, + "status": "inherited_outer_contract", + "current_blocks": [ + "F16", + "F19", + "F20" + ], + "note": "Retained outer algorithm interface; this package does not execute the all-size transform/recovery internals.", + "logical_functions": [ + "L0", + "L5" + ], + "historical_requirements": [ + "SYS-1", + "SYS-4", + "ARC-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/integration_v2/upstream/build/sections/07-resampling.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/07-resampling.tex", + "sha256": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "B0", + "name": "Bit address-interchange contract", + "ports": { + "in": "BitState", + "out": "BitState", + "return_A4b2b": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F10", + "F11", + "F14", + "F20" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-2", + "IF-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + } + } + }, + { + "id": "B1", + "name": "Compensate old dirty response", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02", + "F10" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B10", + "name": "Compose five phase-major bit windows", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F11" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L10" + ], + "historical_requirements": [ + "IF-6", + "ARC-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + } + } + }, + { + "id": "B11", + "name": "Complete independent dirty frames", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F12", + "F13", + "F14" + ], + "note": "Independent completions are discharged only by the current full-bank proof and exact tags. The historical exterior-completion realization is replaced.", + "logical_functions": [ + "L9" + ], + "historical_requirements": [ + "SYS-2", + "IF-3", + "IF-6", + "ARC-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + } + }, + { + "id": "B12", + "name": "Exchange terminal banks", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F11" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L9" + ], + "historical_requirements": [ + "SYS-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + } + }, + { + "id": "B2", + "name": "Compute framed helper word", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02", + "F03", + "F07", + "F08" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B3", + "name": "Manage copied centers", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F03", + "F11" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L7", + "L8" + ], + "historical_requirements": [ + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B4", + "name": "Deliver target updates", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F03", + "F08", + "F10" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B5", + "name": "Restore scalar source and dirt", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F10" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L7", + "L9" + ], + "historical_requirements": [ + "SYS-2", + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_source471_physical_telescope_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_source471_physical_telescope_20261009.py", + "sha256": "5c28c44e10548c234f8b3454e91c1f34695a20559ce6ff8ced009db6bcbbaf58" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/raw_ledger.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/raw_ledger.py", + "sha256": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B6a", + "name": "Start source loan", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B6b", + "name": "Mix source carrier", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B6c", + "name": "Use loan alias", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B6d", + "name": "Restore borrowed source", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02", + "F10" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8", + "L9" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B6e", + "name": "Undo carrier mix", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02", + "F10" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8", + "L9" + ], + "historical_requirements": [ + "SYS-2", + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B7a", + "name": "Prepare source-owned compensation", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F02", + "F06" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B7b", + "name": "Deliver compensated target response", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F06", + "F08" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B7c", + "name": "Keep only desired signal", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F06", + "F08", + "F10" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json", + "sha256": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py", + "sha256": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/scalar_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/scalar_check.py", + "sha256": "ddedeb4d40262123287fb371f5aa5eab67ae73f65167f9144ef134c2edcce142" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "B8a", + "name": "Describe full address identity", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F11", + "F14" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + } + }, + { + "id": "B8b", + "name": "Execute charged complete-stream route", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F20" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + } + }, + { + "id": "B9a", + "name": "Call exact nested recursive residual", + "ports": { + "call_R1": "ResidualRequest", + "in": "BitState", + "out": "BitState", + "receive_R1": "ResidualResponse" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F11", + "F17", + "F20" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + } + }, + { + "id": "B9b", + "name": "Apply equal-frame scalar gate", + "ports": { + "in": "BitState", + "out": "BitState" + }, + "status": "current_supplier_reallocation", + "current_blocks": [ + "F03", + "F04" + ], + "note": "Logical responsibility mapped to source527/hybrid. Historical source471 operations and counts are not transplanted one-for-one.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_20261009.py", + "sha256": "2f4fd25eebbfdfbf37e2375e23b4827fda62776dff3b3b64e971dd215b2664bc" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/five_stage_bit_global_lowering_geometry_20261009.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/five_stage_bit_global_lowering_geometry_20261009.py", + "sha256": "4a619e5d40c05295ef83183ee0d11bee12d0053bab2596ec9cfcd7fea4936157" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/prime_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/prime_check.py", + "sha256": "79c013c703e1f52c6afc225342015a9572230b643b8a9dbf6206bc4f765f642c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + } + } + }, + { + "id": "C1", + "name": "Compensate old complex response", + "ports": { + "in": "ComplexState", + "out": "ComplexState", + "return_A4b2b": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7", + "L8" + ], + "historical_requirements": [ + "IF-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C10", + "name": "Backward transposed-center macro", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C11a", + "name": "Copy scalar work", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C11b", + "name": "Scale exact rational coefficient", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C11c", + "name": "Accumulate scalar update", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C11d", + "name": "Clear scalar work", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "SYS-3", + "SYS-4", + "IF-3", + "IF-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C12a", + "name": "Route complex owner labels", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "ARC-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean", + "sha256": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + } + } + }, + { + "id": "C12b", + "name": "Compose five complex windows", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L10" + ], + "historical_requirements": [ + "ARC-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean", + "sha256": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + } + } + }, + { + "id": "C12c", + "name": "Complete terminal complex exchange", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L9" + ], + "historical_requirements": [ + "ARC-1" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/sources/Work__GCert__Chain__NetDef.lean", + "sha256": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + } + } + }, + { + "id": "C13", + "name": "Synthesize phase-correct residual", + "ports": { + "call_R1": "ResidualRequest", + "in": "ComplexState", + "out": "ComplexState", + "receive_R1": "ResidualResponse" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L6", + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-4", + "ARC-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "C2", + "name": "Adapt exact complex entry labels", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "IF-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C3", + "name": "Perform phase A live climbs", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C4", + "name": "Run retained copied centers", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C5", + "name": "Perform phase B live climbs", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "SYS-3", + "IF-1", + "IF-2", + "IF-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C6", + "name": "Finish live climbs", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C7", + "name": "Adapt exact complex exit labels", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7" + ], + "historical_requirements": [ + "IF-2", + "IF-4" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C8", + "name": "Restore complex borrowed payload", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L7", + "L9" + ], + "historical_requirements": [ + "SYS-2", + "IF-2" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/inputs/complex/source-pins.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/inputs/complex/source-pins.json", + "sha256": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "C9", + "name": "Forward copied-center macro", + "ports": { + "in": "ComplexState", + "out": "ComplexState" + }, + "status": "retained_complex_recipe", + "current_blocks": [ + "F16" + ], + "note": "Current pinned complex supplier expands this responsibility; use its exact labels, phases, lifetimes and source theorems.", + "logical_functions": [ + "L8" + ], + "historical_requirements": [ + "IF-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_complex.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/copied-centers-lemma.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/copied-centers-lemma.tex", + "sha256": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "D0", + "name": "Reconstruct source recipe", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F02" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "D1", + "name": "Check source pins and preflight", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F01", + "F21" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "D2", + "name": "Check complete bit columns and inverse", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F10" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "D3", + "name": "Check physical frames routes and primes", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F11", + "F13", + "F14", + "F15" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "D4", + "name": "Check complex splice and declarations", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F16" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "D5", + "name": "Check finite bill and exact outer inequalities", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F17", + "F18", + "F19", + "F20" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5", + "IF-6", + "ARC-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "D6", + "name": "Expose inherited theorem obligations", + "ports": { + "in": "Evidence", + "out": "Evidence" + }, + "status": "current_evidence_allocation", + "current_blocks": [ + "F21" + ], + "note": "Current hybrid proof/verification allocation; historical PASS receipts do not supply current scientific admission.", + "logical_functions": [ + "L11" + ], + "historical_requirements": [ + "SYS-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/MANIFEST.json": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/MANIFEST.json", + "sha256": "fc691fdf74a7b06c9290d6e91e6d63dc1c7e20c6556519dcf9b7f53fa02350de" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/finite_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/finite_check.py", + "sha256": "cabcdba58e9508b064a33a916b949afd9872e97121e3ac1f10c6a2e3397dfad1" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/loader/source_loader.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/loader/source_loader.py", + "sha256": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/portable_bit.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/portable_bit.py", + "sha256": "c931bc575ed0f1fb9ec0c35557ad8be4bc83dd9e86b4850fd6d77ee12b0a714a" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/verify.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/verify.py", + "sha256": "827c559d949df4ec462691a42067355ebd6d6baff55c48410d5f36247f0ca9a9" + } + } + }, + { + "id": "R1", + "name": "Form completed residual request", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse", + "return_B9a": "ResidualResponse", + "return_C13": "ResidualResponse" + }, + "status": "inherited_recursive_contract", + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "logical_functions": [ + "L10" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "R2", + "name": "Call smaller completed transform", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "status": "inherited_recursive_contract", + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "logical_functions": [ + "L10" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "R3", + "name": "Stop at attained ordinary leaf", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "status": "inherited_recursive_contract", + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "logical_functions": [ + "L10" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-6", + "ARC-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "R4", + "name": "Restore borrowed high rows", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "status": "inherited_recursive_contract", + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "logical_functions": [ + "L9", + "L10" + ], + "historical_requirements": [ + "SYS-2", + "SYS-3", + "SYS-5", + "IF-3", + "IF-6", + "ARC-5" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/paired_cube_assembly.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/paired_cube_assembly.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/math_check.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/math_check.py", + "sha256": "7c1593a1cef1036969eff7fb0d061b15d6b82cd10f2ccf86283b3924a689f8d5" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-bit.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-bit.tex", + "sha256": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/three-stage-cover-rows.tex": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/three-stage-cover-rows.tex", + "sha256": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8" + }, + "processor_architectures/v9_frontier_review/V8_ATTRIBUTION_MAP_2349.md": { + "primary_url": null, + "sha256": "8c871c182d25a8fd79889afd54d7bcfe166de370ecefb406084b5f9b4a8d0236" + } + } + }, + { + "id": "R5a", + "name": "Dispatch good and bad q-local edges", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "status": "inherited_recursive_contract", + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "logical_functions": [ + "L10" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-4", + "IF-6", + "ARC-3" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + }, + { + "id": "R5b", + "name": "Repair exceptional layout records", + "ports": { + "in": "ResidualRequest", + "out": "ResidualResponse" + }, + "status": "inherited_recursive_contract", + "current_blocks": [ + "F17", + "F18", + "F20" + ], + "note": "Completed-child, fallback and restored-row obligations are retained; current finite bill and exact moments bind their charges.", + "logical_functions": [ + "L6" + ], + "historical_requirements": [ + "SYS-3", + "SYS-5", + "IF-4", + "IF-6" + ], + "source_refs": { + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/PROOF.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/PROOF.md", + "sha256": "c9722b07256758cd3b307dd46689f99984c66e16c3dd934f9c34e551620bfc0f" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/README.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/README.md", + "sha256": "991e30cfa8d9d588844bceba0700ace138e1d5cab8d78c91fce888afe0d1f9a7" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/code/complex_splice.py": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/code/complex_splice.py", + "sha256": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c" + }, + "processor_architectures/five_stage_mac_export_20261009/integer_mult_local_lab_V8/proof/FINITE_BIT_ACCOUNTING.md": { + "primary_url": "https://github.com/hcg890/integer-mult-bounds/blob/af3fe331ca60c936229e060681ffccbc1c208678/research/five-stage-source-bound-v8/proof/FINITE_BIT_ACCOUNTING.md", + "sha256": "602923520af184670170bf159fde7b4c72e79a72570eddd7746b7c97bc51fc5b" + }, + "processor_architectures/integration_v2/upstream/build/sections/08-assembly.tex": { + "primary_url": "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026/build/sections/08-assembly.tex", + "sha256": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a" + } + } + } + ], + "types": { + "BitState": { + "address": "rational charts then eligible odd-prime address ring", + "meaning": "versioned complete source/target/dirty arrays with exact frames and owners", + "payload": "F2" + }, + "Bits": { + "meaning": "two nonnegative n-bit operands", + "payload": "N", + "shape": "U,V,n" + }, + "CRTInputs": { + "address": "coprime source-axis product", + "meaning": "convolution-preserving CRT layout", + "payload": "dyadic complex grid" + }, + "ComplexState": { + "address": "exact phase-sensitive frame labels", + "meaning": "versioned source/target/tableau/work streams", + "payload": "exact complex linear action plus chosen dyadic realization" + }, + "Descriptors": { + "meaning": "preserved U,V plus selected size, radix, precision and guards", + "payload": "N and exact metadata" + }, + "Digits": { + "meaning": "U=sum u_i 2^(bi); V=sum v_i 2^(bi)", + "payload": "Z", + "shape": "two N-digit arrays, base 2^b" + }, + "Evidence": { + "meaning": "version-bound proof claim, checked receipt, inherited hypothesis or open obligation", + "payload": "no runtime payload" + }, + "Factors": { + "meaning": "generated chirp/Gaussian factors and precision descriptors", + "payload": "dyadic approximations plus exact bounds" + }, + "IntegerCoefficients": { + "meaning": "exact uncarried convolution coefficients", + "payload": "Z" + }, + "NearIntegerCoefficients": { + "meaning": "all scales and inverse coefficient layout restored; error <1/2", + "payload": "dyadic complex grid" + }, + "PaddedInputs": { + "meaning": "zero-padded length S>2N-2", + "payload": "dyadic complex grid" + }, + "PairedSpectrum": { + "meaning": "both operand spectra in the same retained R order", + "payload": "dyadic complex grid" + }, + "PartialRecovery": { + "meaning": "after first recovery scale; nearest integer is not yet justified", + "payload": "dyadic complex grid" + }, + "PhaseApplicationInput": { + "meaning": "factor approximation, bounded values and precision contract", + "payload": "dyadic factor and dyadic complex tensor" + }, + "PhaseDescriptor": { + "meaning": "chirp or twist exponent for the numerical factor routine", + "payload": "exact address/axis/precision metadata" + }, + "Product": { + "meaning": "requested exact serialization of UV", + "payload": "N" + }, + "ResamplingState": { + "meaning": "ordered sample-selection/Neumann/diagonal-correction state, with exact axis/width refinements", + "payload": "dyadic complex grid" + }, + "ResidualRequest": { + "meaning": "full residual, m,r,n,w, required entry/exit frames and borrowed-row contract", + "payload": "tagged bit or complex operator" + }, + "ResidualResponse": { + "meaning": "completed smaller residual and promised restored rows", + "payload": "same operator tag as request" + }, + "ScaledConvolution": { + "meaning": "approximation to (a*b)/S^2", + "payload": "dyadic complex grid" + }, + "ScaledInputs": { + "meaning": "two digit arrays scaled by 2^(-b-2)", + "payload": "dyadic complex grid" + }, + "SourceSpectrum": { + "meaning": "resampled RF_s output; F_s normalized by 1/S", + "payload": "dyadic complex grid" + }, + "SpectrumProduct": { + "meaning": "pointwise product with declared rounding envelope", + "payload": "dyadic complex grid" + }, + "SyntheticState": { + "meaning": "normalized ring records; exact phase and LB order supplied by refinement", + "payload": "dyadic complex polynomial ring" + }, + "WorkingSpectrum": { + "meaning": "chirp-normalized QF_t tensor", + "payload": "dyadic complex grid" + }, + "WorkingTensor": { + "address": "power-of-two axes", + "meaning": "Gaussian-expanded tensor", + "payload": "dyadic complex grid" + } + }, + "logical_functions": [ + { + "id": "L0", + "input_ports": { + "I0": "two valid nonnegative n-bit operands U and V" + }, + "interface": "Only the externally specified product semantics are universal; transform, layout and storage choices belong to the selected realization.", + "name": "Produce the exact integer product", + "output_ports": { + "OUT": "exact UV in the requested output format" + }, + "purpose": "Return the specified mathematical result.", + "realization_blocks": [ + "A0a", + "A1", + "A2", + "A3a", + "A3b", + "A4a", + "A5", + "A6", + "A7a", + "A7b", + "A8", + "A9" + ], + "subfunctions": [ + "L1", + "L2", + "L3", + "L4", + "L5" + ], + "support_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ] + }, + { + "id": "L1", + "input_ports": { + "I0": "valid operand bit strings" + }, + "interface": "Encoding and scale are explicit and must preserve recoverable numeric values. A radix or particular precision formula is a realization choice.", + "name": "Accept and represent operands", + "output_ports": { + "P0": "preserved operands and admissible representation descriptors" + }, + "purpose": "Preserve operand values while making their representation usable.", + "realization_blocks": [ + "A0a", + "A0b", + "A0c", + "A0d", + "A1", + "A2" + ], + "subfunctions": [] + }, + { + "id": "L2", + "input_ports": { + "P0": "represented operands and descriptors" + }, + "interface": "The selected system pads, reindexes and transforms; the logical function does not require CRT, Fourier transforms or a particular decomposition.", + "name": "Make operands usable for product computation", + "output_ports": { + "P1": "valid inputs to the chosen product-computation interface" + }, + "purpose": "Provide the organization required by the chosen product method.", + "realization_blocks": [ + "A3a", + "A3b", + "A4a", + "A4b", + "A4c", + "A4d" + ], + "subfunctions": [] + }, + { + "id": "L3", + "input_ports": { + "P1": "valid represented operands" + }, + "interface": "The selected Fourier realization uses P2 matching-coordinate arrays internally. Different methods may satisfy the same goal with different internal ports.", + "name": "Compute sufficient product information", + "output_ports": { + "P3": "information sufficient to recover the exact product" + }, + "purpose": "Establish the product relation in the internal representation.", + "realization_blocks": [ + "A4a", + "A4b", + "A4c", + "A4d", + "A5", + "A6" + ], + "subfunctions": [] + }, + { + "id": "L4", + "input_ports": { + "P3": "internal product information plus validity/error guarantees" + }, + "interface": "If approximate arithmetic is used, recovery needs a sufficient exactness margin. The present two S factors, rounding and inverse CRT are conditional on this representation.", + "name": "Recover exact result values", + "output_ports": { + "E0": "exact values sufficient for output encoding" + }, + "purpose": "Resolve internal scales or approximations into exact integer information.", + "realization_blocks": [ + "A7a", + "A7b", + "A8" + ], + "subfunctions": [] + }, + { + "id": "L5", + "input_ports": { + "E0": "exact internal result values" + }, + "interface": "Frozen outer proof uses carries and exactly 2n output bits. An output-format change is possible only with a revised boundary contract.", + "name": "Normalize and emit the result", + "output_ports": { + "OUT": "the requested product bit string" + }, + "purpose": "Meet the requested external representation contract.", + "realization_blocks": [ + "A9" + ], + "subfunctions": [] + }, + { + "id": "L6", + "input_ports": { + "LOC_IN": "complete payload streams and logical owners" + }, + "interface": "Value identity, owner bijections, exact frame interpretation and movement cost must remain valid. The chosen address geometry is not universal.", + "name": "Place data at required interfaces", + "output_ports": { + "LOC_OUT": "the same intended values at the requested owners/frames" + }, + "purpose": "Deliver corresponding values to the locations and representations consumed by an operation.", + "realization_blocks": [ + "A3b", + "A4b2a", + "A4b4a", + "A4io", + "B8a", + "B8b", + "B9a", + "B9b", + "C12a", + "C13", + "R5b" + ], + "subfunctions": [] + }, + { + "id": "L7", + "input_ports": { + "MAP_IN": "payload and exact requested operator contract" + }, + "interface": "F₂ payload, rational-address and exact-complex phase contracts are different operator domains and cannot be interchanged by matching rank alone.", + "name": "Evaluate required component maps", + "output_ports": { + "MAP_OUT": "the requested output action at valid endpoint representations" + }, + "purpose": "Realize each caller-requested arithmetic or linear operator.", + "realization_blocks": [ + "A4b1", + "A4b2", + "A4b3", + "A4b4", + "A4b5", + "A4b2b", + "A4b2c", + "A4b2d", + "A4c1", + "A4c2", + "A4c3", + "A4p1", + "A4p2", + "A4p3", + "B0", + "B1", + "B2", + "B3", + "B4", + "B5", + "C1", + "C2", + "C3", + "C4", + "C5", + "C6", + "C7", + "C8", + "C13" + ], + "subfunctions": [] + }, + { + "id": "L8", + "input_ports": { + "WORK_IN": "live values, declared dirty/clean workspace and ownership" + }, + "interface": "The number of banks, ownership schedule and dirty-versus-clean choice are architectural. Any replacement must preserve alias, lifetime and resource contracts.", + "name": "Manage temporary and shared storage", + "output_ports": { + "WORK_OUT": "valid live values and legal work lifetimes" + }, + "purpose": "Give operations usable storage without undeclared interference.", + "realization_blocks": [ + "B3", + "B6a", + "B6b", + "B6c", + "B6d", + "B6e", + "B7a", + "B7b", + "B7c", + "C1", + "C9", + "C10", + "C11a", + "C11b", + "C11c", + "C11d" + ], + "subfunctions": [] + }, + { + "id": "L9", + "input_ports": { + "BORROWED_IN": "declared borrowed values/rows/frames" + }, + "interface": "Restoration is required where the caller grants a loan. Payload restoration, temporary erasure and address-frame completion are separate conditions.", + "name": "Restore borrowed state", + "output_ports": { + "BORROWED_OUT": "the specified restored state and completed frame effect" + }, + "purpose": "Prevent a subroutine from corrupting externally owned values or representations.", + "realization_blocks": [ + "B5", + "B6d", + "B6e", + "B11", + "B12", + "C8", + "C12c", + "R4" + ], + "subfunctions": [] + }, + { + "id": "L10", + "input_ports": { + "CHILD_IN": "an exact residual problem and allowed resources" + }, + "interface": "Recursion, stage count and fallback strategy are realization choices. The chosen proof requires valid proper children, finite leaves, paid exceptional work and composable boundaries.", + "name": "Complete and compose subproblems", + "output_ports": { + "CHILD_OUT": "a completed result with required state returned" + }, + "purpose": "Close each delegated computation under its caller’s endpoint and cost contracts.", + "realization_blocks": [ + "B10", + "C12b", + "R1", + "R2", + "R3", + "R4", + "R5a" + ], + "subfunctions": [] + }, + { + "id": "L11", + "input_ports": { + "EVIDENCE_IN": "pinned sources, declared interfaces and reconstructed finite recipes" + }, + "interface": "This is an assurance function, not another runtime multiplication step. A passed finite check does not replace an inherited theorem.", + "name": "Establish the evidence for system claims", + "output_ports": { + "EVIDENCE_OUT": "checked finite facts plus explicit remaining theorem dependencies" + }, + "purpose": "Separate executable finite checks from retained assumptions and justify stated bounds.", + "realization_blocks": [ + "D0", + "D1", + "D2", + "D3", + "D4", + "D5", + "D6" + ], + "subfunctions": [] + } + ], + "requirement_definitions": [ + { + "classification": "outcome", + "id": "SYS-1", + "logical_functions": [ + "L0", + "L1", + "L2", + "L3", + "L4", + "L5" + ], + "overconstraint_audit": { + "escape_route": "Change any internal representation or algorithm while preserving the external product meaning; revise the external contract explicitly if input/output meaning changes.", + "reopened_obligations": "Affected encoding, product relation, decoding, and cost dependencies.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "This is the requested mathematical result.", + "realization_blocks": [ + "A1", + "A2", + "A3a", + "A3b", + "A4a", + "A4b", + "A4c", + "A4d", + "A5", + "A6", + "A7a", + "A7b", + "A8", + "A9" + ], + "sources": [ + "P1", + "P7" + ], + "statement": "For every allowed input, output represents the exact integer product.", + "status": "conditional_retained_proof", + "title": "Exact integer product", + "verification_method": "Composed encoding/product/decoding proof." + }, + { + "classification": "outcome_relative_to_promised_interface", + "id": "SYS-2", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Retire or reassign owned state under a changed caller contract; restoration is required only where promised.", + "reopened_obligations": "Affected caller observations, ownership, live versions, endpoints and storage bill.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Endpoint-only equality can hide corrupted intermediate users.", + "realization_blocks": [ + "B0", + "B5", + "B6a", + "B6b", + "B6c", + "B6d", + "B6e", + "B11", + "B12", + "C8", + "R4" + ], + "sources": [ + "P2", + "P3", + "P4", + "P6" + ], + "statement": "Preserve caller-promised values and properties at every required observation.", + "status": "source_specific_local_and_inherited_evidence", + "title": "Honor promised state and observations", + "verification_method": "Full boundary and trace relation on arbitrary allowed state." + }, + { + "classification": "model", + "id": "SYS-3", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Change machine model or compiler with an explicit translation or new theorem.", + "reopened_obligations": "Cost model, lowering, routing, workspace and composed complexity claims.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Algebra alone is not a physical cost proof.", + "realization_blocks": [ + "A0a", + "A0b", + "A0c", + "A0d", + "B8a", + "B8b", + "B9a", + "B9b", + "C11a", + "C11b", + "C11c", + "C11d", + "C13", + "R1", + "R2", + "R3", + "R4", + "R5a", + "R5b" + ], + "sources": [ + "P2", + "P5", + "P8" + ], + "statement": "Implement every operation and movement claimed in the stated model with legal resources.", + "status": "inherited_model_interfaces_with_open_sparse_tariff", + "title": "Realizable execution in the declared model", + "verification_method": "Frame, routing, workspace and lowering arguments." + }, + { + "classification": "outcome", + "id": "SYS-4", + "logical_functions": [ + "L1", + "L2", + "L3", + "L4", + "L5", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Use exact arithmetic or another successful decoder; neither rounding nor fixed dyadic precision is universal.", + "reopened_obligations": "Affected approximation propagation, normalization, widths, decoder and physical cost.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Local exact algebra does not bound accumulated numerical error.", + "realization_blocks": [ + "A0b", + "A4a", + "A4b", + "A4c", + "A4d", + "A7a", + "A7b", + "A8", + "A9", + "C11a", + "C11b", + "C11c", + "C11d" + ], + "sources": [ + "P7" + ], + "statement": "Prove every numerical approximation affecting the result is compatible with exact decoding.", + "status": "conditional_retained_precision_proof", + "title": "Justified exact recovery", + "verification_method": "Complete error/range/width/decoding proof." + }, + { + "classification": "model_and_claim_dependent_outcome", + "id": "SYS-5", + "logical_functions": [ + "L0", + "L6", + "L7", + "L8", + "L9", + "L10", + "L11" + ], + "overconstraint_audit": { + "escape_route": "A correctness experiment need not improve an exponent; an implementation may stay within an unchanged envelope.", + "reopened_obligations": "Only the changed costs and downstream claims that consume them.", + "universal_only_at_stated_scope": true + }, + "parents": [], + "rationale": "Omitted costs and conflated evidence can reverse a comparison.", + "realization_blocks": [ + "R1", + "R2", + "R3", + "R4", + "R5a", + "R5b", + "D0", + "D1", + "D2", + "D3", + "D4", + "D5", + "D6" + ], + "sources": [ + "P2", + "P5", + "P8" + ], + "statement": "Account for all resources relevant to the claimed result and bind evidence to exact sources and scope.", + "status": "source_specific_conditional_bounds", + "title": "Complete support for the claimed cost", + "verification_method": "Complete net inventory, recurrence, finite/outer argument and evidence binding." + }, + { + "classification": "model_and_interface", + "id": "IF-1", + "logical_functions": [ + "L1", + "L6", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Change field, encoding, integer lift or address model with a new interface proof.", + "reopened_obligations": "Semantics, primes, geometry and numerical bounds.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-1", + "SYS-3" + ], + "rationale": "Equal notation across fields may denote different maps.", + "realization_blocks": [ + "B0", + "B8a", + "B8b", + "B9a", + "B9b", + "C1", + "C13", + "A4a", + "A4b", + "A4c", + "A4d" + ], + "sources": [ + "P2", + "P3", + "P4" + ], + "statement": "Specify payload/address domains, sizes, legal inputs and inherited hypotheses.", + "status": "explicit_in_retained_bit_contract", + "title": "Declared mathematical domains", + "verification_method": "Algebraic model and domain checks." + }, + { + "classification": "outcome_and_interface", + "id": "IF-2", + "logical_functions": [ + "L2", + "L3", + "L4", + "L5", + "L6", + "L7", + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Change private intermediate values or enlarge the closed interval.", + "reopened_obligations": "Every newly enclosed consumer, observation and source version.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-1", + "SYS-2" + ], + "rationale": "An unobserved intermediate coordinate need not be fixed.", + "realization_blocks": [ + "B1", + "B4", + "B5", + "B7a", + "B7b", + "B7c", + "C6", + "C7", + "C8" + ], + "sources": [ + "P2", + "P4" + ], + "statement": "Specify endpoint and every required observation at semantic events.", + "status": "local_exact_interval_pass_global_composite_pending", + "title": "Complete boundary and observations", + "verification_method": "Full operator/trace relation; all-column check when linearity is proved." + }, + { + "classification": "interface", + "id": "IF-3", + "logical_functions": [ + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Use different sharing/loan/retirement contracts accepted by affected callers.", + "reopened_obligations": "Owners, aliasing, copy/erase, inverse dependencies and actual stock.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-2", + "SYS-3" + ], + "rationale": "Forward last-use is not inverse restoration.", + "realization_blocks": [ + "B3", + "B6a", + "B6b", + "B6c", + "B6d", + "B6e", + "B11", + "C9", + "C10", + "C11a", + "C11b", + "C11c", + "C11d", + "R4" + ], + "sources": [ + "P2", + "P3", + "P4", + "P6" + ], + "statement": "Declare owners, live versions, dirty/old state, loans, retirement and copy/erase conditions in both directions.", + "status": "source_specific_exact_checks", + "title": "Ownership and lifetimes", + "verification_method": "Dependency/lifetime proof and arbitrary-state endpoint." + }, + { + "classification": "model_and_interface", + "id": "IF-4", + "logical_functions": [ + "L6", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Choose different legal bases, frame plateaus, factorizations or routes.", + "reopened_obligations": "Actual projector identities, primes, cover/namespace, observers and paid movement.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-3" + ], + "rationale": "Equal ranks or small address-matrix similarity are insufficient.", + "realization_blocks": [ + "B8a", + "B8b", + "B9a", + "B9b", + "C2", + "C7", + "C13", + "R5a", + "R5b" + ], + "sources": [ + "P2", + "P5", + "P6" + ], + "statement": "Specify exact frames/labels and complete address action, spectators, inverse and simultaneous injectivity.", + "status": "semantic_route_pass_sparse_tariff_open", + "title": "Physical representations and routes", + "verification_method": "Exact projectors/charts, complete payload action and route proof." + }, + { + "classification": "interface", + "id": "IF-5", + "logical_functions": [ + "L1", + "L2", + "L3", + "L4", + "L5", + "L7" + ], + "overconstraint_audit": { + "escape_route": "Use a different lift or a tighter bound; old coefficients need not match.", + "reopened_obligations": "Any downstream assumption exceeded by the new envelope.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-4", + "SYS-5" + ], + "rationale": "A new representative may be valid but have different growth.", + "realization_blocks": [ + "A0b", + "A4a", + "A4b", + "A4c", + "A4d", + "A7a", + "A7b", + "A8", + "C11a", + "C11b", + "C11c", + "C11d" + ], + "sources": [ + "P2", + "P4", + "P7" + ], + "statement": "Bound coefficients, signed growth, norms, errors and record widths consumed by callers.", + "status": "source_specific_exact_and_inherited_proofs", + "title": "Consumed numerical envelope", + "verification_method": "Signed prefix bounds and full analytic error propagation." + }, + { + "classification": "model_and_interface", + "id": "IF-6", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Change counts, width, replicas, stage count or recurrence type with complete new accounting.", + "reopened_obligations": "Stock/lifetime compatibility, full profile, finite constants, fallback, leaf and outer consumers.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "SYS-3", + "SYS-5" + ], + "rationale": "Lower call count is not equivalent to lower paid moment.", + "realization_blocks": [ + "B10", + "B11", + "R1", + "R2", + "R3", + "R4", + "R5a", + "R5b", + "D5" + ], + "sources": [ + "P2", + "P3", + "P8" + ], + "statement": "Declare net child inventory, true stock, replicas, finite costs, fallback, shrink and normalization.", + "status": "whole_supplier_evidence_is_source_specific", + "title": "Complete paid resource interface", + "verification_method": "Full ledger and applicable scalar/stateful recurrence." + }, + { + "classification": "selected_architecture", + "id": "ARC-1", + "logical_functions": [ + "L6", + "L7", + "L8", + "L9", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Use a different proved schedule or different stage topology.", + "reopened_obligations": "Observation/owner/route dependencies, joint endpoints and full schedule bill.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-2", + "IF-3", + "IF-4" + ], + "rationale": "Interleaving may expose unfinished state.", + "realization_blocks": [ + "B10", + "C12a", + "C12b", + "C12c" + ], + "sources": [ + "P3" + ], + "statement": "When retaining the current global theorem, respect complete-cover phase barriers and dependencies.", + "status": "conditional_on_retained_stage_theorem", + "title": "Retained phase-major composition", + "verification_method": "Source schedule and endpoint-composition proof." + }, + { + "classification": "selected_architecture", + "id": "ARC-2", + "logical_functions": [ + "L8", + "L9" + ], + "overconstraint_audit": { + "escape_route": "Change to coupled completion or a new live helper.", + "reopened_obligations": "Joint payload endpoint, ownership/lifetimes, complete routing and resulting recurrence.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-3", + "IF-4", + "IF-6" + ], + "rationale": "Volume and ranks alone do not complete a bank.", + "realization_blocks": [ + "B8a", + "B8b", + "B11" + ], + "sources": [ + "P3", + "P6" + ], + "statement": "When using independent banks, actual routed block projectors are disjoint and sum to each required bank endpoint.", + "status": "source_bound_bank_proof_not_new_composite_admission", + "title": "Independent completed bank realization", + "verification_method": "Actual chart identities, census, injectivity, endpoint and reverse schedule." + }, + { + "classification": "selected_architecture_and_model", + "id": "ARC-3", + "logical_functions": [ + "L6", + "L7", + "L10" + ], + "overconstraint_audit": { + "escape_route": "Choose different bases, prime set or reduction.", + "reopened_obligations": "Complete new prime coverage, good/bad dispatch and fallback.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-1", + "IF-4" + ], + "rationale": "Invalid denominators make routing undefined.", + "realization_blocks": [ + "B9a", + "C13", + "R5a" + ], + "sources": [ + "P3", + "P5" + ], + "statement": "For the rational-chart reduction, every consumed inverse/scaling exists at each eligible prime/ring.", + "status": "source_bound_prime_evidence", + "title": "Eligible chart arithmetic", + "verification_method": "Cleared Gram and denominator factors; unit checks." + }, + { + "classification": "selected_architecture", + "id": "ARC-4", + "logical_functions": [ + "L4", + "L5" + ], + "overconstraint_audit": { + "escape_route": "Change representation, normalization or decoder with a complete alternative recovery proof.", + "reopened_obligations": "Affected error, scales, layout, widths, carry and finite costs.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-5" + ], + "rationale": "The decoder's input assumptions must be established.", + "realization_blocks": [ + "A7a", + "A7b", + "A8", + "A9" + ], + "sources": [ + "P7" + ], + "statement": "For this recovery, restore both normalizations and coefficient order and achieve pre-rounding error below one half.", + "status": "conditional_retained_analytic_proof", + "title": "Retained approximate convolution recovery", + "verification_method": "Exact scaling/width equations, inverse layout, nearest-integer and carry proofs." + }, + { + "classification": "selected_architecture", + "id": "ARC-5", + "logical_functions": [ + "L10", + "L11" + ], + "overconstraint_audit": { + "escape_route": "Change bootstrap depth, balanced family or outer reduction.", + "reopened_obligations": "The replacement recurrence/leaf bridge and all affected analytic inequalities.", + "universal_only_at_stated_scope": true + }, + "parents": [ + "IF-6" + ], + "rationale": "A limiting coarse rate is not a completed leaf.", + "realization_blocks": [ + "R3", + "R4", + "D5" + ], + "sources": [ + "P8" + ], + "statement": "For this bound, use attained ordinary savings and valid bridge data in the selected outer inequalities.", + "status": "finite_rational_checks_plus_inherited_analytic_interfaces", + "title": "Selected ordinary-leaf and outer assembly", + "verification_method": "Three levels, 47 strict constraints and seven margins in current source." + } + ], + "completeness": "All87 original selected-realization block IDs accounted for; inherited/opaque internals are not promoted to executed operation coverage." +} diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy_edges.json b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy_edges.json new file mode 100644 index 0000000000..752787a69c --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy_edges.json @@ -0,0 +1,1778 @@ +{ + "schema": "historical-edge-reconciliation/1", + "source_graph_sha256": "b70e794473cb75f76941e190ed102c236a15b9a868c4d277eb28e05f843d116c", + "typed_edges": 53, + "documentary_edges": 75, + "relations": [ + { + "id": "HT001", + "inventory": "typed_edges", + "source_block": "A0a", + "target_block": "A0b", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0a.out", + "target": "A0b.in", + "type": "Descriptors" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT002", + "inventory": "typed_edges", + "source_block": "A0b", + "target_block": "A0c", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0b.out", + "target": "A0c.in", + "type": "Descriptors" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT003", + "inventory": "typed_edges", + "source_block": "A0c", + "target_block": "A0d", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0c.out", + "target": "A0d.in", + "type": "Descriptors" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT004", + "inventory": "typed_edges", + "source_block": "A0d", + "target_block": "A1", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A0d.out", + "target": "A1.in", + "type": "Descriptors" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT005", + "inventory": "typed_edges", + "source_block": "A1", + "target_block": "A2", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A1.out", + "target": "A2.in", + "type": "Digits" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT006", + "inventory": "typed_edges", + "source_block": "A2", + "target_block": "A3a", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A2.out", + "target": "A3a.in", + "type": "ScaledInputs" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT007", + "inventory": "typed_edges", + "source_block": "A3a", + "target_block": "A3b", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A3a.out", + "target": "A3b.in", + "type": "PaddedInputs" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT008", + "inventory": "typed_edges", + "source_block": "A3b", + "target_block": "A4a", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A3b.out", + "target": "A4a.in", + "type": "CRTInputs" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT009", + "inventory": "typed_edges", + "source_block": "A4a", + "target_block": "A4b", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4a.out", + "target": "A4b.in", + "type": "WorkingTensor" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT010", + "inventory": "typed_edges", + "source_block": "A4b", + "target_block": "A4c", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4b.out", + "target": "A4c.in", + "type": "WorkingSpectrum" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT011", + "inventory": "typed_edges", + "source_block": "A4c", + "target_block": "A4d", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4c.out", + "target": "A4d.in", + "type": "SourceSpectrum" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT012", + "inventory": "typed_edges", + "source_block": "A4d", + "target_block": "A5", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A4d.out", + "target": "A5.in", + "type": "PairedSpectrum" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT013", + "inventory": "typed_edges", + "source_block": "A5", + "target_block": "A6", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A5.out", + "target": "A6.in", + "type": "SpectrumProduct" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT014", + "inventory": "typed_edges", + "source_block": "A6", + "target_block": "A7a", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A6.out", + "target": "A7a.in", + "type": "ScaledConvolution" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT015", + "inventory": "typed_edges", + "source_block": "A7a", + "target_block": "A7b", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A7a.out", + "target": "A7b.in", + "type": "PartialRecovery" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT016", + "inventory": "typed_edges", + "source_block": "A7b", + "target_block": "A8", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A7b.out", + "target": "A8.in", + "type": "NearIntegerCoefficients" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT017", + "inventory": "typed_edges", + "source_block": "A8", + "target_block": "A9", + "original": { + "guarantee_implies_assumption": "inherited_outer_theorem; not re-proved", + "kind": "data", + "source": "A8.out", + "target": "A9.in", + "type": "IntegerCoefficients" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT018", + "inventory": "typed_edges", + "source_block": "A4b1", + "target_block": "A4b2", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b1.out", + "target": "A4b2.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT019", + "inventory": "typed_edges", + "source_block": "A4b2", + "target_block": "A4b3", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2.out", + "target": "A4b3.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT020", + "inventory": "typed_edges", + "source_block": "A4b3", + "target_block": "A4b4", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b3.out", + "target": "A4b4.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT021", + "inventory": "typed_edges", + "source_block": "A4b4", + "target_block": "A4b5", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b4.out", + "target": "A4b5.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT022", + "inventory": "typed_edges", + "source_block": "A4b2a", + "target_block": "A4b2b", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2a.out", + "target": "A4b2b.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT023", + "inventory": "typed_edges", + "source_block": "A4b2b", + "target_block": "A4b2c", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2b.out", + "target": "A4b2c.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT024", + "inventory": "typed_edges", + "source_block": "A4b2c", + "target_block": "A4b2d", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4b2c.out", + "target": "A4b2d.in", + "type": "SyntheticState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT025", + "inventory": "typed_edges", + "source_block": "A4c1", + "target_block": "A4c2", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4c1.out", + "target": "A4c2.in", + "type": "ResamplingState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT026", + "inventory": "typed_edges", + "source_block": "A4c2", + "target_block": "A4c3", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "A4c2.out", + "target": "A4c3.in", + "type": "ResamplingState" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HT027", + "inventory": "typed_edges", + "source_block": "B1", + "target_block": "B2", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B1.out", + "target": "B2.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT028", + "inventory": "typed_edges", + "source_block": "B2", + "target_block": "B3", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B2.out", + "target": "B3.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT029", + "inventory": "typed_edges", + "source_block": "B3", + "target_block": "B4", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B3.out", + "target": "B4.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT030", + "inventory": "typed_edges", + "source_block": "B4", + "target_block": "B5", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B4.out", + "target": "B5.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT031", + "inventory": "typed_edges", + "source_block": "B8a", + "target_block": "B8b", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B8a.out", + "target": "B8b.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT032", + "inventory": "typed_edges", + "source_block": "B8b", + "target_block": "B9a", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B8b.out", + "target": "B9a.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT033", + "inventory": "typed_edges", + "source_block": "B9a", + "target_block": "B9b", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B9a.out", + "target": "B9b.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT034", + "inventory": "typed_edges", + "source_block": "B9b", + "target_block": "B10", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B9b.out", + "target": "B10.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT035", + "inventory": "typed_edges", + "source_block": "B10", + "target_block": "B11", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B10.out", + "target": "B11.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT036", + "inventory": "typed_edges", + "source_block": "B11", + "target_block": "B12", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "B11.out", + "target": "B12.in", + "type": "BitState" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HT037", + "inventory": "typed_edges", + "source_block": "C1", + "target_block": "C2", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C1.out", + "target": "C2.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT038", + "inventory": "typed_edges", + "source_block": "C2", + "target_block": "C3", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C2.out", + "target": "C3.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT039", + "inventory": "typed_edges", + "source_block": "C3", + "target_block": "C4", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C3.out", + "target": "C4.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT040", + "inventory": "typed_edges", + "source_block": "C4", + "target_block": "C5", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C4.out", + "target": "C5.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT041", + "inventory": "typed_edges", + "source_block": "C5", + "target_block": "C6", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C5.out", + "target": "C6.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT042", + "inventory": "typed_edges", + "source_block": "C6", + "target_block": "C7", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C6.out", + "target": "C7.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT043", + "inventory": "typed_edges", + "source_block": "C7", + "target_block": "C8", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C7.out", + "target": "C8.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT044", + "inventory": "typed_edges", + "source_block": "C12a", + "target_block": "C12b", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C12a.out", + "target": "C12b.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT045", + "inventory": "typed_edges", + "source_block": "C12b", + "target_block": "C12c", + "original": { + "guarantee_implies_assumption": "opaque_refinement_join; type equality is not proof", + "kind": "data", + "source": "C12b.out", + "target": "C12c.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT046", + "inventory": "typed_edges", + "source_block": "A4b2b", + "target_block": "B0", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "A4b2b.call_B0", + "target": "B0.in", + "type": "BitState" + }, + "selected_status": "retained_bit_interface_contract", + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions." + }, + { + "id": "HT047", + "inventory": "typed_edges", + "source_block": "B0", + "target_block": "A4b2b", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "B0.return_A4b2b", + "target": "A4b2b.receive_B0", + "type": "BitState" + }, + "selected_status": "retained_bit_interface_contract", + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions." + }, + { + "id": "HT048", + "inventory": "typed_edges", + "source_block": "A4b2b", + "target_block": "C1", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "A4b2b.call_C1", + "target": "C1.in", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT049", + "inventory": "typed_edges", + "source_block": "C1", + "target_block": "A4b2b", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "C1.return_A4b2b", + "target": "A4b2b.receive_C1", + "type": "ComplexState" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HT050", + "inventory": "typed_edges", + "source_block": "B9a", + "target_block": "R1", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "B9a.call_R1", + "target": "R1.in", + "type": "ResidualRequest" + }, + "selected_status": "retained_bit_interface_contract", + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions." + }, + { + "id": "HT051", + "inventory": "typed_edges", + "source_block": "R1", + "target_block": "B9a", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "R1.return_B9a", + "target": "B9a.receive_R1", + "type": "ResidualResponse" + }, + "selected_status": "retained_bit_interface_contract", + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions." + }, + { + "id": "HT052", + "inventory": "typed_edges", + "source_block": "C13", + "target_block": "R1", + "original": { + "guarantee_implies_assumption": "opaque_call_adapter", + "kind": "call", + "source": "C13.call_R1", + "target": "R1.in", + "type": "ResidualRequest" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HT053", + "inventory": "typed_edges", + "source_block": "R1", + "target_block": "C13", + "original": { + "guarantee_implies_assumption": "opaque_return_adapter", + "kind": "return", + "source": "R1.return_C13", + "target": "C13.receive_R1", + "type": "ResidualResponse" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HD001", + "inventory": "documentary_edges", + "source_block": "A0a", + "target_block": "A0b", + "original": { + "from": "A0a", + "kind": "data", + "to": "A0b" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD002", + "inventory": "documentary_edges", + "source_block": "A0b", + "target_block": "A0c", + "original": { + "from": "A0b", + "kind": "data", + "to": "A0c" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD003", + "inventory": "documentary_edges", + "source_block": "A0c", + "target_block": "A0d", + "original": { + "from": "A0c", + "kind": "data", + "to": "A0d" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD004", + "inventory": "documentary_edges", + "source_block": "A0d", + "target_block": "A1", + "original": { + "from": "A0d", + "kind": "data", + "to": "A1" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD005", + "inventory": "documentary_edges", + "source_block": "A1", + "target_block": "A2", + "original": { + "from": "A1", + "kind": "data", + "to": "A2" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD006", + "inventory": "documentary_edges", + "source_block": "A2", + "target_block": "A3a", + "original": { + "from": "A2", + "kind": "data", + "to": "A3a" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD007", + "inventory": "documentary_edges", + "source_block": "A3a", + "target_block": "A3b", + "original": { + "from": "A3a", + "kind": "data", + "to": "A3b" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD008", + "inventory": "documentary_edges", + "source_block": "A3b", + "target_block": "A4a", + "original": { + "from": "A3b", + "kind": "data", + "to": "A4a" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD009", + "inventory": "documentary_edges", + "source_block": "A4a", + "target_block": "A4b", + "original": { + "from": "A4a", + "kind": "data", + "to": "A4b" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD010", + "inventory": "documentary_edges", + "source_block": "A4b", + "target_block": "A4c", + "original": { + "from": "A4b", + "kind": "data", + "to": "A4c" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD011", + "inventory": "documentary_edges", + "source_block": "A4c", + "target_block": "A4d", + "original": { + "from": "A4c", + "kind": "data", + "to": "A4d" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD012", + "inventory": "documentary_edges", + "source_block": "A4d", + "target_block": "A5", + "original": { + "from": "A4d", + "kind": "data", + "to": "A5" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD013", + "inventory": "documentary_edges", + "source_block": "A5", + "target_block": "A6", + "original": { + "from": "A5", + "kind": "data", + "to": "A6" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD014", + "inventory": "documentary_edges", + "source_block": "A6", + "target_block": "A7a", + "original": { + "from": "A6", + "kind": "data", + "to": "A7a" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD015", + "inventory": "documentary_edges", + "source_block": "A7a", + "target_block": "A7b", + "original": { + "from": "A7a", + "kind": "data", + "to": "A7b" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD016", + "inventory": "documentary_edges", + "source_block": "A7b", + "target_block": "A8", + "original": { + "from": "A7b", + "kind": "data", + "to": "A8" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD017", + "inventory": "documentary_edges", + "source_block": "A8", + "target_block": "A9", + "original": { + "from": "A8", + "kind": "data", + "to": "A9" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD018", + "inventory": "documentary_edges", + "source_block": "A4b1", + "target_block": "A4b2", + "original": { + "from": "A4b1", + "kind": "data", + "to": "A4b2" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD019", + "inventory": "documentary_edges", + "source_block": "A4b2", + "target_block": "A4b3", + "original": { + "from": "A4b2", + "kind": "data", + "to": "A4b3" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD020", + "inventory": "documentary_edges", + "source_block": "A4b3", + "target_block": "A4b4", + "original": { + "from": "A4b3", + "kind": "data", + "to": "A4b4" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD021", + "inventory": "documentary_edges", + "source_block": "A4b4", + "target_block": "A4b5", + "original": { + "from": "A4b4", + "kind": "data", + "to": "A4b5" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD022", + "inventory": "documentary_edges", + "source_block": "A4b2a", + "target_block": "A4b2b", + "original": { + "from": "A4b2a", + "kind": "data", + "to": "A4b2b" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD023", + "inventory": "documentary_edges", + "source_block": "A4b2b", + "target_block": "A4b2c", + "original": { + "from": "A4b2b", + "kind": "data", + "to": "A4b2c" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD024", + "inventory": "documentary_edges", + "source_block": "A4b2c", + "target_block": "A4b2d", + "original": { + "from": "A4b2c", + "kind": "data", + "to": "A4b2d" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD025", + "inventory": "documentary_edges", + "source_block": "A4c1", + "target_block": "A4c2", + "original": { + "from": "A4c1", + "kind": "data", + "to": "A4c2" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD026", + "inventory": "documentary_edges", + "source_block": "A4c2", + "target_block": "A4c3", + "original": { + "from": "A4c2", + "kind": "data", + "to": "A4c3" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD027", + "inventory": "documentary_edges", + "source_block": "B1", + "target_block": "B2", + "original": { + "from": "B1", + "kind": "data", + "to": "B2" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD028", + "inventory": "documentary_edges", + "source_block": "B2", + "target_block": "B3", + "original": { + "from": "B2", + "kind": "data", + "to": "B3" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD029", + "inventory": "documentary_edges", + "source_block": "B3", + "target_block": "B4", + "original": { + "from": "B3", + "kind": "data", + "to": "B4" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD030", + "inventory": "documentary_edges", + "source_block": "B4", + "target_block": "B5", + "original": { + "from": "B4", + "kind": "data", + "to": "B5" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD031", + "inventory": "documentary_edges", + "source_block": "B8a", + "target_block": "B8b", + "original": { + "from": "B8a", + "kind": "data", + "to": "B8b" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD032", + "inventory": "documentary_edges", + "source_block": "B8b", + "target_block": "B9a", + "original": { + "from": "B8b", + "kind": "data", + "to": "B9a" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD033", + "inventory": "documentary_edges", + "source_block": "B9a", + "target_block": "B9b", + "original": { + "from": "B9a", + "kind": "data", + "to": "B9b" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD034", + "inventory": "documentary_edges", + "source_block": "B9b", + "target_block": "B10", + "original": { + "from": "B9b", + "kind": "data", + "to": "B10" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD035", + "inventory": "documentary_edges", + "source_block": "B10", + "target_block": "B11", + "original": { + "from": "B10", + "kind": "data", + "to": "B11" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD036", + "inventory": "documentary_edges", + "source_block": "B11", + "target_block": "B12", + "original": { + "from": "B11", + "kind": "data", + "to": "B12" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD037", + "inventory": "documentary_edges", + "source_block": "C1", + "target_block": "C2", + "original": { + "from": "C1", + "kind": "data", + "to": "C2" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD038", + "inventory": "documentary_edges", + "source_block": "C2", + "target_block": "C3", + "original": { + "from": "C2", + "kind": "data", + "to": "C3" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD039", + "inventory": "documentary_edges", + "source_block": "C3", + "target_block": "C4", + "original": { + "from": "C3", + "kind": "data", + "to": "C4" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD040", + "inventory": "documentary_edges", + "source_block": "C4", + "target_block": "C5", + "original": { + "from": "C4", + "kind": "data", + "to": "C5" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD041", + "inventory": "documentary_edges", + "source_block": "C5", + "target_block": "C6", + "original": { + "from": "C5", + "kind": "data", + "to": "C6" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD042", + "inventory": "documentary_edges", + "source_block": "C6", + "target_block": "C7", + "original": { + "from": "C6", + "kind": "data", + "to": "C7" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD043", + "inventory": "documentary_edges", + "source_block": "C7", + "target_block": "C8", + "original": { + "from": "C7", + "kind": "data", + "to": "C8" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD044", + "inventory": "documentary_edges", + "source_block": "C12a", + "target_block": "C12b", + "original": { + "from": "C12a", + "kind": "data", + "to": "C12b" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD045", + "inventory": "documentary_edges", + "source_block": "C12b", + "target_block": "C12c", + "original": { + "from": "C12b", + "kind": "data", + "to": "C12c" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD046", + "inventory": "documentary_edges", + "source_block": "D1", + "target_block": "D0", + "original": { + "from": "D1", + "kind": "evidence", + "to": "D0" + }, + "selected_status": "current_proof_reallocation", + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission." + }, + { + "id": "HD047", + "inventory": "documentary_edges", + "source_block": "D0", + "target_block": "D2", + "original": { + "from": "D0", + "kind": "evidence", + "to": "D2" + }, + "selected_status": "current_proof_reallocation", + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission." + }, + { + "id": "HD048", + "inventory": "documentary_edges", + "source_block": "D2", + "target_block": "D3", + "original": { + "from": "D2", + "kind": "evidence", + "to": "D3" + }, + "selected_status": "current_proof_reallocation", + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission." + }, + { + "id": "HD049", + "inventory": "documentary_edges", + "source_block": "D3", + "target_block": "D4", + "original": { + "from": "D3", + "kind": "evidence", + "to": "D4" + }, + "selected_status": "current_proof_reallocation", + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission." + }, + { + "id": "HD050", + "inventory": "documentary_edges", + "source_block": "D4", + "target_block": "D5", + "original": { + "from": "D4", + "kind": "evidence", + "to": "D5" + }, + "selected_status": "current_proof_reallocation", + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission." + }, + { + "id": "HD051", + "inventory": "documentary_edges", + "source_block": "D5", + "target_block": "D6", + "original": { + "from": "D5", + "kind": "evidence", + "to": "D6" + }, + "selected_status": "current_proof_reallocation", + "scope": "Current evidence is allocated through F01-F21; historical PASS receipts are not current admission." + }, + { + "id": "HD052", + "inventory": "documentary_edges", + "source_block": "A4b", + "target_block": "A4b1", + "original": { + "from": "A4b", + "kind": "detail", + "to": "A4b1" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD053", + "inventory": "documentary_edges", + "source_block": "A4b2", + "target_block": "A4b2a", + "original": { + "from": "A4b2", + "kind": "detail", + "to": "A4b2a" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD054", + "inventory": "documentary_edges", + "source_block": "A4b4", + "target_block": "A4b4a", + "original": { + "from": "A4b4", + "kind": "detail", + "to": "A4b4a" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD055", + "inventory": "documentary_edges", + "source_block": "A4c", + "target_block": "A4c1", + "original": { + "from": "A4c", + "kind": "detail", + "to": "A4c1" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD056", + "inventory": "documentary_edges", + "source_block": "A4a", + "target_block": "A4io", + "original": { + "from": "A4a", + "kind": "support", + "to": "A4io" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD057", + "inventory": "documentary_edges", + "source_block": "A4c3", + "target_block": "A4io", + "original": { + "from": "A4c3", + "kind": "support", + "to": "A4io" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD058", + "inventory": "documentary_edges", + "source_block": "A4b", + "target_block": "A4p1", + "original": { + "from": "A4b", + "kind": "support", + "to": "A4p1" + }, + "selected_status": "retained_outer_contract", + "scope": "Outer algorithm relation remains conditional; selected package does not execute arbitrary-size outer internals." + }, + { + "id": "HD059", + "inventory": "documentary_edges", + "source_block": "A4b2b", + "target_block": "B0", + "original": { + "from": "A4b2b", + "kind": "support", + "to": "B0" + }, + "selected_status": "retained_bit_interface_contract", + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions." + }, + { + "id": "HD060", + "inventory": "documentary_edges", + "source_block": "A4b2b", + "target_block": "C1", + "original": { + "from": "A4b2b", + "kind": "support", + "to": "C1" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD061", + "inventory": "documentary_edges", + "source_block": "B0", + "target_block": "B1", + "original": { + "from": "B0", + "kind": "detail", + "to": "B1" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD062", + "inventory": "documentary_edges", + "source_block": "B2", + "target_block": "B6a", + "original": { + "from": "B2", + "kind": "detail", + "to": "B6a" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD063", + "inventory": "documentary_edges", + "source_block": "B4", + "target_block": "B7a", + "original": { + "from": "B4", + "kind": "detail", + "to": "B7a" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD064", + "inventory": "documentary_edges", + "source_block": "B5", + "target_block": "B8a", + "original": { + "from": "B5", + "kind": "support", + "to": "B8a" + }, + "selected_status": "historical_order_replaced", + "scope": "Source471 internal order is not admitted as selected source527/hybrid execution. Current operation inventory and F02-F15 are authoritative." + }, + { + "id": "HD065", + "inventory": "documentary_edges", + "source_block": "B9a", + "target_block": "R5a", + "original": { + "from": "B9a", + "kind": "support", + "to": "R5a" + }, + "selected_status": "retained_bit_interface_contract", + "scope": "Caller/supplier responsibility is retained; current bit realization is F02-F15, with inherited all-size interface assumptions." + }, + { + "id": "HD066", + "inventory": "documentary_edges", + "source_block": "A4b2a", + "target_block": "R5b", + "original": { + "from": "A4b2a", + "kind": "support", + "to": "R5b" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HD067", + "inventory": "documentary_edges", + "source_block": "C2", + "target_block": "C13", + "original": { + "from": "C2", + "kind": "support", + "to": "C13" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD068", + "inventory": "documentary_edges", + "source_block": "C4", + "target_block": "C9", + "original": { + "from": "C4", + "kind": "detail", + "to": "C9" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD069", + "inventory": "documentary_edges", + "source_block": "C4", + "target_block": "C10", + "original": { + "from": "C4", + "kind": "detail", + "to": "C10" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD070", + "inventory": "documentary_edges", + "source_block": "C8", + "target_block": "C12a", + "original": { + "from": "C8", + "kind": "support", + "to": "C12a" + }, + "selected_status": "retained_complex_interface", + "scope": "Pinned complex supplier F16 supplies this responsibility; this relation is not a local scalar-gate trace." + }, + { + "id": "HD071", + "inventory": "documentary_edges", + "source_block": "R5a", + "target_block": "R1", + "original": { + "from": "R5a", + "kind": "support", + "to": "R1" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HD072", + "inventory": "documentary_edges", + "source_block": "C13", + "target_block": "R1", + "original": { + "from": "C13", + "kind": "support", + "to": "R1" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HD073", + "inventory": "documentary_edges", + "source_block": "R1", + "target_block": "R2", + "original": { + "from": "R1", + "kind": "support", + "to": "R2" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HD074", + "inventory": "documentary_edges", + "source_block": "R2", + "target_block": "R3", + "original": { + "from": "R2", + "kind": "support", + "to": "R3" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + }, + { + "id": "HD075", + "inventory": "documentary_edges", + "source_block": "R2", + "target_block": "R4", + "original": { + "from": "R2", + "kind": "support", + "to": "R4" + }, + "selected_status": "inherited_recursive_contract", + "scope": "Completed-child and restored-row interface remains an inherited theorem obligation; current charge is bound by F17-F20." + } + ] +} diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy_views.py b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy_views.py new file mode 100644 index 0000000000..1d5f7ed746 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_hierarchy_views.py @@ -0,0 +1,186 @@ +"""Full-system overview and reconciliation of all 87 prior stable block IDs.""" +from pathlib import Path +import json +BASE=Path(__file__).resolve().parent +DATA=json.loads((BASE/"joint259_system_docs_hierarchy.json").read_text()) +EDGES=json.loads((BASE/"joint259_system_docs_hierarchy_edges.json").read_text()) +WHY={ +"A0a":"Determine the exact input domain and operand lengths.", +"A0b":"Choose sizes and precision that satisfy every later interface.", +"A0c":"Make address, scale and phase choices explicit and reproducible.", +"A0d":"Route small cases to the attained ordinary leaf and retain finite guards.", +"A1":"Expose a convolution whose integer coefficients recover the product.", +"A2":"Keep transform inputs within the declared numerical envelope.", +"A3a":"Prevent cyclic wraparound from corrupting ordinary convolution.", +"A3b":"Preserve convolution while using the selected multidimensional layout.", +"A4a":"Move source samples into the working transform grid.", +"A4b":"Realize the source transform through the retained chirp reduction.", +"A4b1":"Represent the chirp convolution in the required negacyclic ring.", +"A4b2":"Evaluate the two normalized transforms used by ring convolution.", +"A4b3":"Form the ring convolution without hiding record-product work.", +"A4b4":"Return transformed products through the opposite normalization.", +"A4b5":"Remove the twist and restore the promised coefficient representation.", +"A4c":"Return from working-grid values to ordered source samples.", +"A4d":"Put both operand spectra in the same declared order.", +"A5":"Compute transform-domain convolution products at the chosen precision.", +"A6":"Recover a scaled convolution using the opposite transform sign.", +"A7a":"Undo the first transform normalization before exact recovery.", +"A7b":"Restore every remaining scale and the original coefficient layout.", +"A8":"Use the strict error bound to recover exact integer coefficients.", +"A9":"Propagate carries and serialize the exact integer product.", +"A4p1":"Generate phase exponents with their exact address/precision context.", +"A4p2":"Approximate phase factors within the allocated error budget.", +"A4p3":"Charge factor multiplication and truncation, rather than treating phases as free.", +"A4b2a":"Present stored records in the order required by each transform round.", +"A4b2b":"Realize the normalized local synthetic transform maps.", +"A4b2c":"Preserve the exact signed polynomial phase convention.", +"A4b2d":"Contain numerical growth and restore temporary work after each round.", +"A4b4a":"Reverse the transform orientation with its exact normalization.", +"A4c1":"Select the correct ordered source sample set.", +"A4c2":"Correct the bounded interpolation discrepancy.", +"A4c3":"Undo the diagonal Gaussian weighting with a paid factor.", +"A4io":"Make record shape and axis-order adapters explicit.", +"B0":"Keep F2 payload semantics separate from odd-prime address geometry.", +"B1":"Cancel arbitrary pre-existing dirty response before desired updates.", +"B2":"Produce the local helper action in exact admissible common frames.", +"B3":"Use a copied center without mutating its source or reading expired work.", +"B4":"Deliver only the specified target shear while preserving old target values.", +"B5":"Return all promised source and dirty payload states.", +"B6a":"Enter a source loan with a declared ownership and observation boundary.", +"B6b":"Prepare the source-carrier mix needed by the selected alias recipe.", +"B6c":"Consume the alias only inside its admitted lifetime and frames.", +"B6d":"Return the borrowed source before it is observed by its caller.", +"B6e":"Remove the carrier mix after its compensation obligations close.", +"B7a":"Prepare exact compensation for source-owned response.", +"B7b":"Transport the compensated target contribution to its legal observation cut.", +"B7c":"Cancel unwanted response without discarding the desired signal.", +"B8a":"Distinguish full routed addresses, not merely equal family numbers.", +"B8b":"Move complete streams with the exact route and finite charge.", +"B9a":"Invoke the exact smaller residual operator with restored-row obligations.", +"B9b":"Apply payload updates only at their common required frame.", +"B10":"Compose five routed orientations with legal phase-major boundaries.", +"B11":"Close arbitrary dirty residuals through the selected exact bank proof.", +"B12":"Restore the final external data-bank ordering by a paid exchange.", +"C1":"Cancel the old complex dirty response before the desired linear update.", +"C2":"Meet the exact phase-sensitive source entry labels.", +"C3":"Execute the first set of paid live-frame transitions.", +"C4":"Retain every copied-center child and scalar consumer.", +"C5":"Execute the second set of paid live-frame transitions.", +"C6":"Finish all live climbs before exit adaptation and cleanup.", +"C7":"Meet the exact complex exit labels, not a same-rank substitute.", +"C8":"Restore borrowed complex payload and clear the tableau.", +"C9":"Implement the literal forward center-copy scalar macro.", +"C10":"Implement the backward/transposed macro with fresh work.", +"C11a":"Create scalar work while preserving its source.", +"C11b":"Realize each exact rational coefficient on the declared common grid.", +"C11c":"Accumulate the signed scalar response at its correct destination.", +"C11d":"Clear temporary scalar work before reuse or recursion.", +"C12a":"Route each complex owner to its exact label and cover class.", +"C12b":"Compose all five complex windows, including idle banks.", +"C12c":"Finish the signed terminal exchange and restore external ownership.", +"C13":"Supply the residual with exact complex phases and normalization.", +"R1":"Package the complete residual operator and ownership obligations.", +"R2":"Call a genuinely smaller completed transform under the induction hypothesis.", +"R3":"Terminate at an attained ordinary algorithm below the finite cutoff.", +"R4":"Return every borrowed high row and spectator state.", +"R5a":"Retain both good-edge dispatch and the complete bad-edge fallback.", +"R5b":"Repair exceptional record layouts with paid primitives.", +"D0":"Bind every later check to a reconstructed source recipe.", +"D1":"Reject missing, changed or unpinned inputs.", +"D2":"Prove every formal bit column and its inverse restoration.", +"D3":"Check actual geometry, route order and determinant inventory.", +"D4":"Bind complex numerical checks to the pinned symbolic declarations.", +"D5":"Prevent a local cost improvement from bypassing complete closure.", +"D6":"Keep inherited all-size assumptions visible at the certificate boundary." +} +def card(d,x,y,w,h,key,title,body,target): + d.panel(x,y,w,h,key+" "+title,body,compact=True) + d.link(x+15,y+12,"Drill down: "+target,"H_"+target if target[0]in"ABCRD" else "B_"+target,w-30,9) + return (x,y,w,h) +def overview(d): + d.page("H_SYSTEM","Functional hierarchy | integers to exact product","Runtime data path; supplier and theorem support are separate") + d.text(42,666,"The selected hybrid replaces the BIT supplier inside this retained conditional integer-multiplication architecture.",13,"#526873") + groups=[ + ("A0","Accept and configure","U,V,n -> admissible sizes, precision and descriptors\nA0a-A0d","A0a"), + ("A1-A3","Represent operands","radix digits -> bounded arrays -> padded/CRT layout\nA1,A2,A3a,A3b","A1"), + ("A4","Two source transforms","normalized source Fourier arrays, same retained order\nGaussian / chirp / resampling hierarchy","A4a"), + ("A5-A6","Convolve and invert","matching Fourier products -> opposite-sign transform\nscaled convolution coefficients","A5"), + ("A7-A8","Recover exactly","undo all scales/layout -> error below 1/2 -> integer coefficients","A7a"), + ("A9","Normalize output","carry propagation and serialization -> exact UV","A9")] + for i,(key,title,body,target) in enumerate(groups): + col=i%3;row=i//3 + p=card(d,42+col*352,487-row*171,324,124,key,title,body,target) + if col:d.arrow(last,p) + last=p + d.panel(42,95,323,159,"BIT SUPPLIER B0-B12","Current F02-F15 expand source527, kernels, intervals, frame paths, copied centers, 40-replica banks and exact completion. Historical source471 details are replaced, not silently retained.",compact=True) + d.panel(394,95,323,159,"COMPLEX C1-C13","F16 expands the pinned complex supplier: labels, two scalar orientations, copied centers, live climbs, exact phases and finite guards. Its symbolic/analytic source theorem remains inherited.",compact=True) + d.panel(746,95,332,159,"RECURSION / PROOF","R1-R5b state completed-child, row and fallback contracts. D0-D6 are evidence flow, not runtime payload. F17-F21 bind the selected literal cost and conditional outer closure.",compact=True) + d.text(45,278,"Continuation: the output of A4 enters A5 on the next row. Each grouped ID opens its preserved detailed allocation.",10,"#526873") +def transforms(d): + d.page("H_TRANSFORMS","Functional hierarchy | source-transform internals","Retained outer interfaces; not new executable helper gates") + d.panel(42,492,320,156,"A4a GAUSSIAN EXPANSION","CRTInputs -> WorkingTensor\nPaid descriptors and phase factors come from A4p1-A4p3; layout adapters are A4io.\nWhy: put source samples in the working grid.",compact=True) + d.panel(390,492,334,156,"A4b CHIRP TRANSFORM","A4b1 twist -> A4b2 two normalized transforms -> A4b3 ring products -> A4b4 opposite transform -> A4b5 untwist.\nWorkingTensor -> WorkingSpectrum.",compact=True) + d.panel(752,492,326,156,"A4c / A4d RESAMPLE","A4c1 sample selection -> A4c2 bounded Neumann correction -> A4c3 diagonal correction -> ordered SourceSpectrum / PairedSpectrum.",compact=True) + d.arrow((42,492,320,156),(390,492,334,156));d.arrow((390,492,334,156),(752,492,326,156)) + d.panel(42,250,498,166,"A4b2 / A4b4 SYNTHETIC TRANSFORM","A4b2a tensor layout; A4b2b normalized butterfly rounds; A4b2c exact signed polynomial twiddle; A4b2d truncation and work cleanup. A4b4a supplies opposite rounds and normalization.\nTyped input/output: SyntheticState, with explicit numerical and ownership refinement.",compact=True) + d.panel(567,250,511,166,"SUPPLIER CONNECTIONS","Bit supplier B supplies exact address movement, with F2 payload and rational address frames.\nComplex supplier C supplies phase-correct linear residuals.\nR supplies completed recursive returns and restored borrowed rows. Supplier proofs do not prove all outer internals.",compact=True) + d.text(43,191,"Every original A/B/C/R/D ID appears below with its typed ports, why it exists, current allocation and exact scope.",13,"#147D77",bold=True) + d.text(43,157,"Unexpanded all-size numerical routines and theorem primitives remain explicit contracts. No transistor/gate-level or all-size implementation completeness is claimed.",12,"#526873",width=1010) +def catalog(d): + rows=DATA["blocks"] + if len(rows)!=87 or len({z["id"]for z in rows})!=87 or set(WHY)!={z["id"]for z in rows}:raise ValueError("Historical block coverage mismatch") + for start in range(0,len(rows),6): + d.page("H_CATALOG" if start==0 else "H_CATALOG%d"%start,"Full hierarchy | blocks %d-%d of 87"%(start+1,min(start+6,87)),"Preserved stable IDs; current allocation and explicit implementation boundary") + for j,z in enumerate(rows[start:start+6]): + x=43+(j%2)*532;y=646-(j//2)*199 + d.bookmark("H_"+z["id"]) + y=d.text(x,y,z["id"]+" "+z["name"],13,"#142D3A",492,True)-6 + y=d.text(x,y,"WHY: "+WHY[z["id"]],10,"#147D77",492,leading=13)-6 + ports="; ".join(k+": "+v for k,v in z["ports"].items()) + y=d.text(x,y,"PORTS: "+ports,9.5,"#142D3A",492,leading=12.5)-7 + y=d.text(x,y,z["note"],9.3,"#526873",492,leading=12)-7 + xx=x + for bid in z["current_blocks"]:d.link(xx,y,bid,"B_"+bid,43,9.5);xx+=55 + d.text(xx,y,z["status"].replace("_"," "),8.4,"#526873",width=max(10,x+495-xx)) + y-=18 + for rid in z['historical_requirements']: + d.link(x,y,rid,'H_REQ_'+rid,47,8.5);x+=52 + refs=list(z['source_refs'].items()) + preferred=[v for p,v in refs if '/sections/' in p]or[v for p,v in refs] + url=preferred[0].get('primary_url') if preferred else None + if url: + label='Exact historical proof/source' + d.text(x,y,label,8.5,'#176B8B',230) + d.c.linkURL(url,(x,y-3,x+180,y+11),relative=0,thickness=0) + +def requirements(d): + rows=DATA['requirement_definitions'] + for start in range(0,len(rows),5): + d.page('H_REQUIREMENTS' if start==0 else 'H_REQUIREMENTS%d'%start,'Original requirement vocabulary | %d-%d'%(start+1,min(start+5,len(rows))),'Retained outcome/model obligations; not source471 implementation mandates') + y=671 + for row in rows[start:start+5]: + d.bookmark('H_REQ_'+row['id']) + y=d.text(43,y,row['id']+' '+row['title'],14,'#147D77',1020,True)-4 + y=d.text(43,y,row['statement'],11,'#142D3A',1020)-6 + y=d.text(43,y,'Why: '+row['rationale'],10,'#526873',1020)-22 + +def connections(d): + rows=[z for z in EDGES['relations']if z['inventory']=='typed_edges'] + if len(rows)!=53 or len(EDGES['relations'])!=128:raise ValueError('Historical edge reconciliation incomplete') + ids={z['id']for z in DATA['blocks']} + if any(e['source_block']not in ids or e['target_block']not in ids for e in EDGES['relations']):raise ValueError('Unknown historical endpoint') + for start in range(0,len(rows),10): + d.page('H_CONNECTIONS'if start==0 else'H_CONNECTIONS%d'%start,'Preserved interface connections | %d-%d of 53'%(start+1,min(start+10,53)),'Original typed relations reconciled; not promoted to current scalar execution') + y=671 + for r in rows[start:start+10]: + e=r['original'];d.bookmark(r['id']) + d.text(43,y,r['id'],10,'#147D77',70,True) + d.link(110,y,e['source'],'H_'+r['source_block'],194,10) + d.text(305,y,'->',10,'#142D3A',30) + d.link(334,y,e['target'],'H_'+r['target_block'],194,10) + d.text(543,y,e['kind']+' / '+e.get('type','contract'),9.5,'#142D3A',500) + d.text(110,y-17,r['selected_status'].replace('_',' '),9,'#526873',850) + y-=49 + d.text(43,91,'Also preserved: 75 documentary relations with separate classification in hierarchy_edges.json. Neither inventory is silently relabeled as current gate order.',10,'#526873',1020) + d.text(43,68,'Current F01-F21 dependencies and the exact selected local event inventory are separate, source-bound layers.',10,'#526873',1020) + diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental.py b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental.py new file mode 100644 index 0000000000..2f699974d7 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental.py @@ -0,0 +1,429 @@ +#!/usr/bin/env python3 +"""Content-addressed vector-page cache for joint259_system_docs_build. + +The normal renderer is executed against a recording canvas, without painting. +Only new drawing-operation sequences are painted. Every run reconstructs PDF +destinations, links, outlines and nonvisual indexes from the current model. +Use --clean to bypass saved pages, --svg for linked per-page vector SVGs, and +--emit-json to return text artifacts without writing to the filesystem. +""" +from __future__ import annotations + +import argparse +import base64 +import contextlib +import hashlib +import importlib.metadata +import io +import json +import re +import shutil +import subprocess +import sys +import time +from pathlib import Path +from xml.sax.saxutils import escape, quoteattr + +import reportlab +from reportlab.lib.colors import Color +from reportlab.pdfbase import pdfmetrics +from reportlab.pdfgen import canvas +from pypdf import PdfReader, PdfWriter +from pypdf.annotations import Link +from pypdf.generic import NameObject, StreamObject + +import joint259_system_docs_build as renderer + +SCHEMA = "joint259-vector-page-cache/1" +BASE_DOC = renderer.Doc +BASE_RENDER = renderer.render +KINDS = {"functional": "functional_architecture"} + + +def canonical(value): + return json.dumps(value, sort_keys=True, separators=(",", ":"), ensure_ascii=True).encode("ascii") + + +def digest(value): + return hashlib.sha256(value).hexdigest() + + +class RecordedPath: + def __init__(self): + self.calls = [] + + def __getattr__(self, name): + def record(*args, **kwargs): + self.calls.append([name, pack(args), pack(kwargs)]) + return record + + +def pack(value): + if isinstance(value, RecordedPath): + return {"__path__": value.calls} + if isinstance(value, Color): + return {"__color__": [value.red, value.green, value.blue, value.alpha]} + if isinstance(value, (list, tuple)): + return [pack(v) for v in value] + if isinstance(value, dict): + return {k: pack(v) for k, v in value.items()} + if value is None or isinstance(value, (str, bool, int, float)): + return value + raise TypeError("Unsupported drawing argument: " + type(value).__name__) + + +def unpack(value, target): + if isinstance(value, dict): + if "__color__" in value: + return Color(*value["__color__"]) + if "__path__" in value: + path = target.beginPath() + for name, args, kwargs in value["__path__"]: + getattr(path, name)(*unpack(args, target), **unpack(kwargs, target)) + return path + return {k: unpack(v, target) for k, v in value.items()} + if isinstance(value, list): + return [unpack(v, target) for v in value] + return value + + +class RecordingCanvas: + """The renderer's supported canvas protocol; unsupported values fail closed.""" + def __init__(self): + self.pages = [] + self.current = {"paint": [], "destinations": [], "links": [], "outlines": []} + + def beginPath(self): + return RecordedPath() + + def stringWidth(self, text, fontName, fontSize, encoding="utf8"): + return pdfmetrics.stringWidth(text, fontName, fontSize, encoding) + + def getPageNumber(self): + return len(self.pages) + 1 + + def bookmarkPage(self, key, **kwargs): + if kwargs: + raise ValueError("New bookmark options require explicit cache support") + self.current["destinations"].append(key) + + def addOutlineEntry(self, title, key, level=0, closed=None): + self.current["outlines"].append([title, key, level, bool(closed)]) + + def linkRect(self, contents, destinationname, Rect=None, addtopage=1, name=None, + relative=1, thickness=0, color=None, dashArray=None, **kwargs): + if relative or not addtopage or name or kwargs or thickness or color or dashArray: + raise ValueError("New link style requires explicit cache support") + self.current["links"].append({"target": destinationname, "rect": list(Rect)}) + + def linkURL(self, url, rect, relative=0, thickness=0, color=None, dashArray=None, kind="URI", **kwargs): + if relative or thickness or color or dashArray or kind != "URI" or kwargs: + raise ValueError("New external-link style requires explicit cache support") + self.current["links"].append({"url": url, "rect": list(rect)}) + + def showPage(self): + if self.current["paint"] or self.current["destinations"]: + self.pages.append(self.current) + self.current = {"paint": [], "destinations": [], "links": [], "outlines": []} + + def save(self): + self.showPage() + + def __getattr__(self, name): + if name.startswith("_"): + raise AttributeError(name) + if name in {"setTitle", "setAuthor", "setSubject", "setCreator", "setKeywords"}: + return lambda *a, **k: None + if not hasattr(canvas.Canvas, name): + raise AttributeError("Unsupported Canvas method " + name) + def record(*args, **kwargs): + self.current["paint"].append([name, pack(args), pack(kwargs)]) + return record + + +class PlanningDoc(BASE_DOC): + def __init__(self, kind, model, refs): + self.kind, self.model, self.refs = kind, model, refs + self.buf = io.BytesIO() + self.c = RecordingCanvas() + self.n = 0 + self.ids, self.links, self.used_blocks, self.pages, self.boxes = set(), [], set(), [], [] + + def finish(self): + missing = {t for _, t in self.links} - self.ids + if missing: + raise ValueError("Broken internal links " + str(missing)) + self.c.save() + if len(self.c.pages) != self.n: + raise ValueError("Page recording mismatch") + return self.c.pages, {"pages": self.pages, "internal_links": len(self.links), + "blocks": sorted(self.used_blocks)} + + +def plan(kind, model, refs): + if kind not in KINDS: + raise ValueError("Unsupported architecture output kind") + """Uses the authoritative renderer; no duplicated page-dispatch logic.""" + previous = renderer.Doc + renderer.Doc = PlanningDoc + try: + return BASE_RENDER(kind, model, refs) + finally: + renderer.Doc = previous + + +def dependencies(model, extra=None): + files = {"renderer": Path(renderer.__file__), "cache_implementation": Path(__file__), + "requirements": renderer.BASE / "joint259_system_docs_requirements.txt", + "source_binding": renderer.BASE / "joint259_system_docs_source_binding.json"} + # Imported drawing code is a renderer dependency as well. Model JSON is + # deliberately projected through recorded page operations, so a single + # block edit does not invalidate every unrelated visual page. + for name, module in vars(renderer).items(): + module_file = getattr(module, "__file__", None) + if module_file and Path(module_file).resolve().parent == renderer.BASE.resolve(): + files["renderer_module_" + name] = Path(module_file) + font_root = Path(reportlab.__file__).parent / "fonts" + files.update({"font_" + f: font_root / f for f in ("Vera.ttf", "VeraBd.ttf")}) + return {"schema": SCHEMA, "files": {k: digest(v.read_bytes()) for k, v in files.items()}, + "source_manifest_sha256": model["source_manifest_sha256"], + "python_version": list(sys.version_info[:3]), + "packages": {n: importlib.metadata.version(n) for n in ("reportlab", "pypdf", "Pillow", "charset-normalizer")}, + "configuration": {"width": renderer.W, "height": renderer.H, "font": renderer.FONT, + "pdf_compression": 0, "invariant": 1}, + "extra": extra or {}} + + +def ascii_pdf(writer): + for obj in writer._objects: + if isinstance(obj, StreamObject): + obj._data = base64.a85encode(obj.get_data()) + b"~>" + obj[NameObject("/Filter")] = NameObject("/ASCII85Decode") + obj.pop(NameObject("/DecodeParms"), None) + if hasattr(obj, "decoded_self"): + obj.decoded_self = None + buf = io.BytesIO() + writer.write(buf) + raw = buf.getvalue().replace(b"%\x93\x8c\x8b\x9e", b"%ASCI", 1).replace(b"%\xe2\xe3\xcf\xd3", b"%ASCI", 1) + raw.decode("ascii") + return raw + + +def paint_page(operations): + buf = io.BytesIO() + target = canvas.Canvas(buf, pagesize=(renderer.W, renderer.H), pageCompression=0, invariant=1) + for name, args, kwargs in operations: + getattr(target, name)(*unpack(args, target), **unpack(kwargs, target)) + target.save() + return buf.getvalue() + + +def entry_pdf(entry): + return base64.b64decode(entry["pdf_base64"], validate=True) + + +def valid_entry(entry, key, plan_hash, dependency_hash): + try: + if (entry["schema"], entry["key"], entry["plan_sha256"], entry["dependency_sha256"]) != (SCHEMA, key, plan_hash, dependency_hash): + return False + raw = entry_pdf(entry) + if digest(raw) != entry["pdf_sha256"]: + return False + reader = PdfReader(io.BytesIO(raw), strict=True) + return len(reader.pages) == 1 and not reader.pages[0].get("/Annots") + except Exception: + return False + + +def assemble(pages, page_pdfs, model): + writer = PdfWriter() + for raw in page_pdfs: + writer.add_page(PdfReader(io.BytesIO(raw)).pages[0]) + targets = {} + for number, page in enumerate(pages): + for name in page["destinations"]: + if name in targets: + raise ValueError("Duplicate destination " + name) + targets[name] = number + for name in sorted(targets): + writer.add_named_destination(name, targets[name]) + parents = {} + for number, page in enumerate(pages): + for title, key, level, closed in page["outlines"]: + if level and level - 1 not in parents: + raise ValueError("Outline skips a level") + parents[level] = writer.add_outline_item(title, targets[key], parent=parents.get(level - 1), is_open=not closed) + for obsolete in [i for i in parents if i > level]: + del parents[obsolete] + for link in page["links"]: + if "url" in link: + annotation = Link(rect=tuple(link["rect"]), url=link["url"]) + else: + annotation = Link(rect=tuple(link["rect"]), target_page_index=targets[link["target"]]) + inserted = writer.add_annotation(number, annotation) + if "url" not in link: + # pypdf 6.10 leaves target_page_index as an integer here; + # an explicit same-document destination requires a page ref. + inserted["/Dest"][0] = writer.pages[targets[link["target"]]].indirect_reference + writer.add_metadata({"/Title": model["title"], "/Author": "Henry Grant; prepared with OpenAI assistance", + "/Creator": "joint259_system_docs_incremental", "/Producer": "pypdf"}) + # Each isolated page carries self-contained fonts. Coalesce identical + # resources before final serialization, keeping the assembled PDF compact. + writer.compress_identical_objects(remove_identicals=True, remove_orphans=True) + return ascii_pdf(writer) + + +def svg_version(): + result = subprocess.run(["pdftocairo", "-v"], stdout=subprocess.PIPE, stderr=subprocess.PIPE, check=True) + return {"version": (result.stdout + result.stderr).decode("utf8").strip(), + "executable_sha256": digest(Path(shutil.which("pdftocairo")).read_bytes())} + + +def paint_svg(raw): + result = subprocess.run(["pdftocairo", "-svg", "-", "-"], input=raw, + stdout=subprocess.PIPE, stderr=subprocess.PIPE, check=True) + value = result.stdout.decode("utf8") + if "' % + (quoteattr(link["url"] if "url" in link else targets[link["target"]]), x1, renderer.H-y2, x2-x1, y2-y1)) + files[svg_name(kind, info["id"])] = saved["text"].replace("", "\n" + "\n".join(overlays) + "\n") + return files + + +class Engine: + def __init__(self, model, cache=None, extra_dependencies=None, svg=False): + self.cache = cache if cache is not None else {} + self.dependencies = dependencies(model, extra_dependencies) + self.dependency_hash = digest(canonical(self.dependencies)) + self.events = [] + self.svg_files = {} + self.svg_version = svg_version() if svg else None + + def render(self, kind, model, refs): + if kind not in KINDS: + raise ValueError("Unsupported architecture output kind") + start = time.perf_counter() + pages, report = plan(kind, model, refs) + planning_seconds = time.perf_counter() - start + page_pdfs, entries, rebuilt, reused = [], [], [], [] + for page, info in zip(pages, report["pages"]): + plan_hash = digest(canonical(page["paint"])) + key = digest(canonical([self.dependency_hash, plan_hash])) + entry = self.cache.get(key) + if not valid_entry(entry, key, plan_hash, self.dependency_hash): + raw = paint_page(page["paint"]) + entry = {"schema": SCHEMA, "key": key, "plan_sha256": plan_hash, + "dependency_sha256": self.dependency_hash, "pdf_sha256": digest(raw), "pdf_base64": base64.b64encode(raw).decode("ascii")} + self.cache[key] = entry + rebuilt.append(info["id"]) + else: + reused.append(info["id"]) + entries.append(entry) + page_pdfs.append(entry_pdf(entry)) + raw = assemble(pages, page_pdfs, model) + if self.svg_version is not None: + self.svg_files.update(linked_svgs(kind, pages, report, entries, self.svg_version)) + report["sha256"] = digest(raw) + self.events.append({"kind": kind, "rendered_pages": rebuilt, "reused_pages": reused, + "planning_seconds": planning_seconds, "elapsed_seconds": time.perf_counter() - start}) + return raw, report + + +def build(source, model, engine): + """Run authoritative integrity/index/QA code with this engine's rendering.""" + source = renderer.source_views.open_source(source) + previous_render, previous_model, previous_argv = renderer.render, renderer.MODEL, sys.argv + class ModelInput: + def read_text(self): + return json.dumps(model) + renderer.render, renderer.MODEL = engine.render, ModelInput() + sys.argv = [str(Path(renderer.__file__)), "--source", str(source), "--emit-json"] + output = io.StringIO() + try: + with contextlib.redirect_stdout(output): + renderer.main(source_override=source) + finally: + renderer.render, renderer.MODEL, sys.argv = previous_render, previous_model, previous_argv + files = json.loads(output.getvalue()) + files.update(engine.svg_files) + receipt = {"schema": SCHEMA, "dependencies": engine.dependencies, + "dependency_sha256": engine.dependency_hash, "model_sha256": digest(canonical(model)), + "auxiliary_models": {p.name: digest(p.read_bytes()) for p in renderer.BASE.glob("joint259_system_docs_hierarchy*.json")}, + "pdfs": {n: digest(v.encode("ascii")) for n, v in files.items() if n.endswith(".pdf")}, + "source_binding": json.loads(files['source_binding.json']), + "svg_converter": engine.svg_version, + "scope": "Vector-page rendering cache only; science replay is separate.", + "page_cache_validation": "Schema, dependency and drawing-plan keys, PDF hash and single-page structure checked before reuse."} + files["incremental_receipt.json"] = renderer.stable(receipt) + return files + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("--source", type=Path, required=True) + parser.add_argument("--model", type=Path, default=renderer.MODEL) + parser.add_argument("--output", type=Path) + parser.add_argument("--cache", type=Path, help="Persistent cache JSON; default OUTPUT/../joint259-page-cache.json") + parser.add_argument("--clean", action="store_true") + parser.add_argument("--svg", action="store_true", help="Also export linked vector SVGs; requires pdftocairo") + parser.add_argument("--emit-json", action="store_true", help="No filesystem writes; emit artifacts and cache in one JSON object") + args = parser.parse_args() + if not args.emit_json and args.output is None: + parser.error("--output or --emit-json is required") + cache_path = args.cache or (args.output.parent / "joint259-page-cache.json" if args.output else None) + cache = {} + if not args.clean and cache_path and cache_path.exists(): + try: + saved = json.loads(cache_path.read_text()) + if saved.get("schema") == SCHEMA and isinstance(saved.get("pages"), dict): + cache = saved["pages"] + except (OSError, ValueError): + pass # An absent or damaged cache is a clean rebuild, never success by receipt. + model = json.loads(args.model.read_text()) + engine = Engine(model, cache, svg=args.svg) + files = build(args.source.resolve(), model, engine) + saved = {"schema": SCHEMA, "pages": engine.cache} + result = {"files": files, "cache": saved, "measurements": engine.events} + if args.emit_json: + print(renderer.stable(result), end="") + return + # Fail before touching prior output; deliberately never writes scientific inputs. + source = args.source.resolve() + for candidate in (args.output.resolve(), cache_path.resolve()): + if candidate == source or source in candidate.parents: + parser.error("Output and cache must be outside the scientific source package") + args.output.mkdir(parents=True, exist_ok=False) + for name, content in files.items(): + (args.output / name).write_text(content, encoding="utf8") + cache_path.parent.mkdir(parents=True, exist_ok=True) + temporary = cache_path.with_name(cache_path.name + ".tmp") + temporary.write_text(renderer.stable(saved), encoding="utf8") + temporary.replace(cache_path) + print(renderer.stable({"output": str(args.output), "cache": str(cache_path), "measurements": engine.events}), end="") + + +if __name__ == "__main__": + main() diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental_README.md b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental_README.md new file mode 100644 index 0000000000..bb563a820b --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental_README.md @@ -0,0 +1,36 @@ +# Functional architecture build and page cache + +The retained incremental renderer builds only functional_architecture.pdf +and summary-functional.svg. It does not regenerate logical or combined output +families. The runtime and model dependencies are retained together with the +functional-only cache/navigation test runner. + +## Build + + python -m pip install -r joint259_system_docs_requirements.txt + python -B joint259_system_docs_incremental.py --source /path/to/construction --output /new/output --cache /path/to/page-cache.json --svg + +The output and cache must be outside the immutable scientific package. Omit +--svg to build without Poppler. Linked per-page functional SVGs are local build +outputs and are excluded from the public allowlist. --clean ignores the cache. + +Page drawing plans, renderer/configuration/font/source dependencies and PDF +hashes determine reuse. Navigation is rebuilt even when appearance is reused. +A missing or damaged cache causes rebuilding; it never bypasses source pins. +The cache is local acceleration state, not an authenticated proof receipt. + +## Focused verification + + python -B joint259_system_docs_incremental_test.py --source /path/to/construction --raster-dpi 40 + +The fresh functional-only report covers 51 pages. It checks cold/warm/clean +byte equality, decoded drawing streams, page text, internal navigation, full +raster equality at the recorded resolution, controlled block and requirement +changes, dependency invalidation, damaged-cache repair, source-pin rejection, +JSON cache round trips and vector SVGs with resolved links. The old L04-only +case is removed because that output family is no longer present. + +The retained independent review files clearly identify their original +three-family review as historical. The fresh narrowed-build test report is +separate evidence and does not reuse the historical 161-page PASS claim. +Neither build nor documentation tests replay the scientific construction. diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental_test.py b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental_test.py new file mode 100644 index 0000000000..8dfdc0715c --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_incremental_test.py @@ -0,0 +1,276 @@ +#!/usr/bin/env python3 +"""Read-only, in-memory mutation and equivalence tests for the visual cache.""" +from __future__ import annotations +import argparse, contextlib, copy, hashlib, io, json, subprocess, time +from pathlib import Path +from xml.etree import ElementTree +import joint259_system_docs_incremental as inc + + +def raster(raw, dpi, page=None): + command = ["pdftoppm", "-r", str(dpi)] + if page: + command += ["-f", str(page), "-l", str(page), "-singlefile"] + return subprocess.run(command + ["-"], input=raw, stdout=subprocess.PIPE, + stderr=subprocess.PIPE, check=True).stdout + + +def pdf_structure(raw): + reader = inc.PdfReader(io.BytesIO(raw), strict=True) + targets = {p.indirect_reference.idnum: i for i, p in enumerate(reader.pages)} + links = [] + for i, page in enumerate(reader.pages): + assert (page.extract_text() or "").strip(), ("Empty page", i) + for item in page.get("/Annots", []): + annotation = item.get_object() + action = annotation.get("/A", {}) + if action.get("/S") == "/URI": + links.append((i, tuple(annotation["/Rect"]), str(action["/URI"]))) + continue + dest = annotation.get("/Dest") + if dest is None: + dest = action["/D"] + assert dest[0].idnum in targets, ("Dangling link", i, dest) + links.append((i, tuple(annotation["/Rect"]), targets[dest[0].idnum])) + destinations = {n: reader.get_destination_page_number(d) for n, d in reader.named_destinations.items()} + assert all(0 <= p < len(reader.pages) for p in destinations.values()) + return {"texts": [p.extract_text() for p in reader.pages], + "streams": [hashlib.sha256(p.get_contents().get_data()).hexdigest() for p in reader.pages], + "links": links, "destinations": destinations, "page_count": len(reader.pages)} + + +@contextlib.contextmanager +def patched(cls, attribute, function): + old = getattr(cls, attribute) + setattr(cls, attribute, function(old)) + try: + yield + finally: + setattr(cls, attribute, old) + + +def run(source, dpi=40, svg=True): + r = inc.renderer + model = json.loads(r.MODEL.read_text()) + source_count = r.integrity(source, model["source_manifest_sha256"]) + refs = r.source_index(source, model) + report = {"status": "RUNNING", "source_files": source_count, "raster_dpi": dpi, + "scope": "Documentation and cache tests only; no scientific replay.", + "baseline": {}, "mutations": [], "invalidation": [], "stale_cache": []} + if dpi: + version = subprocess.run(["pdftoppm", "-v"], stdout=subprocess.PIPE, stderr=subprocess.PIPE, check=True) + report["raster_renderer"] = (version.stdout + version.stderr).decode("utf8").strip() + rejected = [] + for kind in ("logical", "combined"): + for label, call in (("renderer", lambda: r.render(kind, model, refs)), + ("planning", lambda: inc.plan(kind, model, refs)), + ("cache engine", lambda: inc.Engine(model).render(kind, model, refs))): + try: + call() + except ValueError as error: + assert "Unsupported architecture output kind" in str(error) + else: + raise AssertionError(("Rejected output family recreated", kind, label)) + rejected.append({"kind": kind, "entry_point": label}) + report["unsupported_output_kinds_rejected"] = rejected + cache, baseline = {}, {} + for kind in inc.KINDS: + cold = inc.Engine(model, cache) + raw, details = cold.render(kind, model, refs) + warm = inc.Engine(model, cache) + warm_raw, _ = warm.render(kind, model, refs) + clean = inc.Engine(model) + clean_raw, _ = clean.render(kind, model, refs) + t = time.perf_counter() + original, _ = r.render(kind, model, refs) + original_seconds = time.perf_counter() - t + assert raw == warm_raw == clean_raw, kind + assert not warm.events[-1]["rendered_pages"], kind + one, two = pdf_structure(raw), pdf_structure(original) + assert one["texts"] == two["texts"], (kind, "text") + assert one["streams"] == two["streams"], (kind, "drawing streams") + assert one["links"] == two["links"], (kind, "link destinations") + if dpi: + pixels = raster(raw, dpi) + assert pixels == raster(original, dpi), (kind, "full raster") + assert pixels == raster(clean_raw, dpi), (kind, "clean raster") + baseline[kind] = (raw, details) + report["baseline"][kind] = {"pages": one["page_count"], "links": len(one["links"]), + "cold_seconds": cold.events[-1]["elapsed_seconds"], + "warm_seconds": warm.events[-1]["elapsed_seconds"], + "original_seconds": original_seconds, + "warm_rendered_pages": 0, "sha256": inc.digest(raw), + "clean_warm_byte_identical": True, + "original_decoded_streams_text_links_identical": True, + "all_pages_raster_identical": bool(dpi)} + base_raw, base_details = baseline["functional"] + + def compare(label, changed_model, expected=None, changed_refs=None): + current_refs = changed_refs if changed_refs is not None else r.source_index(source, changed_model) + incremental = inc.Engine(changed_model, cache) + actual, details = incremental.render("functional", changed_model, current_refs) + clean = inc.Engine(changed_model) + expected_raw, _ = clean.render("functional", changed_model, current_refs) + assert actual == expected_raw, label + assert pdf_structure(actual) == pdf_structure(expected_raw), label + event = incremental.events[-1] + rebuilt = event["rendered_pages"] + if expected is not None: + assert set(rebuilt) == set(expected), (label, rebuilt, expected) + if dpi and rebuilt: + changed_page = next(v["page"] for v in details["pages"] if v["id"] == rebuilt[0]) + assert raster(actual, dpi, changed_page) == raster(expected_raw, dpi, changed_page), label + report["mutations"].append({"case": label, "rendered_pages": rebuilt, + "reused_page_count": len(event["reused_pages"]), + "incremental_seconds": event["elapsed_seconds"], + "clean_seconds": clean.events[-1]["elapsed_seconds"], + "byte_identical_to_clean": True, "navigation_valid": True}) + return actual + + changed = copy.deepcopy(model) + changed["blocks"][0]["what"] += " Test." + compare("block behavior", changed, ["CATALOG"]) + changed = copy.deepcopy(model) + changed["blocks"][0]["brief"] += " Test." + compare("block diagram summary", changed, ["FVIEW1"]) + changed = copy.deepcopy(model) + changed["blocks"][0]["name"] += " test" + compare("block display rename", changed, ["FVIEW1", "CATALOG"]) + changed = copy.deepcopy(model) + changed["requirements"][0]["text"] += " Test." + compare("requirement wording", changed, ["REQUIREMENTS"]) + changed = copy.deepcopy(model) + changed["edges"][0]["cache_test_note"] = "An index-only controlled edit" + compare("index-only edge metadata", changed, []) + engine = inc.Engine(changed, cache) + files = inc.build(source, changed, engine) + assert json.loads(files["connection_index.json"])["block_edges"][0]["cache_test_note"] == "An index-only controlled edit" + altered_refs = copy.deepcopy(refs) + next(iter(altered_refs.values()))["sha256"] = "0" * 64 + compare("source traceability hash projection", model, ["SOURCES"], altered_refs) + + def change_wire(old): + def wrapped(self, a, b, *args, **kwargs): + if self.pages[-1]["id"] == "FVIEW1": + a = (a[0] + 1, *a[1:]) + return old(self, a, b, *args, **kwargs) + return wrapped + with patched(inc.PlanningDoc, "arrow", change_wire): + compare("diagram wiring coordinate", model, ["FVIEW1"]) + + def change_target(old): + def wrapped(self, contents, destinationname, *args, **kwargs): + if destinationname == "B_F01": + destinationname = "B_F03" + return old(self, contents, destinationname, *args, **kwargs) + return wrapped + with patched(inc.RecordingCanvas, "linkRect", change_target): + redirected = compare("navigation-only internal target", model, []) + assert redirected != base_raw + + def change_url(old): + def wrapped(self, url, *args, **kwargs): + return old(self, url + "#cache-test", *args, **kwargs) + return wrapped + base_links = pdf_structure(base_raw)["links"] + if any(isinstance(link[2], str) for link in base_links): + with patched(inc.RecordingCanvas, "linkURL", change_url): + redirected = compare("navigation-only external URL", model, []) + assert redirected != base_raw + + extended = copy.deepcopy(model) + for identifier in ("F98", "F99"): + block = copy.deepcopy(model["blocks"][-1]) + block["id"], block["name"] = identifier, "Test-only catalog block" + block["inputs"], block["outputs"] = [], [] + block["requirements"] = [] + extended["blocks"].append(block) + compare("add catalog blocks and page", extended) + renamed = copy.deepcopy(extended) + renamed["blocks"][-1]["id"] = "F97" + compare("stable block ID rename", renamed, ["CATALOG22"]) + restored = compare("delete added blocks and undo all edits", model, []) + assert restored == base_raw + + return finish_checks(report, source, model, refs, cache, base_raw, base_details, source_count, svg) + + +def finish_checks(report, source, model, refs, cache, base_raw, base_details, source_count, svg): + r = inc.renderer + # Controlled dependency digests avoid writing scientific inputs. + for dependency in ("renderer_code", "font_bytes", "requirements_pin", "source_manifest", "configuration"): + engine = inc.Engine(model, cache, extra_dependencies={dependency: "controlled different digest"}) + raw, details = engine.render("functional", model, refs) + assert len(engine.events[-1]["rendered_pages"]) == len(details["pages"]) + assert raw == base_raw + report["invalidation"].append({"dependency": dependency, "rendered_page_count": len(details["pages"])}) + pages, _ = inc.plan("functional", model, refs) + engine = inc.Engine(model, cache) + plan_hash = inc.digest(inc.canonical(pages[0]["paint"])) + first_key = inc.digest(inc.canonical([engine.dependency_hash, plan_hash])) + for field, value in (("schema", "obsolete"), ("plan_sha256", "0" * 64), + ("dependency_sha256", "0" * 64), ("pdf_sha256", "0" * 64), + ("pdf_base64", "not a PDF")): + damaged = dict(cache) + damaged[first_key] = dict(cache[first_key], **{field: value}) + repair = inc.Engine(model, damaged) + raw, _ = repair.render("functional", model, refs) + assert raw == base_raw + assert repair.events[-1]["rendered_pages"] == ["CONTENTS"] + report["stale_cache"].append({"damaged_field": field, "rebuilt": ["CONTENTS"], "clean_equality": True}) + wrong = copy.deepcopy(model) + wrong["source_manifest_sha256"] = "0" * 64 + try: + inc.build(source, wrong, inc.Engine(wrong, cache)) + except ValueError as error: + assert "Unrecognized scientific/public source manifest" in str(error) + else: + raise AssertionError("A stale cache bypassed source-pin checking") + report["wrong_scientific_pin_rejected"] = True + persisted_cache = json.loads(json.dumps(cache)) + warm_files = inc.build(source, model, inc.Engine(model, persisted_cache)) + clean_files = inc.build(source, model, inc.Engine(model)) + assert warm_files == clean_files + report["all_clean_warm_artifacts_identical_after_cache_json_roundtrip"] = sorted(warm_files) + if svg: + exporter = inc.Engine(model, cache, svg=True) + exporter.render("functional", model, refs) + first = dict(exporter.svg_files) + exporter.render("functional", model, refs) + assert first == exporter.svg_files + all_links, external_links = 0, 0 + for name, value in first.items(): + parsed = ElementTree.fromstring(value) + assert "2^80 after fixed exclusions; prime supply is an inherited theorem dependency.", + "Every physical basis plus all defining-source and added-transform bases is covered." + ], + "heritage": "PR234 geometric interface plus source527/current entrance inventory; retained exact-prime framework.", + "sources": [ + "code/geometry527.py|def run(", + "prime_check.py|def run(" + ], + "requirements": [ + "R03", + "R07", + "R11" + ] + }, + { + "id": "F16", + "name": "Independent complex supplier", + "brief": "Pinned labels, scalar splice and guard", + "what": "Reconstruct the pinned complex gcert/1 certificate, both scalar orientations, temporary lifetimes, label/scalar splice, all final climbs and finite precision/row guards. Feed its independent profile into the outer assembly.", + "why": "The integer-multiplication closure uses both a bit supplier and a complex supplier. The complex theorem is not implied by a successful bit-word check.", + "inputs": [ + "complexpins: certificate, source theorems and exact matrices" + ], + "outputs": [ + "complex: m=110, W=14,692, 361,405 children", + "guard: row coefficient 20,161; exact denominator grid" + ], + "invariants": [ + "Rank mass 1,613,040; deficit 3,080; largest child 46.", + "Three forward plus two backward calls use 7,577,864 real-component primitive steps.", + "Denominators 1,2,3,6; no return rounding; source symbolic/analytic theorems remain dependencies." + ], + "heritage": "Jacob Sussman source f010392c923279e3dd59ef3aa5fedad23affc5fd; Avi Eisenberg / ikeboy PR193 helper and retained Claude assistance disclosures.", + "sources": [ + "portable_complex.py|def run(", + "portable_complex.py|def finite_guard(" + ], + "requirements": [ + "R04", + "R06", + "R10", + "R11" + ] + }, + { + "id": "F17", + "name": "Independent directed moments", + "brief": "Full rare fallback; adjacent grid rejected", + "what": "Price the literal banked bit histogram and unchanged complex histogram with outward exact-rational bounds. Independently cross-check the bit moment with the base-two engine and include the entire rare fallback allowance.", + "why": "Concavity-based savings are only admissible with a rigorous strict gap and every paid residual, including the low-probability expensive branch.", + "inputs": [ + "literal: bit histogram, m=120, W=867,045", + "complex: independent supplier profile" + ], + "outputs": [ + "rates: strict bit/complex moment enclosures", + "grid: next bit-grid exclusion" + ], + "invariants": [ + "Bit max child 50 < 120/2; literal deficit 176,000.", + "Fallback adds 10^-16 times 32*m^2 rank-one calls per paid child.", + "Two independent interval engines agree; decimals are display/proposal only." + ], + "heritage": "Inherited weighted moment interface; independently implemented current literal repricing.", + "sources": [ + "math_check.py|def run(", + "moment.py|def moment(", + "base_two_moment.py|def moment(" + ], + "requirements": [ + "R04", + "R08", + "R09" + ] + }, + { + "id": "F18", + "name": "Finite ordinary bootstrap", + "brief": "Three completed finite levels", + "what": "Start with completed ordinary a0=384599/10^10 and repeat a_(j+1)=(1-c)c+c*a_j exactly three times. Require every atom, borrowing, remainder and row-stock gap to remain positive.", + "why": "The bit moment rate is converted to an actual completed ordinary supplier through a finite induction, rather than using an unattained limiting rate.", + "inputs": [ + "rates: exact coarse bit c and inherited ordinary a0" + ], + "outputs": [ + "ordinary: three-step exact chain and positive gaps" + ], + "invariants": [ + "Every a_j < a_(j+1) < c < 1-a_(j+1).", + "Each stage includes an inherited-constant-dependent finite cutoff and old-leaf fallback." + ], + "heritage": "Retained ordinary-bootstrap and restored-row framework, freshly evaluated for this literal construction.", + "sources": [ + "math_check.py| chain=[", + "finite_check.py|chain=[" + ], + "requirements": [ + "R08", + "R09" + ] + }, + { + "id": "F19", + "name": "Outer 47-constraint assembly", + "brief": "Balanced two-supplier closure", + "what": "Combine the finite ordinary bit saving with the complex saving, row/recovery bridge, eta=10^-12 and stopping fraction beta=10^-9. Check all 47 strict inequalities and seven margins before choosing the admissible rational kappa grid point.", + "why": "A local helper saving is not the integer-multiplication exponent. The full coupled outer system determines which supplier and margin is binding.", + "inputs": [ + "ordinary: completed bit saving", + "complex: rate and finite row/precision bridge" + ], + "outputs": [ + "bound: kappa=1777613869061/2500000000000000", + "margins: 47 strict constraints and seven margins" + ], + "invariants": [ + "kappa decimal 0.000711045547624400; bit is binding.", + "Adjacent kappa grid point is rejected separately.", + "Full all-size, recovery, symbolic and analytic interfaces remain conditional." + ], + "heritage": "Inherited balanced outer assembly, re-evaluated for current construction.", + "sources": [ + "outer.py|def assembly(", + "math_check.py| assembly=outer.assembly(" + ], + "requirements": [ + "R09", + "R10" + ] + }, + { + "id": "F20", + "name": "Full finite bill and cutoff", + "brief": "Pay every literal mechanism", + "what": "Bind the selected word, tags, global streams, banks, geometry, prime inventory and moment profile. Add scalar primitives, movement, bridges, routes, chart normalizers, selectors, matrix preparation, copy/erase, fallback and restored-row costs.", + "why": "Neither a better histogram nor a displayed finite coefficient can replace the complete accounting and full inherited-constant cutoff rule.", + "inputs": [ + "final/global/literal: bound physical evidence", + "semantics/primes/rates: proof outputs" + ], + "outputs": [ + "finite: coefficient 62,644,197,182,478,801", + "prefix: 288305228198350917154735200000", + "cutoff: all inherited constants retained" + ], + "invariants": [ + "Coefficient below 2^80; prefix is 98 bits and below 2^104.", + "Selector allowance 667,542,305,600 < 2^40; normalizer tariff 838.", + "One-level max-child half-shrink holds; no recursive child hidden in a fixed constant." + ], + "heritage": "Current finite re-bill over inherited bit/row/copy primitives; exact theorem bytes remain pinned.", + "sources": [ + "finite_check.py|def run(", + "finite_check.py|def cutoff_log2(" + ], + "requirements": [ + "R04", + "R06", + "R07", + "R08", + "R09" + ] + }, + { + "id": "F21", + "name": "Conditional admission gate", + "brief": "Eight stages; source unchanged", + "what": "Run all eight mandatory stages from inputs, check complete result coverage and expected rational kappa, then recheck the source manifest before emitting the certificate. Omitted stages must fail hostile controls.", + "why": "The certificate must close every proof port and bind one immutable package. Documentation regeneration is not a substitute for scientific replay.", + "inputs": [ + "raw: freshly reconstructed source ledger", + "bit: physical/global/geometry proof", + "scalar: F2, signed source and chosen-lift prefix proof", + "primes: current basis/determinant evidence", + "banks: callable full-address banked word and census", + "complex: pinned source, splice and finite guard", + "math: moments, bootstrap and outer47", + "finite: complete bill and cutoff" + ], + "outputs": [ + "certificate: conditional finite-construction result", + "verification: timings, stage coverage and immutable-source status" + ], + "invariants": [ + "Standalone verify.py executes all eight stages; output must be new and outside source.", + "Recorded cloud admission freshly ran changed stages and reused byte/AST-bound unchanged signed-source and complex evidence.", + "Mac standalone reproduction passes all eight stages with 143 source files unchanged; certificate SHA256 7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b. The construction remains mathematically conditional and is below the later PR266 frontier." + ], + "heritage": "Current source-bound verification orchestrator and separately scoped review/admission receipts.", + "sources": [ + "verify.py|def main()", + "verify.py|def validate_required(" + ], + "requirements": [ + "R01", + "R11", + "R12" + ] + } + ], + "requirements": [ + { + "id": "R01", + "name": "Immutable construction", + "text": "All numerical code, witness bytes and exact source pins must remain bound to one manifest." + }, + { + "id": "R02", + "name": "Payload and restoration", + "text": "All arbitrary input, old-target and dirty columns satisfy the F2 supplier contract and reverse restoration." + }, + { + "id": "R03", + "name": "Legal actual geometry", + "text": "Every used frame, inclusion, complement, chart and boundary must be checked as an exact subspace/operator, not by rank alone." + }, + { + "id": "R04", + "name": "Complete physical price", + "text": "Every recursive child, scalar primitive, move, copy, bridge, route, selector and fallback must remain accounted for." + }, + { + "id": "R05", + "name": "Full bank address safety", + "text": "Every literal helper occurrence is assigned once; complete banks cover all coordinates; full addresses are nonaliasing." + }, + { + "id": "R06", + "name": "Separate lift and precision claims", + "text": "F2 semantic equality and chosen signed-lift prefix majorants remain distinct from the unchanged source's signed decoder." + }, + { + "id": "R07", + "name": "Complete prime coverage", + "text": "Every physically consumed and defining-source basis has exact determinant/exclusion evidence for eligible odd q." + }, + { + "id": "R08", + "name": "Strict directed moment gap", + "text": "Both interval engines and the full rare fallback establish strict moment bounds and reject the adjacent grid." + }, + { + "id": "R09", + "name": "Finite ordinary closure", + "text": "Use three finite bootstrap levels, all outer inequalities and the full inherited-constant cutoff, with old-leaf fallback." + }, + { + "id": "R10", + "name": "Inherited theorem boundary", + "text": "All-size compiler, covers/charts, restored rows, routing, prime supply, recovery, complex-symbolic and analytic hypotheses stay explicit." + }, + { + "id": "R11", + "name": "Evidence honesty", + "text": "Describe which stages ran freshly, what unchanged evidence was reused, and which cross-platform checks remain pending." + }, + { + "id": "R12", + "name": "Documentation provenance", + "text": "Preserve historical artifacts, licenses and contributor credit; describe the selected construction rather than additive historical gains." + } + ], + "edges": [ + { + "id": "E01", + "from": "F01", + "to": "F02", + "out": "recipes", + "in": "recipes" + }, + { + "id": "E02", + "from": "F02", + "to": "F03", + "out": "context", + "in": "context" + }, + { + "id": "E03", + "from": "F03", + "to": "F04", + "out": "word", + "in": "word" + }, + { + "id": "E04", + "from": "F04", + "to": "F05", + "out": "word", + "in": "word" + }, + { + "id": "E05", + "from": "F05", + "to": "F06", + "out": "word", + "in": "word" + }, + { + "id": "E06", + "from": "F06", + "to": "F07", + "out": "base", + "in": "base" + }, + { + "id": "E07", + "from": "F06", + "to": "F08", + "out": "base", + "in": "base/cohorts" + }, + { + "id": "E08", + "from": "F07", + "to": "F08", + "out": "cohorts", + "in": "base/cohorts" + }, + { + "id": "E09", + "from": "F08", + "to": "F09", + "out": "word", + "in": "word" + }, + { + "id": "E10", + "from": "F09", + "to": "F10", + "out": "finalword", + "in": "finalword" + }, + { + "id": "E11", + "from": "F09", + "to": "F11", + "out": "finalword", + "in": "finalword" + }, + { + "id": "E12", + "from": "F11", + "to": "F12", + "out": "global", + "in": "global" + }, + { + "id": "E13", + "from": "F12", + "to": "F13", + "out": "packing", + "in": "packing" + }, + { + "id": "E14", + "from": "F13", + "to": "F14", + "out": "normalizers", + "in": "packing/charts" + }, + { + "id": "E15", + "from": "F11", + "to": "F14", + "out": "global", + "in": "global" + }, + { + "id": "E16", + "from": "F09", + "to": "F15", + "out": "finalword", + "in": "final/global" + }, + { + "id": "E17", + "from": "F11", + "to": "F15", + "out": "global", + "in": "final/global" + }, + { + "id": "E18", + "from": "F01", + "to": "F16", + "out": "recipes", + "in": "complexpins" + }, + { + "id": "E19", + "from": "F14", + "to": "F17", + "out": "literal", + "in": "literal" + }, + { + "id": "E20", + "from": "F16", + "to": "F17", + "out": "complex", + "in": "complex" + }, + { + "id": "E21", + "from": "F17", + "to": "F18", + "out": "rates", + "in": "rates" + }, + { + "id": "E22", + "from": "F18", + "to": "F19", + "out": "ordinary", + "in": "ordinary" + }, + { + "id": "E23", + "from": "F16", + "to": "F19", + "out": "guard", + "in": "complex" + }, + { + "id": "E24", + "from": "F10", + "to": "F20", + "out": "semantics", + "in": "semantics/primes/rates" + }, + { + "id": "E25", + "from": "F15", + "to": "F20", + "out": "primes", + "in": "semantics/primes/rates" + }, + { + "id": "E26", + "from": "F17", + "to": "F20", + "out": "rates", + "in": "semantics/primes/rates" + }, + { + "id": "E27", + "from": "F14", + "to": "F20", + "out": "literal", + "in": "final/global/literal" + }, + { + "id": "E28", + "from": "F19", + "to": "F21", + "out": "bound", + "in": "math" + }, + { + "id": "E29", + "from": "F20", + "to": "F21", + "out": "finite", + "in": "finite" + }, + { + "id": "E30", + "from": "F02", + "to": "F10", + "out": "sourceword", + "in": "sourceword" + }, + { + "id": "E31", + "from": "F01", + "to": "F05", + "out": "recipes", + "in": "selection" + }, + { + "id": "E32", + "from": "F01", + "to": "F06", + "out": "recipes", + "in": "selection" + }, + { + "id": "E33", + "from": "F01", + "to": "F07", + "out": "recipes", + "in": "candidates" + }, + { + "id": "E34", + "from": "F01", + "to": "F07", + "out": "recipes", + "in": "selection" + }, + { + "id": "E35", + "from": "F01", + "to": "F08", + "out": "recipes", + "in": "intervals" + }, + { + "id": "E36", + "from": "F01", + "to": "F09", + "out": "recipes", + "in": "selection" + }, + { + "id": "E37", + "from": "F09", + "to": "F11", + "out": "paths", + "in": "paths" + }, + { + "id": "E38", + "from": "F09", + "to": "F12", + "out": "entrances", + "in": "entrances" + }, + { + "id": "E39", + "from": "F09", + "to": "F13", + "out": "registry", + "in": "registry" + }, + { + "id": "E40", + "from": "F12", + "to": "F14", + "out": "packing", + "in": "packing/charts" + }, + { + "id": "E41", + "from": "F09", + "to": "F15", + "out": "context", + "in": "context" + }, + { + "id": "E42", + "from": "F09", + "to": "F20", + "out": "finalword", + "in": "final/global/literal" + }, + { + "id": "E43", + "from": "F11", + "to": "F20", + "out": "global", + "in": "final/global/literal" + }, + { + "id": "E44", + "from": "F09", + "to": "F21", + "out": "raw", + "in": "raw" + }, + { + "id": "E45", + "from": "F11", + "to": "F21", + "out": "global", + "in": "bit" + }, + { + "id": "E46", + "from": "F15", + "to": "F21", + "out": "geometry", + "in": "bit" + }, + { + "id": "E47", + "from": "F10", + "to": "F21", + "out": "semantics", + "in": "scalar" + }, + { + "id": "E48", + "from": "F15", + "to": "F21", + "out": "primes", + "in": "primes" + }, + { + "id": "E49", + "from": "F14", + "to": "F21", + "out": "bankword", + "in": "banks" + }, + { + "id": "E50", + "from": "F16", + "to": "F21", + "out": "complex", + "in": "complex" + }, + { + "id": "E51", + "from": "F17", + "to": "F19", + "out": "rates", + "in": "complex" + }, + { + "id": "E52", + "from": "F10", + "to": "F20", + "out": "prefix", + "in": "semantics/primes/rates" + }, + { + "id": "E53", + "from": "F10", + "to": "F21", + "out": "prefix", + "in": "scalar" + } + ], + "evidence_status": { + "mac_reproduction": "PASS all eight mandatory stages", + "seconds": 580.9, + "python": "3.14.2", + "sympy": "1.14.0", + "source_files_unchanged": 143, + "controls": { + "scalar": 25, + "primes": 6, + "omitted_stages": 8 + }, + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "provenance": "Verified FINAL_REPRODUCTION_RECEIPT.json SHA256 327b8b0d5b7b27bc3f25e17222168262671364a3a698e4915a249bed863a8b06; sanitized facts in joint259_system_docs_evidence.json", + "publication": "Verified checkpoint; later PR266 is stronger. Construction PR #277: https://github.com/CrocSwap/integer-mult-bounds/pull/277." + }, + "external_inputs": [ + { + "block": "F01", + "port": "package", + "kind": "pinned_source_files", + "definition": "Complete immutable source package with the selected manifest." + } + ] +} diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_previews.py b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_previews.py new file mode 100644 index 0000000000..6a9da5d9a8 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_previews.py @@ -0,0 +1,34 @@ +"""Functional architecture overview preview.""" +from html import escape +def preview(model): + bg="#F7FAFB";ink="#142D3A";blue="#176B8B";teal="#147D77";muted="#526873" + title="Functional architecture: exact product with two suppliers" + parts=[f'', + '', + '', + f'{escape(title)}', + 'Verified PR259 hybrid checkpoint | conditional kappa 0.000711045547624400'] + def box(x,y,w,h,title,lines,color=blue): + parts.append(f'') + parts.append(f'{escape(title)}') + for i,line in enumerate(lines):parts.append(f'{escape(line)}') + def arrow(x1,y1,x2,y2,dashed=False): + parts.append(f'') + box(34,119,250,134,"Represent operands",["read U,V and sizes","radix / scale / pad","A0-A3"]) + box(329,119,250,134,"Transform stages",["two source transforms","matching products","A4-A6"]) + box(624,119,250,134,"Exact recovery",["undo scales/layout","bounded error -> round","A7-A8"]) + box(919,119,247,134,"Emit exact product",["carry propagation","serialize UV","A9"]) + for a,b in[(284,329),(579,624),(874,919)]:arrow(a,186,b,186) + box(34,313,350,145,"Selected bit supplier",["513 cohorts + 7 intervals","25 final retimings, once","literal 40-replica banks"],teal) + box(426,313,350,145,"Pinned complex supplier",["exact labels and phases","copied centers / live climbs","finite precision and rows"],teal) + box(818,313,348,145,"Recursion and evidence",["all 87 original roles mapped","complete finite price","inherited assumptions explicit"],teal) + arrow(210,313,410,253,True);arrow(600,313,490,253,True) + parts.append('Solid arrows: runtime data interfaces. Dashed arrows: supplier support. This is a conditional mathematical construction.') + parts.append('Source snapshot: 9f6d8637... | Readable overview; full explanations, typed ports, requirements and proofs are linked below.') + svg="\n".join(parts)+"\n" + styles={"title":'font-size="28" font-weight="700"',"label":'font-size="20" font-weight="700"',"body":'font-size="17"',"note":'font-size="16" fill="#526873"'} + for cls,attributes in styles.items(): + svg=svg.replace('class="'+cls+'"','font-family="DejaVu Sans" '+attributes) + return svg +def files(model):return {"summary-functional.svg":preview(model)} + diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_requirements.txt b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_requirements.txt new file mode 100644 index 0000000000..7934d8a29b --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_requirements.txt @@ -0,0 +1,4 @@ +reportlab==4.4.9 +pypdf==6.10.0 +Pillow==12.3.0 +charset-normalizer==3.5.1 diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_source_binding.json b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_source_binding.json new file mode 100644 index 0000000000..38ffa00f95 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_source_binding.json @@ -0,0 +1,138 @@ +{ + "schema": "selected-docs-source-binding/1", + "scientific_archive_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "accepted_public_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "public_paths": 137, + "public_manifest_members": 136, + "retained_numerical_pins": { + "LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "bank_check.py": "64790d1d45032e7f8ae2252d592759ff82def8033544107f9f0dd3bbc6841581", + "bank_template.py": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965", + "base_two_moment.py": "aee70c242a2f1d225528fabe2002e1564d1dc884797c07d28a831c7878ee9098", + "code/complex_basis.py": "52d68781eaf6d9decf02446a532a7336fcf15924a9f6781ba0833d038decb9f8", + "code/complex_labels.py": "ff5d5e914ef1be0f0cc30283a1ee39089b77e4b572f09543e7313d126bd26256", + "code/complex_scalars.py": "fa035447c1f3a5e878dfc18a900942aa180d8bfde03cdce2d21d9bf8b8409429", + "code/complex_splice.py": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c", + "code/geometry527.py": "bff96140e93c0cea01ed618b49b913f913c12d99ebb0e4e4342336cf5a102800", + "code/global_lowering.py": "c888c4d3c38d4a59b48f8a328fc495b3b38ee36ede133495522d8d76c100794b", + "code/physical527.py": "1723a5c53ec236529e46980c8eb2c45134c61275ac7fb85c8ad92223784de07c", + "finite_check.py": "dfb8dd62c4d068417434f6a43e15e5f69dfa40b4d95b7a8d4995b6950c095c61", + "hybrid-selection.json": "0229c2fad3b448d33ad1f21900ad67d13ab1e0c8e716ced9ec66b4ab0445c0b1", + "hybrid_transform.py": "c06837bbc6ccf068362e1f09f110319f20135588f42e3cb3f8bc753436802e09", + "inputs/complex/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "inputs/complex/NOTICE": "9419dd03a2f52cf8bdfc4d18216ce29f263ab583b27f01ced8e420985bcb7c81", + "inputs/complex/gcert1-p11-pr193.json.gz": "15251deb0c11e0504d7b297c9786818888a93f08b92b03c6c122784b70488633", + "inputs/complex/retained/FINITE_BRIDGE.txt": "66d8f4ea8752abd89952d6674a636575a0db16e18b1c16e293f48f64242f0c46", + "inputs/complex/retained/compact-control-layout.tex": "2bc28e50f3eb092195294cafa81213e520f6d42e7935e9905ad8a6199e2a7c87", + "inputs/complex/retained/compact-control-movement.tex": "b963c3d2f4e1b7059aa289bb4b4ac89b688920bcf42f5b20d7698cdef0132cc6", + "inputs/complex/retained/copied-centers-assembly.tex": "00117892971ae766188ace0af03030c44164fda105e42b70d84f52c3339a7dcb", + "inputs/complex/retained/copied-centers-lemma.tex": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe", + "inputs/complex/retained/endpoint-gauge-complex.tex": "dfee33b0281e5551bb6927f757ff0240abade60ae1800f715afd88853ae0191e", + "inputs/complex/retained/general-clifford-frames.tex": "c9bb9655b594583c6b4bab8cb485233f1d1e588f83858cf1e4c3530cee8fed54", + "inputs/complex/retained/stopped-product-complex.tex": "4738089103a4b263b3b0ef458f5ef35519c696f1ea871ae79e508d3720f5870a", + "inputs/complex/source-pins.json": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569", + "inputs/complex/sources/Work__Bridge__Cert.lean": "5c24746a6330907b9b37d6064095035a58575d64ce793d6d7c9881121fdc3980", + "inputs/complex/sources/Work__Bridge__Net.lean": "cf7d7d330b1bffe2e66712c873e647b13dc32db1ccfc0e0f4cd62ee6caf584f0", + "inputs/complex/sources/Work__Carrier__Live.lean": "6d0649eb62589e66057f044e1e2103fc42f3f57a1498f82a26565bd8eb4026d0", + "inputs/complex/sources/Work__Carrier__Phases.lean": "71dc3dda23dfe510d5d53cbada3a6c540cd1dc2825503fda618a5bd6cfc3e812", + "inputs/complex/sources/Work__Fourier__Main.lean": "2e8e88efd4dcbdf0b1a6e39ce7eea8c5fd5ffee2faf360a8c0c9cba84c0e4ef3", + "inputs/complex/sources/Work__GCert__Chain__Geom.lean": "c302f5834287421f11f3b0da7112fcde876cbc702896f2af4145b2d72ee393a2", + "inputs/complex/sources/Work__GCert__Chain__InvThm.lean": "ade7e7873da75ca63a4b5ce2f562dde9c12bfbb69d87d7ae831039ff790e5adb", + "inputs/complex/sources/Work__GCert__Chain__NetCert.lean": "22ae34809466b4ac2a2c5cdde526f51ff246f5189f7c142b38aa4c0dcffb04a4", + "inputs/complex/sources/Work__GCert__Chain__NetDef.lean": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520", + "inputs/complex/sources/Work__GCert__Chain__NetStage.lean": "c122bc01392a6fdcc0bee918fed81804d3c9b1d3e071016dab65a4ed804ef0b6", + "inputs/complex/sources/Work__GCert__Chain__Phased.lean": "0de429c80231334f1ce92575c1e8ac382ca2d5e7d956767b547639a8941d9a8c", + "inputs/complex/sources/Work__GCert__Chain__WinB.lean": "c33ec3fce09c0971c32ddcbb86d9383ffbe4c6d05cf36f20460005e6547bb845", + "inputs/complex/sources/Work__GCert__Data__B2Gp193Main.lean": "cb61f304da51f1dd0a2ec25bca4b63eb095eeb2863289e1e2bdee7c82beff48b", + "inputs/complex/sources/Work__GCert__Data__Glue.lean": "d5314f2b93a7f0e1c949fb502331825bfc6d9d8762d35f865443e7c95b6c7ef7", + "inputs/complex/sources/Work__GCert__Data__InstB2Gp193.lean": "9587ddb9961f44938032b609307ab91c0b0e757e3991f1ad95480dd50fd4f72b", + "inputs/complex/sources/Work__GCert__Data__P193Cert.lean": "d92ee6889be4753fc99f467bd84039743325123a1165128378b9c906a04f2703", + "inputs/complex/sources/Work__GCert__Data__P193Price.lean": "0299bcd0fe255960eec682eef0f045f7e5cb1e4711af2aab4393526eae2caea3", + "inputs/complex/sources/Work__GCert__Data__P193ScalOK.lean": "479434815822e98f015e335361089c3788d00dc3dd39c2944f75410aa0c158fe", + "inputs/complex/sources/Work__GCert__Data__RateB2Gp193x.lean": "6b40cac1481c931d47b1a092e382d04716ede0e785c492a2f2983e886a257c3f", + "inputs/complex/sources/Work__GCert__Data__Raw.lean": "aba94a004c94dcae7cf3047c88a6da9561555f4ebe8ab92e299e6ce09ee7aa66", + "inputs/complex/sources/Work__GCert__Data__SolutionB2Gp193x.lean": "45c768c9d71a7cc18bd6db74cb036db880d89580ca60557bb4a492280296b169", + "inputs/complex/sources/Work__GFrame__Engine__Adapt.lean": "feec0a3828867968a5c7c2c30b86ed70449abc3c660a60ada67203a75bae2ef7", + "inputs/complex/sources/Work__GFrame__Engine__Letters.lean": "34906dbf5ae16b5174db00b4881a5cc1d2e583b8c8806db6523a5e2f86565f09", + "inputs/complex/sources/Work__GFrame__Engine__Level.lean": "80fb3daa9a45de0ed6da570eb4476b9104734be65d0116f58bcfcbcd67f771d0", + "inputs/complex/sources/tools__gx__gxbind.py": "9c9dcfac47f0535bf3aa8ebf7c662cdef0ebda50a9f0a9282b8f3cf34809f835", + "inputs/complex/sources/tools__gx__gxconv.py": "dab7fec9f44c2d368ed334055d7126e202017feb46e41a8d86e2d998720f67c2", + "inputs/complex/sources/tools__gx__gxcore.py": "eb972c06fe8c322db2d9a8d9a7d05596e8f40c4ca8e5f42eb6df3c7361b5d517", + "kernel-candidates.json.gz": "5f6863ad27eb9f2fcb14db10320c00607451c01e12da303def13e48eda7a5d2d", + "loader/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/SOURCE_PINS.json": "5a4fa413ea0ecc74050359329e90521723151e421cc0c19f774b92bd608a3ac9", + "loader/expected_ledger.json": "4910004287e016f7f2db10f0a54eed24bf1912aa148b347b3cb4795fa3ac63f5", + "loader/expected_semantics.json": "b7de3178436c824b6be6d99842270a82e1821b8008dda66d8b18519ad347da2d", + "loader/raw_ledger.py": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32", + "loader/source_inputs/base_bit/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/source_inputs/base_bit/NOTICE": "c9850418622aea8d1382a230306c940947b5da818f4854b4b272ed60cf239f6c", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/bit/base_word.py": "9fe3a81b7561d2b09c086f63fac4626e88a32369ef8bc5579c94878de1218a89", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/bit/word.py": "85822e9cca5b1b2335c3704a3df2f3c6ef01e42d8328daacb33701d30cee80ab", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/references/pr168-v4/research/paired-cube-bit/check_paired_cube_bit.py": "4d7c86cd999a1519e0dfb6dcf33a8f26e442a353c3665a0f06881216a260fbf3", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/frames_p12.json.gz": "ad8e2705652b68476713d7647a8592505e222f2b3ccd1728dedce153aac6d462", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/graph_p12.json": "31a09a55920e64c8bfbac8b845dc01754c112aa6e207812e2fd1f4939d8f64cb", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/kchron_p12.json": "0fab548e84cf5ca7c04e8bd19b5810850463f36e0f92180efe73aeff17105e39", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/profile_p12.json": "c44ef8640cbcbcc9bac3a30e13373bd79efddde55d7cea514354ca2cdb60d66d", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/sinks.json": "c00ff70c564829d4b97740f92796fc6ce14fbcd5ca519663828650552b80249d", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/word_p12.json.gz": "1cb7e8ed45cf542e304fddc4b12247dbb248a0dc84dedbd832f336b2d172793a", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/NOTICE": "9fc5561c0995892dbdde777c713899486920c32d3562392f5f72377a4953bf98", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/frames/opframe-bases.json": "687496f3c15818e7cad1beb5fdf3812b8e38825ea302bfd60aea7ac23f3516b4", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/gaugeb/selection.json": "b0f9f0e67f94a3c21069f393ea27f9483d315bff2f53f77270163065a6345d1c", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/joint-selection.json": "13f6420d6c341c22235c9d136d5f7c32896974bb165a893fecd7e583b790d133", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/joint_word.py": "de37cbed753fc6f13a7e5dc25c8346279cfee5f1868df8c12a5fcb6ca8f631c0", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/pairs.json": "da54b863601b5cbc21d27fc5cd623bf805f974a3e47b81ed29a85aa5bad0fa05", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/schedule.json": "ab39d61fff7a2cfcb13e2c10d65f2c603e76a91013d197260d6c7b645ccb27a1", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/selection.json": "d94ef4e0b8ca98a7385b364cf245816a7cad08f850a60ce8b67aab4c3a89f3f4", + "loader/source_loader.py": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291", + "loader/test_public.py": "2103c953b37cf447d1a2bbb86c26f96fa5569a3ab018567e93884c12ebde8a2d", + "math_check.py": "bb7c80571104d9b9c30ce7be53654090dc006583ba1838557a5307b8a9db4a39", + "moment.py": "9d465c716c6b910ff66e1453e3bf0057608a787b5f5361be93781f42cb3370f7", + "outer.py": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c", + "parity_transform.py": "ef6f5224b91c409c30fc0886143787a0839a13cc6b148e42ca5db858d502ec4d", + "portable_bit.py": "51760a4ba5b431d55b245aca2036ef51249942503fdcd5d9317d515ce411b87c", + "portable_complex.py": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82", + "prepare.py": "fc109fe81d7d9d3f53483ce7d648dc9fcf6d9fb71b8fde1c867ece5283fadbcc", + "prime_check.py": "80b764f53b92b299569a401754047b1a86f80ba4046502bfbfea924f6ec95e0e", + "prime_witnesses.py": "98cd03bc9582e7bd0ab194c191ea8eea940539e510051443ab9fd3e572a364ab", + "proof/copied-centers-lemma.tex": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe", + "proof/primary/03-motifs.tex": "ed76761194988a01af77ead0ea6469cb5dcd29690ab985a0b5a4006b0f2b69bb", + "proof/primary/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "proof/three-stage-cover-bit.tex": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511", + "proof/three-stage-cover-rows.tex": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8", + "raw_ledger.py": "d5dae7b56d403adb778251e4b42903695632d522c1392505723e2125162cef78", + "regauge-selection.json": "135e314f37bd611a021776991c9d786377b3829f84ca576d5006696c2d8bfbed", + "regauge_transform.py": "baa1c7390f449722e7e700fa1ce9afc3d00cd4c0f7faa5f41693ff88ec02fd61", + "requirements.txt": "25f9f1fb1988b230147a1d3092d34e09c069eb7a6c6d6df46b3973b9f2d36efc", + "retiming-selection.json": "b173080a2884d5bfb28e35ed5b4256e233cafc6275cbfe5a76619b406f2ce989", + "retiming25-selection.json": "e66ba924727efa06f6d2f75357a3d5d4eea97c5eb0eccdc786e5814eb877ce14", + "retiming25.py": "5e9e835730aac1b0752019530daa1e75c8938686bf8a8a01640ab69ceada90f2", + "retiming_transform.py": "483cb8da83a1444cbc8b1bbe60473e571a27e6e589fa64f9a26910ca0d678407", + "scalar_check.py": "13ac9a3ef3c131739478ac1ba5903acd638cf5a41c6fa463fa3e27325413c7f9", + "source527/echelon/selection.json": "8e6ce5e257aa7656898ab46bc3421df4a619497b1e9f5956d2c546b3014050a7", + "source527/extra/selection.json": "791f6ddeb19add7026ba37461256c13efe3d35bba0bccf1cb9787a01fc16f0f2", + "source527/fresh/selection.json": "4df5f96064349415882ece4ac9abd19cc778f18c0306a27b3d65027dcb04b6c7", + "source527/paired-selection.json": "67a24896e5ff6a16735efdff57fbb875aa411aba00cbabb22c43a91cdf63e084", + "source527/pr230/NOTICE": "7dfbad087ee49b74fd5075d517eaa263c5dd3d4fbd4c69bfba34ee1cb55e837f", + "source527/pr230/PROVENANCE.json": "19957e28a8ad26281bfe8bfaf8ae16191be53e729a8870a6154671b3384959d4", + "source527/pr230/active-opframe-bases.json": "9a2bba5c72aebc9ee4f21e59b10ce810b2da98a1fa1748fbc44c50a080e584ff", + "source527/rank/selection.json": "5c97c6413f1eb56c7b8f9ba9e839329d212fae7ac3a08c29e9efdee42f5048a0", + "source527/targetagg/selection.json": "b7a4d5eb2a6d2f7df867f9be5af7da1d1aa99cfbd5214195967b0ff60642d77a", + "source527/word.py": "e675d4eb9d90ff0b44279fae0b46f1a8b39f65421cc38454b70a6b75d0e10b42", + "verify.py": "489bee6d23fbed6732e60d62f8fa98e7d2dfb2d2b7f75fd2bd3bc4a920155f10" + }, + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "documentation_only_edits": [ + "BANK-PROOF.md", + "NOTICE.md", + "PR259-PROVENANCE.md", + "PROOF.md", + "README.md", + "UPSTREAM-PR234-PROOF.md", + "proof/FINITE_BIT_ACCOUNTING.md", + "proof/INTEGRATED_PROOF.md" + ], + "scope": "Public extraction reuses the exact117 numerical inputs from the all-eight-stage tested143-file archive. It is not a second all-eight-stage execution of the137-file tree." +} diff --git a/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_sources.py b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_sources.py new file mode 100644 index 0000000000..570f87c2a4 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/joint259_system_docs_sources.py @@ -0,0 +1,73 @@ +"""Read-only source views and exact original/public closure binding.""" +from __future__ import annotations +import hashlib,json,zipfile,stat +from pathlib import Path,PurePosixPath +BASE=Path(__file__).resolve().parent +BINDING=json.loads((BASE/"joint259_system_docs_source_binding.json").read_text()) +def sha(b):return hashlib.sha256(b).hexdigest() +def canonical_path(name,allow_directory=False): + key=name[:-1]if allow_directory and name.endswith('/')else name + p=PurePosixPath(key) + if not key or key=='.'or p.is_absolute()or'..'in p.parts or'\\'in key or key!=p.as_posix():raise ValueError('Noncanonical source path') + return key +class MemoryPath: + """Minimal read-only Path interface over verified bytes; never extracts.""" + def __init__(self,files,name=""):self.files=files;self.name=PurePosixPath(name) + def __truediv__(self,child): + part=PurePosixPath(child) + if part.is_absolute()or".."in part.parts:raise ValueError("Unsafe source path") + return MemoryPath(self.files,(self.name/part).as_posix()) + def __eq__(self,other):return isinstance(other,MemoryPath)and self.files is other.files and self.name==other.name + def read_bytes(self):return self.files[self.name.as_posix()] + def read_text(self):return self.read_bytes().decode("utf8") + def is_file(self):return self.name.as_posix()in self.files + def is_symlink(self):return False + def rglob(self,pattern): + if pattern!="*":raise ValueError("Unsupported source scan") + for key in sorted(self.files):yield MemoryPath(self.files,key) + def relative_to(self,root):return self.name.relative_to(root.name) + def resolve(self):return self +def from_mapping(files): + for k,v in files.items(): + canonical_path(k) + if not isinstance(v,bytes):raise ValueError("Malformed source mapping") + return MemoryPath(dict(files)) +def open_source(path): + if isinstance(path,MemoryPath):return path + path=Path(path) + if path.is_dir():return path.resolve() + if not path.is_file()or not zipfile.is_zipfile(path):raise ValueError("Source must be an admitted directory or ZIP") + with zipfile.ZipFile(path)as z: + canonical=[canonical_path(r.filename,True)for r in z.infolist()] + if len(canonical)!=len(set(canonical)):raise ValueError('Duplicate or aliased ZIP member') + if any(stat.S_ISLNK(r.external_attr>>16)for r in z.infolist()):raise ValueError('ZIP symlink') + names=[r.filename for r in z.infolist()if not r.is_dir()] + if len(names)!=len(set(names)):raise ValueError("Duplicate ZIP member") + if sum(r.file_size for r in z.infolist())>64*1024*1024:raise ValueError("Source ZIP exceeds64MiB") + candidates=[n for n in names if PurePosixPath(n).name=="MANIFEST.json"] + if not candidates:raise ValueError("No source manifest") + depth=min(len(PurePosixPath(n).parts)for n in candidates) + roots=[n for n in candidates if len(PurePosixPath(n).parts)==depth] + if len(roots)!=1:raise ValueError("Ambiguous package roots") + prefix=roots[0][:-len("MANIFEST.json")] + if any(not n.startswith(prefix)for n in names):raise ValueError("Unpinned siblings outside source root") + files={n[len(prefix):]:z.read(n)for n in names} + return from_mapping(files) +def integrity(root,scientific_manifest): + root=open_source(root) + if isinstance(root,MemoryPath):from_mapping(root.files) + digest=sha((root/"MANIFEST.json").read_bytes()) + allowed={scientific_manifest,BINDING["accepted_public_manifest_sha256"]} + if scientific_manifest!=BINDING["scientific_archive_manifest_sha256"]or digest not in allowed: + raise ValueError("Unrecognized scientific/public source manifest") + manifest=json.loads((root/"MANIFEST.json").read_text())["files"] + paths=list(root.rglob("*")) + if any(p.is_symlink()for p in paths):raise ValueError("Source symlink") + actual={p.relative_to(root).as_posix():sha(p.read_bytes())for p in paths if p.is_file()and p!=root/"MANIFEST.json"} + if actual!=manifest:raise ValueError("Missing, changed or extra source file") + if any(actual.get(p)!=h for p,h in BINDING["retained_numerical_pins"].items()):raise ValueError("Numerical source binding changed") + if digest==BINDING["accepted_public_manifest_sha256"]: + if len(actual)!=136 or sha((root/"expected/certificate.json").read_bytes())!=BINDING["certificate_sha256"]:raise ValueError("Public closure/certificate mismatch") + elif len(actual)!=143:raise ValueError("Scientific archive member count changed") + return len(actual) + diff --git a/docs/multicut-delayed-inverse-checkpoint/requirement_traceability.json b/docs/multicut-delayed-inverse-checkpoint/requirement_traceability.json new file mode 100644 index 0000000000..dc8f8c16de --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/requirement_traceability.json @@ -0,0 +1,152 @@ +[ + { + "blocks": [ + "F01", + "F02", + "F07", + "F09", + "F21" + ], + "id": "R01", + "name": "Immutable construction", + "text": "All numerical code, witness bytes and exact source pins must remain bound to one manifest." + }, + { + "blocks": [ + "F02", + "F03", + "F04", + "F06", + "F07", + "F08", + "F10", + "F11", + "F14" + ], + "id": "R02", + "name": "Payload and restoration", + "text": "All arbitrary input, old-target and dirty columns satisfy the F2 supplier contract and reverse restoration." + }, + { + "blocks": [ + "F02", + "F03", + "F04", + "F05", + "F06", + "F07", + "F08", + "F09", + "F11", + "F13", + "F15" + ], + "id": "R03", + "name": "Legal actual geometry", + "text": "Every used frame, inclusion, complement, chart and boundary must be checked as an exact subspace/operator, not by rank alone." + }, + { + "blocks": [ + "F03", + "F04", + "F05", + "F06", + "F07", + "F08", + "F09", + "F11", + "F12", + "F13", + "F14", + "F16", + "F17", + "F20" + ], + "id": "R04", + "name": "Complete physical price", + "text": "Every recursive child, scalar primitive, move, copy, bridge, route, selector and fallback must remain accounted for." + }, + { + "blocks": [ + "F11", + "F12", + "F13", + "F14" + ], + "id": "R05", + "name": "Full bank address safety", + "text": "Every literal helper occurrence is assigned once; complete banks cover all coordinates; full addresses are nonaliasing." + }, + { + "blocks": [ + "F04", + "F08", + "F10", + "F16", + "F20" + ], + "id": "R06", + "name": "Separate lift and precision claims", + "text": "F2 semantic equality and chosen signed-lift prefix majorants remain distinct from the unchanged source's signed decoder." + }, + { + "blocks": [ + "F13", + "F15", + "F20" + ], + "id": "R07", + "name": "Complete prime coverage", + "text": "Every physically consumed and defining-source basis has exact determinant/exclusion evidence for eligible odd q." + }, + { + "blocks": [ + "F17", + "F18", + "F20" + ], + "id": "R08", + "name": "Strict directed moment gap", + "text": "Both interval engines and the full rare fallback establish strict moment bounds and reject the adjacent grid." + }, + { + "blocks": [ + "F17", + "F18", + "F19", + "F20" + ], + "id": "R09", + "name": "Finite ordinary closure", + "text": "Use three finite bootstrap levels, all outer inequalities and the full inherited-constant cutoff, with old-leaf fallback." + }, + { + "blocks": [ + "F16", + "F19" + ], + "id": "R10", + "name": "Inherited theorem boundary", + "text": "All-size compiler, covers/charts, restored rows, routing, prime supply, recovery, complex-symbolic and analytic hypotheses stay explicit." + }, + { + "blocks": [ + "F01", + "F10", + "F15", + "F16", + "F21" + ], + "id": "R11", + "name": "Evidence honesty", + "text": "Describe which stages ran freshly, what unchanged evidence was reused, and which cross-platform checks remain pending." + }, + { + "blocks": [ + "F21" + ], + "id": "R12", + "name": "Documentation provenance", + "text": "Preserve historical artifacts, licenses and contributor credit; describe the selected construction rather than additive historical gains." + } +] diff --git a/docs/multicut-delayed-inverse-checkpoint/scientific_reproduction.json b/docs/multicut-delayed-inverse-checkpoint/scientific_reproduction.json new file mode 100644 index 0000000000..cad55bc86d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/scientific_reproduction.json @@ -0,0 +1,54 @@ +{ + "status": "PASS_LOCAL_ALL_EIGHT_FRESH_STAGES", + "archive_sha256": "0461e04fbf0fa0951534e3a41371e004adde8c71e2e2fe56b039c17a0f775412", + "manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "source_files": 143, + "source_drift": [], + "assertions_enabled": true, + "started_at_utc": "2026-10-10T03:06:46.003930+00:00", + "completed_at_utc": "2026-10-10T03:16:26.881867+00:00", + "exit_status": 0, + "elapsed_seconds": 580.8764400000218, + "verifier_seconds": 580.0584316670429, + "fresh_stages": [ + "banks", + "bit", + "complex", + "finite", + "math", + "primes", + "raw", + "scalar" + ], + "stage_timings_seconds": { + "banks": 56.94726499996614, + "bit": 95.11896820901893, + "complex": 43.77407150005456, + "finite": 0.16010216693393886, + "math": 0.6504860840504989, + "primes": 17.10306049999781, + "raw": 10.393582792021334, + "scalar": 328.12508979195263 + }, + "kappa_exact": "1777613869061/2500000000000000", + "kappa_decimal": "0.000711045547624400", + "scalar_negative_controls": 25, + "prime_negative_controls": 6, + "omitted_stage_negative_controls": [ + "omitted banks stage", + "omitted bit stage", + "omitted complex stage", + "omitted finite stage", + "omitted math stage", + "omitted primes stage", + "omitted raw stage", + "omitted scalar stage" + ], + "scope": "Conditional finite construction; inherited all-size compiler, weighted selector, common-ancestor chart, restored-row, routing, prime, recovery, complex symbolic and analytic interfaces remain assumptions.", + "original_receipt_sha256": "327b8b0d5b7b27bc3f25e17222168262671364a3a698e4915a249bed863a8b06", + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "python": "3.14.2", + "sympy": "1.14.0", + "platform": "macOS arm64", + "scope_note": "Sanitized scientific reproduction facts; local account paths and process details omitted. Public source closure will have a separate documentation manifest." +} diff --git a/docs/multicut-delayed-inverse-checkpoint/source_binding.json b/docs/multicut-delayed-inverse-checkpoint/source_binding.json new file mode 100644 index 0000000000..8e0089413e --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/source_binding.json @@ -0,0 +1,142 @@ +{ + "accepted_public_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "certificate_sha256": "7eb58ec449c932b7092481746390c776365f302a742836cddef5643c0351802b", + "consumed_manifest_members": 136, + "consumed_manifest_sha256": "0af10dcca505cbd913cf1b9220a08b6a62687650ace4e3d1efd093e828e3990e", + "consumed_total_paths": 137, + "documentation_only_edits": [ + "BANK-PROOF.md", + "NOTICE.md", + "PR259-PROVENANCE.md", + "PROOF.md", + "README.md", + "UPSTREAM-PR234-PROOF.md", + "proof/FINITE_BIT_ACCOUNTING.md", + "proof/INTEGRATED_PROOF.md" + ], + "public_manifest_members": 136, + "public_paths": 137, + "retained_numerical_pins": { + "LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "bank_check.py": "64790d1d45032e7f8ae2252d592759ff82def8033544107f9f0dd3bbc6841581", + "bank_template.py": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965", + "base_two_moment.py": "aee70c242a2f1d225528fabe2002e1564d1dc884797c07d28a831c7878ee9098", + "code/complex_basis.py": "52d68781eaf6d9decf02446a532a7336fcf15924a9f6781ba0833d038decb9f8", + "code/complex_labels.py": "ff5d5e914ef1be0f0cc30283a1ee39089b77e4b572f09543e7313d126bd26256", + "code/complex_scalars.py": "fa035447c1f3a5e878dfc18a900942aa180d8bfde03cdce2d21d9bf8b8409429", + "code/complex_splice.py": "ed8f7f55530bab64e25b98ee614e1152ded8a6259c48d32b3ae26bab4b93848c", + "code/geometry527.py": "bff96140e93c0cea01ed618b49b913f913c12d99ebb0e4e4342336cf5a102800", + "code/global_lowering.py": "c888c4d3c38d4a59b48f8a328fc495b3b38ee36ede133495522d8d76c100794b", + "code/physical527.py": "1723a5c53ec236529e46980c8eb2c45134c61275ac7fb85c8ad92223784de07c", + "finite_check.py": "dfb8dd62c4d068417434f6a43e15e5f69dfa40b4d95b7a8d4995b6950c095c61", + "hybrid-selection.json": "0229c2fad3b448d33ad1f21900ad67d13ab1e0c8e716ced9ec66b4ab0445c0b1", + "hybrid_transform.py": "c06837bbc6ccf068362e1f09f110319f20135588f42e3cb3f8bc753436802e09", + "inputs/complex/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "inputs/complex/NOTICE": "9419dd03a2f52cf8bdfc4d18216ce29f263ab583b27f01ced8e420985bcb7c81", + "inputs/complex/gcert1-p11-pr193.json.gz": "15251deb0c11e0504d7b297c9786818888a93f08b92b03c6c122784b70488633", + "inputs/complex/retained/FINITE_BRIDGE.txt": "66d8f4ea8752abd89952d6674a636575a0db16e18b1c16e293f48f64242f0c46", + "inputs/complex/retained/compact-control-layout.tex": "2bc28e50f3eb092195294cafa81213e520f6d42e7935e9905ad8a6199e2a7c87", + "inputs/complex/retained/compact-control-movement.tex": "b963c3d2f4e1b7059aa289bb4b4ac89b688920bcf42f5b20d7698cdef0132cc6", + "inputs/complex/retained/copied-centers-assembly.tex": "00117892971ae766188ace0af03030c44164fda105e42b70d84f52c3339a7dcb", + "inputs/complex/retained/copied-centers-lemma.tex": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe", + "inputs/complex/retained/endpoint-gauge-complex.tex": "dfee33b0281e5551bb6927f757ff0240abade60ae1800f715afd88853ae0191e", + "inputs/complex/retained/general-clifford-frames.tex": "c9bb9655b594583c6b4bab8cb485233f1d1e588f83858cf1e4c3530cee8fed54", + "inputs/complex/retained/stopped-product-complex.tex": "4738089103a4b263b3b0ef458f5ef35519c696f1ea871ae79e508d3720f5870a", + "inputs/complex/source-pins.json": "de0daf6847185d7a6911535e3012c1a91de1e32b5da8204beec26b37523ad569", + "inputs/complex/sources/Work__Bridge__Cert.lean": "5c24746a6330907b9b37d6064095035a58575d64ce793d6d7c9881121fdc3980", + "inputs/complex/sources/Work__Bridge__Net.lean": "cf7d7d330b1bffe2e66712c873e647b13dc32db1ccfc0e0f4cd62ee6caf584f0", + "inputs/complex/sources/Work__Carrier__Live.lean": "6d0649eb62589e66057f044e1e2103fc42f3f57a1498f82a26565bd8eb4026d0", + "inputs/complex/sources/Work__Carrier__Phases.lean": "71dc3dda23dfe510d5d53cbada3a6c540cd1dc2825503fda618a5bd6cfc3e812", + "inputs/complex/sources/Work__Fourier__Main.lean": "2e8e88efd4dcbdf0b1a6e39ce7eea8c5fd5ffee2faf360a8c0c9cba84c0e4ef3", + "inputs/complex/sources/Work__GCert__Chain__Geom.lean": "c302f5834287421f11f3b0da7112fcde876cbc702896f2af4145b2d72ee393a2", + "inputs/complex/sources/Work__GCert__Chain__InvThm.lean": "ade7e7873da75ca63a4b5ce2f562dde9c12bfbb69d87d7ae831039ff790e5adb", + "inputs/complex/sources/Work__GCert__Chain__NetCert.lean": "22ae34809466b4ac2a2c5cdde526f51ff246f5189f7c142b38aa4c0dcffb04a4", + "inputs/complex/sources/Work__GCert__Chain__NetDef.lean": "6e17a68b1e988969f6eb77000028f7ed877e687b8ad3976ec1707fcfe1d2f520", + "inputs/complex/sources/Work__GCert__Chain__NetStage.lean": "c122bc01392a6fdcc0bee918fed81804d3c9b1d3e071016dab65a4ed804ef0b6", + "inputs/complex/sources/Work__GCert__Chain__Phased.lean": "0de429c80231334f1ce92575c1e8ac382ca2d5e7d956767b547639a8941d9a8c", + "inputs/complex/sources/Work__GCert__Chain__WinB.lean": "c33ec3fce09c0971c32ddcbb86d9383ffbe4c6d05cf36f20460005e6547bb845", + "inputs/complex/sources/Work__GCert__Data__B2Gp193Main.lean": "cb61f304da51f1dd0a2ec25bca4b63eb095eeb2863289e1e2bdee7c82beff48b", + "inputs/complex/sources/Work__GCert__Data__Glue.lean": "d5314f2b93a7f0e1c949fb502331825bfc6d9d8762d35f865443e7c95b6c7ef7", + "inputs/complex/sources/Work__GCert__Data__InstB2Gp193.lean": "9587ddb9961f44938032b609307ab91c0b0e757e3991f1ad95480dd50fd4f72b", + "inputs/complex/sources/Work__GCert__Data__P193Cert.lean": "d92ee6889be4753fc99f467bd84039743325123a1165128378b9c906a04f2703", + "inputs/complex/sources/Work__GCert__Data__P193Price.lean": "0299bcd0fe255960eec682eef0f045f7e5cb1e4711af2aab4393526eae2caea3", + "inputs/complex/sources/Work__GCert__Data__P193ScalOK.lean": "479434815822e98f015e335361089c3788d00dc3dd39c2944f75410aa0c158fe", + "inputs/complex/sources/Work__GCert__Data__RateB2Gp193x.lean": "6b40cac1481c931d47b1a092e382d04716ede0e785c492a2f2983e886a257c3f", + "inputs/complex/sources/Work__GCert__Data__Raw.lean": "aba94a004c94dcae7cf3047c88a6da9561555f4ebe8ab92e299e6ce09ee7aa66", + "inputs/complex/sources/Work__GCert__Data__SolutionB2Gp193x.lean": "45c768c9d71a7cc18bd6db74cb036db880d89580ca60557bb4a492280296b169", + "inputs/complex/sources/Work__GFrame__Engine__Adapt.lean": "feec0a3828867968a5c7c2c30b86ed70449abc3c660a60ada67203a75bae2ef7", + "inputs/complex/sources/Work__GFrame__Engine__Letters.lean": "34906dbf5ae16b5174db00b4881a5cc1d2e583b8c8806db6523a5e2f86565f09", + "inputs/complex/sources/Work__GFrame__Engine__Level.lean": "80fb3daa9a45de0ed6da570eb4476b9104734be65d0116f58bcfcbcd67f771d0", + "inputs/complex/sources/tools__gx__gxbind.py": "9c9dcfac47f0535bf3aa8ebf7c662cdef0ebda50a9f0a9282b8f3cf34809f835", + "inputs/complex/sources/tools__gx__gxconv.py": "dab7fec9f44c2d368ed334055d7126e202017feb46e41a8d86e2d998720f67c2", + "inputs/complex/sources/tools__gx__gxcore.py": "eb972c06fe8c322db2d9a8d9a7d05596e8f40c4ca8e5f42eb6df3c7361b5d517", + "kernel-candidates.json.gz": "5f6863ad27eb9f2fcb14db10320c00607451c01e12da303def13e48eda7a5d2d", + "loader/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/SOURCE_PINS.json": "5a4fa413ea0ecc74050359329e90521723151e421cc0c19f774b92bd608a3ac9", + "loader/expected_ledger.json": "4910004287e016f7f2db10f0a54eed24bf1912aa148b347b3cb4795fa3ac63f5", + "loader/expected_semantics.json": "b7de3178436c824b6be6d99842270a82e1821b8008dda66d8b18519ad347da2d", + "loader/raw_ledger.py": "89ba53114488a77a12b941db2787850c2c41612ad0332c47699a011c0c596b32", + "loader/source_inputs/base_bit/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/source_inputs/base_bit/NOTICE": "c9850418622aea8d1382a230306c940947b5da818f4854b4b272ed60cf239f6c", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/bit/base_word.py": "9fe3a81b7561d2b09c086f63fac4626e88a32369ef8bc5579c94878de1218a89", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/bit/word.py": "85822e9cca5b1b2335c3704a3df2f3c6ef01e42d8328daacb33701d30cee80ab", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/references/pr168-v4/research/paired-cube-bit/check_paired_cube_bit.py": "4d7c86cd999a1519e0dfb6dcf33a8f26e442a353c3665a0f06881216a260fbf3", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/frames_p12.json.gz": "ad8e2705652b68476713d7647a8592505e222f2b3ccd1728dedce153aac6d462", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/graph_p12.json": "31a09a55920e64c8bfbac8b845dc01754c112aa6e207812e2fd1f4939d8f64cb", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/kchron_p12.json": "0fab548e84cf5ca7c04e8bd19b5810850463f36e0f92180efe73aeff17105e39", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/profile_p12.json": "c44ef8640cbcbcc9bac3a30e13373bd79efddde55d7cea514354ca2cdb60d66d", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/sinks.json": "c00ff70c564829d4b97740f92796fc6ce14fbcd5ca519663828650552b80249d", + "loader/source_inputs/base_bit/research/paired-cube-diagonal-bit-168/selected/bit/word_p12.json.gz": "1cb7e8ed45cf542e304fddc4b12247dbb248a0dc84dedbd832f336b2d172793a", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/NOTICE": "9fc5561c0995892dbdde777c713899486920c32d3562392f5f72377a4953bf98", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/borrow/selection.json": "6932749407e14b199651f0a7deff02c6de74e2c1be0a1300263f1e164927fb8b", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/frames/opframe-bases.json": "687496f3c15818e7cad1beb5fdf3812b8e38825ea302bfd60aea7ac23f3516b4", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/gaugeb/selection.json": "b0f9f0e67f94a3c21069f393ea27f9483d315bff2f53f77270163065a6345d1c", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/joint-selection.json": "13f6420d6c341c22235c9d136d5f7c32896974bb165a893fecd7e583b790d133", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/joint_word.py": "de37cbed753fc6f13a7e5dc25c8346279cfee5f1868df8c12a5fcb6ca8f631c0", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/joint/pairs.json": "da54b863601b5cbc21d27fc5cd623bf805f974a3e47b81ed29a85aa5bad0fa05", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/replay.py": "0cbec81a11e758156e9303f63dc8c617601da69523073fdf2a77394d76acf56a", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/schedule.json": "ab39d61fff7a2cfcb13e2c10d65f2c603e76a91013d197260d6c7b645ccb27a1", + "loader/source_inputs/pr210/research/coordinated-crossover-pr200/newg/selection.json": "d94ef4e0b8ca98a7385b364cf245816a7cad08f850a60ce8b67aab4c3a89f3f4", + "loader/source_loader.py": "e5e19ee6d6899fce8273d0f06a49caf7cd8bfe940a2a9a103dbc9d3a62b6b291", + "loader/test_public.py": "2103c953b37cf447d1a2bbb86c26f96fa5569a3ab018567e93884c12ebde8a2d", + "math_check.py": "bb7c80571104d9b9c30ce7be53654090dc006583ba1838557a5307b8a9db4a39", + "moment.py": "9d465c716c6b910ff66e1453e3bf0057608a787b5f5361be93781f42cb3370f7", + "outer.py": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c", + "parity_transform.py": "ef6f5224b91c409c30fc0886143787a0839a13cc6b148e42ca5db858d502ec4d", + "portable_bit.py": "51760a4ba5b431d55b245aca2036ef51249942503fdcd5d9317d515ce411b87c", + "portable_complex.py": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82", + "prepare.py": "fc109fe81d7d9d3f53483ce7d648dc9fcf6d9fb71b8fde1c867ece5283fadbcc", + "prime_check.py": "80b764f53b92b299569a401754047b1a86f80ba4046502bfbfea924f6ec95e0e", + "prime_witnesses.py": "98cd03bc9582e7bd0ab194c191ea8eea940539e510051443ab9fd3e572a364ab", + "proof/copied-centers-lemma.tex": "d0ce6d3d504996aadb098227885224e48df46101daec8893523a0a8b7364d8fe", + "proof/primary/03-motifs.tex": "ed76761194988a01af77ead0ea6469cb5dcd29690ab985a0b5a4006b0f2b69bb", + "proof/primary/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4", + "proof/three-stage-cover-bit.tex": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511", + "proof/three-stage-cover-rows.tex": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8", + "raw_ledger.py": "d5dae7b56d403adb778251e4b42903695632d522c1392505723e2125162cef78", + "regauge-selection.json": "135e314f37bd611a021776991c9d786377b3829f84ca576d5006696c2d8bfbed", + "regauge_transform.py": "baa1c7390f449722e7e700fa1ce9afc3d00cd4c0f7faa5f41693ff88ec02fd61", + "requirements.txt": "25f9f1fb1988b230147a1d3092d34e09c069eb7a6c6d6df46b3973b9f2d36efc", + "retiming-selection.json": "b173080a2884d5bfb28e35ed5b4256e233cafc6275cbfe5a76619b406f2ce989", + "retiming25-selection.json": "e66ba924727efa06f6d2f75357a3d5d4eea97c5eb0eccdc786e5814eb877ce14", + "retiming25.py": "5e9e835730aac1b0752019530daa1e75c8938686bf8a8a01640ab69ceada90f2", + "retiming_transform.py": "483cb8da83a1444cbc8b1bbe60473e571a27e6e589fa64f9a26910ca0d678407", + "scalar_check.py": "13ac9a3ef3c131739478ac1ba5903acd638cf5a41c6fa463fa3e27325413c7f9", + "source527/echelon/selection.json": "8e6ce5e257aa7656898ab46bc3421df4a619497b1e9f5956d2c546b3014050a7", + "source527/extra/selection.json": "791f6ddeb19add7026ba37461256c13efe3d35bba0bccf1cb9787a01fc16f0f2", + "source527/fresh/selection.json": "4df5f96064349415882ece4ac9abd19cc778f18c0306a27b3d65027dcb04b6c7", + "source527/paired-selection.json": "67a24896e5ff6a16735efdff57fbb875aa411aba00cbabb22c43a91cdf63e084", + "source527/pr230/NOTICE": "7dfbad087ee49b74fd5075d517eaa263c5dd3d4fbd4c69bfba34ee1cb55e837f", + "source527/pr230/PROVENANCE.json": "19957e28a8ad26281bfe8bfaf8ae16191be53e729a8870a6154671b3384959d4", + "source527/pr230/active-opframe-bases.json": "9a2bba5c72aebc9ee4f21e59b10ce810b2da98a1fa1748fbc44c50a080e584ff", + "source527/rank/selection.json": "5c97c6413f1eb56c7b8f9ba9e839329d212fae7ac3a08c29e9efdee42f5048a0", + "source527/targetagg/selection.json": "b7a4d5eb2a6d2f7df867f9be5af7da1d1aa99cfbd5214195967b0ff60642d77a", + "source527/word.py": "e675d4eb9d90ff0b44279fae0b46f1a8b39f65421cc38454b70a6b75d0e10b42", + "verify.py": "489bee6d23fbed6732e60d62f8fa98e7d2dfb2d2b7f75fd2bd3bc4a920155f10" + }, + "schema": "selected-docs-source-binding/1", + "scientific_archive_manifest_sha256": "9f6d8637b9a119cfe4566a02ab2d704f23c502e5e4357b40c28ef85a3fd4de89", + "scope": "Public extraction reuses the exact117 numerical inputs from the all-eight-stage tested143-file archive. It is not a second all-eight-stage execution of the137-file tree.", + "source_binding_configuration_sha256": "53acbfc4c9cb93404f951789e866339a315ae84d6218a32932638a6ecc6d961c" +} diff --git a/docs/multicut-delayed-inverse-checkpoint/source_index.json b/docs/multicut-delayed-inverse-checkpoint/source_index.json new file mode 100644 index 0000000000..591e51bce3 --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/source_index.json @@ -0,0 +1,370 @@ +[ + { + "anchor": "def integrity()", + "excerpt": "def integrity(): p=ROOT/'MANIFEST.json';m=json.loads(p.read_text());actual={}", + "id": "S01", + "line": 26, + "path": "verify.py", + "sha256": "489bee6d23fbed6732e60d62f8fa98e7d2dfb2d2b7f75fd2bd3bc4a920155f10" + }, + { + "anchor": "# PR259 lineage", + "excerpt": "# PR259 lineage and selected inputs", + "id": "S02", + "line": 1, + "path": "PR259-PROVENANCE.md", + "sha256": "a232f3fb631976128d4e454dc414ecae7de1e88fba86ca45d13e4af21d8bb5f8" + }, + { + "anchor": "def prepare()", + "excerpt": "def prepare(): S=HERE/'source527'", + "id": "S03", + "line": 12, + "path": "prepare.py", + "sha256": "fc109fe81d7d9d3f53483ce7d648dc9fcf6d9fb71b8fde1c867ece5283fadbcc" + }, + { + "anchor": "def", + "excerpt": "def replay(mode='F2',direction=1,bits=24,mutation=None): major=mode=='bound';binary=mode=='F2';v=W.v", + "id": "S04", + "line": 1, + "path": "source527/word.py", + "sha256": "e675d4eb9d90ff0b44279fae0b46f1a8b39f65421cc38454b70a6b75d0e10b42" + }, + { + "anchor": "def run(", + "excerpt": "def run(context,source_text,output_dir=None,source_pins=None): D=Path(output_dir)if output_dir is not None else None", + "id": "S05", + "line": 11, + "path": "code/physical527.py", + "sha256": "1723a5c53ec236529e46980c8eb2c45134c61275ac7fb85c8ad92223784de07c" + }, + { + "anchor": "def run(", + "excerpt": "def run(producer,output_dir=None): begun=time.monotonic();W,C=producer['W'],producer['C'];v=W.v;n=20107", + "id": "S06", + "line": 62, + "path": "parity_transform.py", + "sha256": "ef6f5224b91c409c30fc0886143787a0839a13cc6b148e42ca5db858d502ec4d" + }, + { + "anchor": "## Operator proof", + "excerpt": "## Operator proof", + "id": "S07", + "line": 20, + "path": "proof/PARITY-CONTRACT.md", + "sha256": "a9246be656e31f1a21d5ec714e002f51be0aa07c36e1528066a25b2c7a02db91" + }, + { + "anchor": "def run(", + "excerpt": "def run(producer,output_dir=None,selection_path=None): begun=time.monotonic();W,C=producer['W'],producer['C'];v=W.v;n=20107", + "id": "S08", + "line": 65, + "path": "retiming_transform.py", + "sha256": "483cb8da83a1444cbc8b1bbe60473e571a27e6e589fa64f9a26910ca0d678407" + }, + { + "anchor": "def rebind_retiming(", + "excerpt": "def rebind_retiming(raw,receipt): \"\"\"Recount the complete retimed word from its independently checked gate needs.\"\"\"", + "id": "S09", + "line": 190, + "path": "raw_ledger.py", + "sha256": "d5dae7b56d403adb778251e4b42903695632d522c1392505723e2125162cef78" + }, + { + "anchor": "def run(", + "excerpt": "def run(producer,output_dir=None,selection_path=None): begun=time.monotonic();W,C=producer['W'],producer['C'];v=W.v;n=20107", + "id": "S10", + "line": 128, + "path": "regauge_transform.py", + "sha256": "baa1c7390f449722e7e700fa1ce9afc3d00cd4c0f7faa5f41693ff88ec02fd61" + }, + { + "anchor": "def rebind_regauge(", + "excerpt": "def rebind_regauge(raw,receipt): \"\"\"Price freshly transported F2 compensations and their actual new entrances.\"\"\"", + "id": "S11", + "line": 216, + "path": "raw_ledger.py", + "sha256": "d5dae7b56d403adb778251e4b42903695632d522c1392505723e2125162cef78" + }, + { + "anchor": "def run(", + "excerpt": "def run(p,raw,package,output): begun=time.monotonic();package=Path(package);W,C=p['W'],p['C'];old=p['records'];zero,full=p['ZERO'],p['FULL'];v=1760;n=20107", + "id": "S12", + "line": 19, + "path": "hybrid_transform.py", + "sha256": "c06837bbc6ccf068362e1f09f110319f20135588f42e3cb3f8bc753436802e09" + }, + { + "anchor": "\"removed_pivots\"", + "excerpt": "\"removed_pivots\": [ 17246,", + "id": "S13", + "line": 4, + "path": "hybrid-selection.json", + "sha256": "0229c2fad3b448d33ad1f21900ad67d13ab1e0c8e716ced9ec66b4ab0445c0b1" + }, + { + "anchor": "PR249:", + "excerpt": "PR249: 96495746c786d6d0339dbb38c7f553d4af3f88ed. PR259: a53ec0ca4d59634f16630dd16adf035c9f12595c, repository", + "id": "S14", + "line": 3, + "path": "PR259-PROVENANCE.md", + "sha256": "a232f3fb631976128d4e454dc414ecae7de1e88fba86ca45d13e4af21d8bb5f8" + }, + { + "anchor": " local=[", + "excerpt": "local=[(1,t,pivot,-1,zero,30)for t in ts if t!=pivot]+[(1,pivot,low,-1,L,31),(1,pivot,high,-1,H,31)]+[(1,t,pivot,1,K,32)for t in reversed(ts)if t!=pivot] ids=ts+[low,high];slot={q:i for i,q in enumerate(", + "id": "S15", + "line": 92, + "path": "hybrid_transform.py", + "sha256": "c06837bbc6ccf068362e1f09f110319f20135588f42e3cb3f8bc753436802e09" + }, + { + "anchor": "## Kernel and observation boundaries", + "excerpt": "## Kernel and observation boundaries", + "id": "S16", + "line": 16, + "path": "PROOF.md", + "sha256": "d7c10b19fd1e5fe9280e09c9848bbd7c1c53b36363e6b98571ae8513932ad843" + }, + { + "anchor": "def transform(", + "excerpt": "def transform(a,frames,initial,final,entries,expected_input_sha): \"\"\"Return a fresh word and receipt; reuse existing frames and preserve endpoints.\"\"\"", + "id": "S17", + "line": 22, + "path": "retiming25.py", + "sha256": "5e9e835730aac1b0752019530daa1e75c8938686bf8a8a01640ab69ceada90f2" + }, + { + "anchor": " out,retiming=", + "excerpt": "out,retiming=rt.transform(out,F,initial,final,json.loads((package/'retiming25-selection.json').read_text()),INTERVAL_RAW) assert sha(out.tobytes())==FINAL_RAW", + "id": "S18", + "line": 146, + "path": "hybrid_transform.py", + "sha256": "c06837bbc6ccf068362e1f09f110319f20135588f42e3cb3f8bc753436802e09" + }, + { + "anchor": "def replay_projection(", + "excerpt": "def replay_projection(records,reverse=False,omit_event=None): n=20107;v=1760", + "id": "S19", + "line": 30, + "path": "scalar_check.py", + "sha256": "13ac9a3ef3c131739478ac1ba5903acd638cf5a41c6fa463fa3e27325413c7f9" + }, + { + "anchor": "def run(", + "excerpt": "def run(context,records,progress=lambda text:None): import gc", + "id": "S20", + "line": 54, + "path": "scalar_check.py", + "sha256": "13ac9a3ef3c131739478ac1ba5903acd638cf5a41c6fa463fa3e27325413c7f9" + }, + { + "anchor": "class Lowerer:", + "excerpt": "class Lowerer: \"\"\"Callable IR lowering; op records have exactly eight signed int fields.", + "id": "S21", + "line": 66, + "path": "code/global_lowering.py", + "sha256": "c888c4d3c38d4a59b48f8a328fc495b3b38ee36ede133495522d8d76c100794b" + }, + { + "anchor": "def phase_major_templates(", + "excerpt": "def phase_major_templates(lower): \"\"\"Expand all cover classes for each yielded phase before advancing.\"\"\"", + "id": "S22", + "line": 15, + "path": "portable_bit.py", + "sha256": "51760a4ba5b431d55b245aca2036ef51249942503fdcd5d9317d515ce411b87c" + }, + { + "anchor": "class BankPlan:", + "excerpt": "class BankPlan: m, h, stages, replicas, v = 120, 24, 5, 40, 1760", + "id": "S23", + "line": 11, + "path": "bank_template.py", + "sha256": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965" + }, + { + "anchor": "def census(", + "excerpt": "def census(context): W,C,roles=context['W'],context['C'],context['regs']", + "id": "S24", + "line": 49, + "path": "bank_check.py", + "sha256": "64790d1d45032e7f8ae2252d592759ff82def8033544107f9f0dd3bbc6841581" + }, + { + "anchor": "## Literal capacity", + "excerpt": "## Literal capacity and role assignment", + "id": "S25", + "line": 9, + "path": "BANK-PROOF.md", + "sha256": "ae2ca2693d75f56c076c2ffc790163fe23d2bf69de23bed94345cfe48a0b4252" + }, + { + "anchor": "def run(", + "excerpt": "def run(context,global_result,lower,progress=lambda text:None): begun=time.monotonic();W,C=context['W'],context['C']", + "id": "S26", + "line": 97, + "path": "bank_check.py", + "sha256": "64790d1d45032e7f8ae2252d592759ff82def8033544107f9f0dd3bbc6841581" + }, + { + "anchor": " def normalizer(", + "excerpt": "def normalizer(self, stage, replica, role): \"\"\"Finite exact data for N=scalar Pi embed_stage(B^-1).", + "id": "S27", + "line": 68, + "path": "bank_template.py", + "sha256": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965" + }, + { + "anchor": "## Generic charts", + "excerpt": "## Generic charts and full addresses", + "id": "S28", + "line": 39, + "path": "BANK-PROOF.md", + "sha256": "ae2ca2693d75f56c076c2ffc790163fe23d2bf69de23bed94345cfe48a0b4252" + }, + { + "anchor": " def map_stage_row(", + "excerpt": "def map_stage_row(self, stage, replica, row, cover='d'): \"\"\"Lower an unchanged logical8-field MOVE/ADD/COPY/ERASE record.", + "id": "S29", + "line": 130, + "path": "bank_template.py", + "sha256": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965" + }, + { + "anchor": " def map_boundary_row(", + "excerpt": "def map_boundary_row(self, replica, row, cover='d'): \"\"\"Lower an IDLE/BRIDGE/EXCHANGE with its existing exact projector.", + "id": "S30", + "line": 146, + "path": "bank_template.py", + "sha256": "e255bdc0c0aa4465485ee34ece7d1f04ce3ce363d8ac62edc9de5608e46f8965" + }, + { + "anchor": "class BankLowerer:", + "excerpt": "class BankLowerer: \"\"\"Final full-address lowering of the already checked logical IR.", + "id": "S31", + "line": 65, + "path": "bank_check.py", + "sha256": "64790d1d45032e7f8ae2252d592759ff82def8033544107f9f0dd3bbc6841581" + }, + { + "anchor": "def run(", + "excerpt": "def run(ctx,L,source_pins=None): begin=time.monotonic()", + "id": "S32", + "line": 11, + "path": "code/geometry527.py", + "sha256": "bff96140e93c0cea01ed618b49b913f913c12d99ebb0e4e4342336cf5a102800" + }, + { + "anchor": "def run(", + "excerpt": "def run(context,physical,progress=lambda text:None): started=time.monotonic();w,c=context['W'],context['C']", + "id": "S33", + "line": 20, + "path": "prime_check.py", + "sha256": "80b764f53b92b299569a401754047b1a86f80ba4046502bfbfea924f6ec95e0e" + }, + { + "anchor": "def run(", + "excerpt": "def run(package_root=None, progress=lambda text:None): root=Path(package_root).resolve() if package_root else Path(__file__).resolve().parent", + "id": "S34", + "line": 77, + "path": "portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + { + "anchor": "def finite_guard(", + "excerpt": "def finite_guard(m, b, basis): p=m['parameters'];l=m['ledger'];dim=p['m'];R=p['R'];h=p['h'];W=p['W_live']", + "id": "S35", + "line": 25, + "path": "portable_complex.py", + "sha256": "797e144c0040d78a4731a6eaa61c0edb9803a08462f885ed014cbca9d9991d82" + }, + { + "anchor": "def run(", + "excerpt": "def run(raw,complex_histogram,banks,global_result): cost=load('moment');other=load('base_two_moment');outer=load('outer')", + "id": "S36", + "line": 23, + "path": "math_check.py", + "sha256": "bb7c80571104d9b9c30ce7be53654090dc006583ba1838557a5307b8a9db4a39" + }, + { + "anchor": "def moment(", + "excerpt": "def moment(H,m,W,a,bad=False): lo=hi=F(0)", + "id": "S37", + "line": 55, + "path": "moment.py", + "sha256": "9d465c716c6b910ff66e1453e3bf0057608a787b5f5361be93781f42cb3370f7" + }, + { + "anchor": "def moment(", + "excerpt": "def moment(m, W, entries, saving): lo = hi = Q(0)", + "id": "S38", + "line": 52, + "path": "base_two_moment.py", + "sha256": "aee70c242a2f1d225528fabe2002e1564d1dc884797c07d28a831c7878ee9098" + }, + { + "anchor": " chain=[", + "excerpt": "chain=[Q(384599,10**10)] for _ in range(3):", + "id": "S39", + "line": 46, + "path": "math_check.py", + "sha256": "bb7c80571104d9b9c30ce7be53654090dc006583ba1838557a5307b8a9db4a39" + }, + { + "anchor": "chain=[", + "excerpt": "chain=[Q(384599,10**10)];gaps=[] for j in range(3):", + "id": "S40", + "line": 130, + "path": "finite_check.py", + "sha256": "dfb8dd62c4d068417434f6a43e15e5f69dfa40b4d95b7a8d4995b6950c095c61" + }, + { + "anchor": "def assembly(", + "excerpt": "def assembly(bit_saving,complex_saving,bridge,kappa,eta=Q(1,10**8),beta=Q(1,4)): a,b=bit_saving,complex_saving", + "id": "S41", + "line": 16, + "path": "outer.py", + "sha256": "c1ebb52163a7219504c728a5c2b098bf1e50bf20148a2879c5a74c3cadc7c03c" + }, + { + "anchor": " assembly=outer.assembly(", + "excerpt": "assembly=outer.assembly(bit,b,bridge,k,eta=eta,beta=beta);assert len(assembly['strict_constraints'])==47 and len(assembly['margins'])==7 and min(assembly['strict_constraints'].values())>0 try:outer.assemb", + "id": "S42", + "line": 53, + "path": "math_check.py", + "sha256": "bb7c80571104d9b9c30ce7be53654090dc006583ba1838557a5307b8a9db4a39" + }, + { + "anchor": "def run(", + "excerpt": "def run(raw,physical,scalar,prime_result,math_result,banks,banked_result,global_result): for name,h in THEOREM_PINS.items():assert sha256((HERE/name).read_bytes()).hexdigest()==h,('changed theorem',name)", + "id": "S43", + "line": 59, + "path": "finite_check.py", + "sha256": "dfb8dd62c4d068417434f6a43e15e5f69dfa40b4d95b7a8d4995b6950c095c61" + }, + { + "anchor": "def cutoff_log2(", + "excerpt": "def cutoff_log2(delta,C): assert 0=1", + "id": "S44", + "line": 17, + "path": "finite_check.py", + "sha256": "dfb8dd62c4d068417434f6a43e15e5f69dfa40b4d95b7a8d4995b6950c095c61" + }, + { + "anchor": "def main()", + "excerpt": "def main(): ap=argparse.ArgumentParser(description=__doc__);ap.add_argument('--output',type=Path,required=True);args=ap.parse_args()", + "id": "S45", + "line": 50, + "path": "verify.py", + "sha256": "489bee6d23fbed6732e60d62f8fa98e7d2dfb2d2b7f75fd2bd3bc4a920155f10" + }, + { + "anchor": "def validate_required(", + "excerpt": "def validate_required(results): assert set(results)==REQUIRED,'Missing mandatory proof stage'", + "id": "S46", + "line": 37, + "path": "verify.py", + "sha256": "489bee6d23fbed6732e60d62f8fa98e7d2dfb2d2b7f75fd2bd3bc4a920155f10" + } +] diff --git a/docs/multicut-delayed-inverse-checkpoint/summary-functional.svg b/docs/multicut-delayed-inverse-checkpoint/summary-functional.svg new file mode 100644 index 0000000000..4f7076b62d --- /dev/null +++ b/docs/multicut-delayed-inverse-checkpoint/summary-functional.svg @@ -0,0 +1,47 @@ + + + +Functional architecture: exact product with two suppliers +Verified PR259 hybrid checkpoint | conditional kappa 0.000711045547624400 + +Represent operands +read U,V and sizes +radix / scale / pad +A0-A3 + +Transform stages +two source transforms +matching products +A4-A6 + +Exact recovery +undo scales/layout +bounded error -> round +A7-A8 + +Emit exact product +carry propagation +serialize UV +A9 + + + + +Selected bit supplier +513 cohorts + 7 intervals +25 final retimings, once +literal 40-replica banks + +Pinned complex supplier +exact labels and phases +copied centers / live climbs +finite precision and rows + +Recursion and evidence +all 87 original roles mapped +complete finite price +inherited assumptions explicit + + +Solid arrows: runtime data interfaces. Dashed arrows: supplier support. This is a conditional mathematical construction. +Source snapshot: 9f6d8637... | Readable overview; full explanations, typed ports, requirements and proofs are linked below.