Mister-Meeseeks · Nov 10, 2026 · Nov 8, 2026
diff --git a/research/selected-caller-quantizer-transparency/DEPENDENCY.json b/research/selected-caller-quantizer-transparency/DEPENDENCY.json
@@ -0,0 +1,31 @@
+{
+  "files": [
+    {
+      "git_blob": "fffff679658f00ee81e7ed9c9af69a72c02730ab",
+      "original_path": "research/selected-native-tensor-closure/PROOF.md",
+      "path": "vendor/a1/PROOF.md",
+      "sha256": "c5581d275d90f204c1e559f0e7dcb2172c68592b6ff96411c9ad7f4003893a5b"
+    },
+    {
+      "git_blob": "2545b90099b70ac42c6cbed7f11b0bf2b02bfa77",
+      "original_path": "research/selected-native-tensor-closure/RESULT.json",
+      "path": "vendor/a1/RESULT.json",
+      "sha256": "b3efd599cd80c6f0a062e9fd1557d72701a9b4be8b0d79b6d012b4cfed395457"
+    },
+    {
+      "git_blob": "57558383d3740c0cbb4081a7af7232d9cea47c73",
+      "original_path": "research/selected-native-tensor-closure/SOURCES.json",
+      "path": "vendor/a1/SOURCES.json",
+      "sha256": "813dd728542601b021c8504c5821704617418d1f2272f2335c117a7de04449c1"
+    },
+    {
+      "git_blob": "7eb40e7a8a172c188fcbc47b015905d5d38bf9ea",
+      "original_path": "research/selected-native-tensor-closure/NATIVE.json.gz",
+      "path": "vendor/a1/NATIVE.json.gz",
+      "sha256": "ce62443d9a4d8d73d82df3819ed25c5c3a03e7cea486b0ec83563cea53bda4b4"
+    }
+  ],
+  "published_commit": "e56a5bcf239fa0cd4ee57459af04c0ba7acb2c03",
+  "repository": "CubeJerry/integer-mult-bounds",
+  "tested_commit": "135debb6be1fbf52665c161cabf5286ec122ef81"
+}
diff --git a/research/selected-caller-quantizer-transparency/NOTICE.md b/research/selected-caller-quantizer-transparency/NOTICE.md
@@ -0,0 +1,17 @@
+# Retained source notice
+
+Prepared for @CubeJerry with substantial OpenAI Codex assistance. This package
+uses the repository's Apache-2.0 license and preserves predecessor attribution.
+
+The four files in `vendor/a1/` are byte-identical scientific evidence from
+`research/selected-native-tensor-closure` at the public CubeJerry fork commit
+`e56a5bcf239fa0cd4ee57459af04c0ba7acb2c03`. Their original paths, hashes and
+tested author commit are recorded in `DEPENDENCY.json`. The retained proof
+and manifest preserve their source notices; no retained executable is imported.
+
+The seven canonical live source inputs are read from the pinned upstream base,
+not copied or modified by this package. `SOURCES.json` also records older
+exact-grid reports as provenance. The all-size Clifford denominator method,
+older recursive common-grid construction and original P104 construction are
+credited prior work. This package's new result is the current complete caller's
+source-bound deterministic quantizer and signed-width interface.
diff --git a/research/selected-caller-quantizer-transparency/PROOF.md b/research/selected-caller-quantizer-transparency/PROOF.md
diff --git a/research/selected-caller-quantizer-transparency/README.md b/research/selected-caller-quantizer-transparency/README.md
@@ -0,0 +1,187 @@
+# Deterministic quantizer transparency for the current selected caller
+
+For the exact current CrocSwap/integer-mult-bounds#6030 complete caller, one
+declared fixed grid makes deterministic rounding an identity at every source
+scalar/native return and every completed direct elementary C stage. The result
+covers all 18 forward local invocations, all 16 reverse interfaces, whole
+idles, actual contacts, arbitrary helpers, thin queries and scalar-product
+temporaries. **No new κ.** The selected-rate recursive child's internal
+precision, physical owned reset and complete tape tariff remain open premises.
+
+For integer `f>=1`, `p,h>=0`, input real and imaginary components on `2^-p Z`
+with magnitude strictly below `2^h`, the sufficient format is
+
+\[
+F=p+\left\lceil145f/2\right\rceil+4,\qquad
+W=p+h+145f+20.
+\]
+
+Here F counts fractional bits and W is the signed width **of each real or
+imaginary component**. A complex payload has two such components, plus its
+actual framing. Six further signed temporary bits suffice for the specified
+numerator-first arithmetic. These bounds are not asserted to be sharp.
+The theorem permits any finite number of spectator coordinates and arbitrary
+correlations between spectators and columns.
+
+## What changes
+
+The selected application review already supplies a very conservative complete
+finite precision envelope. This package supplies a concrete source-specific
+producer/consumer equality: nearest-grid rounding with upward ties, or signed
+toward-zero rounding, at the declared F-grid cuts returns exactly the produced
+value. It proves equality on admitted source trajectories, rather than an
+unfunded relative error guarantee for every fine-grid input.
+
+The exact current source facts are:
+
+| Checked object | Result |
+| --- | ---: |
+| Literal local instructions | 22,803 |
+| Maximum stored and pre-product scalar denominator | 16 |
+| Maximum stored coefficient l1 mass | 850 |
+| Maximum separate product coefficient l1 mass | 504 |
+| Complete global instructions, including scalar boundaries | 363 |
+| Checked global prefix states, including entrance | 364 |
+| Global prefix coefficients | Integral, l1 mass at most10 |
+| Actual raw contacts, checked on all265 phase coordinates | 7,488 |
+| Productive fields / paid native calls | 13,444 / 66,834 |
+
+Every completed local public map has an integral identity/shear matrix in
+the common logical charts. Thus the four-bit scalar debt resets between local invocations; it is not multiplied
+by18 or accumulated once per reverse wrapper. The all-size proof combines
+those exact facts with the credited Gaussian-dyadic Clifford denominator
+argument and the actual 145-row retained-coordinate identification.
+
+During a full-coordinate normalizer, an intermediate state may be a permutation
+of a retained-axis Clifford state. The proof accounts for this explicitly;
+endpoint spectator identity alone would not justify an interior bound. Every
+partial C is taken in the literal positive-C factorization, with its actual
+complete canonicalizer. Arbitrary implementations with the same endpoint are
+not given this internal precision contract.
+
+## Exact sources and predecessor distinction
+
+Canonical base: `7c49fe32c55de02c2c873655c804b16e4c3fef0a`.
+The seven live canonical source pins are in [SOURCES.json](SOURCES.json).
+The all-column native/contact theorem is the published
+[selected-native-tensor-closure package](https://github.com/CubeJerry/integer-mult-bounds/tree/e56a5bcf239fa0cd4ee57459af04c0ba7acb2c03/research/selected-native-tensor-closure).
+[DEPENDENCY.json](DEPENDENCY.json) pins the byte-identical retained theorem,
+receipt, source manifest and native recipe payload. The verifier authenticates
+all of these before parsing or execution and confirms the native payload's
+complete hash against the selected RESULT. No predecessor executable is
+imported; the numerical replay is a new integer interpreter of its data.
+
+The denominator argument is prior work, credited to Ross Richardson in the
+retained exact-grid lineage. Three older grid reports are pinned as canonical
+provenance, not new mathematical claims:
+
+- `selected-word-exact-grid` and `selected-caller-exact-grid` concern the
+  different CrocSwap/integer-mult-bounds#5413 backward caller; the latter
+  explicitly restricts its 74-bit theorem to its observed cuts.
+- `p104-retimed-internal-grid` binds the method to
+  CrocSwap/integer-mult-bounds#2725, including its native stage interiors.
+- CrocSwap/integer-mult-bounds#2287, `selected-complex-layer-closure/PROOF.md`
+  §6, already proves a recursive common-grid construction using completed-child
+  height reset and one unfinished child at a time. That methodology is prior
+  work; this package supplies the actual current caller's smaller, explicit
+  source-cut contract, without transplanting the older recursive admission.
+- CrocSwap/integer-mult-bounds#6499 gives five scalar bits for independent
+  rounded native-return atoms in the **current local word**. Its abstraction
+  differs from the actual correlated exact chart rows used here.
+- CrocSwap/integer-mult-bounds#6506 supplies a local Boolean scalar layer;
+  CrocSwap/integer-mult-bounds#6526 and CrocSwap/integer-mult-bounds#6546 supply
+  local stochastic results; CrocSwap/integer-mult-bounds#6635 supplies the
+  local scalar tensor lift. These are not the actual complete global caller.
+- CrocSwap/integer-mult-bounds#6522 concerns the already-known gross envelope.
+  CrocSwap/integer-mult-bounds#6532's small-input counterexample is respected:
+  an arbitrary fine-grid native input need not have an exactly representable
+  same-grid output. Reachability from the declared original input grid matters.
+
+## Reproduce and evidence
+
+From the repository root, with standard-library Python3.12:
+
+```sh
+python3 -I -Werror -B scripts/research_package.py --package research/selected-caller-quantizer-transparency
+```
+
+The registered normal and optimized commands both require the complete typed
+[RESULT.json](RESULT.json) and print
+`PASS_SELECTED_CALLER_QUANTIZER_TRANSPARENCY`. Direct `verify.py` also works
+with `-I`, `-O` and `-Werror`; a fresh bytecode namespace prevents stale package
+bytecode from replacing source. Ordinary replay writes no scientific files.
+The explicit `--write` option regenerates only this new package's result.
+
+The finite numerical witness executes the **entire current local word** on
+512 physical coordinates, with all770 public fields populated by deterministic
+complex input data. It uses the declared global one-column format `F=80,W=170`
+at `p=3,h=2`. The actual 3,453 selected MOVE recipes are executed with their
+signed monomial phases and direct C stages. Separate exact products precede
+ADD; both deterministic quantizers are checked against every exact quotient.
+All394,240 public complex outputs are compared with the independently specified
+canonical-chart endpoint, and all29 owned labels return under the source
+reset semantics. This is **not** a physical replay of a `2^145` global field,
+an all-input finite enumeration, or a selected fast recursive implementation.
+
+The source certificates cover all local stored/product cuts, all364 global
+prefixes and the actual owner maps. Targeted controls reject source drift,
+odd divisions, a three-bit coefficient budget, stale charts, illegal COPY,
+missing wrapper translations/signs, nonintegral global boundaries, omitted
+spectator phases, missing native recipes, lost absolute phase and signed-width
+violations. A C pair with equal integer inputs demonstrates why separately
+rounding its normalized summands is invalid; the complete numerator is exact.
+The three-bit rejection is not advertised as a sharp lower bound on F.
+
+The written all-f proof is in [PROOF.md](PROOF.md). Exact finite source checks
+establish its source premises; the all-size conclusion is the operator and
+valuation argument. The preserved input counts and width/domain checks remain
+active with Python assertions disabled. Execution evidence and unrun
+obligations are recorded in [RECEIPT.json](RECEIPT.json).
+
+## Full cost boundary and limits
+
+The complete bill still includes source preparation, every paid native call
+at its actual service width `P_r`, all exterior scalar arithmetic at W,
+contacts/routing, owned reset, input/output conversion and backing cleanup.
+Neither `P_r=W` nor recursion-wide precision admission follows from this
+result. The direct baseline has `(N/2)*f*240152` C-pair operations plus all
+ordinary work and its actual access/movement bill. It supplies no selected
+accelerated tariff and cannot be substituted for one for free.
+
+Thirty of the local CLEARs erase nonzero ideal data. Exact quantizer behavior
+does not make their physical erasure reversible or free. Space accounting must
+include two W-bit components for every live complex entry, all productive and
+owned fields, arithmetic/control records, route buffers and retained backing.
+The checker uses bounded managed Python allocation; it is not a fixed-tape
+allocator or physical memory certificate. The numerical witness holds only
+finitely many512-coordinate arrays and bounded128-entry monomial/chart caches;
+no giant global field is allocated.
+
+## Open next questions
+
+1. Bind one selected-rate recursive child to this **reachable** F-grid return
+   contract, including its internal grid, scaling, rounding and protected
+   owner return. Its completed approximation error alone is not this proof.
+2. Bind an existing recursion-wide common-grid method, such as
+   CrocSwap/integer-mult-bounds#2287 §6, to the actual current compiler and
+   child widths. Its completed-child reset methodology is already proved;
+   current source, tariff and internal-return compatibility require a join.
+   The conditional sensitivity screens in CrocSwap/integer-mult-bounds#5419
+   concern a different invoice and are not transplanted here.
+3. Implement the complete physical scalar/contact/reset lifetime at this width,
+   charging signed records, input widening, all retained backing and cleanup.
+   The source ideal reset and ordinary per-pass contracts remain separate.
+
+The structured questions, bounded stop rule and novelty record are in
+[TASK.json](TASK.json). No construction search or new kappa is claimed.
+
+## Credit
+
+Prepared for @CubeJerry with substantial OpenAI Codex assistance in mathematics,
+source analysis, implementation, verification and writing. Separate AI review
+is not independent human or formal-kernel verification. Credit DreamingOfClouds
+for the selected source; Ali Romman and the P104/native/controller contributors
+for its retained ancestry; Ross Richardson and the exact-grid contributors for
+the denominator method; and the published all-column closure contributors for the complete
+all-column native, contact, helper and tensor identification. The retained
+documents preserve their detailed predecessor attribution. Apache-2.0.
diff --git a/research/selected-caller-quantizer-transparency/RECEIPT.json b/research/selected-caller-quantizer-transparency/RECEIPT.json
@@ -0,0 +1,95 @@
+{
+  "ai_assistance": "Substantial OpenAI Codex assistance; separately reasoned AI review is not independent human or formal-kernel acceptance.",
+  "author": "@CubeJerry",
+  "author_emit": {
+    "argv": [
+      "python3",
+      "-I",
+      "-Werror",
+      "-B",
+      "research/selected-caller-quantizer-transparency/verify.py",
+      "--write",
+      "--progress"
+    ],
+    "combined_output_sha256": "6f84637ef840544917d9b9e2851af27cc5a909e6d05ab10a8c2957077092237a",
+    "returncode": 0,
+    "scope": "Complete source/numerical/control generation; before the typed JSON key correction. The serialized RESULT bytes are unchanged."
+  },
+  "base_commit": "7c49fe32c55de02c2c873655c804b16e4c3fef0a",
+  "failed_attempts_not_counted_as_registered_passes": [
+    {
+      "correction": "Emit explicit string paid-profile keys and require a typed JSON round trip before writing or comparing. Serialized RESULT bytes remained identical; both registered modes were rerun.",
+      "elapsed_seconds": 111.61787343025208,
+      "finding": "The complete source and numerical work finished, then strict typed receipt comparison rejected integer Python paid-profile keys versus JSON string keys.",
+      "returncode": 1,
+      "stage": "First registered normal replay",
+      "stderr_sha256": "86f1a846e1865cd6f9182f0f08779b911c8b7bb9d8079e51c1a346f5b60ffcef",
+      "stdout_sha256": "f3bbb7479cbc770e214de8e7ad16b468df4e72beffea0fec4eae668fdae76eb7"
+    }
+  ],
+  "independent_ai_review": {
+    "external_evidence_sha256": {
+      "DERIVATION.md": "de579a08f49bef15c7586251d9f01c20571db6251b452dc929303e8a69843943",
+      "KERNEL-O.json": "62fa19ba22cb80f9e7a109a400ad13be0868f97bd3bcb474609fbc6a90abcd3f",
+      "KERNEL.json": "62fa19ba22cb80f9e7a109a400ad13be0868f97bd3bcb474609fbc6a90abcd3f",
+      "REVIEW.md": "db74ae4fda1d85c16489bd497eb5682fde5728d6b7ff3c536af5491c69ae2a34"
+    },
+    "methods": [
+      "stabilizer support and Gaussian integer parity proof",
+      "backward-functional large-base Laurent prefix check",
+      "complete canonicalizer basis and partial-axis reconstruction",
+      "separate complex-Fraction C kernel and signed quantizer oracle"
+    ],
+    "scope": "Separate read-only review evidence; the two final registered commands are the published reproduction gate. No human or formal verification is claimed."
+  },
+  "limits": [
+    "The all-f theorem is the written source-bound argument, not a finite enumeration.",
+    "The complete numerical fixture is one 512-coordinate local word, not a 2^145 global physical replay.",
+    "Selected recursive native internals, actual P_r, owned reset, routing and tape costs remain premises.",
+    "No final coarsening, recursive tariff admission or new kappa."
+  ],
+  "proof_sha256": "eaecedd0fe115499b6fe107db034fe86873e9689119bc0eb9c56b88010783e24",
+  "python": "3.12.14 (main, Aug 25 2026, 14:00:49) [Clang 22.1.3 ]",
+  "registered": {
+    "elapsed_seconds": 234.88624668121338,
+    "returncode": 0,
+    "stderr_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+    "stdout_sha256": "1a8c5c227bab0cda1eddf7706cde5fb03438e92cb89d855657bd2e535a0bfd2e"
+  },
+  "registered_modes": [
+    "normal",
+    "optimized"
+  ],
+  "registered_stderr": "empty; warning-strict commands",
+  "reproduction": [
+    "python3",
+    "-I",
+    "-Werror",
+    "-B",
+    "scripts/research_package.py",
+    "--package",
+    "research/selected-caller-quantizer-transparency"
+  ],
+  "requirements": [],
+  "schema_version": 1,
+  "scientific_markers": 2,
+  "scientific_source_sha256": {
+    "DEPENDENCY.json": "0b92bbb9125587497ea4b1a74f5f14385708c48db639db228473b72c4ee2bdb9",
+    "RESULT.json": "4d80f166cd48e4bc7bc7990ffb4f3255272c0bf372c69f30a0330a0de48a961a",
+    "SOURCES.json": "1bc36bd24df2fddd348a6f9773cfbad569825ae0aa5eeac97fa4c51bed1584e1",
+    "VERIFY.json": "e2670accd567ccf8b92795a706684fe93f8671f013d57abd3e7ae81c5ecb7008",
+    "common.py": "0bc1d0eb75ab7f010ae82f6805f720031eb75bfd9714582dd9a27e4bb486b298",
+    "controller_certificate.py": "99e4be634a783351767bfc00393eacf84084f0e61a3ef4813abb73d5e17a563f",
+    "controls.py": "31e06e1876f89bfa0fbf8b53a8abc549b25e19517e9e932b4dc9ebcf645f8a98",
+    "geometry.py": "573409e93941577e927c840924c4c7841119492c3dc85d7a06fb42e41fa7a1fe",
+    "inputs.py": "9fa1b412b712ece9a8406221ca5dab8592a8c9dd9cb1f8ccb91b0a952cb2f168",
+    "quantized.py": "0bb88b5bb9d7bc77d0069a926bc0b463da28def59dc659d9f37074f0b0402fd2",
+    "scalar_certificate.py": "5c7de15d2e5ab555fbf83b389e63d316bc28dbc4dee6f561c93e257fc5423abb",
+    "vendor/a1/NATIVE.json.gz": "ce62443d9a4d8d73d82df3819ed25c5c3a03e7cea486b0ec83563cea53bda4b4",
+    "vendor/a1/PROOF.md": "c5581d275d90f204c1e559f0e7dcb2172c68592b6ff96411c9ad7f4003893a5b",
+    "vendor/a1/RESULT.json": "b3efd599cd80c6f0a062e9fd1557d72701a9b4be8b0d79b6d012b4cfed395457",
+    "vendor/a1/SOURCES.json": "813dd728542601b021c8504c5821704617418d1f2272f2335c117a7de04449c1",
+    "verify.py": "30a5b69246da7241a0d4ff959043bcc1e63644883e275fd2e395f07692005bd4"
+  },
+  "status": "author_registered_normal_and_optimized_passed"
+}