Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions research/p104-funded-reciprocal-split/APPLICATION.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
# Conditional application to the reciprocal native and signed caller

This applies Rohan Arun's #7113 component proof and #7116–#7118's changed-native adaptation to the exact reciprocal native. The input closure and explicit construction are in PROOF.md. Both artifact hashes and public heads are in README.md. The five inherited assumptions and selected completed BIT predecessor are retained. The source-specific proof template is the [#7000 application review](https://github.com/CrocSwap/integer-mult-bounds/blob/e54523517d0f03e58352e647c403a5af3e525a57/docs/research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md), including its BIT ambient 134 repair. Its generic root/storage and scalar/physical arguments require the substitutions below; a predecessor's numeric receipt alone is insufficient.

## Native and caller operator substitution

The new exact constructor preserves every independent arbitrary-input native endpoint while replacing one rank-nine helper with rank-eight and rank-one helpers. One paid rank-five move is subdivided into rank four and rank one, with every new occurrence charged. A rank-four move and a rank-one move advance without changing their ranks. The cut injection uses main role 17, but its exact suffix image is supported only on the independent helper group; the complete arbitrary-input replay checks restoration of all main endpoints. It checks all three public retiming intervals, the entire rational prefix/suffix, both basis identities and the retained scalar alphabet. Its complete forward and adjoint replays include every owned row. All 3,048 current paid/helper chart pairs and 104 main boundary pairs are then rebuilt with the pinned compiler and distinct signed-Pauli/absolute-phase interpreter. For these Clifford maps, the signed Pauli action fixes the operator up to global phase, which the exact Gaussian check fixes. Thus every column of each chart map is determined. The fresh replay includes a deliberately wrong absolute phase.

The unchanged 17-stage caller has five noncommuting quarter turns and twelve padding turns in inverse pairs. Its grouped idle bases lie over Z[1/30]. Its exact rational and integer Laurent engines agree on all 72 output fields for every formal central/body variable. In the physical substitution, seventeen disjoint eight-axis stage blocks and nine central axes use ambient 145. For each invocation, exchange the eight native complement axes with the fresh stage block while fixing the routed central axis and spectator axes. The phase-polynomial checks verify both directions. Literal A and B routes then apply commuting body operators on disjoint stage blocks.

A signed rank-nine idle uses one positive rank-nine recursive request plus the charged ordinary conjugation/phase implementing the inverse on the protected central axis. Current finite signed-child checks cover widths 1,2,3; the symbolic phase geometry supplies the disjoint-axis substitution. The ordered occurrence digest is recomputed from the literal caller and current native geometry. It binds 13,600 native contact boundaries, 110,706 paid positions and 22,240 productive fields. Main-owner aliasing is rejected. Allocate 18,496 distinct (stage,helper) public inputs and 867 reserved native owned banks, plus the retained serial query/LAMBDA bank. The surplus is 1,424. The ownership discipline and owned-erasure hypothesis remain explicit.

## Common-grid and fixed-root induction

Scale each of the 3,744 raw caller main input fields by 675 and divide each completed caller main output by 675. The independent integer Laurent replay checks the necessary valuations 3³ and 5², rejects a lower exponent of either prime, and uses safe binary valuation 381. Every normalized main coefficient and pre-ADD product is integral on that odd grid. Substituting actual binary Clifford address operators introduces only powers of two, so the odd-divisibility invariant transfers to whole arrays and all spectators.

Within each native invocation, scale all 1,488 public fields by 1125 and unscale the completed returns. The separate exact prefix/pre-product derivation and integer replay establish the native grid at fractional height 24. Fresh helpers receive their own independent inputs. The exact native endpoint ensures these helper inputs do not perturb the normalized main caller invariant. Both odd scales are included simultaneously in the unfinished-context mass allowance.

The fresh forward/adjoint envelope has height 405 and context mass exponent 1171, giving c=2342. It is recomputed from this exact word and caller; #7118's previous allowance was 2338. It remains below 4096. The same conservative ambient 153 compiler threshold funds it: Kstar has 14,093 bits and c·Kstar has 14,104 bits, below H=16487800000000000000000. The independent inequalities check every rounded caller bound as well. Apply the retained full-root common-format induction with fixed padding, signed width p+h+2D+3, fractional width p+D, and 26 temporary bits. Completed child returns preserve this format. Exact finite-state odd division retains the reviewed carry/remainder invariant.

## Physical upper-cost substitution

The source-unit ordinary bound 777,686,320 includes the caller and native conversion services. It is distinct from the physical-machine bound. The fresh raw-occurrence counts give 1,145,341 native scalar macro inputs, 117,856 caller macro inputs and 58,080 conversions. The retained conservative factor 32 gives 42,280,864 scalar services; with the reviewed 2²⁰ service constant this is 44,334,699,249,664 times the root scalar-width envelope. Numerators of all actual native/caller instructions and both conversion scales fit 24 bits.

The current occurrence count gives 298,740 monomial map slots. At actual ambient 145, the retained elementary bound 4(145+1)² is 85,264 records per map, hence at most 25,471,767,360 elementary records per raw occurrence. Use actual owner widths and these finite coefficients in the same fixed-tape stock and movement envelopes from the selected review. The positive compiler/outer slack permits enlarging the eventual cutoffs. This is a conditional asymptotic substitution, not an enumerated machine trace.

The recomputed complete recurrence has the bracket and claim in README.md; both exact price engines, the compiler and 54 strict plus 4 functional outer inequalities pass. These checks establish the stated conditional component application under the five assumptions. Independent mathematical review, formal-kernel validation and maintainer admission are separate obligations.

Credit Rohan Arun for the #7113 proof and implementation, Douglas Colkitt and the #7000 application reviewers, the retained compiler/precision/source authors, and the complete lineage in README.md. Adapted for this exact reciprocal construction by dillona with substantial OpenAI Codex assistance. Apache-2.0.
152 changes: 152 additions & 0 deletions research/p104-funded-reciprocal-split/DISCOVERY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,152 @@
{
"scope": "Local-only nomination search; public verification uses the exact selected witness.",
"source_head": "3f6ff8c34b22af12b40c5a8bcee585cd1aafdb9c",
"word_sha256": "cbce61015e22007f785474e2af2462a7d97ead1e105d71cd2d9cbc0a449580f3",
"method": "Complete boundary kernels including zero images, Matarener pairing decision and basis-pair nominations under total paid-path cost; not exhaustive rational cost optimization.",
"stats": {
"systems": 38318,
"saved": 10014,
"pairs": 44238,
"hits": 7,
"classes": {
"F1zero": 7997,
"witness": 1751,
"F2zero": 266
},
"rescued": 0,
"budget_reject": {
"8": 3024,
"10": 2614,
"6": 3872,
"13": 1242,
"12": 1930,
"4": 2371,
"9": 3120,
"7": 3830,
"14": 1506,
"15": 1921,
"5": 2877,
"3": 3324,
"2": 1166,
"18": 1232,
"16": 1337,
"21": 828,
"24": 498,
"11": 2108,
"17": 1341,
"20": 833,
"19": 954,
"22": 565,
"25": 238,
"23": 641,
"28": 188,
"29": 119,
"27": 170,
"26": 201,
"30": 99,
"31": 34,
"33": 5,
"32": 10
},
"best_budget": {
"cut": 44131,
"frame": 246,
"cost": 0.009070155239718325,
"gain": 0.011366274739030402,
"paths": [
{
"role": 448,
"lo": 44126,
"hi": 45243,
"frame": 246,
"old": 246,
"new": 127,
"moves": [
44129
],
"old_paid": [
1
],
"new_paid": [
0,
1
],
"cost": 0.0,
"private": false,
"neutral": true
},
{
"role": 17,
"lo": 33568,
"hi": 47128,
"frame": 246,
"old": 232,
"new": 127,
"moves": [
33711
],
"old_paid": [
5
],
"new_paid": [
4,
1
],
"cost": 0.009070155239718325,
"private": false,
"neutral": false
},
{
"role": 789,
"lo": 36315,
"hi": 45214,
"frame": 246,
"old": 232,
"new": 246,
"moves": [
45213
],
"old_paid": [
4
],
"new_paid": [
4,
0
],
"cost": 0.0,
"private": false,
"neutral": true
},
{
"role": 745,
"lo": 43973,
"hi": 44154,
"frame": 246,
"old": 541,
"new": 246,
"moves": [
44153
],
"old_paid": [
1
],
"new_paid": [
1,
0
],
"cost": 0.0,
"private": false,
"neutral": true
}
],
"paid_roles": 1
}
},
"legal_nominations": 7,
"full_native_checked_indices": [
3
],
"selected_index": 3,
"selected_reason": "All seven have one profile; this nominal witness has the shortest emitted scalar bases (8+9 instructions).",
"remaining": "The other6 nominations were not constructed. Local search files are preserved; no search optimum is claimed."
}
14 changes: 14 additions & 0 deletions research/p104-funded-reciprocal-split/ENVIRONMENT.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
{
"initial_python": "3.14.7",
"initial_platform": "macOS-27.0.1-arm64-arm-64bit-Mach-O",
"registered_replay": {
"python": "3.12.16",
"platform": "macOS-27.0.1-arm64-arm-64bit",
"result": "PASS both complete commands; every native and composition receipt field matched"
},
"dependencies": "Python standard library",
"interpreter_origin": "Official Astral python-build-standalone release20261026; isolated /tmp installation",
"interpreter_archive_sha256": "fbf4afef53c2a6b72bb741bc06d5671a9dfaf87bd84e5aa73ac9b3d0d589f14e",
"hosted_ci": "Not yet published; no hosted scientific pass claimed.",
"completed_utc": "2026-11-10T19:11:59.338777+00:00"
}
159 changes: 159 additions & 0 deletions research/p104-funded-reciprocal-split/INPUTS.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,159 @@
{
"head": "3f6ff8c34b22af12b40c5a8bcee585cd1aafdb9c",
"pr": 7118,
"prefix": "research/p104-funded-residual-split",
"archive": "inputs/pr7118.tar",
"archive_sha256": "d07c3ebc0fd4f6b067bb0053c39520e9ab61fde144a133b34d4991b7e95eabd1",
"files": [
{
"path": "research/p104-funded-residual-split/APPLICATION.md",
"size": 6707,
"sha256": "fda83d235218ee8e459f04206afa25331eac43744b18364c5269f08d59f99edc",
"git_blob": "c0746110701400e378c3e449b9c0c488f80fbe2a"
},
{
"path": "research/p104-funded-residual-split/DISCOVERY.json",
"size": 3028,
"sha256": "41d571c147b2731a5f342ff33e11a260f69fdc3c11ee38c83a5dd6c191f11d64",
"git_blob": "da21446c51e853c558a41534d79e556733b92bff"
},
{
"path": "research/p104-funded-residual-split/ENVIRONMENT.json",
"size": 665,
"sha256": "bdb10b6516020f542cbf3aba9a8d7956510e623bdf398f07ff82cf674d3d832b",
"git_blob": "3d683f281502c15e1f651257ef05c789d974241c"
},
{
"path": "research/p104-funded-residual-split/INPUTS.json",
"size": 6306,
"sha256": "2a27bf6420abda90b1b22bebfef8454c12abe0ad1b160ee4ec8e818c3fce4cce",
"git_blob": "f62d22126e98a41ca3c32fc2729210a4dc39dfa4"
},
{
"path": "research/p104-funded-residual-split/NATIVE-RESULT.json",
"size": 74055,
"sha256": "9685bf709b2b309d9ce460bd67da346c70c0a7dd9061bb10bbdd75e9523e03f3",
"git_blob": "81793c79a88c8b4e05c1576164eb66f2f19a7949"
},
{
"path": "research/p104-funded-residual-split/PROOF.md",
"size": 4781,
"sha256": "b8b9da190b67cb6a14b4df3e750c80d1805ac3308dffdff5295519bc724da3e4",
"git_blob": "6612493e44d39d7e8d11f67b3de4e090611e97b7"
},
{
"path": "research/p104-funded-residual-split/README.md",
"size": 6678,
"sha256": "233490782412955193a19c8e372bee4af8bfd704af5b1368e3ace9959e65a6f5",
"git_blob": "174bf9a63f233d6f167a4ed4af268df551becf96"
},
{
"path": "research/p104-funded-residual-split/REPLAY.txt",
"size": 3792,
"sha256": "0b149316c1895155d9126c93278acbd21bb39ef0f5ac1a3732528609297eee53",
"git_blob": "a1a0e1d5754980b3e9aeef7b3272f2607517d9dd"
},
{
"path": "research/p104-funded-residual-split/RESULT.json",
"size": 75495,
"sha256": "527995c4df39d926eb51bf942aa61ae8d6ae879800df71ccab0cf51c4b9475e6",
"git_blob": "3b69c963ce54ca28dcb6d7e87278ff62484c032d"
},
{
"path": "research/p104-funded-residual-split/SOURCES.json",
"size": 856,
"sha256": "8b58a30ae55396b8d108de4ee2c7c6ac75dc1096948c9ac3796c20b21b1c9372",
"git_blob": "c4150ae39789502a4adf89e8f5235995d458a72e"
},
{
"path": "research/p104-funded-residual-split/TASK.json",
"size": 9761,
"sha256": "44884508992b900760aee65740ed894bfb23c3e089a5433125d5616365862166",
"git_blob": "a9dd5d2251721360f7898b0e6e149d30359c26eb"
},
{
"path": "research/p104-funded-residual-split/VALIDATION.md",
"size": 2212,
"sha256": "d23d6fcbea3722843cf10e2f338403a5cc26b572143e4a21eb09297561b7e25d",
"git_blob": "074ba6e00c2240f9a0c4ab65b7776f3ce056c688"
},
{
"path": "research/p104-funded-residual-split/VERIFY.json",
"size": 1056,
"sha256": "960b9be56bfe253584989354433c5acf293bae312b39e951a517d15e187f4760",
"git_blob": "0f09718ef4776c4f4c84bc690fac7848b07b3a0e"
},
{
"path": "research/p104-funded-residual-split/WITNESS.json",
"size": 1385,
"sha256": "303c42476f857d691c4dddaf61b73ab0c9b42a9397c786daaefc9c4f72e47daa",
"git_blob": "25f1927d249696cb2e9a28b62ee2e2f7f92f8c4d"
},
{
"path": "research/p104-funded-residual-split/WORD.json.gz",
"size": 364365,
"sha256": "387fd77169e619edf3fa1ebcecb899fa597b9b49100b631c1ac88a3c13727f4e",
"git_blob": "cbf5332c8598fa9df7d89ddcd1d41247a0615995"
},
{
"path": "research/p104-funded-residual-split/adapt.py",
"size": 2163,
"sha256": "da02a24f0591a7cb4cddbc5cd786c9a7201a80a046f5cf747cb31cd5deaa1e02",
"git_blob": "4ef7a4b670c4f890e3112e934ef3470f8fb5defa"
},
{
"path": "research/p104-funded-residual-split/construct.py",
"size": 3061,
"sha256": "42ffab76b8664088f444ba7d815537a541af72c5fa5eef897989b90399b9e564",
"git_blob": "748bfe2be2e5fffc1dfa9bdfa261bfcc8da16088"
},
{
"path": "research/p104-funded-residual-split/derive_grid.py",
"size": 1510,
"sha256": "ceb7a44ef19d72a16db7b43c65c85910d965499d1715436011de32af5d39dbb0",
"git_blob": "f8cb37f00bcd197d77bbb205dae3c1a40c0aa680"
},
{
"path": "research/p104-funded-residual-split/inputs/pr7117.tar",
"size": 6246400,
"sha256": "5dad877e3ecfaada8542c69d1516ecc951086d49cc00fc0647efcaa22defd080",
"git_blob": "8709147ce8e2a7fd8d50572f63424722e49a0454"
},
{
"path": "research/p104-funded-residual-split/price.py",
"size": 3642,
"sha256": "91acd3cab464bad1aa55c129c1c5cd4776746172a44e2d09eb5e03d007684195",
"git_blob": "283a3edfb1d3674fd9949a54ff6bc21536568a57"
},
{
"path": "research/p104-funded-residual-split/source.py",
"size": 3312,
"sha256": "67f3a6f4467b4a14d7d5328e2d169f561ddae066d61746d76b3d16af7dd8702e",
"git_blob": "1dab884d9ea8f86fcaa562d9f77e3203103f4b71"
},
{
"path": "research/p104-funded-residual-split/split.py",
"size": 6432,
"sha256": "3d529d78994504ad591a3afade4dab094751c1c221edbab10165290314cf0894",
"git_blob": "5407e8959b8723464aee68eea6ffcf2ee75cc3b7"
},
{
"path": "research/p104-funded-residual-split/support.py",
"size": 606,
"sha256": "f3e6eeb879480715c5c32c1a390a63c57d26ea1c9a9cbdb89b83ca34260e47f6",
"git_blob": "192cd38d27e4b732981b98730459a041dcfb52e7"
},
{
"path": "research/p104-funded-residual-split/verify.py",
"size": 3448,
"sha256": "2d3132416ed799b4d0cde9e69abef43f754cb75eac7b7650e974b0850de46174",
"git_blob": "cbd31c07de0420bb818dd95820ca850b1c395663"
},
{
"path": "research/p104-funded-residual-split/verify_native.py",
"size": 13008,
"sha256": "e8d541111aaf297658fe3c63bcbf8b997626a10eaabb46ad232ddc24320a12d0",
"git_blob": "e8f29be93ffc943ea834b4e9ad4161960516fef8"
}
]
}
Loading
Loading