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
4 changes: 4 additions & 0 deletions research/staged544-reversible-lattice-macro/.gitattributes
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
*.py text eol=lf
*.md text eol=lf
*.json text eol=lf
frozen/** -text
2 changes: 2 additions & 0 deletions research/staged544-reversible-lattice-macro/.gitignore
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
__pycache__/
*.pyc
37 changes: 37 additions & 0 deletions research/staged544-reversible-lattice-macro/CREDITS.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
# Attribution and source boundaries

The staged544 provider and helper 277 residual are Dugongue's PR3945, building
on dataisfire's PR3734 and the retained scalar, frame, native, owner and outer
lineage. No provider-construction credit is transferred by this implementation.
Jeremy Kothe's frame work, Sagar Thakrar, roger-sato and Arham Tahir's audit
contracts, DreamingOfClouds's residual adapters, chafreaky's PR458 wrappers,
and Cinna Davis's dirty-borrowing work remain credited. The complete preserved
predecessor lineage is in frozen/NOTICE-PR3945.md and frozen/SOURCE-CREDITS.md;
these copied files are authenticated byte-for-byte, not rewritten.

The exact phase recipe and independent Gaussian oracle are reused from
Chris R / Clear1nsight's PR3987 at fc536202fdaa924158789a5ef59ac079bbe21922.
Fresh replay here covers its one helper 277 class. The complete-call allowance
is PR3994 at eb2ac25838a3d39ac8fd6acfa62b8b613c847629; its global theorem is
not claimed as newly derived or its full registry rerun by this package.

Reversible lifting and modular accumulators are established mathematical ideas.
The borrowed-bit multiple-control decomposition and 4n-8 Toffoli cost are
credited to Adriano Barenco et al., *Elementary gates for quantum computation*,
arXiv:quant-ph/9503016, Lemma 7.2:
https://arxiv.org/pdf/quant-ph/9503016 . The implementation contains a
self-contained derivation and checks, and uses literal classical Toffolis,
not the paper's later relative-phase substitutions. No new general gate
decomposition theorem or first-use claim is made.

The new contribution is the source-bound dirty half-sum accumulator, its
explicit application/bill/error contract for the actual residual, a fair
constructed clean comparison, and the actual-macro nonadditivity discriminator.
Chris R / Clear1nsight with substantial OpenAI Codex assistance. A coordinating
agent suggested the clean comparison and classical borrowed ladder; a separate
same-team graph agent independently implemented elementary-gate controls.
These AI reviews are neither independent human review nor proof-kernel checks.

PR3881's exact-residue Gaussian recovery lane was read during overlap checking.
It uses a different numerical producer/consumer and is not a baseline or source
of this macro's constants. No exhaustive novelty claim is made.
106 changes: 106 additions & 0 deletions research/staged544-reversible-lattice-macro/FROZEN-SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,106 @@
[
{
"path": "frozen/WORD-base.json.gz",
"sha256": "08e6c96fbe3dfec96cb8451b3867ef8c1a214109ecd1e5af7fcc28e0f05728d0",
"source": {
"local_path": "frozen/WORD-base.json.gz",
"sha256": "08e6c96fbe3dfec96cb8451b3867ef8c1a214109ecd1e5af7fcc28e0f05728d0",
"origin_commit": "91f81d131252db704f945891da1ea54e29d46b8b",
"origin": "CrocSwap/integer-mult-bounds research/staged544-terminal-gap-fill; exact public frozen bytes, native receipts are author evidence only",
"origin_repository": "CrocSwap/integer-mult-bounds",
"origin_path": "research/staged544-terminal-gap-fill/inputs/NEW-base.json.gz",
"git_blob": "806784bf99d9d15004d2d227d06268556a0726c8"
}
},
{
"path": "frozen/WORD-extra.json.gz",
"sha256": "d83c2ec9cecc0ad092d34ea4080b28a4fd7199579356b6d5a8fc6cd53ff93299",
"source": {
"local_path": "frozen/WORD-extra.json.gz",
"sha256": "d83c2ec9cecc0ad092d34ea4080b28a4fd7199579356b6d5a8fc6cd53ff93299",
"origin_commit": "91f81d131252db704f945891da1ea54e29d46b8b",
"origin": "CrocSwap/integer-mult-bounds research/staged544-terminal-gap-fill; exact public frozen bytes, native receipts are author evidence only",
"origin_repository": "CrocSwap/integer-mult-bounds",
"origin_path": "research/staged544-terminal-gap-fill/inputs/NEW-extra.json.gz",
"git_blob": "c531be7383ad3ba941600c7ced14e5e10d6d1c67"
}
},
{
"path": "frozen/clifford_exact.py",
"sha256": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962",
"source": {
"local_path": "vendor/clifford_exact.py",
"sha256": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962",
"origin_commit": "91f81d131252db704f945891da1ea54e29d46b8b",
"origin": "native/vendor/native/new/code/borrow/vendor/clifford/clifford_exact.py",
"usage": "Only clifford_exact.py used in optional reference generation; independent verifier executes none of these sources",
"origin_repository": "CrocSwap/integer-mult-bounds",
"origin_path": "research/staged544-terminal-gap-fill/native/vendor/native/new/code/borrow/vendor/clifford/clifford_exact.py",
"git_blob": "166841a037f069249f6f7f6dedb89248812f59e2"
}
},
{
"path": "frozen/bw_adapters.py",
"sha256": "c5907050a9a7fa36d4fcba3ad4fe440d1bec2063360c095013891785ba65c3ce",
"source": {
"local_path": "vendor/bw_adapters.py",
"sha256": "c5907050a9a7fa36d4fcba3ad4fe440d1bec2063360c095013891785ba65c3ce",
"origin_commit": "91f81d131252db704f945891da1ea54e29d46b8b",
"origin": "native/vendor/native/new/code/borrow/bw_adapters.py",
"usage": "Only clifford_exact.py used in optional reference generation; independent verifier executes none of these sources",
"origin_repository": "CrocSwap/integer-mult-bounds",
"origin_path": "research/staged544-terminal-gap-fill/native/vendor/native/new/code/borrow/bw_adapters.py",
"git_blob": "82beaa9c1d13bcd5f79d0a5e10e8a10733eac347"
}
},
{
"path": "frozen/bw_transport.py",
"sha256": "9818e08b819310b40f1441b89be8c4369584a5b3fa5dfe9b86b1df9a7f5d6a76",
"source": {
"local_path": "vendor/bw_transport.py",
"sha256": "9818e08b819310b40f1441b89be8c4369584a5b3fa5dfe9b86b1df9a7f5d6a76",
"origin_commit": "91f81d131252db704f945891da1ea54e29d46b8b",
"origin": "native/vendor/native/new/code/borrow/bw_transport.py",
"usage": "Only clifford_exact.py used in optional reference generation; independent verifier executes none of these sources",
"origin_repository": "CrocSwap/integer-mult-bounds",
"origin_path": "research/staged544-terminal-gap-fill/native/vendor/native/new/code/borrow/bw_transport.py",
"git_blob": "08248542b18864c94a5ac050c8669f68519838e1"
}
},
{
"path": "frozen/NOTICE-PR3945.md",
"sha256": "6881464d7731757b63275f056cb9ef8406db04e76c73093d3e5b418529a879cc",
"source": {
"repository": "Clear1nsight/integer-mult-bounds",
"head": "fc536202fdaa924158789a5ef59ac079bbe21922",
"path": "research/staged544-native-quadratic-audit/NOTICE-PR3945.md"
}
},
{
"path": "frozen/SOURCE-CREDITS.md",
"sha256": "d4a13d8b8ed9cdb594f00efb3d1a336e09d934423330f02a1514308a720c278b",
"source": {
"repository": "Clear1nsight/integer-mult-bounds",
"head": "fc536202fdaa924158789a5ef59ac079bbe21922",
"path": "research/staged544-native-quadratic-audit/SOURCE-CREDITS.md"
}
},
{
"path": "frozen/RECIPES.json",
"sha256": "64b85f6aef485026eebaec7acddb41999f57e074b0dfde8077b6543700cd684b",
"source": {
"repository": "Clear1nsight/integer-mult-bounds",
"head": "fc536202fdaa924158789a5ef59ac079bbe21922",
"path": "research/staged544-native-quadratic-audit/RECIPES.json"
}
},
{
"path": "frozen/exact_phase.py",
"sha256": "e3d76b3373ff40a83a4b212b3fe1c0b431b3cfdc807da601d6e7f273c02c6d30",
"source": {
"repository": "Clear1nsight/integer-mult-bounds",
"head": "fc536202fdaa924158789a5ef59ac079bbe21922",
"path": "research/staged544-native-quadratic-audit/exact_phase.py"
}
}
]
38 changes: 38 additions & 0 deletions research/staged544-reversible-lattice-macro/LEDGER.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
{
"scope": "Actual PR3945 helper277 residual L C5 R, both providers, fixed mathematical map; f spectator lanes and b-bit real data",
"proved": {
"finite_permutation": "All data/scratch bit states; exact inverse and arbitrary dirty scratch return; temporary borrowed pair bits restored after each elementary gate",
"arithmetic_primitives_per_lane": {
"dirty_add_sub_conditional_decrement": 23040,
"constructed_clean_add_sub": 17920,
"real_swaps": 3792,
"real_negations": 2304
},
"scratch": "One b+1 bit word, arbitrary initial state restored; no clean ancilla. Data1024bf bits counted separately. Serially reuse scratch across1280f pairs.",
"elementary_gate_upper_bound": "(6b+4)(10240b^2+41584b+10240)f X/CNOT/Toffoli; exact split at b8,32,64 in RESULT.json",
"bounded_fanin_method": "Barenco et al. Lemma7.2 borrowed-bit decomposition, literal classical gates; temporary bits selected only outside current controls/target among pair and scratch",
"numerical_error": "80sqrt(f)Delta completed Hilbert error, conditional on no data wrap; scratch wrap allowed exactly",
"data_range": "Signed range8H is sufficient if Delta<=H/(128sqrt(f)); b=p+4 for Delta=H2^-p, H power of two",
"cut_allowance": "p>=beta+32+ceil(log2sqrt(f)) suffices for PR3994 absolute aggregate-cut allowance H2^(-beta-25)",
"negative_result": "Actual rounded rank5 macro has Q(2e0)-2Q(e0) nonzero at24 coordinates; standalone inverse does not establish whole-provider linear dirty-cleanup identities"
},
"constructed_comparison": {
"baseline": "Explicit clean accumulator introduced here, not an authenticated predecessor implementation",
"improvement": "Removes requirement to initialize b+1 scratch bits to zero",
"additional_cost": "5120f real-word arithmetic primitives;1280(b^2+5b)f generalized gates. At b32, extra61683200f Toffolis plus X/CNOT delta.",
"no_claim": "No speedup, selected sigma, kappa or admitted recursive replacement"
},
"inherited": {
"source_paid_object": "One rank5 recursive child, not a scalar primitive allowance",
"source_semantics": "Exact monomial/Clifford recipe and Gaussian dyadic semantics; PR3987 all-column oracle reused and freshly executed for this single class",
"global_word": "PR3994 ideal linear endpoint identities and full-cut error theorem, not rerun wholesale"
},
"unknown_not_zero": {
"actual_caller_budget": "No authenticated conversion from one paid rank5 child into our serial scalar bit tariff",
"physical_time_space": "Native scheduling, owner stock/tape, parallelism and actual tensor multiplicity",
"borrowed_provider_restoration": "Whole-word nonlinear dirty compensation after interleaved arithmetic and exact recovery/disposal",
"uniform_selected_stock": "Selected m73 producer mapping, all-size recursion and selected sigma",
"hardware_noise": "Boolean permutation model has exact X/CNOT/Toffoli; stochastic hardware faults not modeled"
},
"family_gate_decision": "Narrow: finite implementation closes a real module-level obligation and exposes precise nonadditivity/affordability stops. No further implementation expansion or new construction search justified without actual consumer budget."
}
102 changes: 102 additions & 0 deletions research/staged544-reversible-lattice-macro/MACRO.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,102 @@
{
"kind": "residual",
"entrance": [],
"terminal": [
388,
74,
40,
26,
1
],
"recipe": {
"rank": 5,
"left": {
"matrix_rows": [
1,
48,
68,
152,
26,
8,
10,
260,
4
],
"offset": 0,
"quadratic_rows": [
0,
18,
0,
8,
2,
0,
0,
0,
0
],
"linear_Z4": [
2,
3,
2,
3,
2,
0,
0,
0,
0
],
"phase": 0
},
"right": {
"matrix_rows": [
1,
80,
388,
8,
58,
82,
260,
120,
384
],
"offset": 29,
"quadratic_rows": [
0,
106,
132,
66,
80,
98,
58,
132,
0
],
"linear_Z4": [
2,
3,
3,
2,
3,
1,
0,
3,
2
],
"phase": 0
}
},
"coverage": [
{
"provider": "base",
"kind": "terminal",
"helper": 277,
"version": "new"
},
{
"provider": "extra",
"kind": "terminal",
"helper": 277,
"version": "new"
}
]
}
Loading