Repository navigation
Pay augmented field recoupling and prove fixed-sector batching limits - #270
Merged
Merged
Conversation
Compile the uniform moving-Pauli-helper recoupler with complete native resource and return ledgers, retain the 148-T finite helper allocation, and establish robust weak-probe domain and Clifford-sector degree restrictions. Exact helper-sector tableaux reach the degree floor and guard the fixed-frame scope. R96 and selected Result D remain unchanged.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
The field route had a paid finite decoder but no uniform native word for its division-dependent recursive maps. This revision changes the source representation explicitly: a moving Pauli helper query appears on both sides, and two multiplication-XOR batches pay each recoupling level. The complete source/probe/actual-adjoint echo returns every moving helper and private mask on arbitrary inputs.
The uniform decoder has at most 16(p−1) T bands, T count O(mp³), dirty width O(mp²) and elementary-gate count O(m²p²). The direct indicator pays four decoder/adjoint appearances and two field queries, with at most 64(p−1)+16 bands and an explicit shared workspace pool. These counts fit the precise relaxed fusion budgets; the linear depth does not meet the sublogarithmic target. R96 and selected Result D remain unchanged.
The revision also determines why the proposed fixed-frame batching approach cannot remove that depth dependence:
Validation completed on head
378e23c02a6c03d5f9fe8d694fb5a733c4ffce86, treefc1fb46d64268a0cb8cf9694f36a9ac45dfb9e37:c8efd1b47378fb4bc23fd54eb12151edf700ebdd, whose tree exactly equals the reviewed tree and whose parents are the recorded base and head. Both push jobs checked the reviewed head directly.Full presentation CI passed all 9 steps. Its head-bound presentation artifact is
presentation-previews, 350,124,016 bytes, digestsha256:497a6f0aa4b529dc2d244419126e979c8c05f4413a753910727023b6cd9cb5aa.Exact-tree receipt and complete-log SHA256 hashes
The working checkpoint, research routes and verification catalogue now point to single proof homes and the next construction obligation: leave the fixed-frame helper-affine stage grammar through a paid complete native word. Existing anchors and prior allocations are preserved.