diff --git a/research/joint-relations-independent-validation/CLAIMS.json b/research/joint-relations-independent-validation/CLAIMS.json
new file mode 100644
index 0000000000..daa01b7985
--- /dev/null
+++ b/research/joint-relations-independent-validation/CLAIMS.json
@@ -0,0 +1,58 @@
+{
+ "schema_version": 1,
+ "review_status": "READY_FOR_COLD_REPLAY",
+ "canonical_main": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "selected_baseline": ".0030217758",
+ "selected_metadata_role": "Frozen historical provenance; future selected-result updates do not invalidate this review.",
+ "candidates": [
+ {
+ "pr": 5383,
+ "head": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "author": "Ali Romman",
+ "kappa": "151333/50000000",
+ "decimal": ".00302666",
+ "package": "research/kappa-joint-relations-20261023",
+ "word_payload_sha256": "2aee5e997df99726fc763e510d9cb69fbe4f86114dc8d2cd33ad26c6c462a21d",
+ "last_pivot": 288
+ },
+ {
+ "pr": 5387,
+ "head": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "author": "Dugongue",
+ "kappa": "605334953/200000000000",
+ "decimal": ".003026674765",
+ "package": "research/eight-owned-relations",
+ "word_payload_sha256": "9aa0d7112b4e13f1aa13a93dab0af6f4435ffe99b842aad841685becdafee492",
+ "last_pivot": 261
+ }
+ ],
+ "assumptions": [
+ {
+ "id": "native_all_columns",
+ "statement": "Retained native operators, phase conventions, spectators and whole-job adapters work at every positive column multiplicity."
+ },
+ {
+ "id": "owned_erasure",
+ "statement": "Owned streams and suspended centers obey the retained allocation, erasure and ownership contracts."
+ },
+ {
+ "id": "compiler",
+ "statement": "The finite mixed-target compiler and chronological product, completion and splitting satisfy the retained uniform closure contract."
+ },
+ {
+ "id": "precision_tape",
+ "statement": "Retained fixed-tape movement and precision/storage prescriptions apply to the new fixed finite template."
+ },
+ {
+ "id": "analytic_recovery",
+ "statement": "Analytic decomposition, fine-prime avoidance and exact integer recovery follow the retained upstream/outer framework."
+ }
+ ],
+ "selection_authorized": false,
+ "construction_claim": "No new native construction is claimed by this independent review.",
+ "selected_kappa": "15108879/5000000000",
+ "same_selected_assumptions_required": true,
+ "new_unconditional_or_Lean_theorem": false,
+ "uniform_word_materialized": false,
+ "selected_record_changed": false
+}
diff --git a/research/joint-relations-independent-validation/COMMANDS.json b/research/joint-relations-independent-validation/COMMANDS.json
new file mode 100644
index 0000000000..ddd38138d6
--- /dev/null
+++ b/research/joint-relations-independent-validation/COMMANDS.json
@@ -0,0 +1,95 @@
+{
+ "schema_version": 1,
+ "commands": [
+ {
+ "name": "algebra-5383",
+ "argv": [
+ "agents/algebra/check_joint.py"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "algebra-5387",
+ "argv": [
+ "agents/algebra/check_joint.py",
+ "--candidate",
+ "agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz",
+ "--candidate-pr",
+ "5387",
+ "--candidate-head",
+ "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "--out",
+ "agents/algebra/RESULT-5387.json"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "ownership-5383",
+ "argv": [
+ "agents/ownership/check.py",
+ "--exact",
+ "--controls",
+ "--output",
+ "agents/ownership/RESULT.json"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "ownership-5387",
+ "argv": [
+ "agents/ownership/check.py",
+ "--exact",
+ "--controls",
+ "--candidate",
+ "agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz",
+ "--candidate-head",
+ "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "--output",
+ "agents/ownership/RESULT-5387.json"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "event-invoice-and-prices-both",
+ "argv": [
+ "agents/prices/check_prices.py"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "outer-BIT-compiler-both",
+ "argv": [
+ "agents/outer/check_outer.py",
+ "--candidate",
+ "PR5383",
+ "repository/research/kappa-joint-relations-20261023/RESULT.json",
+ "--candidate",
+ "PR5387",
+ "agents/sources/pr5387/research/eight-owned-relations/RESULT.json",
+ "--bit-source",
+ "repository/research/query-thinned-controllers/RESULT.json",
+ "--out",
+ "agents/outer/RESULT.json"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "applicability-both",
+ "argv": [
+ "agents/applicability/check_applicability.py"
+ ],
+ "timeout_seconds": 120
+ },
+ {
+ "name": "actual-word-semantic-mutants-5383",
+ "argv": [
+ "agents/falsifier/check_mutants.py",
+ "--mode",
+ "full",
+ "--out",
+ "agents/falsifier/CONTROLS-FULL.json"
+ ],
+ "timeout_seconds": 300
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/PROOF.md b/research/joint-relations-independent-validation/PROOF.md
new file mode 100644
index 0000000000..96c22c58d4
--- /dev/null
+++ b/research/joint-relations-independent-validation/PROOF.md
@@ -0,0 +1,217 @@
+# Joint validation and exact dependency argument
+
+## Claim and five retained premises
+
+For each of the two exact literal words in CLAIMS.json, the new independent
+engines establish the algebra, ownership, complete invoice and numerical
+compiler/outer specialization described below. The implication remains
+conditional on the **same five literal premises** in CLAIMS.json, which the
+source guard compares with the authenticated selected PR5241 claim:
+
+1. Native operators, phase conventions, spectators and whole-job adapters work
+ at every positive column multiplicity.
+2. Owned streams and suspended centers obey the retained allocation, erasure
+ and ownership contracts.
+3. The finite mixed-target compiler and chronological product, completion and
+ splitting satisfy the retained uniform closure contract.
+4. The retained fixed-tape movement and precision/storage prescriptions apply
+ to the new fixed finite template.
+5. Analytic decomposition, fine-prime avoidance and exact integer recovery
+ follow the retained upstream/outer framework.
+
+The frozen selected record is 15108879/5000000000 = .0030217758 at canonical main
+1ec1119972c9aefe42525172d07b332fcff81cb4. It is historical provenance, with an exact
+vendored copy; no future live selected-file equality is a premise. No source
+object is fetched or substituted for missing working input during replay.
+
+## Distinct literal words and algebraic domains
+
+| Item | Ali Romman PR5383 | Dugongue PR5387 |
+| --- | --- | --- |
+| Source head | 4bd6efa51a495a7c7b7754915cf0244e7e60969e | b1ab650d36f59e5be682a813145b7c67e219e341 |
+| Conditional κ | 151333/50000000 = .00302666 | 605334953/200000000000 = .003026674765 |
+| Last pivot | L288 | L261 |
+| Eighth snapshot source event/role | 11306 / L288 | 11296 / L256 |
+| Eighth zero source event/role | 17580 / L288 | 17233 / L256 |
+| Backward scalar allowance | 158744 | 158776 |
+
+Both eighth substitutions use frame 281, but the unrestricted source relation
+and the retained arbitrary input domain differ. Equal invoices cannot establish
+their semantic equivalence. Each algebra invocation independently replays all
+21,449 original backward events, derives eight source-center-minus-snapshot rows
+and their eight matching later zero rows, reduces the simultaneous rank-eight
+system, and checks the actual preparation. It then replays the entire respective
+candidate on 624 independent retained inputs plus 17 arbitrary owned entry
+inputs. The pivots are 225,227,229,230,241,245,257 and the candidate-specific last
+pivot above. No relation basis, WITNESS, author evaluator or PASS receipt is the
+source of those identities. See reports/algebra/REPORT.md.
+
+The independent dyadic row engine keeps integer numerators and a common power
+of two denominator. Terms are independent inputs acted on by reduced free words.
+Only adjacent generator/inverse pairs cancel; different generators do not
+commute. For every positive width f, substitute the inherited actual f-column
+operator for each generator and its inverse for the inverse symbol. Evaluation
+is an algebra homomorphism, so the unrestricted formal identities hold on all
+payload vectors, including nonseparable inputs. Rational coefficients stay
+outside evaluation. No tensor power is distributed over a sum.
+
+All new preparation coefficients use the checked same-frame ADD/CLEAR grammar.
+The emitted preparation equals the independent joint RREF assignments and has
+no pivot on any pivot right-hand side. All eight snapshots coexist before the
+first center substitution, each in a distinct cleared owned bank. Same-frame
+COPY substitutes the exact source output with its physical gauge; identity at
+a proved complete zero vector removes the later job. Identity does not transport
+an arbitrary nonzero value between frames or erase approximate error.
+
+## Chronology, physical factors and owners
+
+The independent owner parser separately checks both whole backward words and
+both unchanged forward words, all frame transitions, exact retained endpoints,
+zero retags and owned returns. Each backward has 17 distinct complete owners
+(eight pivots and C0..C8); each forward has one C0 owner. Arbitrary dirt is cleared
+only in owned fields. Every removed pivot loses its productive target. No
+snapshot, suspended center, query scratch or parked bank receives productive
+credit. The raw p16 controller needs at least 16*17+2=274 separately tagged LOCAL
+banks before its other controller/compiler storage.
+
+Every retained warp, phase marker and adapter has exact original chronology;
+canonical operators and frames are unchanged. Source signed native and paid
+phase facts are **authenticated historical reuse** from the selected PR5241
+foundation, whose full 31-file proof/checker/receipt closure is retained under
+capsule/agents/sources/pr5241. The receipt binds the original source payload
+cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd,
+180 native classes, all 408 helpers in both orientations, and 5710 oriented paid
+classes/6596 paid event instances. The historical first-cold wrapper differs
+from canonical verify.py; its mathematical phase/native/helper checkers and
+regeneration code retain the recorded hashes. No new phase lowering is claimed.
+The canonical maintainer PROOF-REVIEW authorizes this unchanged foundation reuse.
+New scalar chronology, joint identities and owner domains are checked afresh.
+PR5384's single-relation review supplies generic COPY/zero/all-f interpretation,
+not the simultaneous joint proof or new inventory.
+
+## Whole-controller invoice, directed prices and outer point
+
+The event census computes paid ranks from actual endpoint frame dimensions,
+checks physical scalar tariffs and reads the literal p16 controller. It obtains
+64,148 paid jobs and 10,800 productive fields for each word. Relative to the
+source controller it removes 128 H1 and 128 H8 paid calls and surrenders all
+128 H9 productive targets; the rank surplus remains 752. This is a complete
+controller invoice, not eight added local savings. It includes main, idle,
+query and completion terms. See reports/prices/REPORT.md.
+
+A fresh independent fixed-point rational interval engine uses directed rounding
+at 10^-65, an atanh logarithm series and exponential Taylor remainder. It checks
+the actual signed moments, unique fixed-profile crossing, both completion tails,
+strict alpha reserve, eta/complement capacity and splitting. It independently
+recomputes both candidate parameter choices; source-identical profile reuse is
+justified by the separate literal event censuses. The raw crossing is strictly
+between .00302667476807 and .00302667476808. This is a ceiling for this exact
+invoice, not an optimum over native constructions or relation systems.
+
+| Quantity | PR5383 | PR5387 |
+| --- | --- | --- |
+| Tested complex saving | .00302667 | .003026674766 |
+| Reserved alpha slack | 1e-9 | 1e-12 |
+| Tensor exponent / cutoff / floor | 1024 / 20 / 21 | 1024 / 20 / 21 |
+| Outer gap | 1/700000000 | 1/7000000000000 |
+| Least winning j on stated sufficient grid | 44836 | 58507 |
+| Compiler H, N=2^H | 31385200000000 | 409549000000000000 |
+
+The new rational outer engine derives all 54 strict and four functional rows
+from its own exact parameter family, checks all positive, and independently
+finds the winning compiler integer and failure at the preceding sufficient-grid
+index. It compares author parameter records only after fresh computation.
+Ordinary BIT is source-bound to 17/5000=.0034 with the exact unchanged ABI;
+its native/interface admission is retained, not replayed. The compiler threshold
+is an algorithmic finite specification. The enormous expanded word is not
+materialized. See reports/outer/REPORT.md and reports/applicability/REPORT.md.
+
+The author engines' separate normal/optimized cold replay evidence is an
+external execution gate. This review's own replay independently recomputes the
+invoice, directed moments and outer predicates; it does not promote author
+RESULT status labels into a premise.
+
+## Effective expanded bounds and exact physical domain
+
+The detailed construction and strong-induction proof are retained in
+reports/applicability/REPORT.md, with exact canonical FINITE-PRECOMPILATION and
+FINITE-TEMPLATE-CLOSURE notes under capsule/repository. For the explicitly chosen
+integer batch clearing, sequential base kernels, full routes and separately
+tagged owned banks, define
+
+```
+D = 2^262144
+F(0) = D
+X_n = (n+1)*(D+1)*(F(n-1)+1) (n>=1)
+F(n) = X_n^(16*(n+1)^2) (n>=1)
+N = 2^H, M = F(N)
+Wbar = Pbar = Obar = Rbar = Gbar = M
+Zbar = 2*M
+Ebar = 64*(Zbar+N+Pbar+Gbar+1)^3
+Bbar = Pbar+Ebar
+C0bar = 32*N*Bbar^2
+```
+
+These are terminating integer recursions and fixed finite constants, with
+candidate-specific H. D pays the squared complete role inventory and rank-router
+factors of the strictified 1024-fold unit. For top rank n, there are at most
+(D+1)^(2n+2) mixed-unit instances; product clearing over distinct smaller widths
+is at most F(n-1)^(n-1). Expanded incidence fits X_n^(3n+5); routing and coefficient
+height fit X_n^(9n+20). For every n>=1,
+16(n+1)^2-(9n+20)=16n^2+23n-4>=35, proving the strong induction. The finite probe
+of this inequality corroborates the algebraic proof; it does not replace it.
+The raw 181098496 bound is never reused as the expanded cap.
+
+The actual W/P still determines efficiency; enlarged envelopes create no
+productive outputs. The fresh semantic recurrence is
+A(e)<=A(floor(e/N))+Pbar*floor(e/N)+Ebar, with elementary leaves <=8e.
+It gives A(e)<=2*Bbar*e and complete-layer height below C0bar*d. The actual
+identity at zero retags propagates residual error through this changed program;
+there is no artificial numerical reset at a symbolic zero.
+
+For d<=c*p^(a/b), choose
+Lprec=bit_length(4*C0bar*ceil(c)),
+tprec=max(4,ceil(b*Lprec/(b-a))) and p_prec=2^tprec.
+For p>=p_prec the retained fine-grid prescription uses at most 2p bits per signed
+component. Fixed-tape class restrictions remain f<=p, A=O(p),
+K/log(p)->infinity, complete compact/control fields, restored dirty temporaries
+and the source superpolynomial record fiber. Their asymptotic domain-entry
+threshold remains the retained premise where no numerical growth rate is given.
+
+With Dord(e)=0 below N and 1+Dord(floor(e/N)) otherwise, reserve complex stock
+[Wbar*(Obar+1)]^Dord(d), **multiply** it by simultaneous BIT stock, and pad once
+to the full product. For retained BIT coefficient L_BIT, define
+Lstock=ceil(log2 Wbar)+ceil(log2(Obar+1))+L_BIT+2.
+Above d>=2^(2*(Lstock+2)), the combined reserve uses fewer than d/4 complete
+chunks; padding costs a factor below 2. Include stopping, precision, movement
+and descriptor cutoffs in the final maximum. This pays all suspended banks and
+preserves the retained movement exponent and spectator restoration.
+
+## Independence, controls and invalidation
+
+No new engine imports an author native, price, interval or endpoint evaluator.
+The only cross-engine import is the independent algebra implementation used by
+the actual-word semantic falsifier. The wrapper runs both exact words separately,
+then checks fresh coverage fields and source/K/payload identities. Fresh result
+files do not enter the frozen input inventory and cannot form a hash cycle.
+The normal/-O schedule is identical, with explicit optimization propagated to
+every scientific subprocess and fresh bytecode caches before scientific imports.
+
+Independent controls cover preparation sign/coefficient/pivot, wrong saved row,
+wrong COPY gauge, omitted relation, arbitrary owned dirt, missing owner returns,
+source chronology, borrowed erasure, storage alias, productive credit, extra H1,
+reserve, compiler grid and outer boundary failures. Six actual-word mutants
+recompute their payload digests and reach the mathematical parser directly;
+rejection is not an old-digest comparison. Source and headline mutation controls
+separately exercise the working-input guard and offline Git membership binding.
+
+An early algebra parser rejected legal signed-denominator SCALE [2,-1]; sign
+normalization corrected that checker defect before the frozen successful runs.
+Early applicability/falsifier resource failures and the wrong-marker parser
+attempt remain reported as implementation failures, never candidate evidence.
+Source phase, ordinary BIT native construction, physical precision/tape execution,
+analytic decomposition, prime avoidance and integer recovery are reused in
+explicit quantified domains. This is not an unconditional theorem, Lean/kernel
+verification, independent human acceptance, selected promotion or practical
+speedup. Any relevant word, native factor, ownership, invoice, parameter,
+scientific engine, source pin or premise edit invalidates its dependent replay.
diff --git a/research/joint-relations-independent-validation/README.md b/research/joint-relations-independent-validation/README.md
new file mode 100644
index 0000000000..a0c5845494
--- /dev/null
+++ b/research/joint-relations-independent-validation/README.md
@@ -0,0 +1,101 @@
+# Independent validation of the joint eight-relation words
+
+This package is being assembled for the exact Ali Romman PR5383 head
+`4bd6efa51a495a7c7b7754915cf0244e7e60969e` at conditional κ `.00302666`
+and Dugongue PR5387 head `b1ab650d36f59e5be682a813145b7c67e219e341`
+at conditional κ `.003026674765`. The separate independent algebra, exact owner, invoice, directed-price,
+applicability and outer checks passed for both words. The first full package
+cold replay passed all eight fresh commands; final committed-byte/export
+transport and acceptance remain separate root gates.
+
+The contribution is an independent validation, with newly implemented algebra,
+owner/frame parsing, event invoice, rational prices and outer predicates. Ali
+Romman retains the public eight-relation construction credit. Dugongue retains
+the separately ordered literal word and tighter completion/compiler reserve
+application. Equal 64,148-paid / 10,800-productive histograms do not establish
+equal word semantics: the eighth pivot is 288 in PR5383 and 261 in PR5387.
+Both exact words require separate source identities and ownership specialization.
+
+The selected baseline is the frozen canonical-main `.0030217758` record at
+`1ec1119972c9aefe42525172d07b332fcff81cb4`. This package changes no selected
+record. It claims no unconditional multiplication theorem, new native mechanism,
+human acceptance or practical speedup.
+
+## Reproduction
+
+Run from the repository root with standard-library Python 3.12:
+
+```sh
+python3 -B scripts/research_package.py --package research/joint-relations-independent-validation
+```
+
+The registered manifest runs normal and optimized replays. Direct commands for
+explicit receipt destinations are:
+
+```sh
+python3 -B research/joint-relations-independent-validation/verify.py --output /tmp/joint-normal.json
+python3 -O -B research/joint-relations-independent-validation/verify.py --output /tmp/joint-optimized.json
+```
+
+The standalone verifier authenticates both helper modules before import, rejects
+missing/symlinked/mutated working inputs and wrong claim/head/payload/premises,
+then copies the minimal capsule into a private scratch tree. It creates fresh
+bytecode caches, propagates explicit optimization to every child and runs the
+eight scientific commands serially. After copying a read-only export, it sets
+only the new private scratch directories to mode 0700 so caches and regenerated
+outputs can be created; frozen/exported source bytes and permissions stay
+unchanged. Fresh outputs are parsed for exact source bindings and complete
+scientific coverage; a child exit code alone is insufficient. It uses no runtime Git reader or Git-blob fallback. Normal and
+optimized executions remain separate recorded runs. Receipt destinations must
+be outside the package and free of symlink/hardlink aliases. Cold receipts stay
+outside frozen inputs, avoiding a source-hash cycle.
+
+`SOURCE-BINDINGS.json` declares every package-local input with raw digest,
+compressed-payload digest where applicable, original head/path/blob and offline
+commit/tree membership proofs. `VERIFY.json.inputs` is empty because no runtime
+input lies outside this package; its package-local inventory is explicit and
+all package changes already trigger registered replay. The full capsule is
+about 2.3 MB and retains the selected 31-file phase proof/reuse closure rather
+than the historical research archive.
+
+The first normal package replay completed all eight fresh commands in 23.47 s
+under the root 1 GiB serial guard. That receipt predates the final bootstrap
+helper hash check and is evidence for its exact pre-bootstrap wrapper only.
+Final registered normal/optimized and committed/exported-byte receipts are
+external publication gates. Engine bytes and mathematical input payloads are
+unchanged. See the source/verification limits in `PROOF.md`.
+
+## Same premises and proof scope
+
+The five literal retained premises are in `CLAIMS.json`: native all-column
+operators and phase conventions; owned allocation/erasure; uniform finite
+mixed-target compiler closure; precision and fixed-tape storage/movement;
+analytic, prime and exact-recovery transfer. `PROOF.md` maps their exact
+applicability to the new fixed templates and include computable expanded
+majorants. The enormous compiled word is specified algorithmically and is not
+materialized.
+
+Source-identical phase factors and previously admitted framework propositions
+are reused with exact hashes and domains. This does not rerun absolute-phase
+lowering, ordinary BIT construction or analytic integer recovery. PR5384's
+single-relation proof cannot establish this package's joint rank, simultaneous
+preparation, 17-bank local ownership, endpoint or complete invoice.
+
+## Open next questions
+
+Structured questions, relevance, first steps and blockers are in `TASK.json`.
+The principal open task is independent closure of the five retained premises.
+Any further relation search must supply a changed complete bill and its full
+physical/compiler applicability rather than add local savings.
+
+## Credit and license
+
+Prepared for Chris R / Clear1nsight with substantial OpenAI Codex assistance.
+Ali Romman supplied PR5377/PR5383's public helper-relation mechanism; Dugongue
+supplied PR5387's separately priced compiler-margin refinement. Retained credit:
+Cao Yifan (PR4610); Chris R (PR5241/PR5384 independent review); Cinna Davis
+(PR4470 p16 controller); zxv (completion/compiler); Jacob Alan Sussman
+(mixed-target recursion); Dugongue (transported frames); ToikY and the retained
+native, Clifford, BIT, precision and analytic contributors. Source-specific
+credits and notices remain in the exact vendored files. Apache-2.0 under the
+repository LICENSE.
diff --git a/research/joint-relations-independent-validation/SOURCE-BINDINGS.json b/research/joint-relations-independent-validation/SOURCE-BINDINGS.json
new file mode 100644
index 0000000000..e590a363e9
--- /dev/null
+++ b/research/joint-relations-independent-validation/SOURCE-BINDINGS.json
@@ -0,0 +1,1292 @@
+{
+ "candidate_claim_records": {
+ "5383": "capsule/repository/research/kappa-joint-relations-20261023/RESULT.json",
+ "5387": "capsule/agents/sources/pr5387/research/eight-owned-relations/RESULT.json"
+ },
+ "candidate_words": {
+ "5383": "capsule/repository/research/kappa-joint-relations-20261023/WORD.json.gz",
+ "5387": "capsule/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz"
+ },
+ "canonical_main": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "files": [
+ {
+ "bytes": 2301,
+ "path": "CLAIMS.json",
+ "role": "bootstrap_helper_or_claim_and_command_contract",
+ "sha256": "def444a7c84d8d3da1d43117a351eba4ebcffcbf9be01f804a089c16d6b90fea"
+ },
+ {
+ "bytes": 2354,
+ "path": "COMMANDS.json",
+ "role": "bootstrap_helper_or_claim_and_command_contract",
+ "sha256": "a1137cf53296d6b56db2a785a1e923e4b807e799e1de41a911353ed5e7aa0433"
+ },
+ {
+ "bytes": 17804,
+ "path": "capsule/agents/algebra/check_joint.py",
+ "role": "new_independent_scientific_engine",
+ "sha256": "3ee4ae79a55188d5abf2306f678179f4aafb799602ffb970fc1bc8f76cb061d9"
+ },
+ {
+ "bytes": 9747,
+ "path": "capsule/agents/applicability/check_applicability.py",
+ "role": "new_independent_scientific_engine",
+ "sha256": "07d09997ad1e0cf3b16a7a0dc152dcd4305c91b6c5fa8e9a5985f69f44277873"
+ },
+ {
+ "bytes": 4781,
+ "path": "capsule/agents/falsifier/check_mutants.py",
+ "role": "new_independent_scientific_engine",
+ "sha256": "326a813b2373502cfaf179de89a9a2736a82413e40b26b52f8681495e5fd4359"
+ },
+ {
+ "bytes": 9832,
+ "path": "capsule/agents/outer/check_outer.py",
+ "role": "new_independent_scientific_engine",
+ "sha256": "6338e7c30403f2077ec1c3397db05707c26fa0dd811c7863b6d84b288fb484ac"
+ },
+ {
+ "bytes": 16997,
+ "path": "capsule/agents/ownership/check.py",
+ "role": "new_independent_scientific_engine",
+ "sha256": "69ab58e41ccf548d68d24c45b673ed9918e22845d5d819588d431eb7807eff24"
+ },
+ {
+ "bytes": 16122,
+ "path": "capsule/agents/prices/check_prices.py",
+ "role": "new_independent_scientific_engine",
+ "sha256": "e5f828e06b896723da4b58ca8c780609b8b94bde374a2ffeda1cab143323a335"
+ },
+ {
+ "bytes": 1894,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "49b35d3fec3960c29b88f974b19e29b2bf487355",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/CLAIM.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/CLAIM.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "4f0f13fb4cd2b30fb52716df3e7299846dc6d11bbd207f2107bc6b06a9b18b61",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 282091,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "7b46f38ceee3152f753a13157852fdaaf60c31aa",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/FIRST-COLD-REPLAY.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/FIRST-COLD-REPLAY.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "0b37e1741af786144e1eb78a752bee65424437107c5065181d8a28e05ec30122",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 488,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "ab99b0d3c93b512ca5add19712d2c541e1abf90c",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/LOCAL-INPUTS.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/LOCAL-INPUTS.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "d3d5d8dd4037112c5952dc91e5d1287a13cf7c26927cd37fd446785e3a07a749",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 125818,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "73fa3ced93981949ad8f2432af840b787d9182c0",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/PAID-CATALOG.jsonl.gz",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/PAID-CATALOG.jsonl.gz",
+ "payload_sha256": "dc47d96b5b651ba3446d73ac0710152f7de88547a0cb2bbd75706e691b6f0bd6",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "964aa2e28057936825a67872ebe5c6b0abc3228e71a545dda6c1fc11adb983d5",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 14291,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "cc71e69b34835eff261b6073606dd585355e442c",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/PROOF.md",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/PROOF.md",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "e573cbbe6fa5481c0533e773de404e10f4dc7907b5ebfe404bdcd02dcf9844d8",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 8212,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "c70c1b436bbd1130332f737c2efab193674e8672",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/README.md",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/README.md",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "df5a03f28c64e2de5d0b0000d1fe93ced20d99b9e99bbc1fa97432f783848f13",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 13513,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "cf40c4d94f11f1058cfd2d04388dbba72051c1fe",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/SOURCES.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/SOURCES.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "25fed1fae88cffefc64cdecf8114718f4f4bcff1ef11e69e7556b8f40110e9a6",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 19802,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "7ee84b30892f7354e1c36611f1a5e9b082dc6147",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/SPECIALIZATION.md",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/SPECIALIZATION.md",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "70430114f744108223bc1d44b98bc25b696c4b408b7b044c2a8bbdfdb434ac5c",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 6649,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "761b7c6ba0684f62bc92a2106515ac24ac61fea9",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/TASK.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/TASK.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "0697507662d6f33633bff5a509122b2c977a82644d758f8282f139e3e24bc8d2",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 1633,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "dfb812803040ae38aafb0c32a522161b6e1414e2",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/VALIDATION.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/VALIDATION.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "e596d5cbe89e5688b16e0a3dd3b9f2dbe867d5e1be67f0186b2afb6a9d0b234e",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 3583,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "8f4e95ea81bfd210d79ef2312247e92d0ecc7837",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/VERIFY.json",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/VERIFY.json",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "3beda8479a0db2a01732a860b7299e05aecc35235943eacd494f179270f3cfc0",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 142,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "b8e75050ef87853ca5950ff8a9ff9b6b36d4cc3c",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/__init__.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/__init__.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "0af9ca16983533aa5fcb9dbcfbbd6f91c6200c93f69515703c9d340f24fed748",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 9219,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "04d5a7427a55761a25a915d38b3e92e6ba9a14cc",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/all_helpers.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/all_helpers.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "7bc813bbd400f851dcb0137ad31d53e7044f33d3a6cb729c60b070fddab0d1ef",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 3109,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "407d9389ff973ff3900dea8b8ed3439cc8630edc",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/arithmetic.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/arithmetic.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "d67b2f665d4cc9ee49ca20af88a06ac2c971923b6a3a7d2b22bfc19c296ca8b5",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 1371,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "dc76e295f2504df68d26428b3aee2af0527c3302",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/census_controls.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/census_controls.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "35fb546ef060a56539be3ac0eaba9d36405bd10803a7829933bd45699c2873ea",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 3509,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "43daf7c305f1fe62ef99f3920b2cb7ed1d83aac6",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/claim.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/claim.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "86bf973f21b6bb1fe54b5dc83b89264e0b406d0ff1a6f686133c055a9752f39a",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 10669,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "6a6f9373fe33d20e6aa7588ddcf86dde6a33a26a",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/compiler.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/compiler.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "4ec862afb1b0c18cecebec9b04d692be37083da64814da79ad692da96fd62bb5",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 2019,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "80a91d0a31bb64f662a7bed1eca90096e3b2cd69",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/frame.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/frame.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "0ef2fa6794ccdc5895a7b72ff318b1f0b56da933ef829705f98ac6d35ee17bcf",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 11245,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "57e54de4a09f6d4e7aba96856a6c29c4b131a13d",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/helpers.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/helpers.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "a6516b310c41a07db9a83f1444c9ae63295286acdb5a5e3eb561bef46cdb22ce",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 3946,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "f33ac0d326d20b8b8422ded0fdae49acff16fbe9",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/independent_clifford.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/independent_clifford.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "4953e06bd3837fa414372a62f2de57711854353e3a6ac6cea94e4c18ae42ea87",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 9584,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "142f3db7796f9be8d58a0c14db747614f8b8b4ff",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/invoice.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/invoice.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "c0a9f90dfbbacec2d6d065986fad3c2b985361b9601d941ceb8296361311a60a",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 4513,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "ebe89f02c41853dd695d84629954d699f97b0cc9",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/lift.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/lift.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "5ca85c008be87d6b49ba24f7928f3f6cc9558d5342119a5e715abf28326ac9fa",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 3561,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "9ad2be9453dda7cb1f4cb2483a17c190272a9ec8",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/lineage.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/lineage.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "7eb01f6125dd65fad0aa404055b0ed3f0609cce01e3d407f5089e4d5f0ac9dbb",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 6502,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "21abd93594516dad073e40b658c6c37084db2c5f",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/moments.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/moments.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "4de41cb8cff88de815f47b634709ef819f822544a03a66ae35c0bea76e5d94c9",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 10090,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "0545a57fc35f6109cbb3bc06e0934d40777c2890",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/native.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/native.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "49b3560fd1baefd3ac986854844d399f1d180f8fd96724b0c3b2065e98a44523",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 3468,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "39e62cac780b662903582cb5f8684990fa779bb3",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/outer.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/outer.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "196be1bc2329500f2c7c995deaf5a82aecc5e27f0fef7805470cb65d187bb1c0",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 9184,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "b9740fa217e545f67e289ae89c75a2a6b492692e",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/paid.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/paid.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "4c6ff3312440ec3ef0c3e2649a1d2dae0f81ef09a8c65b46866775b56be79907",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 4545,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "d17583cd64d9e8c4d1ab2e61cd557bd0bd5037c9",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/source.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/source.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "7b519f0d9326b630c142630fec55a6a8b03a7b2dee7f4fcb2ca68564c4e04e53",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 13855,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "4fe827ec0ea0b30c8749e8e476b5257fd292c1b1",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/checks/specialization.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/specialization.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "a4baf55b462bff8a1f4b9d49d928ff88018792710a1c36b87f859093969921d6",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree"
+ ]
+ },
+ {
+ "bytes": 1133,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "39eaf03f00c5d7e02795112afbd3364386564fca",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/regenerate_paid.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/regenerate_paid.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "3ccd4bc6022f96b863c4611907640a04cecdb0f69ea6c1e9b23c8c88c9eea7e4",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 3687,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "1879aeffa158e5efa74e920fb3d326eb573b1f4e",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/final4610-independent-admission/verify.py",
+ "path": "capsule/agents/sources/pr5241/research/final4610-independent-admission/verify.py",
+ "role": "authenticated_historical_phase_reuse_closure",
+ "sha256": "94ae718a0b5db7f91550c352a4b573edbf62d16aaa925cf250f01b4b8c15edeb",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree"
+ ]
+ },
+ {
+ "bytes": 9358,
+ "commit_object": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "git_blob": "17901a8af82a17135f8414fa592c63c65d85a785",
+ "git_mode": "100644",
+ "origin_commit": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "origin_path": "research/eight-owned-relations/README.md",
+ "path": "capsule/agents/sources/pr5387/research/eight-owned-relations/README.md",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "5d5f033c82a8ed8b7e9c3fe3d3f18f559f4f651bb11d0e6a2c916e244777fb99",
+ "tree_objects": [
+ "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree"
+ ]
+ },
+ {
+ "bytes": 14772,
+ "commit_object": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "git_blob": "2e13818df03e9fd93b9e13ada8663646ec948572",
+ "git_mode": "100644",
+ "origin_commit": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "origin_path": "research/eight-owned-relations/RESULT.json",
+ "path": "capsule/agents/sources/pr5387/research/eight-owned-relations/RESULT.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "34ad456c1f98f7f8c361d63539ef26d75dad8ffb3444edf29652372acabf1aaf",
+ "tree_objects": [
+ "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree"
+ ]
+ },
+ {
+ "bytes": 3665,
+ "commit_object": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "git_blob": "71c57c8a90585da602b8df163d582e7c77949c00",
+ "git_mode": "100644",
+ "origin_commit": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "origin_path": "research/eight-owned-relations/SOURCES.json",
+ "path": "capsule/agents/sources/pr5387/research/eight-owned-relations/SOURCES.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "3b1536861c5b6990966ad5107f3a619f5d9da548f3c4eaa454ec32341e640dd3",
+ "tree_objects": [
+ "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree"
+ ]
+ },
+ {
+ "bytes": 5444,
+ "commit_object": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "git_blob": "8b9df431cc81487d1993dc1babb39dd466abfd59",
+ "git_mode": "100644",
+ "origin_commit": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "origin_path": "research/eight-owned-relations/TASK.json",
+ "path": "capsule/agents/sources/pr5387/research/eight-owned-relations/TASK.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "e3d0ee26c8b6a409be30b83aada3a2c3d1b332408a59307733f4299c940ff8b8",
+ "tree_objects": [
+ "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree"
+ ]
+ },
+ {
+ "bytes": 1298,
+ "commit_object": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "git_blob": "8098df4c806a6c6e9e2be7253ba4101744dab08d",
+ "git_mode": "100644",
+ "origin_commit": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "origin_path": "research/eight-owned-relations/VERIFY.json",
+ "path": "capsule/agents/sources/pr5387/research/eight-owned-relations/VERIFY.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "1fc62a3afd087aa63f8d993beb1cba944b9b441824cd14e9135e792fcd45bab8",
+ "tree_objects": [
+ "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree"
+ ]
+ },
+ {
+ "bytes": 207423,
+ "commit_object": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "git_blob": "c62fcb59643f87919208100517a2fbc4b57cb7d7",
+ "git_mode": "100644",
+ "origin_commit": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "origin_path": "research/eight-owned-relations/WORD.json.gz",
+ "path": "capsule/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz",
+ "payload_sha256": "9aa0d7112b4e13f1aa13a93dab0af6f4435ffe99b842aad841685becdafee492",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "6412632c28e265597fb088087048091d81c19500fb28a0c9c9d2a48f61b8665b",
+ "tree_objects": [
+ "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree"
+ ]
+ },
+ {
+ "bytes": 5495,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "b288ae44032fd84dd5564243422836cbcd29835e",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "certificates/selected-result.json",
+ "path": "capsule/repository/certificates/selected-result.json",
+ "role": "runtime_input",
+ "sha256": "f9ed52bb642cd1e1486cf2743557ac5fa23cf1514a3277d786a644e39a565038",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/92bd281a274191242f183544f5ebab24b7f61127.tree"
+ ]
+ },
+ {
+ "bytes": 8277,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "bf5ff049da5fa07f9bf71176dfafe3343b7ac93d",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md",
+ "path": "capsule/repository/docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md",
+ "role": "runtime_input",
+ "sha256": "b84f833e3072cbab372fbda2ece98fbc031c15e590cf73003ddea35a5222e148",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/258aaa876ecb530c4c173c8e3ef93ccf87c81673.tree",
+ "custody/git-objects/e9c70b9927d6e9233633e4e88108f831e7c5c5d9.tree",
+ "custody/git-objects/02fdbbad293e674b3e2300ee89b37ed4dc623f6f.tree",
+ "custody/git-objects/ca6f51bb3b6474cfa4111ebafa02b1913a807446.tree"
+ ]
+ },
+ {
+ "bytes": 9907,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "69c337a7704ce589798269ab4b8606189c070c4e",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/free-word-tensor-lift-audit/PROOF.md",
+ "path": "capsule/repository/research/free-word-tensor-lift-audit/PROOF.md",
+ "role": "runtime_input",
+ "sha256": "cc8ad3698a673fb225419a3636a39aa99a66c7a0676f12e329b1e76564fa1459",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/8bed1ecc75af648c4b5fbf888b902e89ea94de00.tree"
+ ]
+ },
+ {
+ "bytes": 57924,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "49a2f0675819f9deeea27ed77be2c2b6ff2e87e5",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/joint-helper-lattice/CONTROLLER.json",
+ "path": "capsule/repository/research/joint-helper-lattice/CONTROLLER.json",
+ "role": "runtime_input",
+ "sha256": "1f5d6aa267e4e66048818714b5d3b5eae17a58abe91d15deeaa34574f7391a5f",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/93c3da5da0a527baf42dbbe76e7af010384def87.tree"
+ ]
+ },
+ {
+ "bytes": 16479,
+ "commit_object": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "git_blob": "d0593a46e89eb63a533968cd6bc1d2a129f3c22e",
+ "git_mode": "100644",
+ "origin_commit": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "origin_path": "research/kappa-joint-relations-20261023/README.md",
+ "path": "capsule/repository/research/kappa-joint-relations-20261023/README.md",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "899027b74219ece1832d711e27def50eb49994cd28ede4fedcdd0bd0f2574c64",
+ "tree_objects": [
+ "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree"
+ ]
+ },
+ {
+ "bytes": 22334,
+ "commit_object": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "git_blob": "b6c9cd0da1889ed92f3f1066127a203246f303d8",
+ "git_mode": "100644",
+ "origin_commit": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "origin_path": "research/kappa-joint-relations-20261023/RESULT.json",
+ "path": "capsule/repository/research/kappa-joint-relations-20261023/RESULT.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "d6a99bd75c6b7a2146b0fc4cfa038890aaf1d4adcdef42d767fdb40b687e61aa",
+ "tree_objects": [
+ "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree"
+ ]
+ },
+ {
+ "bytes": 3665,
+ "commit_object": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "git_blob": "71c57c8a90585da602b8df163d582e7c77949c00",
+ "git_mode": "100644",
+ "origin_commit": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "origin_path": "research/kappa-joint-relations-20261023/SOURCES.json",
+ "path": "capsule/repository/research/kappa-joint-relations-20261023/SOURCES.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "3b1536861c5b6990966ad5107f3a619f5d9da548f3c4eaa454ec32341e640dd3",
+ "tree_objects": [
+ "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree"
+ ]
+ },
+ {
+ "bytes": 5801,
+ "commit_object": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "git_blob": "5b57a9e8233575c97042b774a8ee3881e6ece6f7",
+ "git_mode": "100644",
+ "origin_commit": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "origin_path": "research/kappa-joint-relations-20261023/TASK.json",
+ "path": "capsule/repository/research/kappa-joint-relations-20261023/TASK.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "4d536a9bd6162b64ecf7bba20bec35fa0ca8fe61abf8e1404cd010b58de07a3d",
+ "tree_objects": [
+ "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree"
+ ]
+ },
+ {
+ "bytes": 1298,
+ "commit_object": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "git_blob": "8098df4c806a6c6e9e2be7253ba4101744dab08d",
+ "git_mode": "100644",
+ "origin_commit": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "origin_path": "research/kappa-joint-relations-20261023/VERIFY.json",
+ "path": "capsule/repository/research/kappa-joint-relations-20261023/VERIFY.json",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "1fc62a3afd087aa63f8d993beb1cba944b9b441824cd14e9135e792fcd45bab8",
+ "tree_objects": [
+ "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree"
+ ]
+ },
+ {
+ "bytes": 207650,
+ "commit_object": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "git_blob": "a4a58afce144541603385e9bf4e0695c54eade7c",
+ "git_mode": "100644",
+ "origin_commit": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "origin_path": "research/kappa-joint-relations-20261023/WORD.json.gz",
+ "path": "capsule/repository/research/kappa-joint-relations-20261023/WORD.json.gz",
+ "payload_sha256": "2aee5e997df99726fc763e510d9cb69fbe4f86114dc8d2cd33ad26c6c462a21d",
+ "role": "literal_word_or_author_claim_provenance",
+ "sha256": "7883ba0faefc96505bb61ca7312d588fa22dfe2164050c817c1718b8fa28693a",
+ "tree_objects": [
+ "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree"
+ ]
+ },
+ {
+ "bytes": 207673,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "46d929df83817b85a5387bcdb9745e0627d6366e",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "path": "capsule/repository/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd",
+ "role": "runtime_input",
+ "sha256": "7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree"
+ ]
+ },
+ {
+ "bytes": 23356,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "ac77b78547d6dbf2e6bd102e1047c5b16c1bca88",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "path": "capsule/repository/research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "payload_sha256": "bc9de6d11fc3d5fb2141a1658785f2093ea1b735d34414ed15749df7d731b34e",
+ "role": "runtime_input",
+ "sha256": "6eae66ed3cfa8a1533e89b9660a57276908e6646640a12f8b1e3489f4ea1354b",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree"
+ ]
+ },
+ {
+ "bytes": 15898,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "4badb40f0919c515823cb07e44c6470d4d6469ca",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md",
+ "path": "capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md",
+ "role": "runtime_input",
+ "sha256": "4cb32f6b8e388ecf6ed41b5bbdeeb4539cb40c8424f194974afea58f7e0921e8",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree",
+ "custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree",
+ "custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree",
+ "custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree",
+ "custody/git-objects/d520959c0a8af33980dff881ed2cf6c4703bb338.tree"
+ ]
+ },
+ {
+ "bytes": 15369,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "9917ac5543608047fd368e5e75f0851310f53584",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/pr4359-p7-padding/source/research/kappa-rebuild/transfer-audit/FINITE-TEMPLATE-CLOSURE.md",
+ "path": "capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/transfer-audit/FINITE-TEMPLATE-CLOSURE.md",
+ "role": "runtime_input",
+ "sha256": "3f8508c63862dd83968bd30df91b08ba5afcee1e10db15ca546cdff0caef95d9",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree",
+ "custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree",
+ "custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree",
+ "custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree",
+ "custody/git-objects/308866b397e4296d95f7a55ad38313ec11c69f3b.tree"
+ ]
+ },
+ {
+ "bytes": 10237,
+ "commit_object": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "git_blob": "e0695152c98d727edfd0d2034b58a1c7e8682c0c",
+ "git_mode": "100644",
+ "origin_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "origin_path": "research/query-thinned-controllers/RESULT.json",
+ "path": "capsule/repository/research/query-thinned-controllers/RESULT.json",
+ "role": "runtime_input",
+ "sha256": "6ebfc8c0f09166f4834e9d7427410cb31aefff2cd4d4ce588c8e52c9c70e9a0f",
+ "tree_objects": [
+ "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "custody/git-objects/368780035287bad0b8e9cd1a9f7da73223dfa456.tree"
+ ]
+ },
+ {
+ "bytes": 341,
+ "path": "custody/CANDIDATE-COMMIT.raw",
+ "role": "source_custody_observation",
+ "sha256": "d1a49634694ac9f77010440e9da8bbcaec5abfac9c7c2e7ec142b93008b27039"
+ },
+ {
+ "bytes": 2411,
+ "path": "custody/CANDIDATE-FILES.json",
+ "role": "source_custody_observation",
+ "sha256": "e70ed297be022d50471506049c3db674c2d539712f8327b76f3096cd0097f758"
+ },
+ {
+ "bytes": 317,
+ "path": "custody/CANONICAL-COMMIT.raw",
+ "role": "source_custody_observation",
+ "sha256": "8fc74b8fe0be2ef8075db0f654579721bcaf73fa7f1744cb23fe086edc553716"
+ },
+ {
+ "bytes": 7977,
+ "path": "custody/PR5241-INVENTORY.json",
+ "role": "source_custody_observation",
+ "sha256": "82656ff69e81a0e466d4f4bd65c5dfe74b061a63b3a51d8927e5fbc20eab6350"
+ },
+ {
+ "bytes": 7613,
+ "path": "custody/PR5241-PHASE-REUSE.json",
+ "role": "source_custody_observation",
+ "sha256": "98a5fa3cee0aeea101676f0a05d045b8c4f7a953273456b798fd9495c24cd51b"
+ },
+ {
+ "bytes": 313,
+ "path": "custody/PR5387-COMMIT.raw",
+ "role": "source_custody_observation",
+ "sha256": "73c5b337305a1122b7d474f5ec1b74205bc169f51e34868b5cb40706a5263e00"
+ },
+ {
+ "bytes": 2981,
+ "path": "custody/PR5387-INVENTORY.json",
+ "role": "source_custody_observation",
+ "sha256": "52bff5a1fe9d1bd8b1621b8441da4ad91c768d2b753c581301ac9cb799e94c37"
+ },
+ {
+ "bytes": 4651,
+ "path": "custody/SOURCE-HISTORY.json",
+ "role": "source_custody_observation",
+ "sha256": "8b1fa9c7328e0e510f945b5f59a1d98fdab5e9645e634eab01d358af9569744d"
+ },
+ {
+ "bytes": 9907,
+ "git_object_sha1": "02fdbbad293e674b3e2300ee89b37ed4dc623f6f",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/02fdbbad293e674b3e2300ee89b37ed4dc623f6f.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "9f5e14586bed06cd212709f9c6152e61417f4607a8905c941637fc68a79e857f"
+ },
+ {
+ "bytes": 382,
+ "git_object_sha1": "0994002341ec20dbea467f4c19fb8d4300cb88cc",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "81ca588d7a603cc9845120e32ca2906322c8fda59335c4085b605b397e687c2f"
+ },
+ {
+ "bytes": 575,
+ "git_object_sha1": "19b1abce68e32239bd8ad6abf979584eb93ad269",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "b86777926b23d06339e922e520bb9d2aaa7eed869025b290ce7d8c046e013979"
+ },
+ {
+ "bytes": 317,
+ "git_object_sha1": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "git_object_type": "commit",
+ "path": "custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "role": "offline_git_membership_proof",
+ "sha256": "8fc74b8fe0be2ef8075db0f654579721bcaf73fa7f1744cb23fe086edc553716"
+ },
+ {
+ "bytes": 639,
+ "git_object_sha1": "258aaa876ecb530c4c173c8e3ef93ccf87c81673",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/258aaa876ecb530c4c173c8e3ef93ccf87c81673.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "32b88db989aaae9adf124ed59a8f391b8c7cc55175b3f191937c6d422b1e036a"
+ },
+ {
+ "bytes": 181,
+ "git_object_sha1": "2f0243de4ff0d29f087894edbf247327c5bae8e9",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "2ea587bae76140099f73e6042d0b4cc524ccebf5f87acb1d63efeb2a937912ce"
+ },
+ {
+ "bytes": 707,
+ "git_object_sha1": "2f781f177482200db6432209f21d8e7d662fbba3",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "9bb093aa1ad199128bce47b6f958cd19db7df0b8fce36070b184d4e9eeff2341"
+ },
+ {
+ "bytes": 196,
+ "git_object_sha1": "308866b397e4296d95f7a55ad38313ec11c69f3b",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/308866b397e4296d95f7a55ad38313ec11c69f3b.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "26330485f86d462abe32df5b51f7db47ae295dfba576da7e1b5d85345f4f9b49"
+ },
+ {
+ "bytes": 445,
+ "git_object_sha1": "368780035287bad0b8e9cd1a9f7da73223dfa456",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/368780035287bad0b8e9cd1a9f7da73223dfa456.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "ab3e8e7e9ac2eb4668ad34f9b2f31cec0303f2de62162728128be1cb02c4f78a"
+ },
+ {
+ "bytes": 797,
+ "git_object_sha1": "3e58974508669b0b52f53c56371b5f9c253ece4b",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "4785a00e3abd23489c2368faf23ff1a6d16a9713b8e08bd36c47e5af99022645"
+ },
+ {
+ "bytes": 219666,
+ "git_object_sha1": "46dca2d79105e0d899594be581275b404bc812cd",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "a2da6776db02103b2b825d10c1d2ccb47f17589f1f44975d8770c1942442d354"
+ },
+ {
+ "bytes": 341,
+ "git_object_sha1": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "git_object_type": "commit",
+ "path": "custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "role": "offline_git_membership_proof",
+ "sha256": "d1a49634694ac9f77010440e9da8bbcaec5abfac9c7c2e7ec142b93008b27039"
+ },
+ {
+ "bytes": 969,
+ "git_object_sha1": "6d2b3a87d39cf33569d1b1f8a7d6177af59bd524",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "e4410ed702d2606f40d86389d7639f20ace1dbae3a8b66ea8eb0f1b04a85c473"
+ },
+ {
+ "bytes": 35,
+ "git_object_sha1": "74e7c585a7f3c853a2927a5028db379ac86b4a34",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "ca82587f0e0a51caaf7a942cda7448f75e339bd39571f256f14d24a0f76458f1"
+ },
+ {
+ "bytes": 969,
+ "git_object_sha1": "7c8818178b05733b5d09a6decc34d53b84fdc213",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "8c929ae6900a027b095d7446ea2813f8f5eff20706966d211a6cabd104b793d7"
+ },
+ {
+ "bytes": 477,
+ "git_object_sha1": "87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "b2751ffc200196951f304e4fb45f000d68f922a353931925abebecc15e4cdf0b"
+ },
+ {
+ "bytes": 663,
+ "git_object_sha1": "8bed1ecc75af648c4b5fbf888b902e89ea94de00",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/8bed1ecc75af648c4b5fbf888b902e89ea94de00.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "29c18dc1e2792ca110b97790a9153826994ab4e2af59cf9f2e8e1ec8dd04bb86"
+ },
+ {
+ "bytes": 6799,
+ "git_object_sha1": "92bd281a274191242f183544f5ebab24b7f61127",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/92bd281a274191242f183544f5ebab24b7f61127.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "9925ce9ff27d85508b1493dad6f33b38a03350bb6985f17b55f58ecf0966313b"
+ },
+ {
+ "bytes": 599,
+ "git_object_sha1": "93c3da5da0a527baf42dbbe76e7af010384def87",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/93c3da5da0a527baf42dbbe76e7af010384def87.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "3764da0e59c2829d0e8b560feac19e71051d92411598a8abd46fa95b6f8fd7b9"
+ },
+ {
+ "bytes": 313,
+ "git_object_sha1": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "git_object_type": "commit",
+ "path": "custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "role": "offline_git_membership_proof",
+ "sha256": "73c5b337305a1122b7d474f5ec1b74205bc169f51e34868b5cb40706a5263e00"
+ },
+ {
+ "bytes": 219675,
+ "git_object_sha1": "b3abe1a63f80b453a11823d70c836b9199e7c556",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "0df25acffcf38c7c6690547dc0ab38c2cdc15d6593046ffdca8b575484c13531"
+ },
+ {
+ "bytes": 969,
+ "git_object_sha1": "bfb420045d2bc04dd026b5020aea84d547873ef4",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "aee24b16e5fb24053b230ed4a9b375251da522404f93402e7deacceeb9289b4c"
+ },
+ {
+ "bytes": 219618,
+ "git_object_sha1": "c211d4eb07730865bffd69a35a85a0642acc333d",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "dbfd9e35527f18d2342c82bccd407d99d7222e6ebd8f0db4cdb469b05b745d49"
+ },
+ {
+ "bytes": 526,
+ "git_object_sha1": "ca6f51bb3b6474cfa4111ebafa02b1913a807446",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/ca6f51bb3b6474cfa4111ebafa02b1913a807446.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "10d55a065b955681775731817a9619242ea69137125b88be1be2fd8b130e005d"
+ },
+ {
+ "bytes": 208,
+ "git_object_sha1": "d520959c0a8af33980dff881ed2cf6c4703bb338",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/d520959c0a8af33980dff881ed2cf6c4703bb338.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "be37540cce0416977753211ea760091f909b5300d7d7f8172ebfdb2905396416"
+ },
+ {
+ "bytes": 1307,
+ "git_object_sha1": "db06c76a46083783b675e5a5ce418c52a400d350",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "727b0999f3afd17b8756efdc2eec96e5d76f9fcab111db9031814b7fbfbd0d54"
+ },
+ {
+ "bytes": 93,
+ "git_object_sha1": "df0da6ab4433542c03f089e50eeaabacb89fa6a4",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "bbdcd341a480357712d3b4e4187a861c76a680be7334bdb80c4895f959806b62"
+ },
+ {
+ "bytes": 14144,
+ "git_object_sha1": "e9c70b9927d6e9233633e4e88108f831e7c5c5d9",
+ "git_object_type": "tree",
+ "path": "custody/git-objects/e9c70b9927d6e9233633e4e88108f831e7c5c5d9.tree",
+ "role": "offline_git_membership_proof",
+ "sha256": "22369b51a2b61cb47fb424394c7a9fac4f8ef81a1e29f4e9a6805892dbbba7e9"
+ },
+ {
+ "bytes": 5586,
+ "path": "receipt_guard.py",
+ "role": "bootstrap_helper_or_claim_and_command_contract",
+ "sha256": "67336a39205247ca3ad1639e29f2dfcdc334f8e8f68cc173e87cd58f80d6adda"
+ },
+ {
+ "bytes": 11581,
+ "path": "reports/algebra/REPORT.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "4a56a57c6ef5191c57b82c145fc253661cf26fb2555325b414fca6a954df3df2"
+ },
+ {
+ "bytes": 2297,
+ "path": "reports/algebra/RUN-REQUEST.json",
+ "role": "independent_proof_and_limits",
+ "sha256": "81e5dfaf34f43e4509ce094ca2f31bfaf575b75af419c11e50e157da109e20d8"
+ },
+ {
+ "bytes": 711,
+ "path": "reports/applicability/FOUNDATION-SOURCES.json",
+ "role": "independent_proof_and_limits",
+ "sha256": "217e64f025f1c4d2a985703eace4ac60bb8f9951453b5e613ba41cc0790945bf"
+ },
+ {
+ "bytes": 17224,
+ "path": "reports/applicability/REPORT.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "500080de09e17619d7e9b34ca910fc242fa6691d377d5af9f7fa3de8b529832b"
+ },
+ {
+ "bytes": 8546,
+ "path": "reports/falsifier/CODE-AUDIT.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "6ab315f9ac420aa23cc36c1eca30efdc74e5362ab232ff5b78d84ede89b3c209"
+ },
+ {
+ "bytes": 2274,
+ "path": "reports/falsifier/EARLY-FINDINGS.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "97712b703aec926caac82351047a7b64656df6d8fc2a30cc8cf023a1d034ae7c"
+ },
+ {
+ "bytes": 960,
+ "path": "reports/falsifier/RUN-REQUEST.json",
+ "role": "independent_proof_and_limits",
+ "sha256": "e691a9a645b2f1c07e8c874ece22673c8405d184dd61ee62729e0500ddeb56b9"
+ },
+ {
+ "bytes": 533,
+ "path": "reports/falsifier/SAME-FRAME-CONTROL.json",
+ "role": "independent_proof_and_limits",
+ "sha256": "ade262c1506f55baf9221112788e430a3058b0d5ecb35e2cc91113f1c03a238a"
+ },
+ {
+ "bytes": 8620,
+ "path": "reports/outer/REPORT.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "5131afd92d8feb8e3578d724cb7f45a7deea9ef327465af741e02ee00c0f0045"
+ },
+ {
+ "bytes": 5593,
+ "path": "reports/outer/SOURCES.json",
+ "role": "independent_proof_and_limits",
+ "sha256": "3de5130c6494cf0c644ec7cc06fec8255ffd6a7d2f7049a1ad758d81bbfe1503"
+ },
+ {
+ "bytes": 14887,
+ "path": "reports/ownership/REPORT.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "80bb8d3a6e7fbc224049baa95b38a49f8fb31aa2e6b320326a965efb53a848fc"
+ },
+ {
+ "bytes": 1839,
+ "path": "reports/ownership/RUN-REQUEST.json",
+ "role": "independent_proof_and_limits",
+ "sha256": "15208fac92c19b734b04e2f54b5dfd4bc39e72447a804a5ec30543095974d85f"
+ },
+ {
+ "bytes": 8838,
+ "path": "reports/prices/REPORT.md",
+ "role": "independent_proof_and_limits",
+ "sha256": "17e2097d2ebe908700e7d4677733755e4002dc05570f0584f45184456628b165"
+ },
+ {
+ "bytes": 8408,
+ "path": "source_guard.py",
+ "role": "bootstrap_helper_or_claim_and_command_contract",
+ "sha256": "9ef48a8b1fad7e391c8b585691d741c3c4642745aed36e00b5b65b0cf4cdac12"
+ }
+ ],
+ "schema_version": 1,
+ "selected_phase_receipt": "capsule/agents/sources/pr5241/research/final4610-independent-admission/FIRST-COLD-REPLAY.json",
+ "selected_record": "capsule/repository/certificates/selected-result.json",
+ "source_word": "capsule/repository/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "working_source_policy": "No runtime Git reader or object fallback; source custody occurs once during preparation and all replay data are actual authenticated working-file bytes."
+}
diff --git a/research/joint-relations-independent-validation/SOURCES.json b/research/joint-relations-independent-validation/SOURCES.json
new file mode 100644
index 0000000000..5559e48849
--- /dev/null
+++ b/research/joint-relations-independent-validation/SOURCES.json
@@ -0,0 +1,20 @@
+{
+ "schema_version": 1,
+ "base_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "files": [
+ {
+ "path": "docs/research/agent-task-catalog.json",
+ "usage": "provenance",
+ "git_blob": "f126dd2e2dad2b669e75d1d0d0bd05c600725602",
+ "sha256": "f7a48bfa2659b88378282a8eee7d9fe52cdf505594124c4d1686b58510fffd72"
+ },
+ {
+ "path": "certificates/selected-result.json",
+ "usage": "provenance",
+ "git_blob": "b288ae44032fd84dd5564243422836cbcd29835e",
+ "sha256": "f9ed52bb642cd1e1486cf2743557ac5fa23cf1514a3277d786a644e39a565038"
+ }
+ ],
+ "vendored_source_bindings": "SOURCE-BINDINGS.json",
+ "source_binding_policy": "Every actual runtime input is read from working bytes. Git provenance authenticates history; it never supplies a replacement for missing or mutated working inputs."
+}
diff --git a/research/joint-relations-independent-validation/TASK.json b/research/joint-relations-independent-validation/TASK.json
new file mode 100644
index 0000000000..2427c5c9e4
--- /dev/null
+++ b/research/joint-relations-independent-validation/TASK.json
@@ -0,0 +1,73 @@
+{
+ "schema_version": 1,
+ "task_id": "complex-new-helper-inventory",
+ "priority_revision": 7,
+ "base_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "original_card": {
+ "id": "complex-new-helper-inventory",
+ "question": "Can a new local cost interface change the deficit-to-recursive-cost ratio beyond current packing?",
+ "starting_points": [
+ "docs/research/research-family-status.md",
+ "research/complex-local-word-ceiling/README.md",
+ "research/heterogeneous-owner-assembly/README.md",
+ "certificates/selected-result.json",
+ "research/selected-k8-unrestricted-ends/README.md"
+ ],
+ "methods": [
+ "Propose a changed helper inventory and derive an optimistic exact moment.",
+ "Design a small completed instance and independently verify its endpoint and rank bill."
+ ],
+ "acceptance_gate": "A new physically realizable contract outside the frozen catalogue whose per-call profile, screened with ceiling.ceiling(), beats the selected word's packing ceiling; a lower cap does not establish identical circuitry or order attainable optima, and is insufficient to pass the stronger-budget target under this model. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.",
+ "first_step": {
+ "command": [
+ "python3",
+ "-B",
+ "research/complex-local-word-ceiling/verify.py"
+ ],
+ "expected": "PASS_COMPLEX_LOCAL_WORD_CEILING",
+ "inspect": "Read the selected word's per-call local profile, its packing ceiling and the lever table; run levers.py for the ideal budget of the lever you target.",
+ "scope": "Positive control and planning budget only; this is not a new construction or full cold replay."
+ },
+ "first_experiment": "Before any synthesis, write the candidate per-call local profile (and centre charge / unpaid coordinates if changed) and screen it with ceiling.ceiling(); reject it if even the ideal ceiling does not beat the selected word's by your stated margin.",
+ "bottleneck_link": "Packing of the selected word is capped at +0.87% (ceiling model); only a lower local excess spend or a changed coverage law raises the cap.",
+ "allowed_variations": [
+ "Narrow to one changed boundary or helper type with explicit counts.",
+ "If the coverage law, template or guard changes, derive an applicable fully charged replacement bound instead of applying the incumbent ceiling outside its scope."
+ ],
+ "scope_change_triggers": [
+ "Mixing only providers already inside the pinned catalogue.",
+ "Only changing helper terminal subspaces and monotone frames within the fixed scalar word, entrances and cleanup contract already covered by #1995/#2013.",
+ "Continuing a partial cost improvement while leaving the same unpriced consumer, restoration or central-readout obligation unresolved; refresh the family expansion decision first. Local product-retiming evidence has a narrow scope and is not a ban on changed graphs or contracts."
+ ],
+ "overlap_terms": [
+ "helper inventory",
+ "heterogeneous-owner",
+ "mutable leaver"
+ ]
+ },
+ "scope_status": "refined",
+ "actual_scope": "Independent complete same-premise validation of the two literal eight-relation words in PR5383 and PR5387; preserve separate algebra, ownership and compiler bindings.",
+ "scope_change_reason": "The construction authors requested independent review. A matched economic profile does not identify the changed eighth relation or its retained-domain proof.",
+ "bottleneck_link": "https://github.com/CrocSwap/integer-mult-bounds/pull/5383",
+ "budget_minutes": 240,
+ "stop_rule": "Freeze complete evidence and package only after the root scientific and acceptance gates pass; otherwise publish an explicit unresolved scope.",
+ "outcome": "completed",
+ "evidence": "PROOF.md; byte-identical six independent scientific engines; 111 offline-bound working-input files; root first normal cold replay passed all eight fresh commands. Final normal/optimized registered replay, committed-byte/export transport and acceptance remain root gates.",
+ "author": "Chris R / Clear1nsight",
+ "ai_assistance": "Substantial OpenAI Codex assistance in independent code, mathematical review, source custody, verification and packaging.",
+ "open_questions": [
+ {
+ "question": "Can the five retained transfer premises be replaced by independently checked all-size physical and analytic proofs?",
+ "why_it_matters": "This package is a same-premise conditional validation; finite source identities do not close the full multiplication theorem.",
+ "first_step": "Follow each premise and exact retained proposition in PROOF.md and the source-pinned applicability audit.",
+ "blocked_by": "The retained framework includes unrestricted native, compiler, precision/tape and analytic contracts."
+ },
+ {
+ "question": "Can a changed relation system improve this complete paid/productive profile?",
+ "why_it_matters": "The fixed-profile ceiling does not establish a global optimum or a new native construction.",
+ "first_step": "Refresh live claims, derive literal source identities and price every surrendered target and owned bank.",
+ "blocked_by": "All eight backward center jobs are already removed in this profile."
+ }
+ ],
+ "publication_transport_status": "Pending final registered normal/optimized, committed-byte/source-history/export and root acceptance gates."
+}
diff --git a/research/joint-relations-independent-validation/VERIFY.json b/research/joint-relations-independent-validation/VERIFY.json
new file mode 100644
index 0000000000..32866f81c3
--- /dev/null
+++ b/research/joint-relations-independent-validation/VERIFY.json
@@ -0,0 +1,142 @@
+{
+ "schema_version": 1,
+ "status": "ready",
+ "python": "3.12",
+ "requirements": [],
+ "inputs": [],
+ "commands": [
+ {
+ "argv": [
+ "{python}",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "Fresh independent word identities, ownership, event invoice, directed prices, applicability and outer arithmetic, conditional on five explicit retained premises."
+ },
+ {
+ "argv": [
+ "{python}",
+ "-O",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "Same replay with assertion optimization explicitly propagated to child engines; all scientific guards remain active."
+ }
+ ],
+ "input_inventory": "SOURCE-BINDINGS.json binds all package-local working inputs. The registered runner triggers on any package change; no runtime input lies outside this self-contained package.",
+ "package_local_inputs": [
+ "research/joint-relations-independent-validation/CLAIMS.json",
+ "research/joint-relations-independent-validation/COMMANDS.json",
+ "research/joint-relations-independent-validation/capsule/agents/algebra/check_joint.py",
+ "research/joint-relations-independent-validation/capsule/agents/applicability/check_applicability.py",
+ "research/joint-relations-independent-validation/capsule/agents/falsifier/check_mutants.py",
+ "research/joint-relations-independent-validation/capsule/agents/outer/check_outer.py",
+ "research/joint-relations-independent-validation/capsule/agents/ownership/check.py",
+ "research/joint-relations-independent-validation/capsule/agents/prices/check_prices.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/CLAIM.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/FIRST-COLD-REPLAY.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/LOCAL-INPUTS.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/PAID-CATALOG.jsonl.gz",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/PROOF.md",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/README.md",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/SOURCES.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/SPECIALIZATION.md",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/TASK.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VALIDATION.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VERIFY.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/__init__.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/all_helpers.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/arithmetic.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/census_controls.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/claim.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/compiler.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/frame.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/helpers.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/independent_clifford.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/invoice.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/lift.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/lineage.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/moments.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/native.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/outer.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/paid.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/source.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/specialization.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/regenerate_paid.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/verify.py",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/README.md",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/RESULT.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/SOURCES.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/TASK.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/VERIFY.json",
+ "research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz",
+ "research/joint-relations-independent-validation/capsule/repository/certificates/selected-result.json",
+ "research/joint-relations-independent-validation/capsule/repository/docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md",
+ "research/joint-relations-independent-validation/capsule/repository/research/free-word-tensor-lift-audit/PROOF.md",
+ "research/joint-relations-independent-validation/capsule/repository/research/joint-helper-lattice/CONTROLLER.json",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/README.md",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/RESULT.json",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/SOURCES.json",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/TASK.json",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/VERIFY.json",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/WORD.json.gz",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "research/joint-relations-independent-validation/capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md",
+ "research/joint-relations-independent-validation/capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/transfer-audit/FINITE-TEMPLATE-CLOSURE.md",
+ "research/joint-relations-independent-validation/capsule/repository/research/query-thinned-controllers/RESULT.json",
+ "research/joint-relations-independent-validation/custody/CANDIDATE-COMMIT.raw",
+ "research/joint-relations-independent-validation/custody/CANDIDATE-FILES.json",
+ "research/joint-relations-independent-validation/custody/CANONICAL-COMMIT.raw",
+ "research/joint-relations-independent-validation/custody/PR5241-INVENTORY.json",
+ "research/joint-relations-independent-validation/custody/PR5241-PHASE-REUSE.json",
+ "research/joint-relations-independent-validation/custody/PR5387-COMMIT.raw",
+ "research/joint-relations-independent-validation/custody/PR5387-INVENTORY.json",
+ "research/joint-relations-independent-validation/custody/SOURCE-HISTORY.json",
+ "research/joint-relations-independent-validation/custody/git-objects/02fdbbad293e674b3e2300ee89b37ed4dc623f6f.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit",
+ "research/joint-relations-independent-validation/custody/git-objects/258aaa876ecb530c4c173c8e3ef93ccf87c81673.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/308866b397e4296d95f7a55ad38313ec11c69f3b.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/368780035287bad0b8e9cd1a9f7da73223dfa456.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit",
+ "research/joint-relations-independent-validation/custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/8bed1ecc75af648c4b5fbf888b902e89ea94de00.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/92bd281a274191242f183544f5ebab24b7f61127.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/93c3da5da0a527baf42dbbe76e7af010384def87.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit",
+ "research/joint-relations-independent-validation/custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/ca6f51bb3b6474cfa4111ebafa02b1913a807446.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/d520959c0a8af33980dff881ed2cf6c4703bb338.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree",
+ "research/joint-relations-independent-validation/custody/git-objects/e9c70b9927d6e9233633e4e88108f831e7c5c5d9.tree",
+ "research/joint-relations-independent-validation/receipt_guard.py",
+ "research/joint-relations-independent-validation/reports/algebra/REPORT.md",
+ "research/joint-relations-independent-validation/reports/algebra/RUN-REQUEST.json",
+ "research/joint-relations-independent-validation/reports/applicability/FOUNDATION-SOURCES.json",
+ "research/joint-relations-independent-validation/reports/applicability/REPORT.md",
+ "research/joint-relations-independent-validation/reports/falsifier/CODE-AUDIT.md",
+ "research/joint-relations-independent-validation/reports/falsifier/EARLY-FINDINGS.md",
+ "research/joint-relations-independent-validation/reports/falsifier/RUN-REQUEST.json",
+ "research/joint-relations-independent-validation/reports/falsifier/SAME-FRAME-CONTROL.json",
+ "research/joint-relations-independent-validation/reports/outer/REPORT.md",
+ "research/joint-relations-independent-validation/reports/outer/SOURCES.json",
+ "research/joint-relations-independent-validation/reports/ownership/REPORT.md",
+ "research/joint-relations-independent-validation/reports/ownership/RUN-REQUEST.json",
+ "research/joint-relations-independent-validation/reports/prices/REPORT.md",
+ "research/joint-relations-independent-validation/source_guard.py"
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/algebra/check_joint.py b/research/joint-relations-independent-validation/capsule/agents/algebra/check_joint.py
new file mode 100644
index 0000000000..f546c04c16
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/algebra/check_joint.py
@@ -0,0 +1,310 @@
+#!/usr/bin/env python3
+"""Independent joint algebra audit. Standard library only; imports no author code.
+
+Chris R / OpenAI Codex independent checking of Ali Romman's construction,
+using Cao Yifan's source word. Rational rows use normalized dyadic integer
+numerators, not the author's per-coefficient Fraction implementation.
+"""
+import argparse
+import gzip
+import hashlib
+import json
+from fractions import Fraction
+from pathlib import Path
+
+HERE = Path(__file__).resolve().parent
+ROOT = HERE.parents[1] / 'repository'
+SOURCE = 'research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'
+CANDIDATE = 'research/kappa-joint-relations-20261023/WORD.json.gz'
+
+def require(ok, message):
+ if not ok:
+ raise ValueError(message)
+
+def norm(d, exponent):
+ d = {k: v for k, v in d.items() if v}
+ if not d:
+ return ({}, 0)
+ shift = min((abs(v) & -abs(v)).bit_length() - 1 for v in d.values())
+ shift = min(shift, exponent)
+ if shift:
+ d = {k: v >> shift for k, v in d.items()}
+ return d, exponent - shift
+
+def linear(a, b, numerator=1, denominator=1):
+ # Source rationals may carry the sign on either integer, including
+ # SCALE [2,-1]. Normalize the rational sign before dyadic validation.
+ if denominator < 0:
+ numerator, denominator = -numerator, -denominator
+ require(denominator > 0 and denominator & (denominator - 1) == 0, 'non-dyadic scalar')
+ exp_b = b[1] + denominator.bit_length() - 1
+ exp = max(a[1], exp_b)
+ d = {k: v << (exp - a[1]) for k, v in a[0].items()}
+ for k, v in b[0].items():
+ d[k] = d.get(k, 0) + numerator * (v << (exp - exp_b))
+ return norm(d, exp)
+
+def scaled(a, numerator, denominator):
+ return linear(({}, 0), a, numerator, denominator)
+
+def initial(role):
+ return ({(role, ()): 1}, 0)
+
+def warped(a, symbol):
+ # Left action: cancel only an adjacent inverse. Distinct symbols never
+ # commute and the scalar coefficient is kept outside the word.
+ d = {}
+ for (role, word), v in a[0].items():
+ key = (role, word[1:] if word and word[0] == -symbol else (symbol,) + word)
+ d[key] = d.get(key, 0) + v
+ return norm(d, a[1])
+
+def rational_row(row):
+ return {k: Fraction(v, 1 << row[1]) for k, v in row[0].items()}
+
+def rref(relations, preferred_pivots=()):
+ """Conventional matrix elimination, with fixed increasing column order."""
+ all_columns = {h for d in relations for h in d}
+ require(set(preferred_pivots) <= all_columns, 'prepared pivot absent from derived relation system')
+ columns = list(preferred_pivots) + sorted(all_columns - set(preferred_pivots))
+ matrix = [[Fraction(d.get(h, 0)) for h in columns] for d in relations]
+ rank, pivots = 0, []
+ for j, h in enumerate(columns):
+ k = next((k for k in range(rank, len(matrix)) if matrix[k][j]), None)
+ if k is None:
+ continue
+ matrix[rank], matrix[k] = matrix[k], matrix[rank]
+ q = matrix[rank][j]
+ matrix[rank] = [v / q for v in matrix[rank]]
+ for i in range(len(matrix)):
+ if i != rank and matrix[i][j]:
+ q = matrix[i][j]
+ matrix[i] = [a - q * b for a, b in zip(matrix[i], matrix[rank])]
+ pivots.append(h)
+ rank += 1
+ if rank == len(matrix):
+ break
+ return {p: {h: q for h, q in zip(columns, matrix[i]) if q} for i, p in enumerate(pivots)}
+
+def decode_edits(source, candidate):
+ """Read the literal word delta without WITNESS.json or expected outputs."""
+ old, new = source['programs']['backward'], candidate['programs']['backward']
+ j = next(i for i, e in enumerate(new) if e == old[0])
+ preparation = new[:j]
+ snapshots, centers, zeros = {}, {}, {}
+ for i, event in enumerate(old):
+ if new[j] == event:
+ j += 1
+ elif event[0] == 'center':
+ a, b, c = new[j:j + 3]
+ frame = event[3]
+ require(a == ['scalar', ['clear', ['C', 0]], frame], 'center clear')
+ require(b[0] == 'scalar' and b[1][:2] == ['copy', ['C', 0]] and b[2] == frame, 'center COPY gauge')
+ slot = tuple(b[1][2])
+ require(c == ['scalar', ['clear', list(slot)], frame], 'snapshot consumption')
+ centers[i] = {'slot': slot, 'frame': frame}
+ j += 3
+ else:
+ require(event[0] == 'climb', 'unexpected source edit')
+ role, oldframe, newframe = ('L', event[2]), event[3], event[4]
+ require(new[j] == ['zero_retag', list(role), oldframe, newframe], 'zero edit exact frames')
+ zeros[i] = {'role': role, 'frame': oldframe, 'rank': event[5]}
+ j += 1
+ if j + 1 < len(new) and new[j][0] == 'scalar' and new[j][1][0] == 'clear' and new[j][1][1][0] == 'C' and new[j][1][1][1] > 0:
+ a, b = new[j:j + 2]
+ slot, frame = tuple(a[1][1]), a[2]
+ require(b[0] == 'scalar' and b[1][:2] == ['copy', list(slot)] and b[2] == frame, 'snapshot COPY')
+ require(slot not in [x['slot'] for x in snapshots.values()], 'snapshot slot reused')
+ snapshots[i] = {'slot': slot, 'role': tuple(b[1][2]), 'frame': frame}
+ j += 2
+ trailing = new[j:]
+ require(len(snapshots) == len(centers) == len(zeros) == 8, 'eight of each edit')
+ require(len({x['slot'] for x in centers.values()}) == 8, 'eight independent snapshot slots')
+ require(max(snapshots) < min(centers), 'all eight snapshots simultaneously live')
+ for i, x in centers.items():
+ match = [k for k, s in snapshots.items() if s['slot'] == x['slot']]
+ require(len(match) == 1 and match[0] < i and snapshots[match[0]]['frame'] == x['frame'], 'chronological same-frame snapshot')
+ x['snapshot'] = match[0]
+ require(candidate['programs']['forward'] == source['programs']['forward'], 'unchanged entire forward word')
+ canonical = dict(source['canonical']); canonical.pop('local_profile')
+ require(candidate['canonical'] == canonical, 'unchanged actual native operators and frames')
+ return preparation, snapshots, centers, zeros, trailing
+
+def replay(canonical, program, owned, source_sites=None):
+ roles = {('L', i) for i in range(632)} | set(owned)
+ rows = {r: initial(r) for r in roles}
+ frames = {('L', i): f for i, f in enumerate(canonical['start'])}
+ frames.update({r: None for r in owned if r[0] == 'C'})
+ observed, spaces = {}, {}
+ paid = {}
+ max_terms = 1
+ def space(frame):
+ if frame not in spaces:
+ s = {0}
+ for v in canonical['frames'][frame]:
+ s |= {u ^ v for u in tuple(s)}
+ require(len(s) == 1 << len(canonical['frames'][frame]), 'independent binary frame')
+ spaces[frame] = s
+ return spaces[frame]
+ for i, event in enumerate(program):
+ tag = event[0]
+ touched = None
+ if tag == 'scalar':
+ op, f = event[1:]
+ action, dst = op[0], tuple(op[1]); touched = dst
+ require(dst in roles and 0 <= f < len(canonical['frames']), 'scalar declaration')
+ if action == 'clear':
+ require(dst in owned, 'borrowed erasure')
+ rows[dst] = ({}, 0); frames[dst] = f
+ else:
+ require(frames[dst] == f, 'destination gauge')
+ if action in ('add', 'copy'):
+ src = tuple(op[2])
+ require(src in roles and dst != src and frames[src] == f, 'source gauge')
+ if action == 'copy':
+ require(dst in owned and not rows[dst][0], 'COPY requires clean owned destination')
+ rows[dst] = (dict(rows[src][0]), rows[src][1])
+ else:
+ rows[dst] = linear(rows[dst], rows[src], op[3], op[4])
+ else:
+ require(action == 'scale', 'unknown scalar')
+ rows[dst] = scaled(rows[dst], op[2], op[3])
+ elif tag == 'warp':
+ _, role, symbol, old, new = event
+ dst = tuple(role); touched = dst
+ require(frames[dst] == old and 1 <= abs(symbol) <= len(canonical['warps']), 'warp source gauge')
+ rows[dst] = warped(rows[dst], symbol); frames[dst] = new
+ elif tag in ('center', 'climb'):
+ if tag == 'center':
+ _, idx, old, new, rank = event; dst = ('C', idx)
+ require(space(old) < space(new) or space(new) < space(old), 'center nested spaces')
+ else:
+ _, _, idx, old, new, rank = event; dst = ('L', idx)
+ require(space(old) < space(new), 'climb nested spaces')
+ require(frames[dst] == old and rank == abs(len(canonical['frames'][old]) - len(canonical['frames'][new])), 'paid exact frame and rank')
+ frames[dst] = new; paid[rank] = paid.get(rank, 0) + 1
+ elif tag == 'zero_retag':
+ _, role, old, new = event; dst = tuple(role)
+ require(frames[dst] == old and not rows[dst][0], 'physical identity requires complete zero row')
+ frames[dst] = new
+ else:
+ require(tag in ('phase', 'adapter'), 'unrecognized native event')
+ if touched is not None:
+ max_terms = max(max_terms, len(rows[touched][0]))
+ if source_sites and i in source_sites:
+ observed[i] = {r: (dict(rows[r][0]), rows[r][1]) for r in source_sites[i]}
+ for i in range(632):
+ r = ('L', i)
+ require(frames[r] == canonical['final'][i], 'retained final frame')
+ if r not in owned:
+ want = initial(r)
+ if i < 112:
+ want = linear(want, initial(('L', i + 112)), -1)
+ require(rows[r] == want, 'retained exact endpoint L' + str(i))
+ require(all(not rows[r][0] for r in owned), 'arbitrary owned entry must erase and return zero')
+ return observed, {'events': len(program), 'paid': paid, 'max_live_row_terms': max_terms,
+ 'independent_retained_inputs': 632 - sum(r[0] == 'L' for r in owned),
+ 'arbitrary_owned_entry_inputs': len(owned)}
+
+def serialize(d):
+ return {str(k): str(v) for k, v in sorted(d.items())}
+
+def verify_preparation(prep, basis):
+ pivots = set(basis)
+ expected = []
+ for pivot, row in sorted(basis.items()):
+ expected.append(['scalar', ['clear', ['L', pivot]], 0])
+ for h, q in sorted(row.items()):
+ if h != pivot:
+ require(h not in pivots and q.denominator & (q.denominator - 1) == 0, 'independent dyadic preparation')
+ expected.append(['scalar', ['add', ['L', pivot], ['L', h], -q.numerator, q.denominator], 0])
+ require(prep == expected, 'actual simultaneous pivot preparation differs from independently derived RREF')
+
+def main():
+ ap = argparse.ArgumentParser(); ap.add_argument('--out', type=Path, default=HERE / 'RESULT.json')
+ ap.add_argument('--candidate', type=Path, default=ROOT / CANDIDATE)
+ ap.add_argument('--candidate-pr', type=int, default=5383)
+ ap.add_argument('--candidate-head', default='4bd6efa51a495a7c7b7754915cf0244e7e60969e')
+ args = ap.parse_args()
+ source_raw = (ROOT / SOURCE).read_bytes()
+ candidate_raw = args.candidate.read_bytes()
+ source_payload, candidate_payload = map(gzip.decompress, (source_raw, candidate_raw))
+ source, candidate = map(json.loads, (source_payload, candidate_payload))
+ prep, snapshots, centers, zeros, trailing = decode_edits(source, candidate)
+ sites = {}
+ for i, s in snapshots.items(): sites.setdefault(i, set()).add(s['role'])
+ for i in centers: sites.setdefault(i, set()).add(('C', 0))
+ for i, z in zeros.items(): sites.setdefault(i, set()).add(z['role'])
+ observed, before = replay(source['canonical'], source['programs']['backward'], {('C', 0)}, sites)
+ relations, identities, by_frame = [], [], {}
+ for i, x in sorted(centers.items()):
+ s = snapshots[x['snapshot']]
+ diff = linear(observed[i][('C', 0)], observed[x['snapshot']][s['role']], -1)
+ qrow = rational_row(diff)
+ require(qrow and all(r[0] == 'L' and 224 <= r[1] < 632 and not word for (r, word) in qrow), 'derived relation must contain only scalar helper inputs')
+ relation = {r[1]: q for (r, _), q in qrow.items()}
+ require(all(source['canonical']['start'][h] == 0 and source['canonical']['final'][h] == 1 for h in relation), 'cold full-ended relation domain')
+ relations.append(relation); by_frame[x['frame']] = diff
+ identities.append({'center_event': i, 'snapshot_event': x['snapshot'], 'snapshot_role': s['role'], 'frame': x['frame'], 'center_minus_snapshot': serialize(relation)})
+ require(len(by_frame) == 8, 'distinct center frames')
+ for i, z in sorted(zeros.items()):
+ require(z['frame'] in by_frame and z['rank'] == 1, 'zero site belongs to named rank-one center frame')
+ require(observed[i][z['role']] == scaled(by_frame[z['frame']], -1, 1), 'unrestricted later row equals negative center-minus-snapshot')
+ identities.append({'zero_event': i, 'role': z['role'], 'frame': z['frame'], 'unrestricted_row_is_negative_center_delta': True})
+ canonical_basis = rref(relations)
+ require(len(canonical_basis) == 8, 'joint relation rank eight')
+ prepared_pivots = [e[1][1][1] for e in prep if e[0] == 'scalar' and e[1][0] == 'clear' and e[1][1][0] == 'L']
+ require(len(prepared_pivots) == len(set(prepared_pivots)) == 8, 'eight distinct actual prepared pivots')
+ basis = rref(relations, sorted(prepared_pivots))
+ require(set(basis) == set(prepared_pivots), 'actual chosen pivots not independent in joint relation system')
+ verify_preparation(prep, basis)
+ require(trailing == [['scalar', ['clear', ['L', h]], 1] for h in sorted(basis)], 'all pivot outputs returned zero')
+ owned = {('L', h) for h in basis} | {('C', i) for i in range(9)}
+ require({tuple(r) for r in candidate['owned']['backward']} == owned, 'actual owned declarations')
+ _, after = replay(candidate['canonical'], candidate['programs']['backward'], owned)
+ # Controls are exact local propositions applied to independently derived
+ # rows, rather than rerunning or relying on author's rejection controls.
+ controls = {}
+ def rejects(name, fn):
+ try: fn()
+ except ValueError as e: controls[name] = str(e)
+ else: raise ValueError('accepted negative control ' + name)
+ mutant = json.loads(json.dumps(prep)); mutant[1][1][3] += 1
+ rejects('wrong_preparation_coefficient', lambda: verify_preparation(mutant, basis))
+ mutant2 = json.loads(json.dumps(prep)); mutant2[1][1][3] *= -1
+ rejects('wrong_preparation_sign', lambda: verify_preparation(mutant2, basis))
+ mutant3 = json.loads(json.dumps(prep)); mutant3[0][1][1][1] = 226
+ rejects('wrong_pivot', lambda: verify_preparation(mutant3, basis))
+ # Swapping distinct saved values must change the unrestricted center delta.
+ cs = list(sorted(centers)); x, y = centers[cs[0]], centers[cs[1]]
+ sx, sy = snapshots[x['snapshot']], snapshots[y['snapshot']]
+ wrong_delta = linear(observed[cs[0]][('C', 0)], observed[y['snapshot']][sy['role']], -1)
+ rejects('wrong_snapshot', lambda: require(wrong_delta == by_frame[x['frame']], 'snapshot changes unrestricted identity'))
+ wrong_gauge = json.loads(json.dumps(candidate)); ci = next(i for i,e in enumerate(wrong_gauge['programs']['backward']) if e[0]=='scalar' and e[1][:2]==['copy',['C',0]])
+ wrong_gauge['programs']['backward'][ci][2] = 0
+ rejects('wrong_copy_gauge', lambda: decode_edits(source, wrong_gauge))
+ zi = min(zeros); z = zeros[zi]
+ wrong_zero = linear(observed[zi][z['role']], initial(('L', 224)))
+ rejects('wrong_zero_row', lambda: require(wrong_zero == scaled(by_frame[z['frame']], -1, 1), 'nonzero retained column at zero site'))
+ fake_rank = dict(basis); fake_rank.pop(min(fake_rank))
+ rejects('drop_independent_relation', lambda: require(len(fake_rank)==8, 'rank seven cannot fund eight pivots'))
+ result = {'status': 'PASS_INDEPENDENT_JOINT_ALGEBRA', 'author_credit': 'Ali Romman; source word Cao Yifan',
+ 'candidate_pr': args.candidate_pr, 'candidate_head': args.candidate_head,
+ 'source_file': str(ROOT / SOURCE), 'candidate_file': str(args.candidate.resolve()),
+ 'source_raw_sha256': hashlib.sha256(source_raw).hexdigest(),
+ 'source_payload_sha256': hashlib.sha256(source_payload).hexdigest(),
+ 'candidate_raw_sha256': hashlib.sha256(candidate_raw).hexdigest(),
+ 'candidate_payload_sha256': hashlib.sha256(candidate_payload).hexdigest(),
+ 'checker_sha256': hashlib.sha256(Path(__file__).read_bytes()).hexdigest(),
+ 'relation_rank': 8, 'independently_derived_pivots': list(sorted(basis)),
+ 'independently_derived_rref': {str(p): serialize(d) for p,d in sorted(basis.items())},
+ 'unconstrained_canonical_rref': {str(p): serialize(d) for p,d in sorted(canonical_basis.items())},
+ 'source_identities': identities, 'source_replay': before, 'candidate_replay': after,
+ 'simultaneous_snapshot_count': 8, 'all_16_unrestricted_identities_checked': True,
+ 'forward_entire_word_unchanged': True, 'canonical_operators_frames_unchanged': True,
+ 'negative_controls': controls,
+ 'limitations': ['No new absolute-phase lowering or physical all-size proof.', 'Forward replay unchanged and reused; this checker independently replays backward words only.', 'Cost, compiler, outer inequalities are separate review responsibilities.']}
+ args.out.write_text(json.dumps(result, indent=2, sort_keys=True)+'\n')
+ print(json.dumps({'status': result['status'], 'pivots': sorted(basis), 'controls': list(controls)}))
+
+if __name__ == '__main__': main()
diff --git a/research/joint-relations-independent-validation/capsule/agents/applicability/check_applicability.py b/research/joint-relations-independent-validation/capsule/agents/applicability/check_applicability.py
new file mode 100644
index 0000000000..3186aca892
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/applicability/check_applicability.py
@@ -0,0 +1,157 @@
+#!/usr/bin/env python3
+"""Independent small grammar/count/guard check. No candidate evaluator imports.
+
+This checks finite applicability conditions, not unrestricted source identities,
+Clifford factors, directed moments, or complete conditional admission.
+Substantial OpenAI assistance. Apache-2.0.
+"""
+from collections import Counter
+from fractions import Fraction as Q
+from hashlib import sha256
+from pathlib import Path
+import gzip
+import json
+import resource
+import sys
+import time
+
+HERE = Path(__file__).resolve().parent
+BASE = HERE.parents[1]
+REPO = BASE / 'repository'
+
+def require(ok, message):
+ if not ok:
+ raise ValueError(message)
+
+def read(path):
+ raw = path.read_bytes()
+ return json.loads(gzip.decompress(raw) if path.suffix == '.gz' else raw)
+
+def allowance(g):
+ if g[0] in ('clear', 'copy'):
+ return 2
+ q = Q(*g[3:]) if g[0] == 'add' else Q(*g[2:])
+ a, b = abs(q.numerator), q.denominator
+ require(a and not b & (b-1), 'Dyadic finite scalar grammar')
+ if g[0] == 'scale':
+ require(not a & (a-1), 'Dyadic unit SCALE')
+ return 2*(abs(a.bit_length()-b.bit_length()) + int(q < 0))
+ require(g[0] == 'add', 'Scalar opcode')
+ return 2*(2+a.bit_length()+a.bit_count()+b.bit_length()-1)
+
+def inspect(word, old, label):
+ pivots = {225,227,229,230,241,245,257,288 if label == '5383' else 261}
+ require(word['programs']['forward'] == old['programs']['forward'], 'Unchanged forward word')
+ require(word['canonical'] == {k:v for k,v in old['canonical'].items() if k != 'local_profile'}, 'Unchanged canonical geometry')
+ expected = {('C', j) for j in range(9)} | {('L', j) for j in pivots}
+ require({tuple(r) for r in word['owned']['backward']} == expected, 'Seventeen distinct backward owners')
+ stats = {}
+ for direction in ('forward','backward'):
+ program = word['programs'][direction]
+ require([e for e in program if e[0] in ('warp','adapter','phase')] ==
+ [e for e in old['programs'][direction] if e[0] in ('warp','adapter','phase')],
+ 'Exact retained phase/warp/adapter itinerary')
+ owned = {tuple(r) for r in word['owned'][direction]}
+ frames = {('L', i):f for i,f in enumerate(word['canonical']['start'])}
+ cleared = set(); live = set(); peak = 0; scalar = 0; paid = Counter(); zeros = []
+ first_native = next(i for i,e in enumerate(program) if e[0] != 'scalar')
+ prepared = set()
+ for i,e in enumerate(program):
+ kind = e[0]
+ if kind == 'scalar':
+ g, f = e[1:]; dst = tuple(g[1]); op = g[0]
+ scalar += allowance(g)
+ if op == 'clear':
+ require(dst in owned, 'Borrowed erase prohibited')
+ cleared.add(dst); frames[dst] = f
+ if dst[0] == 'C' and dst[1]: live.discard(dst)
+ else:
+ require(frames.get(dst) == f, 'Scalar destination exact frame')
+ if op in ('add','copy'):
+ src = tuple(g[2]); require(src != dst and frames.get(src) == f, 'Distinct same-frame scalar source')
+ if op == 'copy' and dst[0] == 'C' and dst[1]:
+ require(dst in cleared and src[0] == 'L', 'Initialized owned snapshot')
+ live.add(dst); peak=max(peak,len(live))
+ if i < first_native:
+ require(direction == 'backward' and dst == ('L',dst[1]) and dst[1] in pivots and dst in cleared, 'Owned cold pivot preparation')
+ require(op == 'add' and src[0] == 'L' and src[1] not in pivots and f == 0, 'No pivot dependency or extra preparation oracle')
+ prepared.add(dst[1])
+ elif kind == 'climb':
+ r=('L',e[2]); require(frames[r] == e[3], 'Paid current frame');frames[r]=e[4];paid[e[5]]+=1
+ elif kind == 'center':
+ r=('C',e[1]); frames[r]=e[3];paid[e[4]]+=1
+ elif kind == 'zero_retag':
+ r=tuple(e[1]);require(frames[r] == e[2] and e[3] == 1, 'Zero site exact source/target frames');frames[r]=e[3];zeros.append(r)
+ elif kind == 'warp':
+ r=tuple(e[1]); require(frames[r] == e[3], 'Warp current exact frame');frames[r]=e[4]
+ else:
+ require(kind in ('phase','adapter'), 'Known unchanged event species')
+ require(not live, 'All snapshots erased at return')
+ if direction == 'backward':
+ require(prepared == pivots and peak == 8 and len(zeros) == 8, 'Joint preparation, eight simultaneous snapshots, eight zero sites')
+ require(paid == {1:2193,2:412,3:510,4:127,5:40}, 'Complete backward paid census')
+ stats[direction] = dict(scalar_allowance=scalar, owned=len(owned), simultaneous_snapshots=peak, paid=dict(paid), zero_sites=len(zeros))
+ require(stats['backward']['scalar_allowance'] == {'5383':158744,'5387':158776}[label], 'Candidate-specific fresh scalar allowance')
+ return stats
+
+def main():
+ start=time.monotonic()
+ resource.setrlimit(resource.RLIMIT_CPU,(15,15))
+ resource.setrlimit(resource.RLIMIT_AS,(128*1024**2,128*1024**2))
+ old=read(REPO/'research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz')
+ packages={'5383':REPO/'research/kappa-joint-relations-20261023',
+ '5387':BASE/'agents/sources/pr5387/research/eight-owned-relations'}
+ out={'status':'PASS_SCOPED_APPLICABILITY_COUNTS_AND_GUARDS','candidates':{},'full_uniform_word_materialized':False}
+ for label,path in packages.items():
+ word=read(path/'WORD.json.gz'); result=read(path/'RESULT.json')
+ stats=inspect(word,old,label); price=result['bound'] if 'bound' in result else result.get('price',result)
+ # Receipt keys are discovered explicitly, never evaluated as code.
+ if 'compiler' not in price:
+ price=next(v for v in result.values() if isinstance(v,dict) and 'compiler' in v)
+ c=price['compiler'];s=price['strictification'];gap=Q(c['gap']);h=c['H'];j=c['integer_test_exponent']
+ require(gap.numerator == 1 and h == j*gap.denominator, 'Exact integer compiler grid')
+ require((h+1)**1000 < 2**j and (gap.denominator*(j-1)+1)**1000 >= 2**(j-1), 'Candidate threshold and preceding sufficient grid')
+ rho=Q(s['reserve']); normalized=1/(1+1024*rho)+Q(4,2**32)
+ require(normalized < 1 and Q(s['normalized_paid_upper']) == normalized, 'Funded paid-completion rounding budget')
+ require(20**64 < 21**63 and Q(97,100)**128 < Q(1,16), 'Splitting separation and two charged tail-block guard')
+ require(h > 8192 and 1000*gap > Q(1,h+1), 'Threshold covers product rank and eventual logarithmic derivative')
+ out['candidates'][label]=dict(word_sha256=sha256((path/'WORD.json.gz').read_bytes()).hexdigest(),
+ result_sha256=sha256((path/'RESULT.json').read_bytes()).hexdigest(),local=stats,
+ raw_controller_owned_LOCAL_banks=16*17+2,compiler_H=h,compiler_j=j,gap=str(gap),
+ reserve=str(rho),paid_completion_slack=str(1-normalized),
+ expanded_count_majorant='D=2^262144; F(0)=D; F(n)=((n+1)*(D+1)*(F(n-1)+1))^(16*(n+1)^2); M=F(2^H)',
+ expanded_bounds={name:'M' for name in ['W','P','O','R','G']},
+ semantic={'Z':'2*M','E':'64*(2*M+2^H+2*M+1)^3','B':'M+E','C0':'32*2^H*B^2'},
+ endpoint_scope='Fixed finite template and eventual thresholds under the five selected assumptions; semantic source identities and interval moment premises are separate review obligations')
+ # Symbolic induction exponents behind F(n), with concrete arbitrary n controls.
+ require(all(9*n+20 <=16*(n+1)**2 for n in range(1,1000)), 'Router/denominator-clearing majorant exponent')
+ require(2*(82*1024+10+2*8192)+6+3*8193 < 262144, 'Strictified-unit D exponent including squared complete role inventory')
+ controls={}
+ del word
+ original=read(packages['5383']/'WORD.json.gz')
+ def bad_warp(w):
+ i=next(i for i,e in enumerate(w['programs']['backward']) if e[0]=='warp')
+ w['programs']['backward'][i]=list(w['programs']['backward'][i])
+ w['programs']['backward'][i][2]=0
+ for name,edit in [
+ ('borrowed_erase',lambda w:w['programs']['backward'].insert(0,['scalar',['clear',['L',324]],0])),
+ ('snapshot_owner_alias',lambda w:w['owned']['backward'].pop(8)),
+ ('phase_itinerary',bad_warp),
+ ]:
+ bad=dict(original);bad['programs']=dict(original['programs'])
+ bad['programs']['backward']=list(original['programs']['backward'])
+ bad['owned']=dict(original['owned']);bad['owned']['backward']=list(original['owned']['backward'])
+ edit(bad)
+ try: inspect(bad,old,'5383')
+ except ValueError as error: controls[name+'_rejected']=str(error)
+ else: raise ValueError('Accepted mutation '+name)
+ controls.update({'old_1e9_as_expanded_cap_rejected':2**262144>10**9,
+ 'one_bank_per_depth_rejected':out['candidates']['5383']['local']['backward']['simultaneous_snapshots']>1,
+ '5387_reserve_1e_minus13_rounding_rejected':1/(1+Q(1024,10**13))+Q(4,2**32)>=1})
+ require(all(controls.values()),'Meaningful stock/reserve controls')
+ out.update(controls=controls,seconds=time.monotonic()-start,
+ limitations=['No candidate evaluator imported','No free-word identity or Clifford phase replay','Moment alpha/gamma/delta interval hypotheses supplied by independent pricing review','Expanded count bound is a terminating integer recursion; its astronomical value was not numerically expanded','No independent human or formal proof; no unconditional physical theorem'])
+ print(json.dumps(out,indent=2))
+
+if __name__=='__main__':
+ main()
diff --git a/research/joint-relations-independent-validation/capsule/agents/falsifier/check_mutants.py b/research/joint-relations-independent-validation/capsule/agents/falsifier/check_mutants.py
new file mode 100644
index 0000000000..a85fb7db3e
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/falsifier/check_mutants.py
@@ -0,0 +1,73 @@
+#!/usr/bin/env python3
+"""Semantic mutations of actual PR5383 WORD; no old digest comparison in math path.
+
+Chris R with OpenAI Codex. Inputs read only; imports only independent worker's
+algebra module. Coordinator must serialize the full replay modes.
+"""
+import argparse, copy, gzip, hashlib, importlib.util, json, sys, time
+from pathlib import Path
+sys.dont_write_bytecode = True
+HERE = Path(__file__).resolve().parent
+EXEC = HERE.parents[1]
+CHECKER = EXEC / 'agents/algebra/check_joint.py'
+REPO = EXEC / 'repository'
+PACKAGE = REPO / 'research/kappa-joint-relations-20261023'
+
+def read(path):
+ raw = path.read_bytes()
+ return json.loads(gzip.decompress(raw) if path.suffix == '.gz' else raw)
+
+def digest(value):
+ return hashlib.sha256((json.dumps(value,sort_keys=True,separators=(',',':'))+'\n').encode()).hexdigest()
+
+def load_checker():
+ spec=importlib.util.spec_from_file_location('independent_joint_algebra_for_mutation',CHECKER)
+ module=importlib.util.module_from_spec(spec); spec.loader.exec_module(module)
+ return module
+
+def mutations(candidate):
+ program=candidate['programs']['backward']
+ def fork():
+ m=dict(candidate); m['programs']=dict(candidate['programs'])
+ m['programs']['backward']=list(program); m['owned']=copy.deepcopy(candidate['owned'])
+ return m
+ m=fork(); del m['programs']['backward'][0]
+ yield 'arbitrary_owned_input_clear_removed',m,'replay',None
+ m=fork(); m['programs']['backward'][1]=copy.deepcopy(program[1]); m['programs']['backward'][1][1][3]*=-1
+ yield 'preparation_sign_reversed',m,'replay',None
+ m=fork(); idx=next(i for i,e in enumerate(program) if e[0]=='scalar' and e[1][:2]==['copy',['C',1]])
+ m['programs']['backward'][idx]=copy.deepcopy(program[idx]); m['programs']['backward'][idx][1][2]=['L',63]
+ yield 'wrong_same_frame_snapshot_source',m,'replay',None
+ m=fork(); m['programs']['backward'].pop()
+ yield 'arbitrary_owned_output_not_returned_zero',m,'replay',None
+ # Preserve every source marker and per-kind subsequence but exchange two
+ # adjacent differently tagged events. Source chronology must reject.
+ m=fork(); p=m['programs']['backward']
+ idx=next(i for i,e in enumerate(p[:-1]) if e[0] in ('phase','adapter') and p[i+1][0]!=e[0])
+ p[idx],p[idx+1]=p[idx+1],p[idx]
+ yield 'phase_marker_displaced_across_adjacent_event',m,'decode_edits',{'swapped_indices':[idx,idx+1]}
+ m=fork(); m['owned']['backward'].remove(['L',225])
+ yield 'pivot_laundered_as_borrowed_productive_input',m,'replay',None
+
+def main():
+ ap=argparse.ArgumentParser(); ap.add_argument('--mode',choices=['manifest','full'],default='manifest'); ap.add_argument('--out',type=Path,default=HERE/'CONTROLS.json'); ap.add_argument('--only',action='append')
+ args=ap.parse_args(); candidate=read(PACKAGE/'WORD.json.gz'); source=read(REPO/'research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'); checker=load_checker()
+ original_hash=digest(candidate); results={}; start=time.monotonic()
+ for name,mutant,engine,extra in mutations(candidate):
+ if args.only and name not in args.only: continue
+ row={'mutant_payload_sha256_recomputed':digest(mutant),'original_payload_sha256':original_hash,'hash_changed':digest(mutant)!=original_hash,'engine':engine,'old_digest_comparison_used_for_rejection':False,'detail':extra}
+ if args.mode=='manifest': row['status']='NOT_RUN_MANIFEST_ONLY'
+ else:
+ began=time.monotonic()
+ try:
+ if engine=='decode_edits': checker.decode_edits(source,mutant)
+ else: checker.replay(mutant['canonical'],mutant['programs']['backward'],{tuple(r) for r in mutant['owned']['backward']})
+ except (ValueError,IndexError,KeyError) as exc:
+ row.update(status='REJECTED',reason=str(exc),exception_type=type(exc).__name__)
+ else: row.update(status='ACCEPTED_UNEXPECTEDLY')
+ row['seconds']=time.monotonic()-began
+ results[name]=row
+ output={'status':'MANIFEST_ONLY' if args.mode=='manifest' else ('PASS_SEMANTIC_MUTANTS_REJECTED' if all(r['status']=='REJECTED' for r in results.values()) else 'FAIL_SEMANTIC_MUTANT_ACCEPTED'),'candidate_head':'4bd6efa51a495a7c7b7754915cf0244e7e60969e','mutations_of_actual_literal_word':True,'checker_sha256':hashlib.sha256(CHECKER.read_bytes()).hexdigest(),'harness_sha256':hashlib.sha256(Path(__file__).read_bytes()).hexdigest(),'elapsed_seconds':time.monotonic()-start,'controls':results}
+ args.out.write_text(json.dumps(output,indent=2,sort_keys=True)+'\n'); print(json.dumps({'status':output['status'],'controls':{k:v['status'] for k,v in results.items()}}))
+ if output['status']=='FAIL_SEMANTIC_MUTANT_ACCEPTED': raise SystemExit(1)
+if __name__=='__main__': main()
diff --git a/research/joint-relations-independent-validation/capsule/agents/outer/check_outer.py b/research/joint-relations-independent-validation/capsule/agents/outer/check_outer.py
new file mode 100644
index 0000000000..44ce83d7a6
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/outer/check_outer.py
@@ -0,0 +1,168 @@
+#!/usr/bin/env python3
+"""Independent rational review of mixed-target outer allocations and compiler grid.
+No candidate Python code is imported or executed. Standard library only.
+Predecessors for exponent contracts: Jacob Alan Sussman, zxv, Cao Yifan,
+Cinna Davis, and Chris R / Clear1nsight's independently transcribed PR5241
+ledger preserved by PR5384. Substantial OpenAI Codex assistance.
+"""
+from fractions import Fraction as Q
+from pathlib import Path
+import argparse, hashlib, json, platform, resource, time
+
+def need(ok, msg):
+ if not ok: raise AssertionError(msg)
+def encode(x):
+ if isinstance(x,Q): return str(x)
+ if isinstance(x,dict): return {str(k):encode(v) for k,v in x.items()}
+ if isinstance(x,(list,tuple)): return [encode(v) for v in x]
+ return x
+
+def family(k,s,bit=Q('.0034')):
+ g=(s-k)/7
+ return dict(kappa=k,tested_saving=s,complex_uniform_saving=k+6*g,
+ b=k+5*g,a=k+4*g,q=k+3*g,bit_saving=bit,epsilon=1-g,
+ beta=1-3*g,r0=g/10,stop=g,layout=g,d=g)
+
+def outer(p,atom=Q('.004')):
+ # Exponents are calculated from the stopping, grouping and routing rules.
+ k,b,a,q,ep,be,r,stop,layout=(p[n] for n in
+ ('kappa','b','a','q','epsilon','beta','r0','stop','layout'))
+ sigma,tau=1-b,1-a
+ internal=tau+(1-stop)*max(sigma-tau,Q(0))
+ leaf=sigma+stop*(1-sigma)
+ lam=1-(q+a)/2
+ xi=ep*(1+q)-Q(3,32)+layout
+ key=be+1-ep
+ m=dict(main_transform=ep*q,global_coordinate_router=a,
+ fused_gaussian=1-ep+q*be,group_bit_router=1-ep+a*be,
+ group_scans=1-ep+be,boundary_algebraic_matrix=Q(3,32)+xi-ep,
+ sparse_union_movement=xi+Q(1,2)-ep,polynomial_products=ep,
+ microbox_face_corrections=79-ep-be)
+ c=dict(actual_bit_above_effective=p['bit_saving']-a,
+ complex_above_effective=b-a,q_positive=q,complex_endpoint=b-q,
+ q_below_effective=a-q,stop_positive=stop,stop_below_one=1-stop,
+ leaf_saving_above_effective=(1-stop)*b-a,
+ q_below_internal=1-internal-q,q_below_leaf=1-leaf-q,
+ lambda_above_tau=lam-tau,lambda_above_sigma=lam-sigma,
+ lambda_above_internal=lam-internal,lambda_prime_above_lambda=1-q-lam,
+ lambda_prime_above_leaf=1-q-leaf,epsilon_positive=ep,
+ epsilon_below_one=1-ep,cap_above_band=xi-Q(1,2),cap_below_cell=ep-xi,
+ group_positive=be,group_below_dimension=ep-be,support_router_span=1-be,
+ group_gauge_power_slack=3-2*xi-r-be,
+ actual_logarithmic_group_guard=3-2*xi-be,
+ global_gamma_power_slack=1-ep-r,actual_logarithmic_gamma_guard=1-ep,
+ alpha_logarithm_absorption=r,group_key_fits_record=1-key,
+ membership_arithmetic_fits_record=1-be-2*(1-ep),
+ microbox_halo_volume=80-be,positive_layout_slack=layout,
+ short_record_fallback=ep-a,complex_below_one_over_32=Q(1,32)-b,
+ strassen_integer_power_gap=Q(2**45-7**16),
+ theta_positive_polynomial_power=Q(2),cap_below_phase_cell_power=2-xi,
+ halo_covers_generic_inverse_radius=Q(5),union_tag_work_per_visit_fits_record=1-be,
+ union_header_fits_record=1-be,source_axis_superpolynomial=1-ep,
+ gaussian_above_main=m['fused_gaussian']-m['main_transform'],
+ new_complex_uniform_saving_above_b=p['complex_uniform_saving']-b,
+ improvement_over_user_baseline=k-Q('.001730970419199163702738'),
+ new_semantic_guard_with_C1_one=1-ep,fine_prime_halo_umbrella=Q(7,2))
+ c.update({n+'_above_kappa':v-k for n,v in m.items()})
+ f=dict(new_semantic_group_guard=1-be,
+ new_BIT_row_stock_sublinear_in_active_group=be*Q(997,1000),
+ fixed_halo_explicit_metadata_branch=79-ep-be,
+ actual_new_BIT_stock_sublinear=be*(1-atom))
+ return dict(parameters=dict(p,cap_xi=xi,lambda_=lam,lambda_prime=1-q),
+ margins=m,strict_checks=c,functional_checks=f)
+
+def compiler(k,s,reserve,record=None):
+ gap=(s-k)/7
+ need(gap>0 and gap.numerator==1,'positive unit-fraction compiler grid')
+ step=gap.denominator
+ power,v=1000,1024
+ def wins(j):return (step*j+1)**power<2**j
+ left,right=1,2
+ while not wins(right): left,right=right,2*right
+ while right-left>1:
+ mid=(left+right)//2
+ if wins(mid):right=mid
+ else:left=mid
+ H=step*right
+ normalized=1/(1+v*reserve)+Q(4,2**32)
+ checks=dict(height_above_8v=H>8*v,integer_success=wins(right),
+ preceding_integer_grid_fails=not wins(right-1),
+ rounding_and_completion_funded=normalized<1,
+ strict_uniform_below_tested=k+6*gap0. A success and previous failure
+ # prove the least winning positive integer grid index, not least arbitrary H.
+ return dict(gap=gap,step=step,j=right,H=H,N_encoding='2^'+str(H),
+ checks=checks,normalized_paid_upper=normalized,rounding_reserve=1-normalized,
+ reserve_must_exceed=Q(4,2**32)/(v*(1-Q(4,2**32))),
+ word_materialized=False,threshold_scope='Least winning integer j on H=step*j for this sufficient inequality; no globally optimal compiler claim.')
+
+def run(name,path,bit_source):
+ raw=path.read_bytes(); rec=json.loads(raw); ar=rec.get('arithmetic',rec)
+ k,s=Q(ar['kappa']),Q(ar['strictification']['tested'])
+ reserve=Q(ar['strictification']['reserve'])
+ p=family(k,s); out=outer(p)
+ need(len(out['strict_checks'])==54 and len(out['functional_checks'])==4,'54+4 inventory')
+ need(all(v>0 for g in ('strict_checks','functional_checks') for v in out[g].values()),'strict outer funding')
+ for g in ('margins','strict_checks','functional_checks'):
+ need(out[g]=={n:Q(v) for n,v in ar['outer'][g].items()},'record equality '+g)
+ need(all(Q(ar['outer']['parameters'][n])==v for n,v in p.items()),'recorded parameter family')
+ comp=compiler(k,s,reserve,ar['compiler'])
+ controls={}
+ for label,patch in [('insufficient_BIT',{'bit_saving':Q('.0027')}),
+ ('closed_BIT',{'bit_saving':p['a']}),('closed_uniform',{'complex_uniform_saving':p['b']}),
+ ('unfunded_endpoint',{'kappa':s}),('closed_epsilon',{'epsilon':Q(1)}),
+ ('missing_layout',{'layout':Q(0)})]:
+ bad=outer(dict(p,**patch))
+ failures={n:v for n,v in bad['strict_checks'].items() if v<=0}
+ need(failures,'reject '+label);controls[label]=failures
+ try:compiler(k,s,Q(1,10**13))
+ except AssertionError:controls['unfunded_rounding']='rejected by normalized paid bound'
+ else:raise AssertionError('unfunded rounding accepted')
+ controls['lower_compiler_integer_grid']='rejected by independently evaluated strict integer inequality at j-1'
+ try:compiler(s,s,reserve)
+ except AssertionError:controls['closed_compiler_gap']='rejected by positive gap requirement'
+ else:raise AssertionError('closed compiler gap accepted')
+ bit=ar['ordinary_BIT']; need(bit==bit_source,'retained source BIT record unchanged'); atom=Q(bit['atom'])
+ ordinary=(1-atom)*Q(bit['after_cover'])+atom*Q('.0000384599')
+ need(ordinary==Q(bit['ordinary_saving']),'ordinary BIT interpolation')
+ need(atom==Q('.004') and atom>ordinary>Q(bit['admitted'])>s and atom<1-ordinary,'BIT chain and active stock')
+ need(Q(bit['admitted'])==p['bit_saving'],'same retained BIT admission')
+ margins=out['margins']; limiter=min(margins,key=margins.get)
+ return dict(status='PASS_INDEPENDENT_OUTER_AND_FINITE_COMPILER_ARITHMETIC',candidate=name,
+ source_path=str(path.resolve()),source_sha256=hashlib.sha256(raw).hexdigest(),
+ kappa=k,tested=s,reserve=reserve,outer=out,compiler=comp,controls=controls,
+ limiting_outer_row=limiter,limiting_outer_headroom=margins[limiter]-k,
+ minimum_strict_slack=min(out['strict_checks'].values()),
+ BIT=dict(atom=atom,ordinary=ordinary,admitted=Q(bit['admitted']),
+ effective_required=p['a'],headroom=Q(bit['admitted'])-p['a'],
+ positive_sublinear_active_stock=0
p['complex_uniform_saving'],
+ uniform_above_b=p['complex_uniform_saving']>p['b'],b_above_a=p['b']>p['a'],
+ a_above_q=p['a']>p['q'],q_above_kappa=p['q']>k),
+ unexecuted=['Independent invoice and alpha/gamma/delta/eta intervals delegated to pricing lane',
+ 'Physical/native/all-size applicability delegated to other review lanes',
+ 'No global optimum or selected-frontier promotion; no expanded word materialized'])
+
+def main():
+ ap=argparse.ArgumentParser();ap.add_argument('--candidate',action='append',nargs=2,required=True)
+ ap.add_argument('--out',type=Path,required=True);ap.add_argument('--bit-source',type=Path,required=True)
+ args=ap.parse_args();t=time.monotonic();bit_source=json.loads(args.bit_source.read_bytes())['ordinary_BIT']
+ result=dict(status='PASS_SCOPED_ARITHMETIC',candidates=[run(n,Path(p),bit_source) for n,p in args.candidate],
+ python=platform.python_version(),seconds=time.monotonic()-t,
+ retained_BIT_source=str(args.bit_source.resolve()),
+ retained_BIT_source_sha256=hashlib.sha256(args.bit_source.read_bytes()).hexdigest(),
+ maxrss_kib=resource.getrusage(resource.RUSAGE_SELF).ru_maxrss,
+ checker_sha256=hashlib.sha256(Path(__file__).read_bytes()).hexdigest())
+ args.out.write_text(json.dumps(encode(result),indent=2,sort_keys=True)+'\n')
+ print(json.dumps(encode({k:v for k,v in result.items() if k!='candidates'})))
+if __name__=='__main__':main()
diff --git a/research/joint-relations-independent-validation/capsule/agents/ownership/check.py b/research/joint-relations-independent-validation/capsule/agents/ownership/check.py
new file mode 100644
index 0000000000..f03bc1d68a
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/ownership/check.py
@@ -0,0 +1,281 @@
+#!/usr/bin/env python3
+"""Independent event owner/frame/def-use audit; never imports candidate Python.
+
+--structure is a cheap contract probe. --exact is a coordinator-only full row
+replay on arbitrary retained and owned entries. Mathematical scalar rows use
+rational coefficients and reduced free words, not binary tableaux.
+"""
+import argparse
+import copy
+import gzip
+import hashlib
+import json
+from collections import Counter, defaultdict
+from fractions import Fraction
+from pathlib import Path
+
+HERE = Path(__file__).resolve().parent
+REPO = HERE.parents[1] / 'repository'
+SOURCE = 'research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'
+CANDIDATE = 'research/kappa-joint-relations-20261023/WORD.json.gz'
+PHASE = 'research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz'
+HEAD = '4bd6efa51a495a7c7b7754915cf0244e7e60969e'
+MAIN = '1ec1119972c9aefe42525172d07b332fcff81cb4'
+
+
+def require(p, text):
+ if not p:
+ raise ValueError(text)
+
+
+def read(p):
+ data = p.read_bytes()
+ return json.loads(gzip.decompress(data) if p.suffix == '.gz' else data)
+
+
+def role(x):
+ require(isinstance(x, list) and len(x) == 2 and x[0] in ('L','C') and isinstance(x[1],int), 'Malformed role')
+ return tuple(x)
+
+
+def label(r):
+ return '%s%d' % r
+
+
+def relation_structure(source, candidate):
+ """Align literal events, discovering edits instead of using WITNESS.json."""
+ c = candidate['canonical']
+ expected = dict(source['canonical']); expected.pop('local_profile')
+ require(c == expected, 'Changed canonical frames/maps/adapters')
+ require(candidate['programs']['forward'] == source['programs']['forward'], 'Changed forward program')
+ owned_list = [role(x) for x in candidate['owned']['backward']]
+ owned = set(owned_list)
+ require(len(owned) == len(owned_list) == 17, '17 distinct owned roles required')
+ require({r for r in owned if r[0]=='C'} == {('C',i) for i in range(9)}, 'Distinct C0..C8 required')
+ pivots = sorted(r[1] for r in owned if r[0]=='L')
+ require(len(pivots) == 8 and all(224 <= i < 632 and c['start'][i]==0 and c['final'][i]==1 for i in pivots), '8 owned cold full-ended helpers')
+ require(len(c['frames'][1])-len(c['frames'][0]) == 9, 'Lost owned helpers must have rank nine')
+ old = source['programs']['backward']; new = candidate['programs']['backward']
+ k = 0; prepared={}; prep_ops=[]
+ while k < len(new) and new[k][0]=='scalar':
+ e=new[k]; g=e[1]; dst=role(g[1])
+ require(e[2]==0 and dst in owned and dst[0]=='L', 'Preparation owner/frame')
+ if g[0]=='clear':
+ require(dst[1] not in prepared, 'Repeated pivot initial clear')
+ prepared[dst[1]]=[]
+ else:
+ require(g[0]=='add' and dst[1] in prepared, 'Pivot read before initial clear')
+ src=role(g[2]); require(src[0]=='L' and 224<=src[1]<632 and src not in owned and c['start'][src[1]]==0, 'Preparation must use independent common-frame helpers')
+ q=Fraction(g[3],g[4]); require(q and q.denominator & (q.denominator-1)==0, 'Preparation dyadic coefficient')
+ prepared[dst[1]].append([src[1],str(q)])
+ prep_ops.append(k);k+=1
+ require(set(prepared)==set(pivots) and all(prepared.values()), 'Every owned pivot prepared from retained helpers')
+ require(k0:
+ slot=role(new[k][1][1]);frame=new[k][2]
+ require(j>0 and slot not in snapshots and k+1>p&1:n^=row[p]
+ require(n,'Dependent frame basis')
+ row[n.bit_length()-1]=n
+ return row
+
+
+def subset(a,b):
+ for n in a:
+ for p in sorted(b,reverse=True):
+ if n>>p&1:n^=b[p]
+ if n:return False
+ return True
+
+
+def run_frames(c,program,owned,exact=False,backward=True):
+ """Frame and syntactic owner check; exact=True proves complete row returns."""
+ roles={('L',i) for i in range(632)}|owned
+ frames={('L',i):f for i,f in enumerate(c['start'])}
+ frames.update({r:None for r in owned if r[0]=='C'})
+ initialized=set(roles)-owned
+ # Each role, including every owner, starts with its own independent symbol.
+ rows={r:{(r,()):Fraction(1)} for r in roles} if exact else None
+ ever_cleared=set(); last_reads={}; last_writes={}; first_clear={}; last_clear={}; paid=Counter(); zero_sites=[]
+ bases=[span_rank(x) for x in c['frames']]
+ frame_cache={}
+ def read_at(r,i):
+ require(r in roles,'Undeclared/aliased source role')
+ require(r in initialized,'Owned dirt read before legal erase')
+ last_reads[r]=i
+ def add(dst,src,q):
+ for key,value in list(src.items()):
+ new=dst.get(key,Fraction(0))+q*value
+ if new:dst[key]=new
+ else:dst.pop(key,None)
+ for i,e in enumerate(program):
+ kind=e[0]
+ if kind=='scalar':
+ g,f=e[1:];dst=role(g[1]); require(dst in roles and isinstance(f,int) and 0<=f0 else -1000000) if backward else op
+ rows[dst]={(r,word[1:] if word and word[0]==-symbol else (symbol,)+word):q for (r,word),q in rows[dst].items()}
+ frames[dst]=new;last_writes[dst]=i
+ elif kind in ('climb','center'):
+ if kind=='climb':_,_,n,old,new,rank=e;dst=('L',n)
+ else:_,n,old,new,rank=e;dst=('C',n)
+ read_at(dst,i);require(frames[dst]==old,'Paid input frame')
+ require(rank==abs(len(c['frames'][new])-len(c['frames'][old])),'Paid rank mismatch')
+ key=(kind,old,new)
+ if key not in frame_cache:
+ frame_cache[key]=subset(c['frames'][old],bases[new]) or (kind=='center' and subset(c['frames'][new],bases[old]))
+ require(frame_cache[key],'Paid frame inclusion')
+ frames[dst]=new;last_writes[dst]=i;paid[rank]+=1
+ elif kind=='zero_retag':
+ _,r,old,new=e;dst=role(r);read_at(dst,i)
+ require(frames[dst]==old,'Zero identity input frame')
+ if exact:require(not rows[dst],'Zero identity has nonzero input row')
+ frames[dst]=new;last_writes[dst]=i;zero_sites.append(i)
+ else:require(kind in ('phase','adapter'),'Unknown opcode')
+ require([frames[('L',i)] for i in range(632)]==c['final'],'Final borrowed/owned native frame mismatch')
+ require(owned<=ever_cleared,'Owned entry dirt not legally erased')
+ for r in owned:
+ require(last_clear[r]==last_writes[r],'Owned output not zero at return')
+ if exact:
+ for r in sorted(roles):
+ expected={}
+ if r not in owned:
+ expected[(r,())]=Fraction(1)
+ if r[0]=='L' and ((backward and r[1]<112) or (not backward and 112<=r[1]<224)):
+ src=('L',r[1]+112 if backward else r[1]-112)
+ expected[(src,())]=Fraction(-1 if backward else 1)
+ require(rows[r]==expected,'Wrong arbitrary-column endpoint '+label(r))
+ return {'paid':dict(sorted(paid.items())),'zero_sites':zero_sites,
+ 'initial_columns':len(roles),'retained_arbitrary_columns':len(roles-owned),'owned_arbitrary_columns':len(owned),
+ 'all_exact_endpoints_checked':exact,'all_owned_last_writes_are_clears':True,
+ 'owned_def_use':[{'role':label(r),'first_clear':first_clear[r],'last_read':last_reads.get(r),'last_clear':last_clear[r],'return_frame':frames[r]} for r in sorted(owned)]}
+
+
+def phase_binding(repo,source,candidate):
+ receipt=read(repo/PHASE)
+ payload=hashlib.sha256(gzip.decompress((repo/SOURCE).read_bytes())).hexdigest()
+ require(receipt['actual_word_canonical_sha256']==payload and receipt['status']=='PASS_JOINT_HELPER_MAPS_ALL_ACTUAL_ABSOLUTE_PHASES','Absolute phase receipt/source binding')
+ for d in ('forward','backward'):
+ for kind in ('warp','phase','adapter'):
+ require([e for e in source['programs'][d] if e[0]==kind]==[e for e in candidate['programs'][d] if e[0]==kind],'Changed phase/native/adapter sequence')
+ return {'source_payload_sha256':payload,'receipt':PHASE,'source_absolute_phase_lowering_replayed':False,'exact_native_phase_adapter_order_preserved':True}
+
+
+def check(repo,candidate,exact=False):
+ source=read(repo/SOURCE)
+ contract=relation_structure(source,candidate)
+ run=run_frames(candidate['canonical'],candidate['programs']['backward'],contract['owned'],exact)
+ forward=run_frames(candidate['canonical'],candidate['programs']['forward'],{('C',0)},exact,False)
+ public={k:v for k,v in contract.items() if k not in ('owned','source_map','snapshots')}
+ public['snapshots']={label(k):v for k,v in contract['snapshots'].items()}
+ return {'contract':public,'backward':run,'forward':forward,'phase':phase_binding(repo,source,candidate)}
+
+
+def mutations(repo,candidate):
+ checks={}
+ def reject(name,mutate):
+ bad=copy.deepcopy(candidate);mutate(bad)
+ try:check(repo,bad,False)
+ except (ValueError,IndexError,KeyError) as err:checks[name]=str(err)
+ else:raise ValueError('Mutation escaped: '+name)
+ def program(x):return x['programs']['backward']
+ def first_snapshot(x):return next(i for i,e in enumerate(program(x)) if e[0]=='scalar' and e[1][:2]==['copy',['C',1]])
+ reject('borrowed_clear',lambda x: program(x)[0][1].__setitem__(1,['L',0]))
+ reject('missing_initial_pivot_clear',lambda x: program(x).pop(0))
+ reject('alias_owned_snapshot_bank',lambda x:x['owned']['backward'].__setitem__(2,['C',1]))
+ def reuse(x):
+ j=next(i for i,e in enumerate(program(x)) if e[0]=='scalar' and e[1][:2]==['copy',['C',2]])
+ program(x)[j-1][1][1]=['C',1];program(x)[j][1][1]=['C',1]
+ reject('reused_live_snapshot_bank',reuse)
+ reject('wrong_snapshot_frame',lambda x:program(x)[first_snapshot(x)].__setitem__(2,0))
+ reject('wrong_snapshot_source',lambda x:program(x)[first_snapshot(x)][1].__setitem__(2,['C',0]))
+ reject('missing_owner_return',lambda x:program(x).pop())
+ reject('missing_retained_output_operation',lambda x:program(x).pop(next(i for i,e in enumerate(program(x)) if e[0]=='scalar' and e[1][0]=='add' and e[1][1][0]=='L' and e[1][1][1]<224)))
+ reject('undeclared_storage_alias',lambda x:program(x)[first_snapshot(x)][1].__setitem__(1,['C',9]))
+ reject('changed_phase_marker',lambda x:program(x).pop(next(i for i,e in enumerate(program(x)) if e[0]=='phase')))
+ reject('wrong_final_owned_frame',lambda x:program(x)[-1].__setitem__(2,0))
+ reject('wrong_center_copy_gauge',lambda x:next(e for e in program(x) if e[0]=='scalar' and e[1][:2]==['copy',['C',0]]).__setitem__(2,0))
+ return checks
+
+
+def main():
+ parser=argparse.ArgumentParser();parser.add_argument('--repo',type=Path,default=REPO);parser.add_argument('--exact',action='store_true');parser.add_argument('--structure',action='store_true');parser.add_argument('--controls',action='store_true');parser.add_argument('--output',type=Path);parser.add_argument('--candidate',type=Path);parser.add_argument('--candidate-head',default=HEAD)
+ a=parser.parse_args();candidate_path=a.candidate or a.repo/CANDIDATE;candidate=read(candidate_path)
+ result={'status':'PASS_EXACT_RUNTIME_OWNERSHIP' if a.exact else 'PASS_STRUCTURAL_RUNTIME_OWNERSHIP','candidate_head':a.candidate_head,'candidate_word':str(candidate_path.resolve()),'candidate_word_sha256':hashlib.sha256(candidate_path.read_bytes()).hexdigest(),'canonical_main':MAIN,'scope':'Independent event parser; no author Python imports or WITNESS/RESULT counters used','result':check(a.repo,candidate,a.exact)}
+ if a.controls:result['mutation_controls']=mutations(a.repo,candidate)
+ data=json.dumps(result,indent=2,sort_keys=True)+'\n'
+ if a.output:a.output.write_text(data)
+ print(data)
+
+
+if __name__=='__main__':main()
diff --git a/research/joint-relations-independent-validation/capsule/agents/prices/check_prices.py b/research/joint-relations-independent-validation/capsule/agents/prices/check_prices.py
new file mode 100644
index 0000000000..c8b7284f75
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/prices/check_prices.py
@@ -0,0 +1,264 @@
+#!/usr/bin/env python3
+"""Independent event invoice and rational outward-rounded prices. No candidate imports.
+
+New audit code by the execution pricing lane with substantial OpenAI Codex help.
+Construction credit: Ali Romman; retained source Cao Yifan, Cinna Davis, zxv,
+Jacob Alan Sussman. This verifies prices conditional on separately checked semantics.
+"""
+import argparse, collections, functools, gzip, hashlib, json
+from fractions import Fraction as F
+from pathlib import Path
+
+HERE=Path(__file__).resolve().parent
+REPO=HERE.parents[1]/'repository'
+S=10**65
+
+def ceildiv(a,b): return -((-a)//b)
+def need(p,s):
+ if not p: raise ValueError(s)
+def read(p):
+ b=p.read_bytes(); return json.loads(gzip.decompress(b) if p.suffix=='.gz' else b)
+def digest(p): return hashlib.sha256(p.read_bytes()).hexdigest()
+def encode(v):
+ if isinstance(v,F): return str(v)
+ if isinstance(v,dict): return {str(k):encode(x) for k,x in v.items()}
+ if isinstance(v,(list,tuple)): return [encode(x) for x in v]
+ return v
+
+def census(w):
+ c=w['canonical']; frames=c['frames']; dims=list(map(len,frames)); v=c['v']
+ need(len(c['start'])==len(c['final'])==2*v+408 and v==len(c['ports']), 'Main/helper ABI')
+ def reduce_vector(x,basis):
+ for pivot,row in basis:
+ if x & (1<0,'Independent binary frame')
+ basis.append((row.bit_length()-1,row));basis.sort(reverse=True)
+ bases.append(basis)
+ def subset(a,b): return all(reduce_vector(x,bases[b])==0 for x in frames[a])
+ all_profiles={}
+ for direction,events in w['programs'].items():
+ owned={tuple(x) for x in w.get('owned',{}).get(direction,[['C',0]])}
+ current={('L',i):f for i,f in enumerate(c['start'])}
+ current.update({r:None for r in owned if r[0]=='C'})
+ paid=collections.Counter(); types=collections.Counter(); scalar_types=collections.Counter(); tariff=0
+ for e in events:
+ kind=e[0]; types[kind]+=1
+ if kind=='scalar':
+ g,frame=e[1:]; dst=tuple(g[1]);scalar_types[g[0]]+=1
+ if g[0] in ('clear','copy'): tariff+=2
+ else:
+ q=F(*(g[3:] if g[0]=='add' else g[2:]));n,d=abs(q.numerator),q.denominator
+ need(n>0 and d&(d-1)==0,'Dyadic scalar tariff')
+ if g[0]=='scale':
+ need(n&(n-1)==0,'Unit dyadic scale');tariff+=2*(abs(n.bit_length()-d.bit_length())+int(q<0))
+ else:
+ need(g[0]=='add','Tariff opcode');tariff+=2*(3+n.bit_length()-1+n.bit_count()+d.bit_length()-1)
+ if g[0]=='clear': current[dst]=frame
+ else:
+ need(current[dst]==frame,'Scalar destination frame')
+ if g[0] in ('add','copy'): need(current[tuple(g[2])]==frame,'Scalar source frame')
+ elif kind=='warp':
+ _,dst,op,a,b=e;dst=tuple(dst)
+ need(current[dst]==a,'Warp input frame'); current[dst]=b
+ elif kind in ('climb','center'):
+ if kind=='climb': _,tag,i,a,b,claimed=e; dst=('L',i)
+ else: _,i,a,b,claimed=e; dst=('C',i)
+ need(current[dst]==a,'Paid input frame')
+ # The price is computed from endpoint dimensions, never its JSON rank.
+ rank=abs(dims[b]-dims[a]);need(rank==claimed and rank>0,'Paid rank witness')
+ need(subset(a,b) if kind=='climb' else subset(a,b) or subset(b,a),'Nested paid frame')
+ paid[rank]+=1;current[dst]=b
+ elif kind=='zero_retag':
+ _,dst,a,b=e;dst=tuple(dst)
+ need(current[dst]==a,'Retag frame');current[dst]=b
+ else: need(kind in ('phase','adapter'),'Known event kind')
+ need([current['L',i] for i in range(2*v+408)]==c['final'],'Final frame census')
+ targets=collections.Counter()
+ lost=[]
+ for i in range(2*v,2*v+408):
+ a,b=c['start'][i],current['L',i]
+ rank=dims[b]-dims[a];need(rank>0 and subset(a,b),'Productive rank')
+ if ('L',i) in owned: lost.append([i,rank])
+ else: targets[rank]+=1
+ all_profiles[direction]={'paid':paid,'helpers':targets,'event_types':types,'scalar_types':scalar_types,'real_scalar_allowance':tariff,'surrendered_helpers':lost}
+ return all_profiles
+
+def invoice():
+ wp=REPO/'research/kappa-joint-relations-20261023/WORD.json.gz'
+ sp=REPO/'research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'
+ cp=REPO/'research/joint-helper-lattice/CONTROLLER.json'
+ w=read(wp);source=read(sp);controller=read(cp)
+ successor_path=HERE.parent/'sources/pr5387/research/eight-owned-relations/WORD.json.gz'
+ successor=census(read(successor_path))
+ new=census(w);old=census(source)
+ for direction in new:
+ need(successor[direction]['paid']==new[direction]['paid'] and successor[direction]['helpers']==new[direction]['helpers'],'Actual PR5387 same profile')
+ def whole(local):
+ T=collections.Counter();P=collections.Counter();counts=collections.Counter();parts={}
+ v=w['canonical']['v']; h=w['canonical']['h']; step=h-1
+ for e in controller['physical_events']:
+ counts[e[0]]+=1
+ if e[0]=='LOCAL':
+ direction='backward' if e[3] else 'forward'
+ counts[direction]+=1;T.update(local[direction]['helpers']);P.update(local[direction]['paid'])
+ elif e[0]=='QUERY_SHEAR': P[1]+=v
+ elif e[0]=='IDLE': P[step*len(e[2])]+=2*v
+ main=collections.Counter()
+ for exponents in controller['diagonal']:
+ need(abs(exponents[0])==1 and set(exponents[1:])<= {0,1},'Whole completed main target')
+ main[1+step*sum(exponents[1:])]+=v
+ T.update(main)
+ return {'targets':dict(sorted(T.items())),'paid':dict(sorted(P.items())),
+ 'productive_fields':sum(T.values()),'paid_calls':sum(P.values()),
+ 'target_rank_mass':sum(r*n for r,n in T.items()),'paid_rank_mass':sum(r*n for r,n in P.items()),
+ 'controller_event_types':counts,'main_targets':main}
+ candidate,baseline=whole(new),whole(old)
+ delta={k:{r:candidate[k].get(r,0)-baseline[k].get(r,0) for r in set(candidate[k])|set(baseline[k]) if candidate[k].get(r,0)!=baseline[k].get(r,0)} for k in ('targets','paid')}
+ need(delta=={'targets':{9:-128},'paid':{1:-128,8:-128}},'Actual whole delta')
+ need(candidate['paid_calls']==64148 and candidate['productive_fields']==10800,'Whole counts')
+ need(candidate['target_rank_mass']-candidate['paid_rank_mass']==752,'Conserved mass surplus')
+ inputs={str(p.relative_to(REPO)):digest(p) for p in (wp,sp,cp)}
+ inputs[str(successor_path.relative_to(HERE.parents[1]))]=digest(successor_path)
+ return {'candidate_head':'4bd6efa51a495a7c7b7754915cf0244e7e60969e','canonical_main':'1ec1119972c9aefe42525172d07b332fcff81cb4',
+ 'inputs_sha256':inputs,'local_candidate':new,'local_successor':successor,'successor_head':'b1ab650d36f59e5be682a813145b7c67e219e341','local_baseline':old,'candidate':candidate,'baseline':baseline,'delta':delta,
+ 'semantic_dependency':'Each retained endpoint must independently satisfy ordinary completed-helper ABI; zero_retag validity and owned lifetimes checked by other lanes.'}
+
+# Each pair is [lower,upper] in units 1/S. All interval operations round out.
+def mul(a,b):
+ q=[x*y for x in a for y in b]; return min(q)//S,ceildiv(max(q),S)
+def add(a,b): return a[0]+b[0],a[1]+b[1]
+def scale(a,q):
+ q=F(q); x=[n*q.numerator for n in a]
+ return min(x)//q.denominator,ceildiv(max(x),q.denominator)
+def div(a,b):
+ need(b[0]>0,'Positive denominator');q=[F(x*S,y) for x in a for y in b]
+ return min(q).__floor__(),max(q).__ceil__()
+def constant(q):
+ q=F(q)*S;return q.__floor__(),q.__ceil__()
+def interval(a): return [F(a[0],S),F(a[1],S)]
+def decimal(a,digits=30):
+ # Display rounding outward as well; exact bounds are always retained.
+ factor=10**digits;return [f'{a[0]*factor//S/ factor:.{digits}f}',f'{ceildiv(a[1]*factor,S)/ factor:.{digits}f}']
+@functools.lru_cache(None)
+def log(rank):
+ need(rank>=1,'Positive integer log')
+ if rank==1:return (0,0)
+ k=rank.bit_length()-1;x=F(rank,2**k);z=(x-1)/(x+1)
+ def atanh(q):
+ total=F(0);term=q
+ for j in range(90):total+=term/F(2*j+1);term*=q*q
+ tail=2*term/(181*(1-q*q))
+ return constant(2*total)[0],constant(2*total+tail)[1]
+ a=atanh(z);b=atanh(F(1,3));return add(a,scale(b,k))
+def exp_positive(a):
+ need(a[0]>=0 and a[1]< 16*S,'Exp convergence range')
+ term=(S,S);total=term
+ for n in range(1,1000):
+ term=scale(mul(term,a),F(1,n));total=add(total,term)
+ # All subsequent exact terms have ratio <= upper(x)/(n+1).
+ if term[1]<=2 and a[1] < (n+1)*S:
+ tail=ceildiv(term[1]*a[1],(n+1)*S-a[1])
+ return total[0],total[1]+tail
+ raise ValueError('Exp iteration limit')
+@functools.lru_cache(None)
+def power(rank,exponent):
+ exponent=F(exponent)
+ if exponent==0:return(S,S)
+ a=scale(log(rank),abs(exponent));result=exp_positive(a)
+ return result if exponent>0 else div((S,S),result)
+def moment(hist,exponent):
+ result=(0,0)
+ for r,n in hist.items():result=add(result,scale(power(int(r),exponent),n))
+ return result
+
+def validate_invoice_claim(proposed,derived):
+ for kind in ('targets','paid'):
+ need(proposed[kind]==derived[kind], 'Proposed '+kind+' disagrees with literal event-derived census')
+ return True
+
+def prices(data):
+ T=data['candidate']['targets'];P=data['candidate']['paid'];tcount=data['candidate']['productive_fields']
+ validate_invoice_claim({'targets':dict(T),'paid':dict(P)},data['candidate'])
+ def margin(c):
+ a,b=moment(T,1-c),moment(P,1-c);return a[0]-b[1],a[1]-b[0]
+ low,high=F('.00302667476807'),F('.00302667476808')
+ need(margin(low)[0]>0 and margin(high)[1]<0,'Exact fixed-profile root bracket')
+ # Independently certify strictly decreasing M(C) on [0,.05]. Since
+ # M'(C)=-sum signed n*r^(1-C)*ln(r), bound that sum from below.
+ signed={r:T.get(r,0)-P.get(r,0) for r in set(T)|set(P)}
+ derivative_bounds=[]
+ for j in range(16):
+ l,r=F(j,320),F(j+1,320);lower=0
+ for rank,n in signed.items():
+ b=mul(power(int(rank),1-r if n>0 else 1-l),log(int(rank)))
+ lower+=n*b[0 if n>0 else 1]
+ need(lower>0,'Strict decreasing raw moment');derivative_bounds.append(F(lower,S))
+ rest=[]
+ for j in range(128):
+ l,r=F(1,20)+F(19*j,2560),F(1,20)+F(19*(j+1),2560)
+ upper=sum(n*power(int(rank),1-l if n>0 else 1-r)[1 if n>0 else 0] for rank,n in signed.items())
+ need(upper<0,'Negative moment above .05');rest.append(F(upper,S))
+ variants={}
+ for label,K,C,rho in [('PR5383',F('.00302666'),F('.00302667'),F(1,10**9)),('PR5387',F('.003026674765'),F('.003026674766'),F(1,10**12))]:
+ a,b=moment(T,1-C),moment(P,1-C)
+ alpha=div(b,a);gamma=div(moment(P,1-C+F(1,5)),mul(power(20,F(1,5)),a))
+ delta=div(constant(21*tcount),mul(power(20,C),a))
+ alpha_budget=(scale(a,1-rho)[0]-b[1],scale(a,1-rho)[1]-b[0])
+ need(alpha[1]F(63,64)**1000,'Complement capacity')
+ need(F(power(145,1024*C)[1],S)<2**1000,'Initial range')
+ rounding_fail=1/(1+1024*F(1,10**13))+F(4,2**32)>=1
+ predecessor_reserve_rejected=alpha[0]>constant(1-F(1,10**9))[1]
+ if label=='PR5387': need(predecessor_reserve_rejected,'Reject old reserve at stronger C')
+ variants[label]={'kappa':K,'tested':C,'reserve':rho,'raw_margin':interval(margin(C)),'target_moment':interval(a),'paid_moment':interval(b),
+ 'alpha':interval(alpha),'gamma':interval(gamma),'delta':interval(delta),'alpha_budget':interval(alpha_budget),
+ 'coarse_completed_upper':bound,'coarse_completion_slack':1-bound,'actual_completed_upper':exact_tail_bound,
+ 'eta':interval(eta),'raw_headroom_over_claim':[low-K,high-K],'raw_headroom_over_tested':[low-C,high-C],
+ 'coarse_rounding_reserve_1e-13_fails':rounding_fail,'predecessor_reserve_1e-9_rejected':predecessor_reserve_rejected,
+ 'extra_H1_affordable':int(F(alpha_budget[0],S).__ceil__()-1),
+ 'tail_offset':F(1,5),'power':1024,'cutoff':20,'floor':21}
+ next_tested_grid={}
+ for C in [F('.003026674767'),F('.003026674768')]:
+ a,b=moment(T,1-C),moment(P,1-C);alpha=div(b,a)
+ reserved=constant(1-F(1,10**12));budget=(scale(a,1-F(1,10**12))[0]-b[1],scale(a,1-F(1,10**12))[1]-b[0])
+ next_tested_grid[str(C)]={'tested':C,'alpha':interval(alpha),'alpha_budget':interval(budget),'strict_alpha_pass':alpha[1]=reserved[1]}
+ need(next_tested_grid[str(F('.003026674767'))]['strict_alpha_pass'],'Next C grid still passes alpha')
+ need(next_tested_grid[str(F('.003026674768'))]['strict_alpha_fail'],'Following C grid fails reserved alpha')
+ controls={}
+ for name,patch in [('unearned_128_H9',{9:128}),('extra_H1',{1:1})]:
+ if name.startswith('unearned'):
+ bad={'targets':dict(T),'paid':dict(P)};bad['targets'][9]+=128
+ mutant_hash=hashlib.sha256(json.dumps(encode(bad),sort_keys=True,separators=(',',':')).encode()).hexdigest()
+ try: validate_invoice_claim(bad,data['candidate'])
+ except ValueError as error: controls[name]={'status':'invoice_mutant_rejected','reason':str(error),'added_target_count':128,'recomputed_proposed_invoice_sha256':mutant_hash}
+ else: raise ValueError('Unearned productive outputs escaped invoice validator')
+ else:
+ bad=dict(P);bad[1]+=1
+ controls[name]={'margin_upper_at_5383':F(moment(T,1-F('.00302667'))[1]-moment(bad,1-F('.00302667'))[0],S)}
+ need(controls[name]['margin_upper_at_5383']<0,'Reject unpriced H1')
+ return {'status':'PASS_INDEPENDENT_EVENT_INVOICE_AND_EXACT_PRICES','method':'Integer fixed-point outward rounding 10^-65; rational atanh log series and exp Taylor geometric remainder; no author code imports',
+ 'raw_root_bracket':[low,high],'min_derivative_negation_lower':min(derivative_bounds),'remaining_moment_upper':max(rest),'variants':variants,'next_tested_1e-12_grid':next_tested_grid,'controls':controls,
+ 'independence_scope':'Fresh implementation of count/parser and interval arithmetic; no PR5377/5383/5387 or PR5384 arithmetic engine reused. Literal word and controller are common primary evidence.',
+ 'ceiling_scope':'Unique raw crossing of this exact signed profile for 0 -> i^(a+q(x)) |A*x xor b>,
+q(x) = sum_i alpha_i*x_i + 2*sum_(i A*x_j xor b for every j,
+phase = a*f + sum_(j=1..f) q(x_j) (mod4).
+```
+
+Apply the finite row-addition list to the corresponding pair of complete f-axis slots, and use the pointwise residue above. Each selected slot is a full range; arbitrary intervening, preceding and following spectator fields remain present. The temporary complete compact fields are returned by each addition. Thus the lift is exactly m tensor-powered f, acting as identity on the other address fields. It uses one fixed list of primitive **types/operations**, rather than f separately allocated tapes. Its per-record descriptor arithmetic is polynomial in the same selected address bound, and the number of work tapes stays fixed for the template.
+
+For a recorded positive-rank recipe, source equality is the ordered product `right.then(C_r).then(left)`. Tensoring this product gives `right_f.then(C_(r*f)).then(left_f)` after the fixed coordinate reordering. This is one ordinary positive rank-r*f child on the actual owner's full stream, with its input and output monomials independently retained. Inverse orientation and Pauli corrections are included by the actual signed recipes. No identity distributes a tensor power over a matrix sum.
+
+For the scalar word itself, use selected #4359's free-word substitution theorem: replace each warp generator by its f-column lift while leaving ADD/SCALE coefficients and chronology unchanged. This is an algebra homomorphism from the noncommuting free-word algebra; hence the already checked arbitrary-input word identity survives. The scalar program is not itself tensor-powered. Keeping a single constant phase a instead of a*f would violate the lift; a negative control explicitly distinguishes that mutation at f=2.
+
+The ideal algebraic lift holds for every positive f. Its physical tariff applies only in the selected source domain: f<=p, A=O(p), K/log p tending to infinity, and a superpolynomial record fiber. In the actual layer f<=e<=floor(b_in^epsilon) and p=6*b_in eventually. No tariff is extrapolated to arbitrary independent f,p/geometry. The compact-control parameter hypotheses are unchanged: f slots, complete dirty reservations, `A=O(p)`, record fiber beyond fixed powers, and the same selected movement exponent. The final uniform template may have much larger fixed dimensions and operation counts. That changes constants and thresholds through section6 below, rather than changing these quantifiers or creating a new tape per coordinate.
+
+## 4. Exhaustive family/owner specialization
+
+The executable source census is over the actual final payload, not its proposed histogram. It classifies every event in both21449-record orientations, and checks exact scalar coefficients/opcodes/chronology against the selected THREE-base word. Main charts on all224 persistent main owners are exact retained records. Every scalar target/source belongs to the632 declared persistent owners or the one declared owned C0. Clear and overwrite COPY target only C0; ADD arguments are distinct owners; no new borrowed owner, alias or productive C0 is introduced.
+
+| Actual family | Membership/coverage | Selected physical interpretation |
+| --- | --- | --- |
+| 180 signed warp classes,240 occurrences | Each actual G is invertible; both signed recipes have rank0;800new monomial records cover this and the changed families below | Fixed affine binary permutation and unit quadratic phase from section2; same all-f native generator |
+| 3290 borrowed climbs per orientation | Actual source/target bases strictly nested, correct current owner/frame and rank | The selected arbitrary-U-subset-V factorization: two rank-zero adapters and one positive rank-r*f child |
+| Eight center calls per orientation | Actual nested comparable bases, owned C0 only, all eight rank8 jobs billed | Same positive child plus signed adapters; no productive credit, no allocation of a new arbitrary input |
+| 408 helper endpoints | Actual strict nested entrance/exit, profile `{4:28,7:7,8:47,9:326}` | Complete two-sided normal form on each distinct arbitrary input field; no internal scalar reframing shortcut |
+| 448 main entrance/exit charts | Exact event equality with retained base main charts | Source-identical selected chart/axis interface, with its retained charge |
+| 17453 scalar records per orientation | Exact old opcode/coefficient sequence, dyadic grammar and current-frame checks | Retained ADD, dyadic unit SCALE, owned COPY/CLEAR; identical scalar tariff |
+| Ten phase labels | Fixed annotations, no new physical instruction | Existing scalar-word scope boundaries; not extra outputs or uncharged operators |
+
+Exact factorization equality and arbitrary-input endpoints are independently established by the admission dossier's native/phase replays, not by a syntactic schema. This module supplies the missing **physical class implication** for those exact factors. The new phase receipt covers180signedwarp classes,105newpaid pairs and5changedhelper pairs. The382 unchanged helpers are bound to the selected #4470 phase receipt through gain_acceptance's exact ordered-basis/owner lineage;26changed helpers use the new five-pair receipt. The independently replayed all2855paid-pair factorization module supplies the full actual paid-pair coverage. These coverage claims remain separate from this module's fresh class/census checks.
+
+For owned return, the local word retains one physical C0 and ends its C0 updates with a permitted erase. The existing arbitrary-input native proof establishes completed main/helper endpoints and C0 clearance. During product/compiler substitution, each suspended local occurrence receives its own center bank; all child inputs are distinct actual fields, even when values are correlated or one input is a parent's center. The child finishes and its adapters/role ordering return **before** the parent resumes. The parent clears only its own bank after its last use. Every such bank is excluded from productive W and included in full O. This is exactly the selected compiler ownership rule; no one-bank-per-depth reuse or undeclared initialized input is used.
+
+## 5. Finite raw tariffs in the selected unit
+
+The tariff unit here is a retained elementary scalar/movement/phase **record**, each realized with the selected physical primitive's asymptotic bound. It is not one literal tape instruction and does not suppress the f-dependent movement bound. Choose the same common upper unit for the fixed primitive alphabet as in the selected finite-word accounting. Each new two-sided nine-axis recipe has at most342 elementary records, below the retained conservative1000-per-group allowance. Unchanged main charts retain their selected count/unit. The selected primitive implementation constants, record-paid setup, scans and repair remain paid in that common physical unit. Changing the finite catalogue does not require a new asymptotic movement assumption.
+
+The actual local route groups are
+
+```
+3298 paid jobs + 2*408 helper wrappers + 240 warps + 448 main charts
+ = 4802 groups,
+4802*1000 = 4,802,000.
+```
+
+The source scalar allowance formula, reimplemented directly without importing its evaluator, gives158120 forward and158168 backward. Therefore
+
+```
+158168 + 4802000 = 4960168 < 10^7.
+```
+
+This is an instantiation of the selected raw-unit bound with a smaller changed paid count, not reuse of an old expanded compiler cap. The controller remains18full calls and15thin queries, with the exact retained physical-event and boundary programs. The complete source raw bound is
+
+```
+18*10^7 + 15*1792
+ + 32*112*(#physical_events + #left_boundary_program + #right_boundary_program)
+ = 181098496 < 10^9.
+```
+
+Each thin query's paid rank-one request, owned copy/add/erase and inverse orientation remain in the source invoice. Idle jobs, main normalizations, inherited controller geometry and actual exact phase bills remain charged. No local or controller charge is credited as a new productive output. These numerical bounds concern **raw** supplier records only; they are not the expanded uniform word's operation count, storage or literal physical runtime.
+
+## 6. Expanded compiler, precision and tape constants
+
+Apply the selected chronological product, same-owner paid completion, disjoint splitting and integer finite compiler to this now-specialized raw program. The algorithms are finite and only instantiate the same grammar. Their matching uses complete job endpoints and restores adapters, and their owner allocation is the rule just proved applicable. No new movement species occurs when a fixed matcher has a larger fixed rank: binary basis/coordinate permutations have the same finite elimination construction, now with a larger fixed list.
+
+Let W,P,O be the actual final productive width, paid rank-one count and full owned-bank allocation; let R count the full native/movement/normalizer records, including product, completion, split and compiler routes. Let G be their fresh dyadic coefficient/phase allowance, computed by summing the actual scalar allowances (plus the source's conservative non-scalar charge). These are finite computable integers of the new expanded template. They are fixed before multiplication input size varies. A record-count overestimate and one owned bank per relevant occurrence suffice; no practical materialization or old p3 numerical count is needed.
+
+Use the **new** values in the selected semantic prescription:
+
+```
+Z=W+O,
+E=64*(Z+N+P+G+1)^3,
+B=P+E,
+C0=32*N*B^2.
+```
+
+The selected completed-child argument gives `A(e)<=A(floor(e/N))+P*floor(e/N)+E`, hence `A(e)<=2B*e`. Monomial permutations/unit phases add no coefficient height but do retain their execution/descriptor costs. The new C0 determines a new eventual fine-grid threshold. The compact row reserve, full simultaneous stock products, depth-first parking, fixed tape inventory and polynomial setup degrees also use the new W,P,O,R,N and selected formulas. Fixed enlarged degrees/counts are absorbed by the same retained superpolynomial record fiber and strict outer epsilon<1 after increasing the threshold. In particular, neither raw10^9 nor selected p3/p16 reserve constants stand in for these expanded values.
+
+Thus P2–P4 can consume a genuine new finite instance of H_selected's grammar and precision/stock/tape prescriptions. This note does not independently prove the historical native movement/repair or outer analytic/recovery stack. Those are exactly the assumptions already retained by selected #4470, with no additional candidate-specific implementation assumption.
+
+## 7. Conclusion and exact limits
+
+Given H_selected and the source-bound exact semantic/phase endpoints supplied by the independent native dossier, the final catalogue has permitted explicit all-f realizations, legal actual-owner return, finite raw tariffs and the selected expanded-constant substitution. No extra primitive or changed movement exponent is required. P1 is therefore a **consequence** of H_selected for this instance. It need not be restated as a new hypothesis “the new recipes implement.”
+
+`checks/specialization.py` runs through the master verifier and its source-authenticated `--repo` working-byte loader; it never substitutes clean Git blobs for dirty inputs. Its new actual catalogue has800monomials with at most83 elementary records each, compared with the uniform171 bound. It also checks1692selected monomial records by the identical schema, exhaustive event/role/rank/scalar census in both orientations, helper geometry, retained main charts, the4802route grouping and raw bounds. Controls reject singular maps, non-Z4 absolute phases, borrowed clear, unpaid rank changes, non-dyadic scalars and an unlifted f=2 global phase. Exact phase/operator equality is intentionally supplied by the separate phase/native verification rather than inferred from membership.
+
+Credits remain with Cao Yifan/intqwq (#4610), Cinna Davis (#4470/#4416/controller/helper lineage), zxv (#4359/native/compiler/semantic precision), icekylinx and Dugongue (general Clifford/transported frames), Jacob Alan Sussman (mixed integer compiler), and all retained physical/BIT/geometry/analytic contributors. This new specialization/proof/check uses substantial OpenAI assistance. It is a scoped conditional AI verification contribution, not an unconditional multiplication theorem or independent human/kernel acceptance.
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/TASK.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/TASK.json
new file mode 100644
index 0000000000..761b7c6ba0
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/TASK.json
@@ -0,0 +1,94 @@
+{
+ "task_id": "complex-new-helper-inventory",
+ "assignment": "Independent source-bound conditional admission of final merged PR4610, not a new construction or root-only hillclimb",
+ "scope_status": "changed",
+ "scope_change_reason": "Explicit user goal permits completing verification/incorporation of existing construction above selected4470 under exactly the same assumptions",
+ "outcome": "completed",
+ "object": "Final native payload and complete p16 compiler/outer construction",
+ "changed_hypothesis": "Complete changed paid profile + compatible native/helper/phase and finite compiler specialization within inherited selected framework",
+ "method_domain": "Independent stdlib exact circuits, free group rows, frames, controller census, directed rational intervals and source closure",
+ "source_pins": {
+ "canonical_main": "ec2780e8aeb1c88acaf5e9e470ef8c68e7fbbb6c",
+ "PR4610": "20bb93cd990d2ff683e4d0fc56b87a42cd5d3296"
+ },
+ "nearest_overlap": "Merged Cao Yifan PR4610; independent admission rather than novelty claim",
+ "compute_cap": "Coordinator serial guarded cold replay only; prepare scripts without heavy local run",
+ "expected_gain": "8129/5000000000 = .0000016258 over selected4470",
+ "unknown_costs": "No unknown cost silently zero; uniform realization costs remain precisely selected conditional premises",
+ "falsification_test": "Working-byte mutation, phase mutation invisible to binarytableau, owned-erasure/frame mutation, completepaid omission, unfunded tail/compiler/outer target",
+ "source_credit": [
+ "Cao Yifan PR4610",
+ "Cinna Davis PR4470",
+ "Dugongue",
+ "zxv",
+ "Jacob Alan Sussman",
+ "retained native/BIT/precision/outer lineage"
+ ],
+ "open_next_questions": [
+ {
+ "question": "Formalize the inherited whole multiplication framework",
+ "why_it_matters": "Conditional admission is not unconditional multiplication proof",
+ "first_step": "Define actual amplitude/phase and physical execution contracts before connecting scoped finite certificates",
+ "blocked_by": "Uniform physical and analytic framework remains inherited"
+ }
+ ],
+ "schema_version": 1,
+ "base_commit": "ec2780e8aeb1c88acaf5e9e470ef8c68e7fbbb6c",
+ "priority_revision": 7,
+ "original_card": {
+ "id": "complex-new-helper-inventory",
+ "question": "Can a new local cost interface change the deficit-to-recursive-cost ratio beyond current packing?",
+ "starting_points": [
+ "docs/research/research-family-status.md",
+ "research/complex-local-word-ceiling/README.md",
+ "research/heterogeneous-owner-assembly/README.md",
+ "certificates/selected-result.json",
+ "research/selected-k8-unrestricted-ends/README.md"
+ ],
+ "methods": [
+ "Propose a changed helper inventory and derive an optimistic exact moment.",
+ "Design a small completed instance and independently verify its endpoint and rank bill."
+ ],
+ "acceptance_gate": "A new physically realizable contract outside the frozen catalogue whose per-call profile, screened with ceiling.ceiling(), beats the selected word's packing ceiling; a lower cap does not establish identical circuitry or order attainable optima, and is insufficient to pass the stronger-budget target under this model. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.",
+ "first_step": {
+ "command": [
+ "python3",
+ "-B",
+ "research/complex-local-word-ceiling/verify.py"
+ ],
+ "expected": "PASS_COMPLEX_LOCAL_WORD_CEILING",
+ "inspect": "Read the selected word's per-call local profile, its packing ceiling and the lever table; run levers.py for the ideal budget of the lever you target.",
+ "scope": "Positive control and planning budget only; this is not a new construction or full cold replay."
+ },
+ "first_experiment": "Before any synthesis, write the candidate per-call local profile (and centre charge / unpaid coordinates if changed) and screen it with ceiling.ceiling(); reject it if even the ideal ceiling does not beat the selected word's by your stated margin.",
+ "bottleneck_link": "Packing of the selected word is capped at +0.87% (ceiling model); only a lower local excess spend or a changed coverage law raises the cap.",
+ "allowed_variations": [
+ "Narrow to one changed boundary or helper type with explicit counts.",
+ "If the coverage law, template or guard changes, derive an applicable fully charged replacement bound instead of applying the incumbent ceiling outside its scope."
+ ],
+ "scope_change_triggers": [
+ "Mixing only providers already inside the pinned catalogue.",
+ "Only changing helper terminal subspaces and monotone frames within the fixed scalar word, entrances and cleanup contract already covered by #1995/#2013.",
+ "Continuing a partial cost improvement while leaving the same unpriced consumer, restoration or central-readout obligation unresolved; refresh the family expansion decision first. Local product-retiming evidence has a narrow scope and is not a ban on changed graphs or contracts."
+ ],
+ "overlap_terms": [
+ "helper inventory",
+ "heterogeneous-owner",
+ "mutable leaver"
+ ]
+ },
+ "actual_scope": "Independent source-bound conditional admission of final merged PR4610, not a new construction or root-only hillclimb",
+ "bottleneck_link": "Existing changed native/helper invoice requires complete source-compatible verification before admission.",
+ "stop_rule": "Fail closed on missing source/phase/type/tariff implication; no conditional claim with stronger assumptions.",
+ "evidence": "Complete first cold replay passed all11 mathematical stages, sourceworking-byte preflight and independent P1/helper/phase review; FIRST-COLD-REPLAY.json. Postcommit registered replay/publication preflights remain separate.",
+ "author": "Independent audit prepared with OpenAI Codex; PR4610 construction by Cao Yifan",
+ "ai_assistance": "Substantial OpenAI Codex assistance for independent verification and written compatibility argument",
+ "open_questions": [
+ {
+ "question": "Formalize the inherited whole multiplication framework",
+ "why_it_matters": "Conditional admission is not unconditional multiplication proof",
+ "first_step": "Define actual amplitude/phase and physical execution contracts before connecting scoped finite certificates",
+ "blocked_by": "Uniform physical and analytic framework remains inherited"
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VALIDATION.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VALIDATION.json
new file mode 100644
index 0000000000..dfb8128030
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VALIDATION.json
@@ -0,0 +1,43 @@
+{
+ "status": "FIRST_COMPLETE_MATHEMATICAL_COLD_REPLAY_PASSED_FINAL_PUBLICATION_REPLAY_REQUIRED",
+ "first_receipt": "FIRST-COLD-REPLAY.json",
+ "first_receipt_sha256": "0b37e1741af786144e1eb78a752bee65424437107c5065181d8a28e05ec30122",
+ "first_master_verifier_seconds": 110.63370080996538,
+ "guarded_wall_seconds": 110.84,
+ "guarded_peak_RSS_MiB_approx": 123.63,
+ "fresh_complete_stages": [
+ "all_helpers",
+ "arithmetic",
+ "compiler",
+ "frame",
+ "helpers",
+ "invoice",
+ "lift",
+ "lineage",
+ "native",
+ "paid",
+ "specialization"
+ ],
+ "paid": {
+ "unique_union_pairs": 2863,
+ "oriented_classes": 5710,
+ "covered_paid_event_instances": 6596
+ },
+ "helpers": {
+ "roles": 408,
+ "oriented_classes": 34
+ },
+ "working_external_inputs": 51,
+ "code_change_after_first_run": "CLAIM presentation binding/scope checks and meaningful recomputed-hash metadata controls added; no audited mathematical checker module changed. Final committed-head registered complete replay is still required.",
+ "selected_changed": false,
+ "assumptions": "Exactly the five selected4470 assumption records; P1 is their source-specific specialization, not an additional premise.",
+ "checks_not_conflated": [
+ "Fresh complete mathematical replay",
+ "Independent AI review",
+ "Registration metadata validation",
+ "Committed-byte/source-history preflight",
+ "Exact-head hosted CI",
+ "Maintainer selection"
+ ],
+ "final_head_receipt_policy": "Write final exact-head replay outside the package to avoid recursive receipt hashes; retain its result and exact CI head in publication evidence."
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VERIFY.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VERIFY.json
new file mode 100644
index 0000000000..8f4e95ea81
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/VERIFY.json
@@ -0,0 +1,71 @@
+{
+ "schema_version": 1,
+ "status": "ready",
+ "python": "3.12",
+ "requirements": [],
+ "inputs": [
+ "certificates/frontier4470-source.json",
+ "certificates/selected-result.json",
+ "docs/research/pr-intake-evidence/pr4359/PROOF-REVIEW.md",
+ "docs/research/pr-intake-evidence/pr4416/PROOF-REVIEW.md",
+ "docs/research/pr-intake-evidence/pr4470/PROOF-REVIEW.md",
+ "docs/research/pr-intake-evidence/pr4470/REVIEWED-SOURCES.json",
+ "notes/batched-complex-rows.tex",
+ "notes/compact-control-movement.tex",
+ "notes/general-clifford-frames.tex",
+ "notes/stopped-product-complex.tex",
+ "references/semantic-bulk/pr23/semantic-bulk-17-note.tex",
+ "research/fresh-helper-boundary/CHANGES.json",
+ "research/fresh-helper-boundary/native.py",
+ "research/higher-moment-strictification/verify.py",
+ "research/joint-helper-lattice/CONTROLLER.json",
+ "research/joint-helper-lattice/NATIVE.json.gz",
+ "research/joint-helper-lattice/PATCH.json",
+ "research/joint-helper-lattice/PROOF.md",
+ "research/joint-helper-lattice/RESULT.json",
+ "research/joint-helper-lattice/native_joint.py",
+ "research/kappa-causal-continuation/buffer-borrowing/verify_buffers.py",
+ "research/kappa-function-composition/complex/prune_native.py",
+ "research/kappa-rebuild/complex/full-identity-certificates/THREE-base-FULL-IDENTITY-CANONICAL.json.gz",
+ "research/kappa-rebuild/complex/full-identity-certificates/THREE-base-FULL-IDENTITY-NATIVE.json.gz",
+ "research/kappa-rebuild/complex/native_extensions.py",
+ "research/kappa-rebuild/complex/power_two_balance.py",
+ "research/kappa-rebuild/complex/rebuild_native.py",
+ "research/kappa-rebuild/transfer-audit/FINITE-TEMPLATE-CLOSURE.md",
+ "research/kappa-round3-warp-20261022/ACTUAL-WORD-FREEZE.json",
+ "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "research/kappa-round3-warp-20261022/NATIVE-VALIDATION.json",
+ "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "research/kappa-round3-warp-20261022/PROOF.md",
+ "research/kappa-round3-warp-20261022/SOURCES.json",
+ "research/kappa-round3-warp-lean-20261022/NativeCore.lean",
+ "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "research/kappa-round6-compiler-tightening-20261022/arithmetic.py",
+ "research/missing-join-frame/PATCH.json",
+ "research/native-warp-extraction-boundary/algebra.py",
+ "research/native-warp-extraction-boundary/operators.py",
+ "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "research/query-thinned-controllers/PROOF.md",
+ "research/t74-native-fast/vendor/native/new/code/borrow/vendor/clifford/clifford_exact.py",
+ "research/transported-warp-frames/PROOF.md",
+ "research/warp-interface-20261022/ACTUAL-WORD-FREEZE.json",
+ "research/warp-interface-20261022/ACTUAL-WORD.json.gz",
+ "research/warp-interface-20261022/PATCH.json",
+ "research/warp-interface-20261022/PHASE-VALIDATION.json.gz",
+ "research/warp-interface-20261022/SOURCES.json",
+ "research/warp-interface-20261022/verify_candidate.py",
+ "research/warp-interface-20261022/warp_merge.py"
+ ],
+ "commands": [
+ {
+ "argv": [
+ "{python}",
+ "-I",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "Live-working-byte preflight; complete native/helper/paid phases; all-dirty free-group word; complete p16 invoice; two independent interval engines; compiler tails/capacity/outer; same-assumption class specialization and semantic controls"
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/__init__.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/__init__.py
new file mode 100644
index 0000000000..b8e75050ef
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/__init__.py
@@ -0,0 +1,3 @@
+"""Independent source-pinned PR4610 audit modules. Apache-2.0.
+Substantial OpenAI Codex assistance; construction source credit in README.
+"""
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/all_helpers.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/all_helpers.py
new file mode 100644
index 0000000000..04d5a7427a
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/all_helpers.py
@@ -0,0 +1,102 @@
+#!/usr/bin/env python3
+"""Complete finite helper residual/normalizer phase proof; no source imports.
+
+Only the independent reviewer module next to this checker is loaded. Source
+receipts are candidate circuit data. Their recorded PASS status is not used.
+Clifford conjugation on all Pauli generators fixes an operator up to scalar;
+exact nonzero anchor amplitudes fix that scalar, including absolute phase.
+"""
+import copy,gzip,hashlib,importlib.util,json,pathlib,sys,time
+
+from . import source
+from . import independent_clifford as C
+HERE=pathlib.Path(__file__).resolve().parent
+WORD_PAYLOAD='cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd'
+CANONICAL='ec2780e8aeb1c88acaf5e9e470ef8c68e7fbbb6c'
+
+def need(b,s):
+ if not b:raise ValueError(s)
+
+def normalizer_valid(C,r):
+ need(set(r)=={'matrix_rows','quadratic_rows','linear_Z4','offset','phase'},'exact normalizer field schema')
+ G,Q,a=r['matrix_rows'],r['quadratic_rows'],r['linear_Z4']
+ need(len(G)==len(Q)==len(a)==9,'nine-dimensional monomial')
+ need(all(type(x)is int and 0<=x<512 for x in G+Q),'binary normalizer matrices')
+ need(C.rank(G)==9 and C.transpose(Q)==Q,'invertible linear permutation and symmetric quadratic form')
+ need(all(type(x)is int and 0<=x<4 for x in a),'Z4 diagonal phases')
+ need(all(a[j]%2==((Q[j]>>j)&1)for j in range(9)),'Clifford diagonal phase parity')
+ need(type(r['offset'])is int and 0<=r['offset']<512,'monomial offset')
+ need(type(r['phase'])is int and 0<=r['phase']<4,'absolute scalar phase')
+
+def phase_equal(C,target,compiled):
+ T,S=C.tableau(target),C.tableau(compiled)
+ need(T==S,'all18 Pauli conjugations, with Pauli phases')
+ a,d=C.state(target);b,e=C.state(compiled)
+ need(sum(x*x+y*y for x,y in a)==1<<(2*d),'exact nonzero unit-norm anchor')
+ need((a,d)==(b,e),'exact absolute-phase anchor amplitudes')
+ return T,a,d
+
+def cover(rows):
+ roles=[i for r in rows for i in r['roles']]
+ need(len(roles)==408 and sorted(roles)==list(range(224,632)),'complete exact408 role coverage, no duplicates')
+ need(len({(r['input'],r['output'])for r in rows})==len(rows),'unique endpoint-pair source classes')
+
+def run():
+ start=time.monotonic()
+ objects={k:source.js(p) for k,p in {'word':'research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz','selected_recipes':'research/joint-helper-lattice/NATIVE.json.gz','changed_recipes':'research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz'}.items()}
+ source_hashes={}
+ raw_word=gzip.decompress(source.raw('research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'));need(hashlib.sha256(raw_word).hexdigest()==WORD_PAYLOAD,'exact final4610 canonical word payload')
+ c=objects['word']['canonical'];need(len(c['start'])==len(c['final'])==632 and c['h']==9,'actual persistent width and digit axes')
+ grouped={}
+ for role in range(224,632):grouped.setdefault((c['start'][role],c['final'][role]),[]).append(role)
+ catalogues={'selected_recipes':objects['selected_recipes']['new_physical_edges_and_boundaries'],'changed_recipes':objects['changed_recipes']['changed_helper_boundaries']}
+ rows=[]
+ for (a,b),roles in sorted(grouped.items()):
+ choices=[(name,j) for name,cat in catalogues.items() for j,row in enumerate(cat) if (row.get('old',row.get('input')),row.get('new',row.get('output')))==(a,b)]
+ need(choices,'actual helper recipe missing')
+ name,j=choices[-1]
+ rows.append(dict(input=a,output=b,rank=len(c['frames'][b])-len(c['frames'][a]),roles=roles,input_ordered_basis=c['frames'][a],output_ordered_basis=c['frames'][b],recipe_source=name,recipe_index=j))
+ cover(rows)
+ actual={}
+ for i in range(224,632):actual.setdefault((c['start'][i],c['final'][i]),[]).append(i)
+ need(len(actual)==len(rows)==17,'all17 actual final endpoint pairs')
+ source_catalogues={'selected_recipes':objects['selected_recipes']['new_physical_edges_and_boundaries'],
+ 'changed_recipes':objects['changed_recipes']['changed_helper_boundaries']}
+ evidence=[];phase_controls=[];census={}
+ for row in rows:
+ a,b,r=row['input'],row['output'],row['rank'];need(actual[a,b]==row['roles'],'actual final roles, not inferred from count')
+ U,V=c['frames'][a],c['frames'][b];need(U==row['input_ordered_basis']and V==row['output_ordered_basis'],'actual exact ordered frame bases')
+ need(all(type(x)is int and 0<=x<512 for x in U+V),'binary frame domain')
+ need(C.rank(U)==len(U)and C.rank(V)==len(V)and C.rank(U+V)==len(V),'independent exact nested frame bases')
+ need(r==len(V)-len(U)>0,'positive complete relative Fourier rank')
+ census[r]=census.get(r,0)+len(row['roles'])
+ candidate=source_catalogues[row['recipe_source']][row['recipe_index']]
+ ca,cb=(candidate['old'],candidate['new'])if row['recipe_source']=='selected_recipes'else(candidate['input'],candidate['output'])
+ need((ca,cb)==(a,b)and candidate['rank']==r,'source recipe class label/rank')
+ residual=C.adj(C.frame(U))+C.frame(V)
+ for direction in ('forward','backward'):
+ target=residual if direction=='forward'else C.conjugate(residual);rec=candidate['recipes'][direction]
+ need(set(rec)=={'left','right','rank'}and rec['rank']==r,'actual complete two-sided recipe')
+ normalizer_valid(C,rec['left']);normalizer_valid(C,rec['right'])
+ compiled=C.recipe(rec['right'])+[('C',1<0>M.margin(T,P,ks[-1])[1]
+ assert M.derivative_interval(T,P,F(0),F('.004'))[1]<0
+ strict=M.strictification(T,P,'.00302177581',{})
+ assert strict['same_model_moment_and_tail_screen']
+ old=source.js('research/joint-helper-lattice/RESULT.json');assert d['ordinary_BIT']==old['ordinary_BIT'],'unchanged source-bound ordinary BIT interface'
+ oT,oP=M.reconstruct(ctrl,M.dictint(old['local_paid']),M.dictint(old['local_helpers']))
+ assert oT==T and oP==M.dictint(old['paid']) and oP!=P
+ assert M.margin(T,oP,'.0030201659770')[0]>0>M.margin(T,oP,'.0030201659771')[1]
+ assert M.margin(T,oP,'.0030217758')[1]<0
+ bill_delta={str(r):P.get(r,0)-oP.get(r,0) for r in set(P)|set(oP) if P.get(r,0)!=oP.get(r,0)}
+ assert bill_delta
+ controls={}
+ bad=P.copy();bad[1]+=1
+ assert M.margin(T,bad,'.0030217758')[1]<0;controls['one_unfunded_H1_rejected']=True
+ bad=P.copy();bad[8]-=18*8
+ assert M.margin(T,bad,'.0030217758')[0]>M.margin(T,P,'.0030217758')[1]
+ controls['owned_centers_affect_complete_margin']=True
+ q=outer.evaluate(outer.parameters('.0030217758','.00302177581'))
+ assert q['all_positive']
+ for group in ['margins','strict_checks','functional_checks']:
+ assert q[group]=={n:F(v) for n,v in d['outer'][group].items()}
+ for name,patch in [('old_BIT',{'bit_saving':F('.0027')}),('closed_uniform',{'complex_uniform_saving':q['parameters']['b']}),('unfunded_endpoint',{'kappa':F('.00302177581')}),('closed_epsilon',{'epsilon':F(1)})]:
+ z=outer.evaluate(q['parameters']|patch);assert not z['all_positive'];controls[name]=[n for n,v in z['strict_checks'].items() if v<=0]
+ # Exact identities, separately from source target enclosures.
+ for r in [1,2,3,4,8,20,145]:
+ for k,want in [(F(0),r),(F(1),1)]:
+ lo,hi=M.power(r,k);assert lo<=want*M.S<=hi
+ for r,want in [(4,2),(9,3),(16,4),(64,8)]:
+ lo,hi=M.power(r,F(1,2));assert lo<=want*M.S<=hi
+ return {'status':'PASS_INDEPENDENT_COMPLETE_DIRECTED_MOMENTS_AND_OUTER','margins':margins,'strictification':strict,'paid_delta_over_selected4470':bill_delta,'selected4470_unfunded_at_candidate':True,'outer':outer.encode(q),'semantic_controls':controls,'source_receipt_used_as_expected_pass':False}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/census_controls.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/census_controls.py
new file mode 100644
index 0000000000..dc76e295f2
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/census_controls.py
@@ -0,0 +1,21 @@
+"""Literal invoice + semantic mutations, independent of source summary statuses."""
+from copy import deepcopy
+from . import invoice,source
+
+def run():
+ word=source.js('research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz')
+ ctrl=source.js('research/joint-helper-lattice/CONTROLLER.json')
+ result=invoice.assemble(word,ctrl);controls=[]
+ def reject(name,w,c):
+ try:invoice.assemble(w,c)
+ except ValueError as e:controls.append({'name':name,'semantic_rejected':str(e)})
+ else:raise ValueError('mutant accepted '+name)
+ for typ in ['center','climb']:
+ bad=deepcopy(word);p=bad['programs']['forward'];p.pop(next(j for j,e in enumerate(p) if e[0]==typ));reject('omitted_'+typ,bad,ctrl)
+ for typ in ['QUERY_SHEAR','IDLE','LOCAL']:
+ bad=deepcopy(ctrl);p=bad['physical_events'];p.pop(next(j for j,e in enumerate(p) if e[0]==typ));reject('omitted_'+typ,word,bad)
+ bad=deepcopy(ctrl);bad['boundaries']['left_program'].pop(0);reject('omitted_scalar_normalizer',word,bad)
+ bad=deepcopy(word);next(e for e in bad['programs']['forward'] if e[0]=='climb')[5]+=1;reject('wrong_paid_rank',bad,ctrl)
+ assert result['paid_calls']==64404 and result['productive_fields']==10928 and result['rank_mass_surplus']==752
+ result['status']='PASS_COMPLETE_LITERAL_P16_INVOICE';result['semantic_controls']=controls
+ return result
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/claim.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/claim.py
new file mode 100644
index 0000000000..43daf7c305
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/claim.py
@@ -0,0 +1,50 @@
+"""Bind the presented CLAIM to the actual audited source and selected baseline.
+Apache-2.0; substantial OpenAI Codex assistance. Metadata is not an admission proof.
+"""
+from copy import deepcopy
+from fractions import Fraction as F
+import gzip,json
+from . import source
+HEAD='20bb93cd990d2ff683e4d0fc56b87a42cd5d3296'
+WORD='cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd'
+PATH='research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'
+
+def validate(claim,selected,payload):
+ need=source.need
+ need(claim['candidate_head']==HEAD,'claim candidate attribution head')
+ need(payload==claim['word_payload_sha256']==WORD,'claim does not identify audited native payload')
+ need(F(claim['baseline_selected_kappa'])==F(selected['kappa']),'claim baseline selected kappa')
+ need(F(claim['baseline_selected_decimal'])==F(selected['decimal'])==F(selected['kappa']),'claim baseline selected decimal')
+ need(claim['assumptions']==selected['assumptions'],'candidate silently changed selected assumptions')
+ need(F(claim['kappa'])==F('0.0030217758'),'claim audited candidate kappa')
+ need(F(claim['kappa'])-F(selected['kappa'])==F(claim['gain_over_selected'])==F('0.0000016258'),'exact claimed gain')
+ need(F(claim['decimal'])==F(claim['kappa']) and F(claim['gain_decimal'])==F(claim['gain_over_selected']),'claim decimal encodings')
+ need(claim['same_selected_assumptions_required'] is True,'same-premise scope flag')
+ need(claim['selected_record_changed'] is False,'no selected-record update claimed')
+ need(claim['new_unconditional_or_Lean_theorem'] is False,'no unconditional or Lean theorem claimed')
+ need(claim['uniform_word_materialized'] is False,'no materialized uniform word claimed')
+
+def run(claim):
+ selected=source.js('certificates/selected-result.json')
+ payload=source.digest(gzip.decompress(source.raw(PATH)))
+ validate(claim,selected,payload)
+ mutations=[('wrong_candidate_head',dict(candidate_head='0'*40)),
+ ('wrong_payload',dict(word_payload_sha256='0'*64)),
+ ('wrong_baseline_kappa',dict(baseline_selected_kappa='1/1000')),
+ ('wrong_baseline_decimal',dict(baseline_selected_decimal='.001')),
+ ('wrong_candidate_decimal',dict(decimal='.0032')),
+ ('wrong_gain',dict(gain_over_selected='1/1000')),
+ ('changed_assumptions',dict(assumptions=claim['assumptions'][:-1])),
+ ('unconditional_claim',dict(new_unconditional_or_Lean_theorem=True)),
+ ('claimed_selection_update',dict(selected_record_changed=True)),
+ ('claimed_materialized_word',dict(uniform_word_materialized=True)),
+ ('weakened_same_assumptions',dict(same_selected_assumptions_required=False))]
+ controls=[]
+ for name,patch in mutations:
+ bad=deepcopy(claim);bad.update(patch)
+ # Recompute the mutant's own bytes/hash: rejection must be semantic.
+ mutant_hash=source.digest(json.dumps(bad,sort_keys=True,separators=(',',':')).encode())
+ try:validate(bad,selected,payload)
+ except ValueError as e:controls.append(dict(name=name,recomputed_mutant_sha256=mutant_hash,semantic_rejection=str(e)))
+ else:raise ValueError('claim metadata mutation accepted '+name)
+ return {'status':'PASS_CLAIM_IDENTIFIES_ACTUAL_AUDITED_CONSTRUCTION_AND_BASELINE','actual_payload_sha256':payload,'candidate_head':HEAD,'baseline_selected_kappa':selected['kappa'],'semantic_mutations_with_recomputed_hash':controls}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/compiler.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/compiler.py
new file mode 100644
index 0000000000..6a6f9373fe
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/compiler.py
@@ -0,0 +1,138 @@
+"""Independent stdlib finite compiler audit. No project code is imported.
+
+Exact atanh logarithm and Taylor exponential with rational remainder bounds;
+all acceptance comparisons are rational/integer. Authored for the swarm audit,
+retaining Cao Yifan/zxv/Cinna Davis/Jacob Alan Sussman predecessor credit.
+"""
+from fractions import Fraction as F
+from collections import Counter
+from functools import lru_cache
+from pathlib import Path
+from hashlib import sha256
+import argparse, json, time, platform, re
+from . import source
+
+UNIT=2**240
+def down(x): return F(x.numerator*UNIT//x.denominator,UNIT)
+def up(x): return -down(-x)
+def add(x,y): return x[0]+y[0],x[1]+y[1]
+def mul(x,y):
+ v=[a*b for a in x for b in y];return down(min(v)),up(max(v))
+def divide(x,y):
+ assert y[0]>0
+ return mul(x,(1/y[1],1/y[0]))
+def logbase(x):
+ z=(x-1)/(x+1);term=z;s=F(0)
+ for j in range(100):s+=term/F(2*j+1);term*=z*z
+ rem=2*abs(term)/(201*(1-z*z))
+ return down(2*s-rem),up(2*s+rem)
+@lru_cache(None)
+def logint(n):
+ b=n.bit_length()-1
+ a=logbase(F(n,2**b));l2=logbase(F(2))
+ return a[0]+b*l2[0],a[1]+b*l2[1]
+def exp_point(x):
+ if x<0:
+ l,u=exp_point(-x);return down(1/u),up(1/l)
+ shifts=0
+ while x>F(1,16):x/=2;shifts+=1
+ term=s=F(1)
+ for j in range(1,51):term=term*x/j;s+=term
+ nxt=term*x/51
+ # Ratios in the remaining positive Taylor series are <= x/52.
+ l,u=down(s),up(s+nxt/(1-x/52))
+ for _ in range(shifts):l,u=down(l*l),up(u*u)
+ return l,u
+def power(n,e):
+ l,u=logint(n);l,u=(e*l,e*u) if e>=0 else (e*u,e*l)
+ return exp_point(l)[0],exp_point(u)[1]
+def moment(p,e):
+ l=u=F(0)
+ for n,c in p.items():a,b=power(n,e);l+=c*a;u+=c*b
+ return l,u
+def ledger(p):
+ # Manually transcribed from the exact source; no AST/source execution.
+ k,b,a,q,ep,be,r,st,la=(p[x] for x in ['kappa','b','a','q','epsilon','beta','r0','stop','layout'])
+ si,ta=1-b,1-a;it=ta+(1-st)*max(si-ta,F(0));lf=si+st*(1-si)
+ lm=1-(q+a)/2;xi=ep*(1+q)-F(3,32)+la;key=be+1-ep
+ m=dict(main_transform=ep*q,global_coordinate_router=a,fused_gaussian=1-ep+q*be,group_bit_router=1-ep+a*be,group_scans=1-ep+be,boundary_algebraic_matrix=F(3,32)+xi-ep,sparse_union_movement=xi+F(1,2)-ep,polynomial_products=ep,microbox_face_corrections=1-(ep+be+48-128+2))
+ c=dict(actual_bit_above_effective=p['bit_saving']-a,complex_above_effective=b-a,q_positive=q,complex_endpoint=b-q,q_below_effective=a-q,stop_positive=st,stop_below_one=1-st,leaf_saving_above_effective=(1-st)*b-a,q_below_internal=1-it-q,q_below_leaf=1-lf-q,lambda_above_tau=lm-ta,lambda_above_sigma=lm-si,lambda_above_internal=lm-it,lambda_prime_above_lambda=1-q-lm,lambda_prime_above_leaf=1-q-lf,epsilon_positive=ep,epsilon_below_one=1-ep,cap_above_band=xi-F(1,2),cap_below_cell=ep-xi,group_positive=be,group_below_dimension=ep-be,support_router_span=1-be,group_gauge_power_slack=1-(2*xi-2)-r-be,actual_logarithmic_group_guard=1-(2*xi-2)-be,global_gamma_power_slack=1-ep-r,actual_logarithmic_gamma_guard=1-ep,alpha_logarithm_absorption=r,group_key_fits_record=1-key,membership_arithmetic_fits_record=1-be-2*(1-ep),microbox_halo_volume=128-48-be,positive_layout_slack=la,short_record_fallback=ep-a,complex_below_one_over_32=F(1,32)-b,strassen_integer_power_gap=F(2**45-7**16),theta_positive_polynomial_power=F(2),cap_below_phase_cell_power=2-xi,halo_covers_generic_inverse_radius=F(5),union_tag_work_per_visit_fits_record=1-be,union_header_fits_record=1-be,source_axis_superpolynomial=1-ep,gaussian_above_main=m['fused_gaussian']-m['main_transform'],new_complex_uniform_saving_above_b=p['complex_uniform_saving']-b,improvement_over_user_baseline=k-F('.001730970419199163702738'),new_semantic_guard_with_C1_one=1-ep,fine_prime_halo_umbrella=F(7,2))
+ c.update({n+'_above_kappa':v-k for n,v in m.items()})
+ f=dict(new_semantic_group_guard=1-be,new_BIT_row_stock_sublinear_in_active_group=be*F(997,1000),fixed_halo_explicit_metadata_branch=128-48-ep-be-1,actual_new_BIT_stock_sublinear=be*F(996,1000))
+ return m,c,f
+def enc(x):
+ if isinstance(x,F):return str(x)
+ if isinstance(x,dict):return {str(k):enc(v) for k,v in x.items()}
+ if isinstance(x,(tuple,list)):return [enc(y) for y in x]
+ return x
+def run(root,invoice):
+ start=time.monotonic();pkg='research/kappa-round6-compiler-tightening-20261022/'
+ a=source.js(pkg+'ARITHMETIC.json');controller=source.js('research/joint-helper-lattice/CONTROLLER.json')
+ assert source.digest(source.raw('research/joint-helper-lattice/CONTROLLER.json'))==a['source_sha256']['research/joint-helper-lattice/CONTROLLER.json']
+ assert source.digest(source.raw('research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py'))==a['source_sha256']['research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py']
+ H={4:28,7:7,8:47,9:326};P0={1:2201,2:412,3:510,4:127,5:40,8:8};T,P=Counter(),Counter()
+ for e in controller['physical_events']:
+ if e[0]=='LOCAL':T.update(H);P.update(P0)
+ elif e[0]=='QUERY_SHEAR':P[1]+=112
+ elif e[0]=='IDLE':P[8*len(e[2])]+=224
+ elif e[0] in {'ADD','SIGNED_SWAP'}:pass # Scalar operations, priced below.
+ else:raise AssertionError(e[0])
+ for e in controller['diagonal']:T[1+8*sum(e[1:])]+=112
+ assert dict(T)=={int(k):v for k,v in invoice['targets'].items()} and dict(P)=={int(k):v for k,v in invoice['paid'].items()}
+ assert dict(T)=={int(k):v for k,v in a['targets'].items()} and dict(P)=={int(k):v for k,v in a['paid'].items()}
+ assert H=={int(k):v for k,v in a['local_helpers'].items()} and P0=={int(k):v for k,v in a['local_paid'].items()}
+ assert sum(T.values())==10928 and sum(P.values())==64404
+ assert sum(n*c for n,c in T.items())-sum(n*c for n,c in P.items())==752
+ k=F('.0030217758');s=F('.00302177581');g=(s-k)/7;t=1-s;reserve=F(1,10**11)
+ assert F(a['kappa'])==k and F(a['strictification']['tested'])==s
+ tt,pp=moment(T,t),moment(P,t)
+ rootlow,roothigh=map(F,a['raw_root_interval'])
+ ml=moment(T,1-rootlow)[0]-moment(P,1-rootlow)[1]
+ mh=moment(T,1-roothigh)[1]-moment(P,1-roothigh)[0]
+ assert ml>0>mh and s1-F(1,10**9)
+ assert ratios['gamma'][1]=1 and 20**64<21**63
+ theta=F(63,64);assert 2*(20**1024)**64<=(145**1024)**63
+ # Ambient m=145^1024; compiler eta=t*m^(t-1).
+ assert 1024*stheta**1000
+ j=55099;step=g.denominator;h=step*j
+ assert g==F(1,700000000000) and h==a['compiler']['H']==38569300000000000 and j==a['compiler']['integer_test_exponent']
+ assert (h+1)**1000<2**j and (step*(j-1)+1)**1000>=2**(j-1)
+ assert h>8*1024
+ # Strict convex log ratio has one positive crossing; previous-grid failure
+ # plus success establishes minimality on this grid (not among programs).
+ uniform=k+6*g;assert s-uniform==g and uniform==F(a['compiler']['uniform_saving'])
+ p=dict(kappa=k,tested_saving=s,complex_uniform_saving=uniform,b=k+5*g,a=k+4*g,q=k+3*g,bit_saving=F(17,5000),epsilon=1-g,beta=1-3*g,r0=g/10,stop=g,layout=g,d=g)
+ for n,v in p.items():assert F(a['outer']['parameters'][n])==v
+ m,c,f=ledger(p)
+ for n,tab in [('margins',m),('strict_checks',c),('functional_checks',f)]:assert tab=={x:F(y) for x,y in a['outer'][n].items()}
+ assert len(c)==54 and len(f)==4 and min(c.values())>0 and min(f.values())>0
+ assert 01-F(1,10**9)
+ controls['power128_does_not_fit_rounded_tail_envelope']=1/(1+128*reserve)+4*F(97,100)**128>1
+ controls['preceding_grid_rejected']=(step*(j-1)+1)**1000>=2**(j-1)
+ assert all(controls[x] for x in controls)
+ scalar=158168;routes=(sum(P0.values())+2*408+688)*1000
+ raw=18*10**7+15*1792+32*112*(len(controller['physical_events'])+sum(len(controller['boundaries'][x+'_program']) for x in ['left','right']))
+ assert routes==4802000 and scalar+routes<10**7 and raw==181098496<10**9
+ assert a['nonrecursive']=={'local_scalar':scalar,'local_routes':routes,'raw_scalar_upper':raw}
+ bit=a['ordinary_BIT'];ordinary=(1-F(bit['atom']))*F(bit['after_cover'])+F(bit['atom'])*F('.0000384599')
+ assert ordinary==F(bit['ordinary_saving']) and F(bit['atom'])>ordinary>F(bit['admitted'])>s
+ assert F(bit['atom'])<1-ordinary
+ result=dict(status='PASS_INDEPENDENT_EXACT_FINITE_COMPILER_AND_58_OUTER',command='final4610-independent-admission compiler stage',python=platform.python_version(),seconds=time.monotonic()-start,repository_pin='ec2780e8aeb1c88acaf5e9e470ef8c68e7fbbb6c',arithmetic_sha256=source.digest(source.raw(pkg+'ARITHMETIC.json')),source_sha256=sha256(Path(__file__).read_bytes()).hexdigest(),targets=dict(T),paid=dict(P),kappa=k,tested=s,ratios=ratios,eta=eta,normalized_paid_upper=normalized,completion_slack=1-normalized,uniform_saving=uniform,gap=g,H=h,j=j,root_signs=[ml,mh],nonrecursive=dict(scalar=scalar,routes=routes,raw_controller_scalar=raw),outer_strict_count=len(c),functional_count=len(f),minimum_outer_strict_slack=min(c.values()),outer_strict_slacks=c,functional_slacks=f,controls=controls,fresh_author_recorded_modules=[],reused_author_recorded_modules=[],objects_checked=False,Lean_run=False,scope='Fresh independent exact arithmetic from the independently derived invoice; no Lean/log acceptance inherited and no end-to-end multiplication theorem.')
+ return enc(result)
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/frame.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/frame.py
new file mode 100644
index 0000000000..80a91d0a31
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/frame.py
@@ -0,0 +1,41 @@
+"""Independent exact signed binary transport at every actual event. Apache-2.0."""
+from copy import deepcopy
+from . import source
+
+def need(ok,msg):
+ if not ok:raise ValueError(msg)
+def span(b):
+ out={0}
+ for x in b:out|={v^x for v in list(out)}
+ need(len(out)==2**len(b),'frame rank');return out
+def apply(cols,x):
+ out=0
+ for j,g in enumerate(cols):
+ if x>>j&1:out^=g
+ return out
+def audit(w):
+ c=w['canonical'];spaces=[span(b) for b in c['frames']];maps={x['op']:x['G_columns'] for x in c['warps']}
+ need(set(maps)==set(range(1,73)),'exact native maps')
+ for op,cols in maps.items():need(len({apply(cols,x) for x in range(512)})==512,'invertible map')
+ counts={};classes=set()
+ for direction,word in w['programs'].items():
+ n=0
+ for e in word:
+ if e[0]!='warp':continue
+ _,role,op,a,b=e;src,dst=(a,b) if op>0 else (b,a)
+ need({apply(maps[abs(op)],x) for x in spaces[src]}==spaces[dst],'signed warp transport does not carry actual source frame')
+ n+=1;classes.add((op,a,b))
+ counts[direction]=n
+ need(counts=={'forward':240,'backward':240} and len(classes)==180,'exact complete warp-event coverage')
+ return counts,classes
+
+def run():
+ w=source.js('research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz');counts,classes=audit(w);controls=[]
+ for direction in w['programs']:
+ bad=deepcopy(w);p=bad['programs'][direction]
+ need(p[3]==['warp',['L',273],-59,0,0] and p[4]==['warp',['L',273],59,0,0],'source-bound issue4571 fixture')
+ p[3][4]=1;p[4][3]=1
+ try:audit(bad)
+ except ValueError as e:controls.append({'direction':direction,'mutated_object_sha256':source.digest(__import__('json').dumps(bad,sort_keys=True).encode()),'semantic_rejection':str(e)})
+ else:raise ValueError('binary-frame mutation accepted')
+ return {'status':'PASS_ALL480_SIGNED_WARP_EVENTS','counts':counts,'classes':len(classes),'semantic_controls_with_recomputed_hash':controls}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/helpers.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/helpers.py
new file mode 100644
index 0000000000..57e54de4a0
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/helpers.py
@@ -0,0 +1,189 @@
+#!/usr/bin/env python3
+"""Independent finite helper audit. Stdlib only; imports no retained evaluator.
+
+Pauli images plus exact state amplitudes certify Clifford equality: identical
+conjugation on the full Pauli generating set implies a scalar discrepancy;
+agreement on any nonzero state fixes that scalar. --all-columns additionally
+replays every basis input, without relying on this finite-dimensional lemma.
+"""
+import argparse, collections, copy, gzip, hashlib, json, pathlib, subprocess, sys, time
+from fractions import Fraction as Q
+from . import source as inputs
+
+HEAD='20bb93cd990d2ff683e4d0fc56b87a42cd5d3296'
+NEW='research/kappa-round3-warp-20261022/'
+OLD='research/warp-interface-20261022/'
+HERE=pathlib.Path(__file__).resolve().parent
+REPO=HERE.parents[1]/'repository'
+
+def need(b,s):
+ if not b: raise ValueError(s)
+
+def source(p):return inputs.raw(p)
+
+def js(p):
+ b=source(p); return json.loads(gzip.decompress(b) if p.endswith('.gz') else b)
+
+def rank(xs):
+ piv={}
+ for x in xs:
+ while x:
+ j=x.bit_length()-1
+ if j not in piv: piv[j]=x;break
+ x^=piv[j]
+ return len(piv)
+
+def points(b):
+ s=[0]
+ for x in b:s += [y^x for y in s]
+ return sum(1<>i)&1)<>j&1);w[j],w[k]=w[k],w[j]
+ for i in range(9):
+ if i!=j and w[i]>>j&1:w[i]^=w[j]
+ return [x>>9 for x in w]
+
+def adj(c):
+ return [('P',inverse(g[1])) if g[0]=='P' else ('D',g[1],[(-x)%4 for x in g[2]]) if g[0]=='D'
+ else ('C',g[1],-g[2]) if g[0]=='C' else ('phase',-g[1]) if g[0]=='phase' else g for g in reversed(c)]
+
+def conjugate(c):
+ return [('D',g[1],[(-x)%4 for x in g[2]]) if g[0]=='D' else ('C',g[1],-g[2]) if g[0]=='C' else ('phase',-g[1]) if g[0]=='phase' else g for g in c]
+
+def frame(b):
+ if len(b)==0:return []
+ if len(b)==9:return [('C',1<len(ext):ext.append(x)
+ G=transpose(ext);it=transpose(inverse(G))
+ # Q=I+(G^-1)^T G^-1, over F2, as in the canonical chart definition.
+ qm=[(1<>i)&1 for i in range(9)])]
+ return adj(K)+[('C',1<>i&1)+2*sum((rows[i]&x&~((1<<(i+1))-1)).bit_count() for i in range(9) if x>>i&1))%4
+
+def tableau(c):
+ out=[]
+ for j in range(18):
+ x,z,p=(1<0 else -1000000) if backward else op
+ rows[t]={(v,w[1:] if w and w[0]==-sym else (sym,)+w):q for (v,w),q in rows[t].items()}
+ elif k=='scalar':
+ g,f=e[1:];t=tuple(g[1]);life[t].append(j)
+ if g[0] in ('clear','copy'):
+ need(t==('C',0),'borrowed erase/copy prohibited');erasures.append([j,g[0],list(t)])
+ if g[0]=='clear':rows[t]={};cur[t]=f;continue
+ need(cur[t]==f,'scalar chronological receiver frame')
+ if g[0] in ('add','copy'):
+ s=tuple(g[2]);need(cur[s]==f,'scalar chronological source frame');life[s].append(j)
+ if g[0]=='copy':rows[t]=rows[s].copy();continue
+ need(s!=t,'distinct shear fields');q=Q(g[3],g[4]);need(q and q.denominator&(q.denominator-1)==0,'dyadic ADD');add(t,s,q)
+ else:
+ need(g[0]=='scale','known scalar');q=Q(g[2],g[3]);need(q and abs(q.numerator)&(abs(q.numerator)-1)==0 and q.denominator&(q.denominator-1)==0,'unit dyadic scale');rows[t]={a:q*b for a,b in rows[t].items()}
+ else:raise ValueError('unknown event '+k)
+ need([cur['L',i] for i in range(632)]==c['final'],'all chronological final frames')
+ need(rows['C',0]=={},'arbitrary owned entry and owned scratch cleared')
+ for i in range(632):
+ t=('L',i);want={(t,()):Q(1)}
+ if (i<112 if backward else 112<=i<224):want[(('L',i+112 if backward else i-112),())]=Q(-1 if backward else 1)
+ need(rows[t]==want,'all-column arbitrary endpoint '+str(i))
+ return {'events':len(p),'paid':dict(paid),'arbitrary_persistent_columns':632,'arbitrary_owned_entry_columns':1,'helper_restored_count':408,'owned_erasure_events':erasures,'lifetimes':{str(i):{'first_event':min(life['L',i]),'last_event':max(life['L',i]),'contacts':len(life['L',i])} for i in range(224,632)}}
+
+def run():
+ args=argparse.Namespace(all_columns=False)
+ started=time.monotonic();nw=js(NEW+'ACTUAL-WORD.json.gz');ow=js(OLD+'ACTUAL-WORD.json.gz');phase=js(NEW+'PHASE-VALIDATION.json.gz');c=nw['canonical'];old=ow['canonical']
+ changed=[i for i in range(224,632) if (c['start'][i],c['final'][i])!=(old['start'][i],old['final'][i])]
+ need(len(changed)==26,'exact26 changed interfaces');need(c['final']==old['final'],'all receiver exits inherited');need(c['start'][:224]==old['start'][:224],'main source endpoints inherited')
+ census=collections.Counter()
+ for i in range(224,632):
+ a,b=c['start'][i],c['final'][i];sa,sb=points(c['frames'][a]),points(c['frames'][b]);need(sa!=sb and sa&sb==sa,'strict whole residual boundary');census[len(c['frames'][b])-len(c['frames'][a])]+=1
+ need(census=={4:28,7:7,8:47,9:326},'complete helper census')
+ entries=[];covered=[]
+ for h in phase['changed_helper_boundaries']:
+ a,b=h['input'],h['output'];covered+=h['helpers'];need(all(i in changed and c['start'][i]==a and c['final'][i]==b for i in h['helpers']),'receipt exact actual helper boundary')
+ residual=adj(frame(c['frames'][a]))+frame(c['frames'][b])
+ for direction in ('forward','backward'):
+ target=residual if direction=='forward' else conjugate(residual);r=h['recipes'][direction];need(r['rank']==h['rank'],'recipe rank')
+ compiled=recipe(r['right'])+[('C',1<> i & 1) << j for j in range(9))) for i in range(9)]
+
+def mv(a, x):
+ return sum(((r & x).bit_count() % 2 << i for i, r in enumerate(a)))
+
+def inverse(a):
+ w = [x | 1 << 9 + i for i, x in enumerate(a)]
+ for j in range(9):
+ k = next((i for i in range(j, 9) if w[i] >> j & 1))
+ w[j], w[k] = (w[k], w[j])
+ for i in range(9):
+ if i != j and w[i] >> j & 1:
+ w[i] ^= w[j]
+ return [x >> 9 for x in w]
+
+def adj(c):
+ return [('P', inverse(g[1])) if g[0] == 'P' else ('D', g[1], [-x % 4 for x in g[2]]) if g[0] == 'D' else ('C', g[1], -g[2]) if g[0] == 'C' else ('phase', -g[1]) if g[0] == 'phase' else g for g in reversed(c)]
+
+def conjugate(c):
+ return [('D', g[1], [-x % 4 for x in g[2]]) if g[0] == 'D' else ('C', g[1], -g[2]) if g[0] == 'C' else ('phase', -g[1]) if g[0] == 'phase' else g for g in c]
+
+def frame(b):
+ if len(b) == 0:
+ return []
+ if len(b) == 9:
+ return [('C', 1 << i, 1) for i in range(9)]
+ ext = []
+ for x in b + [1 << i for i in range(9)]:
+ if rank(ext + [x]) > len(ext):
+ ext.append(x)
+ G = transpose(ext)
+ it = transpose(inverse(G))
+ qm = [1 << i ^ sum(((a & bb).bit_count() % 2 << j for j, bb in enumerate(it))) for i, a in enumerate(it)]
+ K = [('P', G), ('D', qm, [qm[i] >> i & 1 for i in range(9)])]
+ return adj(K) + [('C', 1 << i, 1) for i in range(len(b))] + K
+
+def recipe(r):
+ return [('D', r['quadratic_rows'], r['linear_Z4']), ('P', r['matrix_rows']), ('X', r['offset']), ('phase', r['phase'])]
+
+def qvalue(rows, lin, x):
+ return (sum((lin[i] for i in range(9) if x >> i & 1)) + 2 * sum(((rows[i] & x & ~((1 << i + 1) - 1)).bit_count() for i in range(9) if x >> i & 1))) % 4
+
+def tableau(c):
+ out = []
+ for j in range(18):
+ x, z, p = (1 << j, 0, 0) if j < 9 else (0, 1 << j - 9, 0)
+ for g in c:
+ if g[0] == 'P':
+ x = mv(g[1], x)
+ z = mv(transpose(inverse(g[1])), z)
+ elif g[0] == 'D':
+ p = (p + qvalue(g[1], g[2], x)) % 4
+ z ^= mv(g[1], x)
+ elif g[0] == 'C':
+ if (z & g[1]).bit_count() % 2:
+ x ^= g[1]
+ p = (p + 3 * g[2]) % 4
+ elif g[0] == 'X':
+ p = (p + 2 * ((z & g[1]).bit_count() % 2)) % 4
+ elif g[0] != 'phase':
+ raise ValueError(g)
+ out.append((x, z, p))
+ return out
+
+def rot(a, p):
+ x, y = a
+ return [(x, y), (-y, x), (-x, -y), (y, -x)][p % 4]
+
+def state(c, basis=0):
+ a = [(0, 0)] * 512
+ a[basis] = (1, 0)
+ den = 0
+ for g in c:
+ if g[0] == 'P':
+ b = [(0, 0)] * 512
+ for x, v in enumerate(a):
+ b[mv(g[1], x)] = v
+ a = b
+ elif g[0] == 'X':
+ a = [a[x ^ g[1]] for x in range(512)]
+ elif g[0] == 'D':
+ a = [rot(v, qvalue(g[1], g[2], x)) for x, v in enumerate(a)]
+ elif g[0] == 'phase':
+ a = [rot(v, g[1]) for v in a]
+ elif g[0] == 'C':
+ b = []
+ s = g[2]
+ for x, (u, v) in enumerate(a):
+ w, t = a[x ^ g[1]]
+ b.append((u - s * v + w + s * t, v + s * u + t - s * w))
+ a = b
+ den += 1
+ else:
+ raise ValueError(g)
+ while den and all((not (u | v) & 1 for u, v in a)):
+ a = [(u // 2, v // 2) for u, v in a]
+ den -= 1
+ return (a, den)
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/invoice.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/invoice.py
new file mode 100644
index 0000000000..142f3db779
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/invoice.py
@@ -0,0 +1,147 @@
+#!/usr/bin/env python3
+"""Independent stdlib census; no retained evaluators or expected profile inputs.
+Cao Yifan/Cinna Davis and predecessor construction credit retained. AI assistance.
+"""
+import argparse, collections, copy, gzip, hashlib, json, pathlib, platform, subprocess, sys, time
+from fractions import Fraction
+C=collections.Counter
+PIN='a5df48c55ea806d7952b65acc9c76d878ff09b13'
+WORD='research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'
+CTRL='research/joint-helper-lattice/CONTROLLER.json'
+
+def need(x,msg):
+ if not x: raise ValueError(msg)
+def hist(x): return {str(k):v for k,v in sorted(x.items()) if v}
+def basis(rows):
+ b={}
+ for x in rows:
+ while x:
+ k=x.bit_length()-1
+ if k in b:x^=b[k]
+ else:b[k]=x;break
+ return b
+def contained(rows,b):
+ for x in rows:
+ while x:
+ k=x.bit_length()-1
+ if k not in b:return False
+ x^=b[k]
+ return True
+
+def local_census(w):
+ c=w['canonical'];fs=c['frames'];bs=[basis(f) for f in fs]
+ need(c['v']==112 and c['h']==9 and len(c['start'])==len(c['final'])==632,'local fixed ports/fields')
+ need(all(len(b)==len(f) for b,f in zip(bs,fs)),'frame lists are independent bases')
+ H=C()
+ for r in range(224,632):
+ a,b=c['start'][r],c['final'][r]
+ need(len(fs[a])0 and den&(den-1)==0,'dyadic ADD')
+ primitives+=3+n.bit_length()-1+n.bit_count()+den.bit_length()-1
+ else:
+ need(op=='scale','known scalar opcode');q=Fraction(g[2],g[3]);n,den=abs(q.numerator),q.denominator
+ need(n>0 and n&(n-1)==0 and den&(den-1)==0,'dyadic SCALE')
+ primitives+=abs(n.bit_length()-den.bit_length())+int(q<0)
+ elif typ=='adapter':adapters[e[1]]+=1
+ elif typ=='phase':last_phase=e[1]
+ else:need(False,'unknown literal local opcode')
+ need([current['L',i] for i in range(632)]==c['final'],'all final frame references')
+ need(last_phase=='done' and counts['center']==8 and centers==C({8:8}),'all eight owned centre transports charged')
+ need(adapters==C({'old_to_new':224,'new_to_old':224}),'entry and exit adapter marker coverage')
+ directions[d]={'paid':hist(paid),'climbs':hist(climbs),'centers':hist(centers),'event_counts':dict(sorted(counts.items())),'scalar_opcodes':dict(sorted(scalarops.items())),'real_scalar_allowance':2*primitives,'adapter_markers':dict(sorted(adapters.items()))}
+ need(directions['forward']['paid']==directions['backward']['paid'],'dual paid profile agreement')
+ return H,C({int(k):v for k,v in directions['forward']['paid'].items()}),directions
+
+def expected_controller(p,a):
+ thick={0,2*p,*range(1,2*p,2)};b=p-1-a
+ keep=sum(1<>idle_index&1:
+ selected=[s for s in selected if s in thick]
+ if selected:events.append(['IDLE',pair,selected])
+ idle_index+=1
+ def local(stage,pair,back):
+ events.append(['LOCAL' if stage in thick else 'QUERY_SHEAR',stage,pair,back])
+ if stage%2 and stage<=2*p-3:idle((stage+1)//2,range(stage+1))
+ elif stage%2==0 and 2<=stage<=2*p-2:idle(stage//2,[stage])
+ elif stage==2*p:
+ for j in range(p-1):idle(j,range(2*j+3,2*p+1))
+ def bridge(dst,src,c):events.extend([['ADD',2*dst,2*src,c],['ADD',2*src+1,2*dst+1,-c]])
+ local(0,0,False)
+ for j in range(p):
+ local(2*j+1,j,True)
+ if j>j&1)
+ q+=2*sum((((rec['quadratic_rows'][j]>>(j+1))&(x>>(j+1))).bit_count()%2) for j in range(9) if x>>j&1)
+ return y,ipow(q)
+def one_column(rec,x):
+ r=rec['rank'];y,a=mono(rec['right'],x);out={}
+ for flip in range(1<>j&1 else (1,1))
+ z,c=mono(rec['left'],y^flip);out[z]=mul(b,c)
+ return out # common denominator2^r
+
+def tensor_column(rec,xs):
+ out={(): (1,0)}
+ for x in xs:
+ out={prefix+(y,):mul(a,b) for prefix,a in out.items() for y,b in one_column(rec,x).items()}
+ return out
+
+def wide_column(rec,xs,wrong_phase_once=False):
+ r=rec['rank'];ys=[];amp=(1,0)
+ for x in xs:
+ y,a=mono(rec['right'],x,omit_phase=True);ys.append(y);amp=mul(amp,a)
+ amp=mul(amp,ipow(rec['right']['phase']*(1 if wrong_phase_once else len(xs))))
+ out={}
+ for flip in range(1<<(r*len(xs))):
+ state=ys[:];a=amp
+ for j in range(r):
+ for c in range(len(xs)):
+ bit=flip>>(j*len(xs)+c)&1 # explicit axis-major child order
+ state[c]^=bit<0
+ v=[F(x*S,y) for x in a for y in b]
+ return min(v).__floor__(),max(v).__ceil__()
+def scale(a,n):return mul(a,point(n))
+def display(a):return [str(F(a[0],S)),str(F(a[1],S))]
+def decimal(a):
+ def dec(n):
+ sign='-' if n<0 else '';n=abs(n);return sign+str(n//S)+'.'+str(n%S).zfill(70)
+ return [dec(x) for x in a]
+
+def log_reduced(q):
+ assert 1<=q<=2
+ z=(q-1)/(q+1); total=F(0); zp=z
+ for j in range(NLOG):
+ total+=2*zp/(2*j+1);zp*=z*z
+ tail=2*zp/((2*NLOG+1)*(1-z*z))
+ lo=point(total)[0]; hi=point(total+tail)[1]
+ return lo,hi
+@lru_cache(None)
+def log_rank(r):
+ assert isinstance(r,int) and r>0
+ e=r.bit_length()-1
+ return add(log_reduced(F(r,2**e)),scale(log_reduced(F(2)),e))
+def exp_positive(a):
+ assert 0<=a[0]<=a[1]
+ if a[1]>=S:
+ half=div(a,point(2));e=exp_positive(half);return mul(e,e)
+ result=point(1);term=point(1)
+ for j in range(1,NEXP+1):
+ term=div(mul(term,a),point(j));result=add(result,term)
+ nextterm=div(mul(term,a),point(NEXP+1))
+ # Ratios after the next term are <= a.upper/(NEXP+2).
+ bound=div(nextterm,sub(point(1),div(a,point(NEXP+2))))
+ return result[0],result[1]+bound[1]
+def power(r,k):
+ """Enclose r**(1-k), supporting |k| log(r)<1."""
+ k=F(k)
+ if r==1:return point(1)
+ a=scale(log_rank(r),abs(k))
+ e=exp_positive(a)
+ return scale(div(point(1),e) if k>=0 else e,r)
+def moment(hist,k):
+ a=point(0)
+ for r,n in hist.items():a=add(a,scale(power(int(r),k),n))
+ return a
+def margin(T,P,k):return sub(moment(T,k),moment(P,k))
+def dictint(d):
+ out={}
+ for k,v in d.items():
+ assert isinstance(k,(str,int)) and not isinstance(k,bool)
+ assert isinstance(v,(str,int)) and not isinstance(v,bool),'counts must be exact JSON integers or integer strings'
+ r,n=int(k),int(v)
+ assert str(k)==str(r) and str(v)==str(n) and r>0,'invalid exact rank or count'
+ if n:out[r]=n
+ return out
+def derivative_interval(T,P,lo,hi):
+ result=point(0)
+ for hist,sign in [(P,1),(T,-1)]:
+ for r,n in hist.items():
+ # For all c in [lo,hi], r**(1-c) decreases with c.
+ interval=(power(r,hi)[0],power(r,lo)[1])
+ result=add(result,scale(mul(log_rank(r),interval),sign*n))
+ return result
+
+def strictification(T,P,k,extra):
+ k=F(k);target=moment(T,k);paid=add(moment(P,k),moment(extra,k))
+ alpha=div(paid,target)
+ # Same model and fixed sufficient tail constants as final 4610, independent engine.
+ higher=add(moment(P,k-F(1,5)),moment(extra,k-F(1,5)))
+ gamma=div(higher,mul(power(20,F(4,5)),target))
+ delta=div(point(sum(T.values())*21),mul(div(point(20),power(20,k)),target))
+ alpha_ok=alpha[1]=0 for r,n in extra.items()),'paid removals exceed existing source invoice'
+ m=margin(T,P,k);c=moment(extra,k)
+ remaining=sub(m,c)
+ status='AFFORDABLE_RAW' if remaining[0]>0 else 'UNAFFORDABLE_RAW' if remaining[1]<=0 else 'UNRESOLVED'
+ return {'k':str(F(k)),'extra_paid':extra,'raw_margin':decimal(m),'extra_cost':decimal(c),'remaining':decimal(remaining),'status':status,'strictification':strictification(T,P,k,extra),'funding_status':'conditional arithmetic screen; implementation costs and compiler/outer/native closure remain required'}
+def root(T,P,lo,hi,steps=40):
+ lo=F(lo);hi=F(hi)
+ assert margin(T,P,lo)[0]>0 and margin(T,P,hi)[1]<0
+ for _ in range(steps):
+ mid=(lo+hi)/2;m=margin(T,P,mid)
+ if m[0]>0:lo=mid
+ elif m[1]<0:hi=mid
+ else:break
+ return [str(lo),str(hi)]
+def reconstruct(controller,local,helpers):
+ from collections import Counter
+ T=Counter();P=Counter();counts=Counter()
+ for event in controller['physical_events']:
+ counts[event[0]]+=1
+ if event[0]=='LOCAL':T.update(helpers);P.update(local)
+ elif event[0]=='QUERY_SHEAR':P[1]+=112
+ elif event[0]=='IDLE':P[8*len(event[2])]+=224
+ elif event[0] in ('ADD','SIGNED_SWAP'):pass # fixed nonrecursive operations, not recursive child calls
+ else:raise AssertionError('unknown controller event')
+ for term in controller['diagonal']:T[1+8*sum(term[1:])]+=112
+ assert counts=={'LOCAL':18,'QUERY_SHEAR':15,'IDLE':15,'ADD':90,'SIGNED_SWAP':16}
+ return dict(T),dict(P)
+def price_planes(T,P,k):
+ k=F(k);target=moment(T,k)
+ raw=margin(T,P,k)
+ alpha_budget=sub(raw,scale(target,F(1,10**11)))
+ higher=moment(P,k-F(1,5))
+ gamma_budget=sub(scale(mul(power(20,F(4,5)),target),F(97,100)),higher)
+ return {'k':str(k),'raw_budget':decimal(raw),'alpha_reserved_budget':decimal(alpha_budget),'gamma_budget':decimal(gamma_budget),'coefficients':{str(r):{'raw_and_alpha':decimal(power(r,k)),'gamma':decimal(power(r,k-F(1,5)))} for r in [1,2,3,4,8,16,32,64,128]},'interpretation':'Each extra paid histogram must satisfy both linear planes; negative coordinates are explicit paid-call removals requiring implementation witnesses. These planes are necessary conditional arithmetic checks; they do not admit an implementation.'}
+
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/native.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/native.py
new file mode 100644
index 0000000000..0545a57fc3
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/native.py
@@ -0,0 +1,192 @@
+#!/usr/bin/env python3
+"""Independent finite native/absolute-phase audit, stdlib only.
+
+No imports from author verifier, Clifford compiler, or native operators. Derives
+native columns from inverse-permutation Gram bits. Equality of 18 Pauli images
+plus the zero ket proves equality of the two finite Clifford operators. Gaussian
+integer vectors preserve absolute phase. Does not replay the 632-column word or
+prove an all-width supplier theorem. Apache-2.0; OpenAI Codex assistance.
+"""
+import argparse, collections, functools, gzip, hashlib, json, pathlib, subprocess, time
+from . import source
+N=9; D=1<>j&1)+2*sum(parity(cross[j]&y) for j in range(N) if y>>j&1))%4
+ return tuple((y,phase(y)) for y in perm)
+
+def inverse_mono(m):
+ out=[None]*D
+ for x,(y,q) in enumerate(m):out[y]=(x,-q%4)
+ need(None not in out,'monomial permutation')
+ return tuple(out)
+
+def recipe_mono(r):
+ rows=r['matrix_rows'];alpha=r['linear_Z4'];Q=r['quadratic_rows']
+ need(len(rows)==len(alpha)==len(Q)==N,'recipe field dimensions')
+ need(all(0<=v>j&1)==(Q[j]>>i&1) for i in range(N) for j in range(N)),'symmetric Q')
+ need(all(alpha[i]%2==(Q[i]>>i&1) for i in range(N)),'Z4 diagonal convention')
+ out=[]
+ for x in range(D):
+ y=sum(parity(v&x)<>j&1)+2*sum(parity((Q[j]>>(j+1))&(x>>(j+1))) for j in range(N) if x>>j&1)
+ out.append((y,q%4))
+ need(len({y for y,q in out})==D,'recipe invertible')
+ return tuple(out)
+
+@functools.lru_cache(None)
+def mono_table(m):
+ back={y:x for x,(y,q) in enumerate(m)};out=[]
+ for kind in ('X','Z'):
+ for j in range(N):
+ def value(y):
+ x=back[y]
+ return ((m[x^(1<>j&1)))
+ v,p=value(0);z=0
+ for k in range(N):
+ vk,q=value(1<>j&1:out=multiply(out,t[j])
+ for j in range(N):
+ if z>>j&1:out=multiply(out,t[N+j])
+ return out
+
+def rank(vec):
+ piv={}
+ for v in vec:
+ while v:
+ j=v.bit_length()-1
+ if j not in piv:piv[j]=v;break
+ v^=piv[j]
+ return len(piv)
+
+@functools.lru_cache(None)
+def frame(U):
+ r=len(U)
+ if not r:return ()
+ if r==N:return tuple(('C',1<len(basis):basis.append(v)
+ need(len(basis)==N,'frame basis completion')
+ k=gram_native(basis)
+ return (('M',inverse_mono(k)),)+tuple(('C',1<=a.limit:break
+ op,u,v=key;need(r['G_columns']==newG[abs(op)],'same G shared at every occurrence')
+ U,V=tuple(c['frames'][u]),tuple(c['frames'][v]);g=newG[abs(op)]
+ if op<0:g=[inverse_mono(maps[-op])[1<0 else inverse_mono(maps[-op])),)+frame(V)
+ for d in ('forward','backward'):
+ actual=physical if d=='forward' else conjugate(physical);rec=r['recipes'][d];need(rec['rank']==0 and rec['right'] is None,'rank zero native recipe')
+ decoded=(('M',recipe_mono(rec['left'])),)
+ need(circuit_table(actual)==circuit_table(decoded),'all 18 independent Pauli images '+str((key,d)))
+ need(act_zero(actual)==act_zero(decoded),'independent absolute phase '+str((key,d)))
+ counts[d]+=1
+ results.append(list(key))
+ if n==0:
+ wrong=dict(r['recipes']['forward']['left']);wrong['phase']=(wrong['phase']+1)%4
+ controls['global_phase_preserves_Paulis_but_rejected']=circuit_table((('M',recipe_mono(wrong)),))==circuit_table(physical) and act_zero((('M',recipe_mono(wrong)),))!=act_zero(physical)
+ controls['transpose_map_rejected']=any(gram_native([sum((newG[op][j]>>i&1)<0
+ return dict(kappa=kappa,tested_saving=tested,complex_uniform_saving=kappa+6*g,b=kappa+5*g,a=kappa+4*g,q=kappa+3*g,bit_saving=F(17,5000),epsilon=1-g,beta=1-3*g,r0=g/10,stop=g,layout=g,d=g)
+def evaluate(p):
+ k,b,a,q,e,B,r,s,l=[p[x] for x in ['kappa','b','a','q','epsilon','beta','r0','stop','layout']]
+ sig,tau=1-b,1-a;inside=tau+(1-s)*max(sig-tau,0);leaf=sig+s*(1-sig)
+ lam=1-(q+a)/2;xi=e*(1+q)-F(3,32)+l;key=B+1-e
+ margins=dict(main_transform=e*q,global_coordinate_router=a,fused_gaussian=1-e+q*B,group_bit_router=1-e+a*B,group_scans=1-e+B,boundary_algebraic_matrix=F(3,32)+xi-e,sparse_union_movement=xi+F(1,2)-e,polynomial_products=e,microbox_face_corrections=1-(e+B+48-128+2))
+ checks={
+ 'actual_bit_above_effective':p['bit_saving']-a,
+ 'complex_above_effective':b-a,'q_positive':q,'complex_endpoint':b-q,'q_below_effective':a-q,
+ 'stop_positive':s,'stop_below_one':1-s,'leaf_saving_above_effective':(1-s)*b-a,
+ 'q_below_internal':1-inside-q,'q_below_leaf':1-leaf-q,'lambda_above_tau':lam-tau,
+ 'lambda_above_sigma':lam-sig,'lambda_above_internal':lam-inside,
+ 'lambda_prime_above_lambda':1-q-lam,'lambda_prime_above_leaf':1-q-leaf,
+ 'epsilon_positive':e,'epsilon_below_one':1-e,'cap_above_band':xi-F(1,2),
+ 'cap_below_cell':e-xi,'group_positive':B,'group_below_dimension':e-B,'support_router_span':1-B,
+ 'group_gauge_power_slack':1-(2*xi-2)-r-B,'actual_logarithmic_group_guard':1-(2*xi-2)-B,
+ 'global_gamma_power_slack':1-e-r,'actual_logarithmic_gamma_guard':1-e,'alpha_logarithm_absorption':r,
+ 'group_key_fits_record':1-key,'membership_arithmetic_fits_record':1-B-2*(1-e),
+ 'microbox_halo_volume':128-48-B,'positive_layout_slack':l,'short_record_fallback':e-a,
+ 'complex_below_one_over_32':F(1,32)-b,'strassen_integer_power_gap':F(2**45-7**16),
+ 'theta_positive_polynomial_power':F(2),'cap_below_phase_cell_power':2-xi,
+ 'halo_covers_generic_inverse_radius':F(48-43),'union_tag_work_per_visit_fits_record':1-B,
+ 'union_header_fits_record':1-B,'source_axis_superpolynomial':1-e,
+ 'gaussian_above_main':margins['fused_gaussian']-margins['main_transform'],
+ 'new_complex_uniform_saving_above_b':p['complex_uniform_saving']-b,
+ 'improvement_over_user_baseline':k-F('.001730970419199163702738'),
+ 'new_semantic_guard_with_C1_one':1-e,'fine_prime_halo_umbrella':10-(2*2+2+F(1,2))}
+ checks.update({n+'_above_kappa':v-k for n,v in margins.items()})
+ functional=dict(new_semantic_group_guard=1-B,new_BIT_row_stock_sublinear_in_active_group=B*(1-F(3,1000)),fixed_halo_explicit_metadata_branch=128-48-e-B-1,actual_new_BIT_stock_sublinear=B*(1-F(1,250)))
+ assert len(checks)==54 and len(functional)==4
+ return dict(parameters=p,margins=margins,strict_checks=checks,functional_checks=functional,all_positive=all(x>0 for g in [checks,functional] for x in g.values()))
+def encode(x):
+ if isinstance(x,F):return str(x)
+ if isinstance(x,dict):return {k:encode(v) for k,v in x.items()}
+ if isinstance(x,list):return [encode(v) for v in x]
+ return x
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/paid.py b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/paid.py
new file mode 100644
index 0000000000..b9740fa217
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5241/research/final4610-independent-admission/checks/paid.py
@@ -0,0 +1,122 @@
+#!/usr/bin/env python3
+"""Propose paid normalizers, then independently verify a frozen catalogue.
+
+`generate` alone executes the pinned retained Clifford compiler, as an
+untrusted proposal generator. `verify` never imports that compiler; it checks
+every record using the independent reviewer's circuit implementation.
+"""
+import argparse,copy,gzip,hashlib,importlib.util,json,pathlib,sys,time
+from . import source
+from . import all_helpers as independent_check
+from . import independent_clifford as independent_C
+HERE=pathlib.Path(__file__).resolve().parent
+PACKAGE=HERE.parent
+WORD_SHA='cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd'
+COMPILER_SHA='2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962'
+
+def need(b,s):
+ if not b:raise ValueError(s)
+
+def setup():
+ check,C=independent_check,independent_C
+ raw=gzip.decompress(source.raw('research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz'));need(hashlib.sha256(raw).hexdigest()==WORD_SHA,'exact final source word')
+ word=json.loads(raw);c=word['canonical'];pairs={};directionsets={};counts={}
+ for d,events in word['programs'].items():
+ ps=set();count=0
+ for j,e in enumerate(events):
+ if e[0]=='climb':a,b,r=e[3:6];kind='borrowed'
+ elif e[0]=='center':a,b,r=e[2:5];kind='owned'
+ else:continue
+ need(r==abs(len(c['frames'][a])-len(c['frames'][b]))>0,'actual event rank')
+ pairs.setdefault((a,b),{'rank':r,'occurrences':[]})['occurrences'].append({'direction':d,'event':j,'kind':kind,'role':e[2]if kind=='borrowed'else e[1]})
+ need(pairs[a,b]['rank']==r,'consistent pair rank');ps.add((a,b));count+=1
+ directionsets[d]=ps;counts[d]=count
+ need(len(directionsets['forward'])==len(directionsets['backward'])==2855,'actual orientation-specific paid pair counts')
+ need(len(pairs)==2863 and counts=={'backward':3298,'forward':3298},'actual complete paid pair/job inventory')
+ for a,b in pairs:
+ U,V=c['frames'][a],c['frames'][b]
+ need(all(type(x)is int and 0<=x<512 for x in U+V)and C.rank(U)==len(U)and C.rank(V)==len(V),'actual independent binary frame bases')
+ need(C.rank(U+V)==max(len(U),len(V)),'actual nested paid frames')
+ return check,C,c,pairs,counts
+
+def chosen(pairs,limit):
+ allpairs=sorted(pairs)
+ if limit is None:return allpairs
+ selected=[];seen=set()
+ for key in allpairs:
+ tag=(pairs[key]['rank'],any(x['kind']=='owned'for x in pairs[key]['occurrences']),tuple(sorted({x['direction']for x in pairs[key]['occurrences']})))
+ if tag not in seen:seen.add(tag);selected.append(key)
+ for i in range(limit):
+ key=allpairs[min(len(allpairs)-1,(i*len(allpairs))//limit)]
+ if key not in selected:selected.append(key)
+ return sorted(selected[:limit])
+
+def write_line(f,value):f.write((json.dumps(value,sort_keys=True,separators=(',',':'))+'\n').encode())
+
+def generate(args,check,C,c,pairs,counts):
+ # Source compiler loaded only in this proposal-generation branch.
+ compiler_path='research/t74-native-fast/vendor/native/new/code/borrow/vendor/clifford/clifford_exact.py'
+ compiler_bytes=source.raw(compiler_path);need(hashlib.sha256(compiler_bytes).hexdigest()==COMPILER_SHA,'pinned candidate compiler')
+ import types
+ ce=types.ModuleType('pinned_paid_candidate_compiler');sys.modules[ce.__name__]=ce
+ exec(compile(compiler_bytes,compiler_path,'exec'),ce.__dict__)
+ pick=chosen(pairs,args.limit_pairs);cache={}
+ def frame(i):
+ if i not in cache:cache[i]=ce.canonical_frame(9,c['frames'][i])
+ return cache[i]
+ with gzip.GzipFile(filename=str(args.catalog),mode='wb',mtime=0)as f:
+ proposed_classes=sum(len({x['direction']for x in pairs[key]['occurrences']})for key in pick)
+ write_line(f,{'schema':'paid-phase-candidate/1','word_payload_sha256':WORD_SHA,'compiler_sha256':COMPILER_SHA,'expected_complete_union_pairs':2863,'expected_complete_oriented_classes':5710,'proposed_pairs':len(pick),'proposed_oriented_classes':proposed_classes,'partial':args.limit_pairs is not None})
+ for number,(a,b)in enumerate(pick):
+ op=frame(a).adjoint().then(frame(b))
+ for d in ('forward','backward'):
+ if not any(x['direction']==d for x in pairs[a,b]['occurrences']):continue
+ if d=='backward':actual=ce.Op(9,tuple((x,z,(-p)%4)for x,z,p in op.tab),C.conjugate(op.circuit))
+ else:actual=op
+ recipe,_=ce.lower_child(actual);need(recipe['rank']==pairs[a,b]['rank'],'proposed paid rank')
+ write_line(f,{'input':a,'output':b,'direction':d,'rank':pairs[a,b]['rank'],'recipe':recipe})
+ if(number+1)%250==0:print('GENERATED_PAIRS',number+1,flush=True)
+ return {'status':'PROPOSED_CATALOGUE_NOT_YET_INDEPENDENTLY_VERIFIED','pairs':len(pick),'oriented_classes':proposed_classes,'compiler_sha256':COMPILER_SHA,'catalog_sha256':hashlib.sha256(args.catalog.read_bytes()).hexdigest()}
+
+def verify(args,check,C,c,pairs,counts):
+ seen=set();ranks={};controlled=set();controls=[];cache={};classes=0;fieldinstances=0
+ def frame(i):
+ if i not in cache:cache[i]=C.frame(c['frames'][i])
+ return cache[i]
+ with gzip.open(args.catalog,'rb')as f,gzip.GzipFile(filename=str(args.evidence),mode='wb',mtime=0)as evidence:
+ head=json.loads(next(f));need(head['word_payload_sha256']==WORD_SHA and head['expected_complete_union_pairs']==2863 and head['expected_complete_oriented_classes']==5710,'candidate catalogue source binding')
+ need(not head['partial']or args.allow_partial,'partial catalogue cannot establish complete paid phase closure')
+ for raw in f:
+ rec=json.loads(raw);a,b,d=rec['input'],rec['output'],rec['direction'];key=(a,b,d)
+ need((a,b)in pairs and d in ('forward','backward')and key not in seen,'actual unique oriented paid pair')
+ need(any(x['direction']==d for x in pairs[a,b]['occurrences']),'paid orientation actually occurs')
+ need(rec['rank']==pairs[a,b]['rank'],'actual charged rank catalogue match');recipe=rec['recipe'];r=rec['rank']
+ need(set(recipe)=={'rank','left','right'}and recipe['rank']==r,'complete paid factorization')
+ check.normalizer_valid(C,recipe['left']);check.normalizer_valid(C,recipe['right'])
+ target=C.adj(frame(a))+frame(b)
+ if d=='backward':target=C.conjugate(target)
+ compiled=C.recipe(recipe['right'])+[('C',1<>j)&1),None)
+ need(piv is not None,'invertible affine matrix')
+ if piv!=j:
+ work[j],work[piv]=work[piv],work[j];ops.append(('swap',j,piv))
+ for k in range(9):
+ if k!=j and (work[k]>>j)&1:
+ work[k]^=work[j];ops.append(('xor',k,j))
+ need(work==[1<>i)&1;b=(x>>j)&1
+ if op=='xor':x^=b<>i)&1)
+ +2*sum(((Q[i]>>(i+1))&(x>>(i+1))).bit_count()%2
+ for i in range(9) if (x>>i)&1))%4
+
+def monomial(m):
+ need(set(m)=={'matrix_rows','offset','phase','linear_Z4','quadratic_rows'},'exact monomial grammar')
+ A=m['matrix_rows'];ops=eliminate(A)
+ b=m['offset'];a=m['phase'];alpha=m['linear_Z4'];Q=m['quadratic_rows']
+ need(type(b)is int and 0<=b<512,'binary affine offset')
+ need(type(a)is int and 0<=a<4,'absolute Z4 constant')
+ need(len(alpha)==9 and all(type(x)is int and 0<=x<4 for x in alpha),'Z4 linear phase')
+ need(len(Q)==9 and all(type(x)is int and 0<=x<512 for x in Q),'binary quadratic matrix')
+ need(all(((Q[i]>>j)&1)==((Q[j]>>i)&1) for i in range(9) for j in range(9)),'symmetric quadratic matrix')
+ need(all((alpha[i]&1)==((Q[i]>>i)&1) for i in range(9)),'Clifford diagonal parity')
+ pairs=[(i,j) for i in range(9) for j in range(i+1,9) if (Q[i]>>j)&1]
+ probes={0,511,341,170}|{1<>i)&1) for i in range(9))
+ +2*sum(((x>>i)&1)*((x>>j)&1) for i,j in pairs))%4
+ need(qvalue(m,x)==primitive_phase,'exact phase polynomial decomposition')
+ elementary=sum(3 if op[0]=='swap' else 1 for op in ops)+b.bit_count()+sum(alpha)+len(pairs)+a
+ need(elementary<=171,'one monomial finite primitive-record bound')
+ for f in (1,2,3,4):
+ xs=[(j*73+341)%512 for j in range(f)]
+ expected=sum(qvalue(m,x) for x in xs)%4
+ lifted=(a*f+sum(qvalue(m,x)-a for x in xs))%4
+ need(expected==lifted,'tensor absolute phase multiplicity')
+ return elementary,len(ops),len(pairs)
+
+def scalar_cost(g):
+ need(g[0] in ('add','scale','copy','clear'),'retained scalar opcode')
+ if g[0] in ('copy','clear'):return 2
+ q=Fraction(g[3],g[4]) if g[0]=='add' else Fraction(g[2],g[3])
+ n,d=abs(q.numerator),q.denominator
+ need(n and not d&(d-1),'nonzero dyadic scalar')
+ if g[0]=='scale':
+ need(not n&(n-1),'dyadic unit scale')
+ return 2*(abs(n.bit_length()-d.bit_length())+int(q<0))
+ return 2*(3+n.bit_length()-1+n.bit_count()+d.bit_length()-1)
+
+def program_schema(c,word):
+ spaces=[span(b) for b in c['frames']]
+ need(len(c['start'])==len(c['final'])==632,'exact arbitrary owner count')
+ current={('L',r):c['start'][r] for r in range(632)};current['C',0]=0
+ cost=0;profile=Counter();types=Counter()
+ for e in word:
+ typ=e[0];types[typ]+=1
+ need(typ in ('scalar','climb','center','warp','adapter','phase'),'retained event grammar')
+ if typ=='scalar':
+ g,frame=e[1:];target=tuple(g[1]);need(target in current,'declared scalar owner')
+ cost+=scalar_cost(g)
+ if g[0]=='clear':
+ need(target==('C',0),'no borrowed clear');current[target]=frame
+ else:
+ need(current[target]==frame,'scalar target frame')
+ if g[0] in ('copy','add'):
+ source=tuple(g[2]);need(source in current and source!=target,'distinct actual owner slots')
+ need(current[source]==frame,'scalar source frame')
+ if g[0]=='copy':need(target==('C',0),'no borrowed overwrite')
+ elif typ in ('climb','center'):
+ if typ=='climb':
+ _,_,r,a,b,rank=e;target=('L',r);need(spaces[a] 0`,
+
+by strict subadditivity of x ↦ x^t on positive reals. This mechanism and bill are already in PR #5383. There are 64,148 paid jobs, 10,800 productive fields and rank surplus 752. No extra target credit is obtained from owned pivots or snapshot fields.
+
+The fixed-profile root remains in `(0.00302667476807, 0.00302667476808)`. We use tested saving `C = 0.003026674766`, completion reserve `ρ = 10⁻¹²`, tensor power `v = 1024`, cutoff 20, completion floor 21 and tail offset 1/5. Two rational interval engines certify the complete target and paid moments. The compiler needs all of:
+
+- `α < 1 − ρ`, where α is the full paid-to-target moment ratio;
+- both charged tail ratios below 97/100 and `(97/100)^128 < 1/16`;
+- the exact normalized completed bound `1/(1 + 1024 ρ) + 4/2^32 < 1`;
+- the retained shifted-exit, rounding and complement-capacity inequalities.
+
+The smaller reserve is useful because it leaves enough moment margin near the raw root, but it is not free: shrinking it too far would violate the fixed rounding allowance in the third inequality. All these conditions are rechecked, not inferred from the sign of the raw moment.
+
+Let κ = 0.003026674765 and gap = (C − κ)/7 = 1/7,000,000,000,000. The uniform-rank compiler uses logarithmic power 1000 and computes an integer j satisfying `(gap.denominator * j + 1)^1000 < 2^j`; it checks that the preceding integer fails. The resulting finite height H and threshold N = 2^H are recorded in RESULT.json. Every intermediate saving has an explicit gap, and all 54 strict plus four functional outer predicates are positive. The construction is algorithmically specified; the enormous expanded word is not materialized.
+
+All preparation, snapshot, cleanup and route work is charged. Eight new snapshot slots and sixteen additional owned lifetimes receive two routes each. The full nonrecursive bound remains below 10^9; exact scalar and route counts appear in RESULT.json. Formal prefix norms and denominators are checked against the retained 2^192 envelope; that check does not replace a physical precision execution.
+
+## Reproduction and scope
+
+Python 3.12, standard library only, portable relative paths:
+
+```sh
+python3 -B scripts/research_package.py --package research/eight-owned-relations
+python3 -B scripts/check_research_commit.py --package research/eight-owned-relations
+```
+
+Both registered normal and optimized runs are read-only. `verify.py --write` explicitly regenerates only this package’s word and receipt. Checks cover exact row reduction, all source identities, complete native endpoints and ownership, exact word bytes, controller factorization, independent invoice counting, directed intervals, compiler and outer predicates. Wrong signs in every prepared pivot, wrong snapshot/gauge, missing owned clears and corrupted ranks are rejected. The old 10⁻⁹ reserve is rejected at the new tested saving, and a 10⁻¹³ reserve is rejected for insufficient rounding budget. Source phase lowering is authenticated and reused, not rerun.
+
+The result retains the selected framework’s permitted-erasure, whole-job mixed-target all-size/native, precision/tape, analytic, prime and exact-recovery contracts. Physical tape execution, analytic decomposition, BIT native replay, full source phase lowering, Lean/kernel verification, hosted CI and independent human acceptance are not supplied here. The source admission review for #4610/#5241 does not automatically admit this changed inventory. Chris R’s concurrent PR #5384 independently validates the single-relation predecessor; it does not validate this eight-relation compiler endpoint. No unconditional integer-multiplication theorem or selected-result change is claimed. Full-history ancestry checking is not claimed for this shallow checkout.
+
+## Open next questions
+
+Independent review should check the new reserve against the completed-bound inequality and the finite compiler at the exact printed constants, then the applicability of inherited transfer assumptions. Begin with price.py and the complete invoice in RESULT.json. See TASK.json for the structured question. A further native/profile improvement is a different task; this result supplies no global ceiling for all helper relations.
+
+## Credit
+
+Ali Romman, with OpenAI Codex assistance: PR #5377’s one-relation mechanism and source/pricing implementation, and PR #5383’s public eight-relation construction and prior bound. Cao Yifan: final native word, phase evidence and earlier compiler tightening in PR #4610. Chris R: independent selected-source admission in PR #5241. Cinna Davis: p16 controller and helper lineage in PR #4470. zxv: productive-helper framework, completion/compiler and the PR #5283 cache-contract handoff. Jacob Alan Sussman: mixed-target recursion. Dugongue: retained transported-frame lineage and this compiler-margin refinement. ToikY and all earlier native, Clifford, BIT, precision and analytic contributors retain their source credit. The smaller-reserve technique already occurs in the selected #4610/#5241 compiler audit; we claim its new certified application to this bill, not invention of that technique.
+
+Latest overlap check covered all 214 open PR search results containing “kappa”, the 100 recently updated PRs, and targeted bodies through #5384. Larger draft #5270 is not used: #5349 documents a physical-reference/controller binding mismatch. This bounded search is not exhaustive literature or Discussion coverage.
+
+Prepared by Dugongue with substantial OpenAI Codex assistance, solo. Apache-2.0. Exact predecessor and source hashes are retained.
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/RESULT.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/RESULT.json
new file mode 100644
index 0000000000..2e13818df0
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/RESULT.json
@@ -0,0 +1,429 @@
+{
+ "arithmetic": {
+ "compiler": {
+ "H": 409549000000000000,
+ "N": "2^409549000000000000",
+ "eta": {
+ "lower": "0.000000199491021599850733809086",
+ "upper": "0.000000199491021599850733809087"
+ },
+ "gap": "1/7000000000000",
+ "integer_test_exponent": 58507,
+ "logarithm_power": 1000,
+ "theta": "63/64",
+ "uniform_saving": "21186723361/7000000000000",
+ "word_materialized": false
+ },
+ "completion_reserve": "1/1000000000000",
+ "fixed_profile_ceiling": {
+ "decreasing_through": "1/20",
+ "derivative_upper": {
+ "lower": "-195473.450610684184815935477074865515",
+ "upper": "-195473.450610684184815935477074865514"
+ },
+ "remaining_interval_moment_upper": {
+ "lower": "-6820.155255095433991980526890420873",
+ "upper": "-6820.155255095433991980526890420872"
+ }
+ },
+ "full_backward": 16,
+ "full_forward": 2,
+ "gain_over_PR4610": "979793/200000000000",
+ "gain_over_PR5383": "2953/200000000000",
+ "kappa": "605334953/200000000000",
+ "kappa_decimal": ".003026674765",
+ "margin_at_previous_kappa": {
+ "lower": "1.209169472215494738857340795394",
+ "upper": "1.209169472215494738857340795395"
+ },
+ "margin_at_previous_root_upper": {
+ "lower": "1.209152002019805295008574084544",
+ "upper": "1.209152002019805295008574084545"
+ },
+ "negative_controls": {
+ "closed_epsilon": [
+ "epsilon_below_one",
+ "global_gamma_power_slack",
+ "actual_logarithmic_gamma_guard",
+ "source_axis_superpolynomial",
+ "gaussian_above_main",
+ "new_semantic_guard_with_C1_one"
+ ],
+ "closed_uniform": [
+ "new_complex_uniform_saving_above_b"
+ ],
+ "old_BIT": [
+ "actual_bit_above_effective"
+ ],
+ "unearned_helper_credit": "Rejected by the independent complete census",
+ "unfunded_endpoint": [
+ "main_transform_above_kappa",
+ "global_coordinate_router_above_kappa",
+ "fused_gaussian_above_kappa",
+ "group_bit_router_above_kappa",
+ "boundary_algebraic_matrix_above_kappa"
+ ]
+ },
+ "nonrecursive": {
+ "additional_private_slots": 8,
+ "local_routes": 4834000,
+ "local_scalar": 158776,
+ "owned_slots_backward": 17,
+ "raw_budget": 1000000000,
+ "raw_scalar_upper": 181098496
+ },
+ "ordinary_BIT": {
+ "admitted": "17/5000",
+ "after_cover": "69/20000",
+ "atom": "1/250",
+ "before_cover": "3459/1000000",
+ "ordinary_saving": "8590884599/2500000000000",
+ "prime_rule": "odd q > 2^26*N^5 avoiding all fixed denominators and rank witnesses"
+ },
+ "outer": {
+ "functional_checks": {
+ "actual_new_BIT_stock_sublinear": "1742999999999253/1750000000000000",
+ "fixed_halo_explicit_metadata_branch": "134750000000001/1750000000000",
+ "new_BIT_row_stock_sublinear_in_active_group": "6978999999997009/7000000000000000",
+ "new_semantic_group_guard": "3/7000000000000"
+ },
+ "margins": {
+ "boundary_algebraic_matrix": "74153531756489406638321/24500000000000000000000000",
+ "fused_gaussian": "74153531756468219914963/24500000000000000000000000",
+ "global_coordinate_router": "21186723359/7000000000000",
+ "group_bit_router": "148307063519936439829923/49000000000000000000000000",
+ "group_scans": "3499999999999/3500000000000",
+ "main_transform": "74153531752989406638321/24500000000000000000000000",
+ "microbox_face_corrections": "134750000000001/1750000000000",
+ "polynomial_products": "6999999999999/7000000000000",
+ "sparse_union_movement": "10027278531756489406638321/24500000000000000000000000"
+ },
+ "parameters": {
+ "a": "21186723359/7000000000000",
+ "b": "132417021/43750000000",
+ "beta": "6999999999997/7000000000000",
+ "bit_saving": "17/5000",
+ "cap_xi": "22277278531752989406638321/24500000000000000000000000",
+ "complex_uniform_saving": "21186723361/7000000000000",
+ "d": "1/7000000000000",
+ "epsilon": "6999999999999/7000000000000",
+ "kappa": "605334953/200000000000",
+ "lambda_": "1993946650469/2000000000000",
+ "lambda_prime": "3489406638321/3500000000000",
+ "layout": "1/7000000000000",
+ "q": "10593361679/3500000000000",
+ "r0": "1/70000000000000",
+ "stop": "1/7000000000000",
+ "tested_saving": "1513337383/500000000000"
+ },
+ "strict_checks": {
+ "actual_bit_above_effective": "2613276641/7000000000000",
+ "actual_logarithmic_gamma_guard": "1/7000000000000",
+ "actual_logarithmic_group_guard": "2222721468252260593361679/12250000000000000000000000",
+ "alpha_logarithm_absorption": "1/70000000000000",
+ "boundary_algebraic_matrix_above_kappa": "13989406638321/24500000000000000000000000",
+ "cap_above_band": "10027278531752989406638321/24500000000000000000000000",
+ "cap_below_cell": "2222721468243510593361679/24500000000000000000000000",
+ "cap_below_phase_cell_power": "26722721468247010593361679/24500000000000000000000000",
+ "complex_above_effective": "1/7000000000000",
+ "complex_below_one_over_32": "1234770479/43750000000",
+ "complex_endpoint": "1/3500000000000",
+ "epsilon_below_one": "1/7000000000000",
+ "epsilon_positive": "6999999999999/7000000000000",
+ "fine_prime_halo_umbrella": "7/2",
+ "fused_gaussian_above_kappa": "13968219914963/24500000000000000000000000",
+ "gaussian_above_main": "1739406638321/12250000000000000000000000",
+ "global_coordinate_router_above_kappa": "1/1750000000000",
+ "global_gamma_power_slack": "9/70000000000000",
+ "group_below_dimension": "1/3500000000000",
+ "group_bit_router_above_kappa": "34936439829923/49000000000000000000000000",
+ "group_gauge_power_slack": "2222721468252085593361679/12250000000000000000000000",
+ "group_key_fits_record": "1/3500000000000",
+ "group_positive": "6999999999997/7000000000000",
+ "group_scans_above_kappa": "6978813276643/7000000000000",
+ "halo_covers_generic_inverse_radius": "5",
+ "improvement_over_user_baseline": "647852172900418148631/500000000000000000000000",
+ "lambda_above_internal": "1/14000000000000",
+ "lambda_above_sigma": "3/14000000000000",
+ "lambda_above_tau": "1/14000000000000",
+ "lambda_prime_above_lambda": "1/14000000000000",
+ "lambda_prime_above_leaf": "87367582979/306250000000000000000000",
+ "leaf_saving_above_effective": "43617582979/306250000000000000000000",
+ "main_transform_above_kappa": "10489406638321/24500000000000000000000000",
+ "membership_arithmetic_fits_record": "1/7000000000000",
+ "microbox_face_corrections_above_kappa": "538978813276649/7000000000000",
+ "microbox_halo_volume": "553000000000003/7000000000000",
+ "new_complex_uniform_saving_above_b": "1/7000000000000",
+ "new_semantic_guard_with_C1_one": "1/7000000000000",
+ "polynomial_products_above_kappa": "1744703319161/1750000000000",
+ "positive_layout_slack": "1/7000000000000",
+ "q_below_effective": "1/7000000000000",
+ "q_below_internal": "1/7000000000000",
+ "q_below_leaf": "87367582979/306250000000000000000000",
+ "q_positive": "10593361679/3500000000000",
+ "short_record_fallback": "43617582979/43750000000",
+ "source_axis_superpolynomial": "1/7000000000000",
+ "sparse_union_movement_above_kappa": "9953125000013989406638321/24500000000000000000000000",
+ "stop_below_one": "6999999999999/7000000000000",
+ "stop_positive": "1/7000000000000",
+ "strassen_integer_power_gap": "1951441519231",
+ "support_router_span": "3/7000000000000",
+ "theta_positive_polynomial_power": "2",
+ "union_header_fits_record": "3/7000000000000",
+ "union_tag_work_per_visit_fits_record": "3/7000000000000"
+ }
+ },
+ "paid": {
+ "1": 41170,
+ "16": 448,
+ "2": 7416,
+ "24": 448,
+ "3": 9180,
+ "32": 448,
+ "4": 2286,
+ "40": 448,
+ "48": 448,
+ "5": 720,
+ "56": 448,
+ "64": 448,
+ "72": 224,
+ "8": 16
+ },
+ "paid_calls": 64148,
+ "productive_fields": 10800,
+ "query_shears": 15,
+ "rank_mass_surplus": 752,
+ "raw_headroom": [
+ "307/100000000000000",
+ "77/25000000000000"
+ ],
+ "raw_root_interval": [
+ "302667476807/100000000000000",
+ "37833434601/12500000000000"
+ ],
+ "strictification": {
+ "alpha": {
+ "lower": "0.999999999997831927004289535030",
+ "upper": "0.999999999997831927004289535031"
+ },
+ "cutoff": 20,
+ "delta": {
+ "lower": "0.951652475842024105512105409944",
+ "upper": "0.951652475842024105512105409945"
+ },
+ "floor": 21,
+ "gamma": {
+ "lower": "0.956968566609975897371044048406",
+ "upper": "0.956968566609975897371044048407"
+ },
+ "normalized_paid_upper": "1048576000976562501/1048576001073741824",
+ "power": 1024,
+ "reserve": "1/1000000000000",
+ "tail_offset": "1/5",
+ "tested": "1513337383/500000000000"
+ },
+ "targets": {
+ "145": 224,
+ "17": 448,
+ "25": 448,
+ "33": 448,
+ "4": 504,
+ "41": 448,
+ "49": 448,
+ "57": 448,
+ "65": 448,
+ "7": 126,
+ "73": 224,
+ "8": 846,
+ "9": 5740
+ }
+ },
+ "candidate_native": {
+ "backward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 318
+ },
+ "independent_owned_entry_columns": 17,
+ "independent_persistent_columns": 624,
+ "max_denominator": 64,
+ "max_formal_prefix_l1": "163",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2193,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40
+ },
+ "real_scalar_allowance": 158776,
+ "zero_identities": 8
+ },
+ "forward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 326
+ },
+ "independent_owned_entry_columns": 1,
+ "independent_persistent_columns": 632,
+ "max_denominator": 32,
+ "max_formal_prefix_l1": "457",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2201,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40,
+ "8": 8
+ },
+ "real_scalar_allowance": 158120,
+ "zero_identities": 0
+ }
+ },
+ "independent_source_identities": [
+ {
+ "center": 11332,
+ "center_factor": "1/4",
+ "site": 0,
+ "zero_factor": "-1/4"
+ },
+ {
+ "center": 11358,
+ "center_factor": "1/4",
+ "site": 1,
+ "zero_factor": "-1/4"
+ },
+ {
+ "center": 11384,
+ "center_factor": "1/4",
+ "site": 2,
+ "zero_factor": "-1/4"
+ },
+ {
+ "center": 11410,
+ "center_factor": "-1/4",
+ "site": 3,
+ "zero_factor": "1/4"
+ },
+ {
+ "center": 11436,
+ "center_factor": "1/4",
+ "site": 4,
+ "zero_factor": "-1/4"
+ },
+ {
+ "center": 11462,
+ "center_factor": "-1/4",
+ "site": 5,
+ "zero_factor": "1/4"
+ },
+ {
+ "center": 11488,
+ "center_factor": "1/4",
+ "site": 6,
+ "zero_factor": "-1/4"
+ },
+ {
+ "center": 11514,
+ "center_factor": "-1/4",
+ "site": 7,
+ "zero_factor": "1/4"
+ }
+ ],
+ "native_negative_controls": {
+ "missing_owned_input_clear": "Every independent main/helper endpoint: 0",
+ "uncleared_owned_output": "Every owned entry column is erased at return",
+ "under_or_overstated_paid_rank": "Exact paid rank and frame",
+ "wrong_copy_gauge": "Exact scalar destination frame",
+ "wrong_prepared_pivot_225": "Every independent main/helper endpoint: 0",
+ "wrong_prepared_pivot_227": "Every independent main/helper endpoint: 0",
+ "wrong_prepared_pivot_229": "Every independent main/helper endpoint: 1",
+ "wrong_prepared_pivot_230": "Every independent main/helper endpoint: 0",
+ "wrong_prepared_pivot_241": "Every independent main/helper endpoint: 1",
+ "wrong_prepared_pivot_245": "Every independent main/helper endpoint: 1",
+ "wrong_prepared_pivot_257": "Every independent main/helper endpoint: 1",
+ "wrong_prepared_pivot_261": "Every independent main/helper endpoint: 1",
+ "wrong_relation_sign": "Every independent main/helper endpoint: 0",
+ "wrong_snapshot_source": "Zero identity requires an identically zero full row",
+ "wrong_zero_input_frame": "Zero identity requires an identically zero full row"
+ },
+ "phase_inheritance": {
+ "absolute_phase_receipt_reused": "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "all_retained_paid_events_and_warps_from_source": true,
+ "new_gaussian_operators": 0,
+ "new_native_maps": 0,
+ "new_operations": "Same-frame COPY, owned CLEAR/ADD, and physical identity on a proved zero row.",
+ "source_amplitudes_and_phase_lowering_freshly_replayed": false
+ },
+ "relation_basis": {
+ "dyadic": true,
+ "pivots": [
+ 225,
+ 227,
+ 229,
+ 230,
+ 241,
+ 245,
+ 257,
+ 261
+ ],
+ "rank": 8
+ },
+ "scope": "Exact finite word, full all-column endpoints, ownership, p16 bill and compiler arithmetic. Retains source native phase, allowed owned erasure, mixed-target all-size, analytic, precision, tape, prime and exact-recovery contracts. No selected-frontier update.",
+ "source_native": {
+ "backward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 326
+ },
+ "independent_owned_entry_columns": 1,
+ "independent_persistent_columns": 632,
+ "max_denominator": 64,
+ "max_formal_prefix_l1": "169",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2201,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40,
+ "8": 8
+ },
+ "real_scalar_allowance": 158168,
+ "zero_identities": 0
+ },
+ "forward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 326
+ },
+ "independent_owned_entry_columns": 1,
+ "independent_persistent_columns": 632,
+ "max_denominator": 32,
+ "max_formal_prefix_l1": "457",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2201,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40,
+ "8": 8
+ },
+ "real_scalar_allowance": 158120,
+ "zero_identities": 0
+ }
+ },
+ "source_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd",
+ "status": "PASS_CONDITIONAL_KAPPA_003026674765_COMPILER_MARGIN",
+ "word_payload_sha256": "9aa0d7112b4e13f1aa13a93dab0af6f4435ffe99b842aad841685becdafee492"
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/SOURCES.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/SOURCES.json
new file mode 100644
index 0000000000..71c57c8a90
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/SOURCES.json
@@ -0,0 +1,90 @@
+{
+ "schema_version": 1,
+ "base_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "files": [
+ {
+ "path": "certificates/selected-result.json",
+ "usage": "provenance",
+ "git_blob": "b288ae44032fd84dd5564243422836cbcd29835e",
+ "sha256": "f9ed52bb642cd1e1486cf2743557ac5fa23cf1514a3277d786a644e39a565038"
+ },
+ {
+ "path": "docs/research/agent-task-catalog.json",
+ "usage": "provenance",
+ "git_blob": "f126dd2e2dad2b669e75d1d0d0bd05c600725602",
+ "sha256": "f7a48bfa2659b88378282a8eee7d9fe52cdf505594124c4d1686b58510fffd72"
+ },
+ {
+ "path": "research/free-word-tensor-lift-audit/PROOF.md",
+ "usage": "provenance",
+ "git_blob": "69c337a7704ce589798269ab4b8606189c070c4e",
+ "sha256": "cc8ad3698a673fb225419a3636a39aa99a66c7a0676f12e329b1e76564fa1459"
+ },
+ {
+ "path": "research/higher-moment-strictification/verify.py",
+ "usage": "input",
+ "git_blob": "4b24a5096154736ce060474eb8c72dc64c303699",
+ "sha256": "0ce7e7137422d5ffeda22085c81fa88471bbe963100fdad62e659f1e3bf89326"
+ },
+ {
+ "path": "research/joint-helper-lattice/CONTROLLER.json",
+ "usage": "input",
+ "git_blob": "49a2f0675819f9deeea27ed77be2c2b6ff2e87e5",
+ "sha256": "1f5d6aa267e4e66048818714b5d3b5eae17a58abe91d15deeaa34574f7391a5f"
+ },
+ {
+ "path": "research/kappa-causal-continuation/buffer-borrowing/verify_buffers.py",
+ "usage": "input",
+ "git_blob": "5a55034ec9e6185d981e16c28e1e2e455069e2cb",
+ "sha256": "106b4d5e052427230df452f0c901d5390a0583782960b80a8af94d9a984022c7"
+ },
+ {
+ "path": "research/kappa-interface-round2-20261022/price_profile.py",
+ "usage": "provenance",
+ "git_blob": "1d93e43d1cb888d128c2faa2be83a96d85b84295",
+ "sha256": "adde619968d3ac37147d239e25145b28150650e9ce0f76035f680f22589adcbb"
+ },
+ {
+ "path": "research/kappa-rebuild/architecture/mixed_target_probe.py",
+ "usage": "input",
+ "git_blob": "4fc05ab08138218ba9f09e5c89b649afae7c914e",
+ "sha256": "011c3c9d0cf81103dc84d709a0e36793eb7c5ae3f23c85eac27650ef13afa04a"
+ },
+ {
+ "path": "research/kappa-rebuild/complex/native_extensions.py",
+ "usage": "provenance",
+ "git_blob": "7f84894efc309546a903d314c7ac1473e7f594a8",
+ "sha256": "50ad007d9c386393657e86c99a96ae0a63a8fbc52872579b185002cc626e88e3"
+ },
+ {
+ "path": "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "usage": "input",
+ "git_blob": "46d929df83817b85a5387bcdb9745e0627d6366e",
+ "sha256": "7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05"
+ },
+ {
+ "path": "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "usage": "input",
+ "git_blob": "ac77b78547d6dbf2e6bd102e1047c5b16c1bca88",
+ "sha256": "6eae66ed3cfa8a1533e89b9660a57276908e6646640a12f8b1e3489f4ea1354b"
+ },
+ {
+ "path": "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "usage": "input",
+ "git_blob": "0fdb65f946d557c13d8e2781b9151e2a8ddee5c3",
+ "sha256": "b4f720a7ccbb5b46e472eaf85dc8739a40598986f19b37d26c4f9ecfbd31f0de"
+ },
+ {
+ "path": "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "usage": "input",
+ "git_blob": "340e1f0ffb8a1a9c38fbbd9119580b6d23e01b59",
+ "sha256": "d097e55f06c3f244f2074ffd7c1a0a5f3c4b4b6a6accf9619d1dde5c0ae85e15"
+ },
+ {
+ "path": "research/query-thinned-controllers/RESULT.json",
+ "usage": "input",
+ "git_blob": "e0695152c98d727edfd0d2034b58a1c7e8682c0c",
+ "sha256": "6ebfc8c0f09166f4834e9d7427410cb31aefff2cd4d4ce588c8e52c9c70e9a0f"
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/TASK.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/TASK.json
new file mode 100644
index 0000000000..8b9df431cc
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/TASK.json
@@ -0,0 +1,71 @@
+{
+ "schema_version": 1,
+ "task_id": "complex-new-helper-inventory",
+ "priority_revision": 7,
+ "base_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "original_card": {
+ "id": "complex-new-helper-inventory",
+ "question": "Can a new local cost interface change the deficit-to-recursive-cost ratio beyond current packing?",
+ "starting_points": [
+ "docs/research/research-family-status.md",
+ "research/complex-local-word-ceiling/README.md",
+ "research/heterogeneous-owner-assembly/README.md",
+ "certificates/selected-result.json",
+ "research/selected-k8-unrestricted-ends/README.md"
+ ],
+ "methods": [
+ "Propose a changed helper inventory and derive an optimistic exact moment.",
+ "Design a small completed instance and independently verify its endpoint and rank bill."
+ ],
+ "acceptance_gate": "A new physically realizable contract outside the frozen catalogue whose per-call profile, screened with ceiling.ceiling(), beats the selected word's packing ceiling; a lower cap does not establish identical circuitry or order attainable optima, and is insufficient to pass the stronger-budget target under this model. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.",
+ "first_step": {
+ "command": [
+ "python3",
+ "-B",
+ "research/complex-local-word-ceiling/verify.py"
+ ],
+ "expected": "PASS_COMPLEX_LOCAL_WORD_CEILING",
+ "inspect": "Read the selected word's per-call local profile, its packing ceiling and the lever table; run levers.py for the ideal budget of the lever you target.",
+ "scope": "Positive control and planning budget only; this is not a new construction or full cold replay."
+ },
+ "first_experiment": "Before any synthesis, write the candidate per-call local profile (and centre charge / unpaid coordinates if changed) and screen it with ceiling.ceiling(); reject it if even the ideal ceiling does not beat the selected word's by your stated margin.",
+ "bottleneck_link": "Packing of the selected word is capped at +0.87% (ceiling model); only a lower local excess spend or a changed coverage law raises the cap.",
+ "allowed_variations": [
+ "Narrow to one changed boundary or helper type with explicit counts.",
+ "If the coverage law, template or guard changes, derive an applicable fully charged replacement bound instead of applying the incumbent ceiling outside its scope."
+ ],
+ "scope_change_triggers": [
+ "Mixing only providers already inside the pinned catalogue.",
+ "Only changing helper terminal subspaces and monotone frames within the fixed scalar word, entrances and cleanup contract already covered by #1995/#2013.",
+ "Continuing a partial cost improvement while leaving the same unpriced consumer, restoration or central-readout obligation unresolved; refresh the family expansion decision first. Local product-retiming evidence has a narrow scope and is not a ban on changed graphs or contracts."
+ ],
+ "overlap_terms": [
+ "helper inventory",
+ "heterogeneous-owner",
+ "mutable leaver"
+ ]
+ },
+ "scope_status": "changed",
+ "actual_scope": "Certify conditional kappa 0.003026674765 on the eight-relation bill of PR5383 by shrinking the completion reserve and rechecking the finite compiler and complete outer ledger.",
+ "scope_change_reason": "Concurrent PR5383 published the same eight-relation mechanism during discovery. Credit that result; the new contribution is a smaller fully charged completion reserve and higher finite conditional endpoint, with a fresh reconstructed native witness.",
+ "bottleneck_link": "https://github.com/CrocSwap/integer-mult-bounds/discussions/5125#discussioncomment-19153737",
+ "budget_minutes": 60,
+ "stop_rule": "Publish one exact complete-profile kappa improvement after native, ownership, phase-inheritance, compiler and cold-export checks.",
+ "outcome": "partial",
+ "evidence": "Exact simultaneous native replay, source identities, rational row reduction, all-input endpoints, complete controller invoice, two rational interval engines, compiler and outer predicates. Conditional transfer assumptions retained.",
+ "author": "Dugongue",
+ "ai_assistance": "Substantial OpenAI Codex assistance, solo; no subagents.",
+ "open_questions": [
+ {
+ "question": "Can an independent reviewer validate the new completion reserve and its finite-template application?",
+ "why_it_matters": "The result is conditional and author-checked; the numerical crossing alone is not an admitted supplier.",
+ "first_step": "Check alpha < 1 - 10^-12, the exact completion bound, finite integer test and all 58 outer predicates against the unchanged complete bill.",
+ "blocked_by": "Independent admission review remains pending."
+ }
+ ],
+ "coordination": {
+ "predecessor_discussion": "https://github.com/CrocSwap/integer-mult-bounds/discussions/5125#discussioncomment-19154290",
+ "scope": "Compiler-margin refinement of PR5383, not a new claim to eight-relation discovery.",
+ "coverage": "All 214 open PR search results containing kappa, 100 recently updated PRs and targeted bodies through #5384; incomplete Discussion pagination. Agent CLI authentication returned HTTP 401."
+ }
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/VERIFY.json b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/VERIFY.json
new file mode 100644
index 0000000000..8098df4c80
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/VERIFY.json
@@ -0,0 +1,38 @@
+{
+ "schema_version": 1,
+ "status": "ready",
+ "python": "3.12",
+ "requirements": [],
+ "inputs": [
+ "research/higher-moment-strictification/verify.py",
+ "research/joint-helper-lattice/CONTROLLER.json",
+ "research/kappa-causal-continuation/buffer-borrowing/verify_buffers.py",
+ "research/kappa-rebuild/architecture/mixed_target_probe.py",
+ "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "research/query-thinned-controllers/RESULT.json"
+ ],
+ "commands": [
+ {
+ "argv": [
+ "{python}",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "Exact native rows, owned entry columns, event ranks, independent source identities, p16 Laurent controller, complete asymmetric invoice, two interval engines, compiler and outer predicates, negative controls."
+ },
+ {
+ "argv": [
+ "{python}",
+ "-O",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "The same checks remain active with Python assertions disabled."
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz
new file mode 100644
index 0000000000..c62fcb5964
Binary files /dev/null and b/research/joint-relations-independent-validation/capsule/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz differ
diff --git a/research/joint-relations-independent-validation/capsule/repository/certificates/selected-result.json b/research/joint-relations-independent-validation/capsule/repository/certificates/selected-result.json
new file mode 100644
index 0000000000..b288ae4403
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/certificates/selected-result.json
@@ -0,0 +1,92 @@
+{
+ "status": "Selected maintainer-reviewed conditional PR4610 construction, with independent PR5241 admission evidence and explicit inherited foundation reuse",
+ "kappa": "15108879/5000000000",
+ "decimal": "0.0030217758",
+ "source_prs": [
+ 4610,
+ 5241,
+ 4470,
+ 4447,
+ 4441,
+ 4440,
+ 4416,
+ 4433,
+ 4359,
+ 4268,
+ 3945,
+ 4085,
+ 2979,
+ 4076,
+ 4088,
+ 1673,
+ 1758,
+ 1786,
+ 23,
+ 555,
+ 589
+ ],
+ "source_manifest": "certificates/frontier4610-source.json",
+ "certificate": "certificates/frontier4610/CLAIM.json",
+ "certificate_sha256": "c48376a8365a4c7b67adb368bafa128bede4cd5589a41fa276f96a350d45606c",
+ "proof": "docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md",
+ "proof_supplements": {
+ "notes/batched-bit-rows.tex": "ef72c0ead19373cbc19c8a3aacb44dd0f75353ee5f4d055f775a986a4878022c",
+ "notes/batched-complex-rows.tex": "64c70926a8705874f1c9b42a2f703e42cad4e90f927f544458cfdf729540236c",
+ "notes/compact-control-movement.tex": "b963c3d2f4e1b7059aa289bb4b4ac89b688920bcf42f5b20d7698cdef0132cc6",
+ "notes/general-clifford-frames.tex": "c9bb9655b594583c6b4bab8cb485233f1d1e588f83858cf1e4c3530cee8fed54",
+ "notes/stopped-product-complex.tex": "4738089103a4b263b3b0ef458f5ef35519c696f1ea871ae79e508d3720f5870a",
+ "notes/three-stage-cover-bit.tex": "47123a756f823c83a0d48cca2bf5add6472cd88410b13aed345e70c8834fb511",
+ "notes/three-stage-cover-rows.tex": "6ad97a5cd7d6aecf978a81226e1c2763d37840caca130c61f3bf5c4ac111c5c8",
+ "references/semantic-bulk/pr23/semantic-bulk-17-note.tex": "652242b05174bb776ffc6165af170df9c8cf220dbd0fc26c24d778f320dbabc8",
+ "research/e8-bit-carrier-skeleton/code/bit/export_records.py": "8a5999601f917dbb492bb9ae9a344611f18cc7cedc53dc3c76496a369e530eb3",
+ "research/e8-bit-carrier-skeleton/code/nine/geometry.py": "36eeda3184bd009e89462b65c8725d10860c444f8da8f1f87e5f6e50120011ca",
+ "research/e8-bit-p111-tuned/code/gen_p3.py": "438b83f10d70ceca7cf78049420204b7de2dc61682f913c50a62596106ad84cd",
+ "research/e8-bit-p111-tuned/code/xcheck_p.py": "af3decc877e27c00001cf56f50c6c09566e8e101297ab34c7860aed96a06d80e",
+ "research/e8-bit-p111-tuned/tune/EXPECTED.json": "b9f0e5ca038abe837b0007c8fe006f366a6f02009244ac57705a8a200e2301f4",
+ "research/e8-bit-p111-tuned/tune/apply.py": "806ae4cb2648e4f05dcf56bd089891fd3ba33a6ee5fe76d3329e322c6770c1a1",
+ "research/e8-bit-p111-tuned/tune/wlib.py": "a37fdf3cdf5f62945c2a90193401c0e9edc9dd3cda8d8cb36a3b9c329ebe4dbc",
+ "research/t74-native-fast/vendor/native/new/code/borrow/vendor/clifford/clifford_exact.py": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962",
+ "docs/research/pr-intake-evidence/pr4359/PROOF-REVIEW.md": "7d67bb814285f7634029fbd378c6457156545f0b38858cc1c6ec34b68cd9d162",
+ "docs/research/pr-intake-evidence/pr4470/PROOF-REVIEW.md": "5c111dd56beb53dc44ab727d96e1af03aaf50f3023d4342e2b0a89ede6cf585b",
+ "docs/research/pr-intake-evidence/pr4416/PROOF-REVIEW.md": "2c2bbe6fe1bab44778192118f27e59a0d23dbe02c47aa8a42845093f1ce46f49",
+ "docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md": "b84f833e3072cbab372fbda2ece98fbc031c15e590cf73003ddea35a5222e148",
+ "research/final4610-independent-admission/PROOF.md": "e573cbbe6fa5481c0533e773de404e10f4dc7907b5ebfe404bdcd02dcf9844d8",
+ "research/final4610-independent-admission/SPECIALIZATION.md": "70430114f744108223bc1d44b98bc25b696c4b408b7b044c2a8bbdfdb434ac5c"
+ },
+ "review": "docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md",
+ "validation": "docs/research/pr-intake-evidence/pr4610/VALIDATION.json",
+ "integration": "docs/research/pr-intake-evidence/pr4610/INTEGRATION.json",
+ "reproduce": "make frontier4610-verify",
+ "scope": "Maintainer-reviewed conditional PR4610 construction using the PR5241 independent audit. The five PR4470 framework assumptions are unchanged. Uniform words are not materialized.",
+ "previous_kappa": "60403/20000000",
+ "previous_record": "certificates/checkpoints/frontier4470.json",
+ "audited_source_head": "20bb93cd990d2ff683e4d0fc56b87a42cd5d3296",
+ "source_certificate": "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "source_certificate_sha256": "b4f720a7ccbb5b46e472eaf85dc8739a40598986f19b37d26c4f9ecfbd31f0de",
+ "replay_mode": "Fresh complete independent admission replay; source-bound preceding controller, ordinary BIT and physical/compiler foundation reuse",
+ "contributors": "docs/research/community-native4610-contributors.md",
+ "assumptions": [
+ {
+ "id": "native_all_columns",
+ "statement": "Retained native operators, phase conventions, spectators and whole-job adapters work at every positive column multiplicity."
+ },
+ {
+ "id": "owned_erasure",
+ "statement": "Owned streams and suspended centers obey the retained allocation, erasure and ownership contracts."
+ },
+ {
+ "id": "compiler",
+ "statement": "The finite mixed-target compiler and chronological product, completion and splitting satisfy the retained uniform closure contract."
+ },
+ {
+ "id": "precision_tape",
+ "statement": "Retained fixed-tape movement and precision/storage prescriptions apply to the new fixed finite template."
+ },
+ {
+ "id": "analytic_recovery",
+ "statement": "Analytic decomposition, fine-prime avoidance and exact integer recovery follow the retained upstream/outer framework."
+ }
+ ],
+ "audit_pr": 5241,
+ "audit_head": "13efb5fc5f3b7c14ec2cfa181dd9eb6480972cf2"
+}
diff --git a/research/joint-relations-independent-validation/capsule/repository/docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md b/research/joint-relations-independent-validation/capsule/repository/docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md
new file mode 100644
index 0000000000..bf5ff049da
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md
@@ -0,0 +1,137 @@
+# PR4610: conditional admission through the PR5241 audit
+
+**Pass under the unchanged five selected framework assumptions:**
+κ = 15108879/5000000000 = **0.0030217758**.
+This is Cao Yifan / intqwq's construction at
+`20bb93cd990d2ff683e4d0fc56b87a42cd5d3296`, independently audited in
+Chris R / Clear1nsight's PR5241 at
+`13efb5fc5f3b7c14ec2cfa181dd9eb6480972cf2`.
+Maintainer review: Douglas Colkitt's OpenAI assistant, with substantial AI
+assistance. Apache-2.0. No independent human or end-to-end formal proof is claimed.
+
+## Changed construction and exact coverage
+
+The accepted object is the frozen round3 native word and round6 compiler point,
+not every exploratory claim or intermediate result in PR4610. Relative to
+selected PR4470, 20 native binary maps and 26 helper boundary interfaces change;
+all twelve shared prelude maps and the main endpoints remain fixed. The complete
+local paid profile becomes `{1:2201, 2:412, 3:510, 4:127, 5:40, 8:8}`.
+The productive helper profile remains `{4:28, 7:7, 8:47, 9:326}`.
+
+The fresh audit passes all eleven required stages. It checks 480 signed warp
+events, 180 signed warp classes in both orientations, all 408 helper inputs
+through 34 oriented endpoint classes, and all 5,710 oriented paid classes
+covering 6,596 local event instances. No earlier receipt's PASS flag substitutes
+for phase correctness. The frozen paid catalogue is candidate data; its
+compiler is not imported by the acceptance path.
+
+The reviewer inspected the independent Clifford evaluation and phase test:
+equality on the 18 Pauli generators identifies the operator up to a scalar;
+equality on an exactly normalized nonzero state fixes that scalar. All factors
+are validated monomial/Clifford operations, so this is a complete finite-operator
+argument, not a sample of input vectors. Phase-only mutations preserve the
+tableau and are nevertheless rejected. Positive recursive ranks are checked
+against the actual nested bases, including all eight owned rank-eight calls.
+
+The chronological symbolic interpreter tracks all 632 independent persistent
+inputs, current frames, inverse orientations and the owned C0. It verifies a
+free-group identity on arbitrary dirty inputs, with each helper restored and
+only the owned stream erased. Left multiplication on reduced free words is
+injective; its dictionary update does not silently discard colliding words.
+Main chart and scalar opcode/coefficient sequences are compared to retained
+source. No arbitrary borrowed input is treated as initialized workspace.
+
+## Uniform lift and physical specialization
+
+We reviewed PROOF.md and SPECIALIZATION.md against the pinned PR4359, PR4416
+and PR4470 reviews and the general-frame/compact-movement notes. The retained
+contract already permits arbitrary fixed nested binary frames with independent
+two-sided monomial adapters. The new recipes lie in that class: invertible
+nine-bit affine maps and Z4 quadratic phases. Elimination, translations and
+phase operations need at most 171 primitive records per monomial, hence at
+most 342 for two adapters, within the retained 1000-record raw allowance.
+This counts retained physical primitive records, not constant literal tape
+steps at arbitrary column multiplicity.
+
+Tensor power is applied to products and individual operator factors. The scalar
+ADD program instead lifts by evaluation of its proved free-group identity.
+Tensor power is never distributed over a sum. Absolute phase is repeated once
+per column. Algebraic equality holds at every positive multiplicity; the
+physical tariff retains its source hypotheses on complete slots, restored
+controls, record fibers and the f,p domain. Spectators and independent ownership
+remain explicit. Thus the changed catalogue does not add a candidate-specific
+oracle to the old assumptions.
+
+Expanded template counts, owned banks, routing and coefficient envelopes must
+be substituted into the retained precision/stock formulas. The new enormous
+compiler does not inherit an old numerical template-size cap. This remains a
+conditional application of the selected physical and analytic framework;
+finite computations do not independently prove its fixed-tape, precision or
+integer-recovery theorems.
+
+## Invoice, completion and outer transfer
+
+The unchanged p16/query-thinned controller is source-identical to the selected
+review. The audit independently reconstructs its events and boundary programs;
+the previously reviewed Laurent endpoint and stage-zero commutation argument
+are reused with unchanged main operators. Eighteen full calls, fifteen thin
+queries, fifteen idle windows, all main/helper targets and owned centers give
+**64,404 paid calls and 10,928 productive fields**. Target and paid rank masses
+remain 239,886 and 239,134, giving surplus 752. Compared with PR4470 the whole
+paid histogram changes by `{-648 H1, +432 H2, +288 H3, -360 H4, +72 H5}`:
+216 fewer calls, without removing rank mass or reusing output credit.
+
+Two independently implemented directed interval engines check the freshly
+derived invoice. The raw crossing is bracketed by
+(.00302177587077, .00302177587078). The tested saving .00302177581 exceeds the
+claim .0030217758. The old selected invoice fails at the new claim; this is a
+changed-construction gain, not decimal refinement of the old crossing.
+
+At tensor power 1024, cutoff 20, completion floor 21 and tail shift 1/5,
+alpha < 1-10^-11 and both charged tail ratios are below 97/100. The complete
+bound `1/(1+1024*10^-11)+4/2^32 < 1` is checked exactly. The old 10^-9 reserve
+would fail here and is explicitly rejected. The reviewed product/completion
+and splitting arguments apply with these new constants and actual profiles.
+The compiler's sufficient integer test gives H=38,569,300,000,000,000 and
+N=2^H. This is a finite specified construction; no expanded word is materialized.
+
+The ordinary BIT interface is exactly equal to the selected source and admits
+.0034, above the required effective saving. Its already reviewed supplier and
+conversion are reused, not established anew by the complex checks. All nine
+outer cost rows, 54 strict predicates and four functional predicates pass.
+The minimum recorded strict predicate is 1/7,000,000,000,000. Both arithmetic
+engines retain the charged targets, owned centers and compiler tails.
+
+## Execution, provenance and invalidation
+
+COLD-REPLAY.json and BOUNDED-RUN.json record the complete serial CPython 3.12
+run: 137.25 seconds and 184,928 KiB peak sampled descendant RSS, below the
+660-second / 1 GiB guard. All 82 committed-byte bindings, canonical source
+ancestry and registered metadata/pins checks passed. No Lean, Docker, hosted
+Linux run or historical all-suite replay was performed.
+
+The current selected metadata is changing, but PR5241 authenticates the exact
+old PR4470 record as its baseline. The new reproduction entrypoint therefore
+exports that historical record from `certificates/checkpoints/frontier4470.json`
+to its original path, explicitly. The research package and scientific source
+bytes remain unchanged. Canonical Git objects are used only for ancestry and
+stored-blob checks; the mathematical code reads its closed exported input set.
+The source manifest also retains the prior reviewed foundation closure.
+
+Changes to frames, native phases, scalar chronology, helper endpoints,
+controller, actual ownership, paid completion, compiler parameters, source
+bytes or physical/outer contracts invalidate the affected review. Optional
+optimizers, claimed global optima and later scalar-compression variants are
+outside this acceptance. The result remains conditional on precisely the five
+PR4470 assumption records, copied without weakening or deletion.
+
+## Credit
+
+Cao Yifan / intqwq: changed construction and compiler point (PR4610).
+Chris R / Clear1nsight: complete independent admission package (PR5241).
+Cinna Davis /1337isnot1337: joint-helper, query-thinned controller and preceding
+construction chain. zxv: productive-helper native/compiler machinery.
+Jacob Alan Sussman: mixed-target recursion. Dugongue: transported frames and
+physical interfaces. Mihir Srivastava, Ryanson Jonathan and Mark / Matarener:
+retained independent checks and adversarial questions. All BIT, geometry,
+Clifford, precision and analytic contributors retain their earlier credit.
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/free-word-tensor-lift-audit/PROOF.md b/research/joint-relations-independent-validation/capsule/repository/research/free-word-tensor-lift-audit/PROOF.md
new file mode 100644
index 0000000000..69c337a770
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/free-word-tensor-lift-audit/PROOF.md
@@ -0,0 +1,174 @@
+# Source-bound free-operator tensor lift
+
+This audit affirms one specific premise in PR4100's `COMPLEX.md`, lines 62–89:
+the retained four PR4088 words cancel in a free group algebra before any
+particular native operator is substituted. The premise is true for the exact
+source exports checked here. This is a local algebra and source-binding result;
+it supplies no new paid profile, numerical allowance, encoded implementation,
+physical hosting theorem, outer release or selected-frontier improvement.
+
+## Exact source and contract
+
+The audited text is `research/unconditional-batched-crt/COMPLEX.md`, Git blob
+`c3be56fbfdb4fb29c1ace88cbcdfa7475fb6e343`, SHA256
+`853e1295850862752e4f854aa9e8b28f9ca6eaa9306e2af110b7b77526d1b5e1`.
+It is identical at retained PR4100 head
+`337d04939571a637aeab54a0f58f54fde811663a` and canonical main
+`12fa8c5c844be21bfefb38a19503fbd867a11244`.
+
+Its stated source is PR4088 head
+`72d7efc181edb21806a878f174847c96dd410ab0`, package
+`research/staged544-mixed-fourth-entry`. This audit exports the exact four
+`inputs/{THREE,FOUR}-{base,extra}.json.gz` files, retained `vendor/audit_core.py`,
+`vendor/audit_verify.py`, source `verify.py`, `PROOF.md` and `NOTICE.md`.
+`SOURCE-PINS.json` records every original commit, path, length, Git blob and
+SHA256. Every file is authenticated before the retained checker is executed.
+No native runner, owner fill, solver, NumPy or historical outer engine is run.
+
+Each word has 632 live registers, 91 arbitrary dirty private registers,
+72 abstract unary generators and 36 listed initial correction terms. The
+forward common-label contract on the 723-register direct sum is
+
+`(x,y,h,b) -> (x,y+x,h,b)`.
+
+The dual contract is `(x,y,h,b) -> (x-y,y,h,b)`. In particular every private
+buffer is an independent input, returns identically, and has no leakage into
+live outputs. Neither contract assumes zero private inputs or a product state.
+
+## What the retained checker actually computes
+
+In `audit_core.py`, lines 297–391, a register value is a sparse dictionary
+
+`(initial_input, reduced_signed_operator_word) -> Fraction`.
+
+`program` includes every declared initial correction, precondition,
+compensation, A and cut gate, chronologically inserted B warp, B gate,
+restoration and cleanup gate. `_left` and `_right` cancel only adjacent inverse
+letters; `_axpy` adds exact rational coefficients and removes exact zeros.
+There is no commutation, finite-order relation, numerical operator matrix,
+Fourier-character evaluation or univariate minimal-polynomial reduction.
+
+`audit_verify.semantics` runs all 723 independent symbols forward and dual,
+compares an independent direction of pullback, and checks both cleanup-boundary
+contracts. Every emitted provider passes. Each endpoint consists of exactly
+835 nonzero terms: the 723 diagonal terms and 112 intended shear terms. Every
+surviving operator word is empty.
+
+That is a universal algebraic identity, rather than an identity inferred from
+one operator realization. The source's use of the word “symbolic” is justified
+by these actual data structures, reductions and endpoint predicates.
+
+## All positive tensor multiplicities
+
+Let `F` be the free group on symbols `g_1,...,g_72`, and let `A=Q[F]` be its
+rational group algebra. The finite word program is a product of elementary
+723-by-723 matrices over `A`. A correction `c*g_word*x_source` is an off-diagonal
+entry of one such elementary matrix. Scalar ADD and SCALE entries belong to
+`Q*1_A`.
+
+Let `K` be any characteristic-zero field (in particular `Q[i]`) and let `V`
+be any finite-dimensional vector space over `K`. Choose arbitrary invertible `K`-linear operators
+`G_k` on `V`. All tensor products below are over `K`. For every positive integer `f`, define
+
+`rho_f(g_k) = G_k tensor ... tensor G_k` (f factors).
+
+The assignment of free generators extends uniquely to a group homomorphism
+`F -> GL(V tensor f)`: inverses map to tensor products of inverses, and
+
+`(G H) tensor f = (G tensor f)(H tensor f)`.
+
+Extend this map rationally from `A` into the `K`-linear endomorphisms of
+`V tensor f`. This extension is a unital rational algebra
+homomorphism because multiplication of finite formal sums distributes and
+because the group map preserves products. In particular
+
+`rho_f(sum_w c_w*w) = sum_w c_w*rho_f(w)`.
+
+Apply this homomorphism entrywise to the certified elementary-matrix product.
+It preserves each elementary action, the order of events and the product.
+Since the certified endpoint has only rational multiples of empty words, its
+image is exactly the same register-level shear with each scalar multiplied
+by the identity of `V tensor f`. This proves the endpoint for every positive
+`f` and every input in the 723-register direct sum of `V tensor f`, including
+arbitrarily correlated live/private data.
+
+The number of register roles remains 723. We are changing the internal space
+of each role; we are not taking a tensor power of the 723-by-723 register matrix.
+The latter operation would create a different program with 723^f roles.
+
+The dual pass treats `d_k=G_k^(-T)` as separate free generators. The same
+argument applies, and `(G_k^(-T)) tensor f = (G_k tensor f)^(-T)` in the product
+basis. Native frame labels can be replaced by their tensor powers if the
+separately supplied directed native recipe identities are exact. This audit
+does not reprove or rerun those native recipe identities.
+
+## The distinction that must be retained
+
+This algebra homomorphism is linear on formal sums. Therefore
+
+`rho_f(g-I) = G tensor f - I`,
+
+not `(G-I) tensor f`. Likewise `rho_f(c*g)=c*(G tensor f)`, not
+`(c*G) tensor f = c^f*(G tensor f)`. A role SCALE or bridge coefficient must
+remain scalar, while a constant phase already inside a unary generator is
+part of that generator and therefore occurs in every tensor factor.
+
+For an exact small counterexample, take `G=[[1,1],[0,1]]` and `f=2`.
+Then `(G tensor G-I)` sends `e_2 tensor e_2` to
+`e_1 tensor e_1 + e_1 tensor e_2 + e_2 tensor e_1`; whereas
+`(G-I) tensor (G-I)` sends it only to `e_1 tensor e_1`. Their difference is
+nonzero over `Q` (and over the supplemental field F101).
+The code checks a distinct noncommuting 72-generator family as well, and rejects
+both the whole-difference and whole-scalar tensorization rules.
+
+## Independent evidence and its scope
+
+`independent.py` imports or executes no retained implementation. It reconstructs
+the literal sequence from the four exported words and, for each of the 723
+outputs separately, pulls the output functional backward through that sequence
+over exact `Q[F_72]`. The reverse traversal appends words on the right; a stack
+reduces only adjacent inverse letters. All four forward and all four dual
+contracts match exactly: 5784 output-functional checks, 6680 endpoint terms and
+zero surviving nonempty words. Its controls preserve a nontrivial commutator,
+a fourth power and the two distinct terms of `g-I`.
+
+This implementation is independent of the source engine; the format and
+endpoint contract were read from the same credited source. Agreement is
+supplemental to inspection of the finite exact computations, not a substitute
+for proving what the reductions mean.
+
+`verify.py` also reconstructs and executes the literal events directly on dense
+vectors over F101, with 72 distinct invertible 2-by-2 matrices. The first two do
+not commute. It substitutes their tensor powers at `f=1,2,3` in both orientations
+of all four providers, yielding 24 direct fixtures; all 723 registers are given
+deterministic dirty values. These finite-field experiments are controls, not
+the proof for every rational input or unbounded f. Erasing the actual listed
+correction generators fails at 20 registers; tensorizing the actual role SCALE
+coefficients fails at the reported registers. Exact inverse and product
+compatibility controls also pass.
+
+## Remaining obligations and credit
+
+This positive result discharges only the source's formal free-operator premise
+and its algebraic implication to per-role tensor multiplicity. The physical
+lowering of native monomials, directed native recipes, placement, common cover,
+hosted slices, analytic bounds, coefficient precision, fixed-tape inventory,
+recovery and complete ordinary/outer release are outside this audit. The source
+construction makes additional written claims about these interfaces; this audit
+neither verifies nor refutes those claims.
+No paid-rank saving, all-size multiplication theorem, independent human
+acceptance or new kappa is claimed.
+
+The tensor-lift proposal and current construction are credited to Cinna Davis,
+the PR4100 author; this audit does not claim to invent the representation argument.
+Cinna Davis's PR4088 supplies the four literal providers and source integration.
+Sagar Thakrar's PR3687 exact free-operator engine and roger-sato's PR3693
+all-dirty/reverse audit are reused explicitly. Retained lineage includes Rohan
+Arun/PR4076, Dugongue/David Ganz/PR4085 and PR3945, Nick Petalas, Ross
+Richardson/PR3605, dataisfire/PR3734, ChaloupeMusic/Erwan Secousses, Marius-Paul
+Dumitrean, zxv and the earlier geometry/native/compiler/owner contributors.
+The byte-identical source notice and source-file notices remain in `source/`.
+
+The formal and F101 implementations were separately written by one Codex agent. A second Codex agent independently reviewed them and supplied the exact rational signed-permutation oracle in `independent_real.py`; see `INDEPENDENT-REVIEW.md`. None is a human or formal-kernel acceptance.
+
+`mutation_controls.py` also produces exact actual-program counterexamples in `MUTATIONS.json`: erasing the first correction generator yields `(I-G59)x273` in output115; dropping the first nonidentity scale yields `-3*x119` in output119. Both baseline output functionals pass first. Every actual correction word has length one, so a multi-letter correction reorder is inapplicable rather than counted as an executed control.
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/joint-helper-lattice/CONTROLLER.json b/research/joint-relations-independent-validation/capsule/repository/research/joint-helper-lattice/CONTROLLER.json
new file mode 100644
index 0000000000..49a2f06758
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/joint-helper-lattice/CONTROLLER.json
@@ -0,0 +1,5224 @@
+{
+ "ambient_rank": 145,
+ "boundaries": {
+ "left": [
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "1",
+ "0",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ]
+ ],
+ "left_program": [
+ [
+ "SWAP",
+ 30,
+ 31
+ ],
+ [
+ "SWAP",
+ 29,
+ 30
+ ],
+ [
+ "SWAP",
+ 28,
+ 30
+ ],
+ [
+ "SWAP",
+ 27,
+ 29
+ ],
+ [
+ "SWAP",
+ 26,
+ 28
+ ],
+ [
+ "SWAP",
+ 25,
+ 30
+ ],
+ [
+ "SWAP",
+ 24,
+ 25
+ ],
+ [
+ "SWAP",
+ 23,
+ 26
+ ],
+ [
+ "SWAP",
+ 22,
+ 30
+ ],
+ [
+ "SWAP",
+ 20,
+ 26
+ ],
+ [
+ "SWAP",
+ 19,
+ 22
+ ],
+ [
+ "SWAP",
+ 18,
+ 29
+ ],
+ [
+ "SWAP",
+ 17,
+ 23
+ ],
+ [
+ "SWAP",
+ 16,
+ 27
+ ],
+ [
+ "SCALE",
+ 15,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 15,
+ 31
+ ],
+ [
+ "ADD",
+ 12,
+ 14,
+ "1"
+ ],
+ [
+ "ADD",
+ 10,
+ 14,
+ "-1"
+ ],
+ [
+ "ADD",
+ 8,
+ 14,
+ "1"
+ ],
+ [
+ "ADD",
+ 6,
+ 14,
+ "-1"
+ ],
+ [
+ "ADD",
+ 4,
+ 14,
+ "1"
+ ],
+ [
+ "ADD",
+ 2,
+ 14,
+ "-1"
+ ],
+ [
+ "ADD",
+ 0,
+ 14,
+ "1"
+ ],
+ [
+ "SWAP",
+ 14,
+ 15
+ ],
+ [
+ "ADD",
+ 31,
+ 13,
+ "1"
+ ],
+ [
+ "SWAP",
+ 13,
+ 30
+ ],
+ [
+ "ADD",
+ 10,
+ 12,
+ "1"
+ ],
+ [
+ "ADD",
+ 8,
+ 12,
+ "-1"
+ ],
+ [
+ "ADD",
+ 6,
+ 12,
+ "1"
+ ],
+ [
+ "ADD",
+ 4,
+ 12,
+ "-1"
+ ],
+ [
+ "ADD",
+ 2,
+ 12,
+ "1"
+ ],
+ [
+ "ADD",
+ 0,
+ 12,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 12,
+ 14
+ ],
+ [
+ "ADD",
+ 31,
+ 11,
+ "-1"
+ ],
+ [
+ "ADD",
+ 30,
+ 11,
+ "-1"
+ ],
+ [
+ "SCALE",
+ 11,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 11,
+ 29
+ ],
+ [
+ "ADD",
+ 8,
+ 10,
+ "1"
+ ],
+ [
+ "ADD",
+ 6,
+ 10,
+ "-1"
+ ],
+ [
+ "ADD",
+ 4,
+ 10,
+ "1"
+ ],
+ [
+ "ADD",
+ 2,
+ 10,
+ "-1"
+ ],
+ [
+ "ADD",
+ 0,
+ 10,
+ "1"
+ ],
+ [
+ "SWAP",
+ 10,
+ 13
+ ],
+ [
+ "ADD",
+ 31,
+ 9,
+ "1"
+ ],
+ [
+ "ADD",
+ 30,
+ 9,
+ "1"
+ ],
+ [
+ "ADD",
+ 29,
+ 9,
+ "1"
+ ],
+ [
+ "SWAP",
+ 9,
+ 28
+ ],
+ [
+ "ADD",
+ 6,
+ 8,
+ "1"
+ ],
+ [
+ "ADD",
+ 4,
+ 8,
+ "-1"
+ ],
+ [
+ "ADD",
+ 2,
+ 8,
+ "1"
+ ],
+ [
+ "ADD",
+ 0,
+ 8,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 8,
+ 12
+ ],
+ [
+ "ADD",
+ 31,
+ 7,
+ "-1"
+ ],
+ [
+ "ADD",
+ 30,
+ 7,
+ "-1"
+ ],
+ [
+ "ADD",
+ 29,
+ 7,
+ "-1"
+ ],
+ [
+ "ADD",
+ 28,
+ 7,
+ "-1"
+ ],
+ [
+ "SCALE",
+ 7,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 7,
+ 27
+ ],
+ [
+ "ADD",
+ 4,
+ 6,
+ "1"
+ ],
+ [
+ "ADD",
+ 2,
+ 6,
+ "-1"
+ ],
+ [
+ "ADD",
+ 0,
+ 6,
+ "1"
+ ],
+ [
+ "SWAP",
+ 6,
+ 11
+ ],
+ [
+ "ADD",
+ 31,
+ 5,
+ "1"
+ ],
+ [
+ "ADD",
+ 30,
+ 5,
+ "1"
+ ],
+ [
+ "ADD",
+ 29,
+ 5,
+ "1"
+ ],
+ [
+ "ADD",
+ 28,
+ 5,
+ "1"
+ ],
+ [
+ "ADD",
+ 27,
+ 5,
+ "1"
+ ],
+ [
+ "SWAP",
+ 5,
+ 26
+ ],
+ [
+ "ADD",
+ 2,
+ 4,
+ "1"
+ ],
+ [
+ "ADD",
+ 0,
+ 4,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 4,
+ 10
+ ],
+ [
+ "ADD",
+ 31,
+ 3,
+ "-1"
+ ],
+ [
+ "ADD",
+ 30,
+ 3,
+ "-1"
+ ],
+ [
+ "ADD",
+ 29,
+ 3,
+ "-1"
+ ],
+ [
+ "ADD",
+ 28,
+ 3,
+ "-1"
+ ],
+ [
+ "ADD",
+ 27,
+ 3,
+ "-1"
+ ],
+ [
+ "ADD",
+ 26,
+ 3,
+ "-1"
+ ],
+ [
+ "SCALE",
+ 3,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 3,
+ 25
+ ],
+ [
+ "ADD",
+ 0,
+ 2,
+ "1"
+ ],
+ [
+ "SWAP",
+ 2,
+ 9
+ ],
+ [
+ "ADD",
+ 31,
+ 1,
+ "1"
+ ],
+ [
+ "ADD",
+ 30,
+ 1,
+ "1"
+ ],
+ [
+ "ADD",
+ 29,
+ 1,
+ "1"
+ ],
+ [
+ "ADD",
+ 28,
+ 1,
+ "1"
+ ],
+ [
+ "ADD",
+ 27,
+ 1,
+ "1"
+ ],
+ [
+ "ADD",
+ 26,
+ 1,
+ "1"
+ ],
+ [
+ "ADD",
+ 25,
+ 1,
+ "1"
+ ],
+ [
+ "SWAP",
+ 1,
+ 24
+ ],
+ [
+ "SWAP",
+ 0,
+ 8
+ ]
+ ],
+ "right": [
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "-1",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "1",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "-1",
+ "1",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "-1",
+ "1",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "-1"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ],
+ [
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "1",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0",
+ "0"
+ ]
+ ],
+ "right_program": [
+ [
+ "ADD",
+ 30,
+ 31,
+ "-1"
+ ],
+ [
+ "ADD",
+ 29,
+ 31,
+ "-1"
+ ],
+ [
+ "ADD",
+ 28,
+ 31,
+ "-1"
+ ],
+ [
+ "ADD",
+ 27,
+ 31,
+ "-1"
+ ],
+ [
+ "SCALE",
+ 31,
+ "-1"
+ ],
+ [
+ "ADD",
+ 31,
+ 30,
+ "-1"
+ ],
+ [
+ "ADD",
+ 29,
+ 30,
+ "-1"
+ ],
+ [
+ "ADD",
+ 28,
+ 30,
+ "-1"
+ ],
+ [
+ "ADD",
+ 27,
+ 30,
+ "-1"
+ ],
+ [
+ "ADD",
+ 31,
+ 29,
+ "-1"
+ ],
+ [
+ "ADD",
+ 28,
+ 29,
+ "-1"
+ ],
+ [
+ "ADD",
+ 27,
+ 29,
+ "-1"
+ ],
+ [
+ "SCALE",
+ 29,
+ "-1"
+ ],
+ [
+ "ADD",
+ 31,
+ 28,
+ "-1"
+ ],
+ [
+ "ADD",
+ 27,
+ 28,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 28,
+ 29
+ ],
+ [
+ "ADD",
+ 31,
+ 27,
+ "-1"
+ ],
+ [
+ "SCALE",
+ 27,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 27,
+ 29
+ ],
+ [
+ "ADD",
+ 31,
+ 26,
+ "1"
+ ],
+ [
+ "SWAP",
+ 26,
+ 29
+ ],
+ [
+ "ADD",
+ 29,
+ 25,
+ "-1"
+ ],
+ [
+ "ADD",
+ 24,
+ 25,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 25,
+ 28
+ ],
+ [
+ "ADD",
+ 28,
+ 24,
+ "1"
+ ],
+ [
+ "SWAP",
+ 23,
+ 29
+ ],
+ [
+ "SWAP",
+ 22,
+ 25
+ ],
+ [
+ "SWAP",
+ 20,
+ 23
+ ],
+ [
+ "SWAP",
+ 19,
+ 25
+ ],
+ [
+ "SWAP",
+ 18,
+ 27
+ ],
+ [
+ "SWAP",
+ 17,
+ 29
+ ],
+ [
+ "SWAP",
+ 16,
+ 31
+ ],
+ [
+ "ADD",
+ 14,
+ 15,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 15,
+ 30
+ ],
+ [
+ "ADD",
+ 13,
+ 14,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 14,
+ 30
+ ],
+ [
+ "ADD",
+ 12,
+ 13,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 13,
+ 22
+ ],
+ [
+ "ADD",
+ 11,
+ 12,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 12,
+ 30
+ ],
+ [
+ "ADD",
+ 10,
+ 11,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 11,
+ 18
+ ],
+ [
+ "ADD",
+ 9,
+ 10,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 10,
+ 22
+ ],
+ [
+ "ADD",
+ 8,
+ 9,
+ "-1"
+ ],
+ [
+ "SWAP",
+ 9,
+ 26
+ ],
+ [
+ "SWAP",
+ 8,
+ 30
+ ],
+ [
+ "SWAP",
+ 7,
+ 16
+ ],
+ [
+ "SWAP",
+ 6,
+ 18
+ ],
+ [
+ "SWAP",
+ 5,
+ 20
+ ],
+ [
+ "SWAP",
+ 4,
+ 22
+ ],
+ [
+ "SWAP",
+ 3,
+ 24
+ ],
+ [
+ "SWAP",
+ 2,
+ 26
+ ],
+ [
+ "SWAP",
+ 1,
+ 28
+ ],
+ [
+ "SWAP",
+ 0,
+ 30
+ ]
+ ]
+ },
+ "diagonal": [
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ -1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0
+ ],
+ [
+ 1,
+ 1,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 0,
+ 1,
+ 1
+ ]
+ ],
+ "invoice": {
+ "main": {
+ "17": 448,
+ "25": 448,
+ "33": 448,
+ "41": 448,
+ "49": 448,
+ "57": 448,
+ "65": 448,
+ "73": 224,
+ "145": 224
+ },
+ "owned_streams_reused_sequentially": 1,
+ "paid": {
+ "1": 46446,
+ "2": 12834,
+ "3": 4032,
+ "4": 1836,
+ "5": 360,
+ "8": 144,
+ "16": 448,
+ "24": 448,
+ "32": 448,
+ "40": 448,
+ "48": 448,
+ "56": 448,
+ "64": 448,
+ "72": 224
+ },
+ "paid_calls": 69012,
+ "productive_fields": 10928,
+ "rank_surplus": 752,
+ "raw_scalar_record_bound": 1000000000,
+ "targets": {
+ "5": 504,
+ "6": 324,
+ "7": 1008,
+ "8": 1674,
+ "9": 3834,
+ "17": 448,
+ "25": 448,
+ "33": 448,
+ "41": 448,
+ "49": 448,
+ "57": 448,
+ "65": 448,
+ "73": 224,
+ "145": 224
+ },
+ "thick_calls": 18,
+ "thick_stages": [
+ 0,
+ 1,
+ 3,
+ 5,
+ 7,
+ 9,
+ 11,
+ 13,
+ 15,
+ 17,
+ 19,
+ 21,
+ 23,
+ 25,
+ 27,
+ 29,
+ 31,
+ 32
+ ],
+ "thin_queries": 1680,
+ "whole_idle": {
+ "16": 448,
+ "24": 448,
+ "32": 448,
+ "40": 448,
+ "48": 448,
+ "56": 448,
+ "64": 448,
+ "72": 224
+ }
+ },
+ "keep_mask": 35047648968703,
+ "kind": "complex",
+ "pairs": 16,
+ "physical_events": [
+ [
+ "LOCAL",
+ 0,
+ 0,
+ false
+ ],
+ [
+ "LOCAL",
+ 1,
+ 0,
+ true
+ ],
+ [
+ "IDLE",
+ 1,
+ [
+ 0,
+ 1
+ ]
+ ],
+ [
+ "ADD",
+ 0,
+ 2,
+ 1
+ ],
+ [
+ "ADD",
+ 3,
+ 1,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 2,
+ 0,
+ false
+ ],
+ [
+ "ADD",
+ 0,
+ 2,
+ -1
+ ],
+ [
+ "ADD",
+ 3,
+ 1,
+ 1
+ ],
+ [
+ "LOCAL",
+ 3,
+ 1,
+ true
+ ],
+ [
+ "IDLE",
+ 2,
+ [
+ 0,
+ 1,
+ 3
+ ]
+ ],
+ [
+ "ADD",
+ 2,
+ 4,
+ 1
+ ],
+ [
+ "ADD",
+ 5,
+ 3,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 4,
+ 1,
+ false
+ ],
+ [
+ "ADD",
+ 2,
+ 4,
+ -1
+ ],
+ [
+ "ADD",
+ 5,
+ 3,
+ 1
+ ],
+ [
+ "LOCAL",
+ 5,
+ 2,
+ true
+ ],
+ [
+ "IDLE",
+ 3,
+ [
+ 0,
+ 1,
+ 3,
+ 5
+ ]
+ ],
+ [
+ "ADD",
+ 4,
+ 6,
+ 1
+ ],
+ [
+ "ADD",
+ 7,
+ 5,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 6,
+ 2,
+ false
+ ],
+ [
+ "ADD",
+ 4,
+ 6,
+ -1
+ ],
+ [
+ "ADD",
+ 7,
+ 5,
+ 1
+ ],
+ [
+ "LOCAL",
+ 7,
+ 3,
+ true
+ ],
+ [
+ "IDLE",
+ 4,
+ [
+ 0,
+ 1,
+ 3,
+ 5,
+ 7
+ ]
+ ],
+ [
+ "ADD",
+ 6,
+ 8,
+ 1
+ ],
+ [
+ "ADD",
+ 9,
+ 7,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 8,
+ 3,
+ false
+ ],
+ [
+ "ADD",
+ 6,
+ 8,
+ -1
+ ],
+ [
+ "ADD",
+ 9,
+ 7,
+ 1
+ ],
+ [
+ "LOCAL",
+ 9,
+ 4,
+ true
+ ],
+ [
+ "IDLE",
+ 5,
+ [
+ 0,
+ 1,
+ 3,
+ 5,
+ 7,
+ 9
+ ]
+ ],
+ [
+ "ADD",
+ 8,
+ 10,
+ 1
+ ],
+ [
+ "ADD",
+ 11,
+ 9,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 10,
+ 4,
+ false
+ ],
+ [
+ "ADD",
+ 8,
+ 10,
+ -1
+ ],
+ [
+ "ADD",
+ 11,
+ 9,
+ 1
+ ],
+ [
+ "LOCAL",
+ 11,
+ 5,
+ true
+ ],
+ [
+ "IDLE",
+ 6,
+ [
+ 0,
+ 1,
+ 3,
+ 5,
+ 7,
+ 9,
+ 11
+ ]
+ ],
+ [
+ "ADD",
+ 10,
+ 12,
+ 1
+ ],
+ [
+ "ADD",
+ 13,
+ 11,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 12,
+ 5,
+ false
+ ],
+ [
+ "ADD",
+ 10,
+ 12,
+ -1
+ ],
+ [
+ "ADD",
+ 13,
+ 11,
+ 1
+ ],
+ [
+ "LOCAL",
+ 13,
+ 6,
+ true
+ ],
+ [
+ "IDLE",
+ 7,
+ [
+ 0,
+ 1,
+ 3,
+ 5,
+ 7,
+ 9,
+ 11,
+ 13
+ ]
+ ],
+ [
+ "ADD",
+ 12,
+ 14,
+ 1
+ ],
+ [
+ "ADD",
+ 15,
+ 13,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 14,
+ 6,
+ false
+ ],
+ [
+ "ADD",
+ 12,
+ 14,
+ -1
+ ],
+ [
+ "ADD",
+ 15,
+ 13,
+ 1
+ ],
+ [
+ "LOCAL",
+ 15,
+ 7,
+ true
+ ],
+ [
+ "ADD",
+ 14,
+ 16,
+ 1
+ ],
+ [
+ "ADD",
+ 17,
+ 15,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 16,
+ 7,
+ false
+ ],
+ [
+ "ADD",
+ 14,
+ 16,
+ -1
+ ],
+ [
+ "ADD",
+ 17,
+ 15,
+ 1
+ ],
+ [
+ "LOCAL",
+ 17,
+ 8,
+ true
+ ],
+ [
+ "ADD",
+ 16,
+ 18,
+ 1
+ ],
+ [
+ "ADD",
+ 19,
+ 17,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 18,
+ 8,
+ false
+ ],
+ [
+ "ADD",
+ 16,
+ 18,
+ -1
+ ],
+ [
+ "ADD",
+ 19,
+ 17,
+ 1
+ ],
+ [
+ "LOCAL",
+ 19,
+ 9,
+ true
+ ],
+ [
+ "ADD",
+ 18,
+ 20,
+ 1
+ ],
+ [
+ "ADD",
+ 21,
+ 19,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 20,
+ 9,
+ false
+ ],
+ [
+ "ADD",
+ 18,
+ 20,
+ -1
+ ],
+ [
+ "ADD",
+ 21,
+ 19,
+ 1
+ ],
+ [
+ "LOCAL",
+ 21,
+ 10,
+ true
+ ],
+ [
+ "ADD",
+ 20,
+ 22,
+ 1
+ ],
+ [
+ "ADD",
+ 23,
+ 21,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 22,
+ 10,
+ false
+ ],
+ [
+ "ADD",
+ 20,
+ 22,
+ -1
+ ],
+ [
+ "ADD",
+ 23,
+ 21,
+ 1
+ ],
+ [
+ "LOCAL",
+ 23,
+ 11,
+ true
+ ],
+ [
+ "ADD",
+ 22,
+ 24,
+ 1
+ ],
+ [
+ "ADD",
+ 25,
+ 23,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 24,
+ 11,
+ false
+ ],
+ [
+ "ADD",
+ 22,
+ 24,
+ -1
+ ],
+ [
+ "ADD",
+ 25,
+ 23,
+ 1
+ ],
+ [
+ "LOCAL",
+ 25,
+ 12,
+ true
+ ],
+ [
+ "ADD",
+ 24,
+ 26,
+ 1
+ ],
+ [
+ "ADD",
+ 27,
+ 25,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 26,
+ 12,
+ false
+ ],
+ [
+ "ADD",
+ 24,
+ 26,
+ -1
+ ],
+ [
+ "ADD",
+ 27,
+ 25,
+ 1
+ ],
+ [
+ "LOCAL",
+ 27,
+ 13,
+ true
+ ],
+ [
+ "ADD",
+ 26,
+ 28,
+ 1
+ ],
+ [
+ "ADD",
+ 29,
+ 27,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 28,
+ 13,
+ false
+ ],
+ [
+ "ADD",
+ 26,
+ 28,
+ -1
+ ],
+ [
+ "ADD",
+ 29,
+ 27,
+ 1
+ ],
+ [
+ "LOCAL",
+ 29,
+ 14,
+ true
+ ],
+ [
+ "ADD",
+ 28,
+ 30,
+ 1
+ ],
+ [
+ "ADD",
+ 31,
+ 29,
+ -1
+ ],
+ [
+ "QUERY_SHEAR",
+ 30,
+ 14,
+ false
+ ],
+ [
+ "ADD",
+ 28,
+ 30,
+ -1
+ ],
+ [
+ "ADD",
+ 31,
+ 29,
+ 1
+ ],
+ [
+ "LOCAL",
+ 31,
+ 15,
+ true
+ ],
+ [
+ "LOCAL",
+ 32,
+ 15,
+ false
+ ],
+ [
+ "IDLE",
+ 7,
+ [
+ 17,
+ 19,
+ 21,
+ 23,
+ 25,
+ 27,
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 8,
+ [
+ 19,
+ 21,
+ 23,
+ 25,
+ 27,
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 9,
+ [
+ 21,
+ 23,
+ 25,
+ 27,
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 10,
+ [
+ 23,
+ 25,
+ 27,
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 11,
+ [
+ 25,
+ 27,
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 12,
+ [
+ 27,
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 13,
+ [
+ 29,
+ 31,
+ 32
+ ]
+ ],
+ [
+ "IDLE",
+ 14,
+ [
+ 31,
+ 32
+ ]
+ ],
+ [
+ "ADD",
+ 30,
+ 28,
+ 1
+ ],
+ [
+ "ADD",
+ 29,
+ 31,
+ -1
+ ],
+ [
+ "ADD",
+ 28,
+ 26,
+ 1
+ ],
+ [
+ "ADD",
+ 27,
+ 29,
+ -1
+ ],
+ [
+ "ADD",
+ 26,
+ 24,
+ 1
+ ],
+ [
+ "ADD",
+ 25,
+ 27,
+ -1
+ ],
+ [
+ "ADD",
+ 24,
+ 22,
+ 1
+ ],
+ [
+ "ADD",
+ 23,
+ 25,
+ -1
+ ],
+ [
+ "ADD",
+ 22,
+ 20,
+ 1
+ ],
+ [
+ "ADD",
+ 21,
+ 23,
+ -1
+ ],
+ [
+ "ADD",
+ 20,
+ 18,
+ 1
+ ],
+ [
+ "ADD",
+ 19,
+ 21,
+ -1
+ ],
+ [
+ "ADD",
+ 18,
+ 16,
+ 1
+ ],
+ [
+ "ADD",
+ 17,
+ 19,
+ -1
+ ],
+ [
+ "ADD",
+ 16,
+ 14,
+ 1
+ ],
+ [
+ "ADD",
+ 15,
+ 17,
+ -1
+ ],
+ [
+ "ADD",
+ 14,
+ 12,
+ 1
+ ],
+ [
+ "ADD",
+ 13,
+ 15,
+ -1
+ ],
+ [
+ "ADD",
+ 12,
+ 10,
+ 1
+ ],
+ [
+ "ADD",
+ 11,
+ 13,
+ -1
+ ],
+ [
+ "ADD",
+ 10,
+ 8,
+ 1
+ ],
+ [
+ "ADD",
+ 9,
+ 11,
+ -1
+ ],
+ [
+ "ADD",
+ 8,
+ 6,
+ 1
+ ],
+ [
+ "ADD",
+ 7,
+ 9,
+ -1
+ ],
+ [
+ "ADD",
+ 6,
+ 4,
+ 1
+ ],
+ [
+ "ADD",
+ 5,
+ 7,
+ -1
+ ],
+ [
+ "ADD",
+ 4,
+ 2,
+ 1
+ ],
+ [
+ "ADD",
+ 3,
+ 5,
+ -1
+ ],
+ [
+ "ADD",
+ 2,
+ 0,
+ 1
+ ],
+ [
+ "ADD",
+ 1,
+ 3,
+ -1
+ ],
+ [
+ "SIGNED_SWAP",
+ 0,
+ 1
+ ],
+ [
+ "SIGNED_SWAP",
+ 2,
+ 3
+ ],
+ [
+ "SIGNED_SWAP",
+ 4,
+ 5
+ ],
+ [
+ "SIGNED_SWAP",
+ 6,
+ 7
+ ],
+ [
+ "SIGNED_SWAP",
+ 8,
+ 9
+ ],
+ [
+ "SIGNED_SWAP",
+ 10,
+ 11
+ ],
+ [
+ "SIGNED_SWAP",
+ 12,
+ 13
+ ],
+ [
+ "SIGNED_SWAP",
+ 14,
+ 15
+ ],
+ [
+ "SIGNED_SWAP",
+ 16,
+ 17
+ ],
+ [
+ "SIGNED_SWAP",
+ 18,
+ 19
+ ],
+ [
+ "SIGNED_SWAP",
+ 20,
+ 21
+ ],
+ [
+ "SIGNED_SWAP",
+ 22,
+ 23
+ ],
+ [
+ "SIGNED_SWAP",
+ 24,
+ 25
+ ],
+ [
+ "SIGNED_SWAP",
+ 26,
+ 27
+ ],
+ [
+ "SIGNED_SWAP",
+ 28,
+ 29
+ ],
+ [
+ "SIGNED_SWAP",
+ 30,
+ 31
+ ]
+ ],
+ "prefix_pairs": 7
+}
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/README.md b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/README.md
new file mode 100644
index 0000000000..d0593a46e8
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/README.md
@@ -0,0 +1,280 @@
+# Conditional kappa 0.00302666 from eight joint helper relations
+
+This construction gives **conditional kappa = 151333/50000000 = 0.00302666**.
+It improves the one-relation [PR #5377](https://github.com/CrocSwap/integer-mult-bounds/pull/5377)
+value by **431/100000000 = 0.00000431**. The gain over the selected final
+[PR #4610](https://github.com/CrocSwap/integer-mult-bounds/pull/4610)
+value is **24421/5000000000 = 0.0000048842**.
+
+Eight independent helper relations replace all eight backward rank-eight
+centers with exact saved values. They also remove eight later rank-one jobs
+on zero fields. Each backward call gives up eight rank-nine productive helper
+targets. All 224 main inputs and the other 400 helper inputs stay independent.
+The forward word and p16 controller stay unchanged. This changes the complete
+paid profile and proves a strict moment gain.
+
+[WITNESS.json](WITNESS.json) lists the eight relations and source events.
+[WORD.json.gz](WORD.json.gz) contains the complete literal program.
+[RESULT.json](RESULT.json) gives the exact row identities and complete bill.
+[SOURCES.json](SOURCES.json) pins every consumed input by Git blob and SHA256.
+The package has no runtime dependency on the pending PR #5377 package.
+
+## Source and research boundary
+
+The branch starts at canonical main
+[1ec1119972c9aefe42525172d07b332fcff81cb4](https://github.com/CrocSwap/integer-mult-bounds/commit/1ec1119972c9aefe42525172d07b332fcff81cb4).
+This base selects the final PR4610 result with the independent
+[PR #5241](https://github.com/CrocSwap/integer-mult-bounds/pull/5241) audit.
+The [selected review](https://github.com/CrocSwap/integer-mult-bounds/blob/1ec1119972c9aefe42525172d07b332fcff81cb4/docs/research/pr-intake-evidence/pr4610/PROOF-REVIEW.md)
+records its exact scope and five retained framework assumptions.
+
+The frozen native source is Cao Yifan's
+[round-three word](https://github.com/intqwq/integer-mult-bounds/blob/20bb93cd990d2ff683e4d0fc56b87a42cd5d3296/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz)
+at final PR4610 commit `20bb93cd990d2ff683e4d0fc56b87a42cd5d3296`.
+Its decompressed SHA256 is
+`cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd`.
+The prior complete bill and crossing come from its
+[round-six arithmetic](https://github.com/intqwq/integer-mult-bounds/blob/20bb93cd990d2ff683e4d0fc56b87a42cd5d3296/research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json).
+All consumed source bytes occur in the recorded main base.
+
+The [canonical claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/5125#discussioncomment-19154290)
+covers only the eight named centers and their joint relation system.
+The separate [no-snapshot relation search](https://github.com/CrocSwap/integer-mult-bounds/discussions/5125#discussioncomment-19154267)
+has released its scope and explicitly excludes joint relations and center reuse.
+The original-input cache search in
+[Discussion #5355](https://github.com/CrocSwap/integer-mult-bounds/discussions/5355)
+is also released. The coded caller in
+[Discussion #4930](https://github.com/CrocSwap/integer-mult-bounds/discussions/4930)
+retains all original helper outputs. This package changes eight helper inputs
+in backward calls. It does not take those other research scopes.
+
+## General relation construction
+
+Consider an exact linear register program with independent helper inputs in
+one common input frame. Let r independent scalar relations have a reduced
+basis with dyadic coefficients and r helper pivots. Make these r fields owned.
+Clear them and prepare each pivot from the nonpivot inputs with scalar ADDs.
+Each relation is then zero for every remaining independent input. The r owned
+fields receive no productive output credit.
+
+Suppose that an earlier field and a later owned center output have the same
+exact frame, and their logical row difference is zero under these relations.
+Clear a new owned field, COPY the earlier value into it and retain it. At the
+center, clear the old owned center and COPY the saved value into that same
+output frame. Clear the snapshot after use. This implements the old output
+exactly without the center job. If another paid job has an identically zero
+input row, the physical identity also implements that job on the restricted
+domain. A frame annotation may change only after this exact zero check.
+
+Each replacement preserves the source state on that domain. Induction through
+the chronological word therefore preserves every retained output. Clear all
+owned pivots at return. The complete cost must remove their productive
+credits and count every new scalar operation and storage route. Independence
+of the relations is necessary: counting eight apparent formulas is not a
+proof of eight independent pivots or of eight distinct saved jobs.
+
+## Eight exact source identities
+
+Let h_r denote the unrestricted logical input of source helper Lr. Define:
+
+```text
+D1 = h230 - h324 + h326 + h328 - h333
+D2 = h225 - h384 - h388 + h390 + h391 + h392 - h397
+D3 = h225 - h227 + h229 - 2h231 + h232 - h234 - h235
+ - h236 - h237 + 2h238 + h239 - h384 - h388 + h390
+ + h391 + h392 - h397
+D4 = h227 + h229 - h232 + h234 + h235 - h236 + h237
+ - h239 - h324 + h326 + h328 - h333
+D5 = h241 - h243 + h245 - h247 - h252 - h253 + h254 + h255
+D6 = h225 - h241 + h243 + h245 - h247 - h252 + h253
+ + h254 - h255 - h324 + h326 + h328 - h333 - h384
+ - h388 + h390 + h391 + h392 - h397
+D7 = h257 - h259 + h261 - h263 - h268 - h269 + h270 + h271
+D8 = h288 - h294 - h296 - h297 + h300 + h303
+```
+
+Every helper in these relations starts in frame 0 and ends in frame 1, of
+rank nine. Exact row reduction gives the eight pivots
+**225, 227, 229, 230, 241, 245, 257, 288**. The reduced basis has no other pivot
+in any pivot row. Its nonzero coefficients are integers or half-integers.
+The emitted preparation thus uses only independent inputs and dyadic ADDs;
+it has no cyclic dependence and needs no recursive job. The full reduced
+basis is recorded in the word and result.
+
+The following indices are zero-based indices in the frozen backward source.
+A snapshot is taken immediately after its named event. The two last columns
+are identities in the unrestricted source, before any relation is imposed.
+
+| Relation | Snapshot event and role | Frame | Center event | Later zero event and role | Center minus snapshot | Later row |
+|---|---|---|---|---|---|---|
+| D1 | 11205, L92 | 254 | 11332 | 15584, L92 | D1/4 | -D1/4 |
+| D2 | 11218, L57 | 274 | 11358 | 17264, L57 | D2/4 | -D2/4 |
+| D3 | 11231, L81 | 619 | 11384 | 17256, L81 | D3/4 | -D3/4 |
+| D4 | 11244, L224 | 279 | 11410 | 17722, L224 | -D4/4 | D4/4 |
+| D5 | 11257, L11 | 621 | 11436 | 15876, L11 | D5/4 | -D5/4 |
+| D6 | 11270, L240 | 280 | 11462 | 17245, L240 | -D6/4 | D6/4 |
+| D7 | 11283, L9 | 624 | 11488 | 15870, L9 | D7/4 | -D7/4 |
+| D8 | 11306, L288 | 281 | 11514 | 17580, L288 | D8/4 | -D8/4 |
+
+The COPY coefficient is one in every case. All eight snapshots are live
+before the first center replacement. They use distinct owned fields C1 through
+C8. Each is read once and cleared after use. The source owned center C0 is
+cleared before each replacement. Each later zero job changes from the listed
+frame to frame 1 and has rank one. `zero_retag` is a physical no-op; the verifier
+requires its complete row to be zero and checks both exact frame identifiers.
+
+A separate source interpreter checks all sixteen identities on the unrestricted
+632 source inputs. The new interpreter then executes the emitted program on
+all **624 independent persistent columns and 17 arbitrary owned entry columns**.
+It checks every scalar frame, paid rank, native transition, retained endpoint,
+final frame and owned return. No independent input is silently set to zero.
+
+The identities are over rational coefficients and reduced free operator words.
+They hold for any invertible interpretation of the native generators. At
+positive tensor width f, replace each generator with its source tensor power
+and each inverse with the inverse tensor power. Keep each rational coefficient
+outside this substitution. Evaluation is a representation of the free group,
+so the identities still hold. In particular, no tensor power is distributed
+over a sum. The retained
+[free-word tensor audit](https://github.com/CrocSwap/integer-mult-bounds/blob/1ec1119972c9aefe42525172d07b332fcff81cb4/research/free-word-tensor-lift-audit/PROOF.md)
+records this termwise argument and credits Cinna Davis and ToikY.
+
+All 4,429 source frames, 72 native maps, adapters and retained paid operators
+are unchanged. The package authenticates and reuses the source
+[absolute-phase evidence](https://github.com/intqwq/integer-mult-bounds/blob/20bb93cd990d2ff683e4d0fc56b87a42cd5d3296/research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz).
+Same-frame COPY and identity on zero add no phase recipe. This package does
+not rerun the source Clifford lowering or amplitude checks. The new identities
+hold for the full source operators, including their absolute phases.
+
+## Complete bill and compiler
+
+Each backward call has the following complete local profiles:
+
+```text
+paid: {1:2193, 2:412, 3:510, 4:127, 5:40}
+helpers: {4:28, 7:7, 8:47, 9:318}
+```
+
+The controller has 16 backward calls, two unchanged forward calls and 15 thin
+queries. Every idle and main target remains paid or credited as in the source.
+Compared with PR4610, the complete difference is **minus 128 H1 and 128 H8 paid
+jobs, with minus 128 H9 productive targets**. Compared with PR5377 it removes
+224 further paid jobs and 112 further productive fields. The complete bill has
+**64,148 paid jobs and 10,800 productive fields**. The respective rank masses
+are 237,982 and 238,734, with unchanged surplus 752.
+
+For every real `0 < t < 1`, the complete target-minus-paid moment increases by
+
+```math
+128(1+8^t-9^t)>0.
+```
+
+Both `(1/9)^t > 1/9` and `(8/9)^t > 8/9`; summing and multiplying by `9^t`
+proves the strict inequality. This comparison charges the lost helper jobs.
+
+The backward scalar allowance is **158,744**, which is 576 above the source.
+Its maximum formal prefix L1 norm is **163**, below the source value 169, and
+its maximum denominator stays 64. The forward values remain 158,120, 457 and
+32. Eight new physical slots hold C1 through C8; the eight private helpers use
+existing slots. The local route allowance charges both routes for each of
+these sixteen new owned lifetimes. It is **4,834,000**. The local scalar-plus-route
+bill stays below 10^7. The complete raw nonrecursive bound remains
+**181,098,496 < 10^9**. These bounds include preparation, storage, COPY and CLEAR.
+The retained precision and tape prescriptions must use this expanded fixed
+template, not a former numerical template-size cap.
+
+Two rational interval engines verify the complete moment. Its unique crossing
+in `0 < kappa < 1` lies in **(0.00302667476807, 0.00302667476808)**. Exact interval
+bounds prove decrease on `[0,0.05]` and negativity on `[0.05,1]`. This is a ceiling
+for this fixed complete profile. It does not optimize all relation systems.
+The claimed kappa leaves more than **0.00000001476807** raw headroom.
+
+The tested saving is **0.00302667**. The paid/target ratio is below
+`0.999999995016963387587258118167`, with reserve `1e-9`. The two charged tail
+ratios are below 0.957 and 0.952, respectively, hence below 0.97. Tensor power
+1024, cutoff 20, floor 21, tail offset 1/5, complement factor 63/64 and logarithm
+power 1000 all pass. The finite compiler uses gap `1/700000000`, `j=44836`,
+`H=31385200000000` and `N=2^31385200000000`. The exact test
+`(H+1)^1000 < 2^44836` passes; the preceding grid integer fails. The uniform
+complex saving is `529667/175000000`. All **54 strict outer predicates and
+four functional predicates** pass with the retained ordinary BIT saving 0.0034.
+
+## Verification and limitations
+
+Use CPython 3.12 or 3.14 and the standard library. From the repository root:
+
+```sh
+python3 -B scripts/research_package.py --package research/kappa-joint-relations-20261023 --check-only
+python3 -B scripts/research_package.py --package research/kappa-joint-relations-20261023
+```
+
+The registered verifier runs normal and optimized modes. The direct commands
+also work in the official Git-free export:
+
+```sh
+python3 -B research/kappa-joint-relations-20261023/verify.py
+python3 -O -B research/kappa-joint-relations-20261023/verify.py
+```
+
+Both print `PASS_CONDITIONAL_KAPPA_00302666_EIGHT_JOINT_RELATIONS`.
+The verifier reconstructs and compares the literal published word and result.
+`--write` is an authoring mode that writes only this package after all checks
+pass. Regeneration compares decompressed payloads, not gzip container bytes.
+
+Fresh checks cover both original and changed words, all retained and owned
+entry columns, sixteen unrestricted source identities, exact relation rank,
+phase source bindings, the p16 Laurent controller and both boundary programs,
+two complete invoice counts, two interval engines, the fixed profile ceiling,
+completion, compiler and every outer predicate. Seven native controls reject
+a wrong preparation sign, omitted input clear, wrong snapshot, wrong zero
+frame, wrong paid rank, wrong COPY gauge and omitted output clear. Five
+cost controls reject unearned helper credit and four invalid outer parameters.
+
+Normal and optimized registered checks passed on CPython 3.12.14. The direct
+author replay also passed on CPython 3.14. Metadata and source pins passed.
+The publication handoff records committed-byte and Git-free export checks.
+The optional full-history preflight is not claimed in this shallow checkout.
+
+These are author checks. The source phase lowering, BIT native construction,
+physical tape execution, numerical precision execution, analytic decomposition,
+fine-prime avoidance and exact integer recovery are inherited. They are not
+rerun here. No expanded compiled word, Lean proof, Docker run or independent
+human acceptance is claimed. The complete result retains the selected five
+framework assumptions: all-column native realization, owned erasure, uniform
+compiler closure, precision/tape and analytic recovery. No selected record is
+changed. This is a conditional mathematical improvement, not a timing result.
+
+## Credit
+
+Ali Romman, with substantial OpenAI Codex assistance. Apache-2.0.
+The new code and proof generalize our
+[frozen one-relation package](https://github.com/aliromman/integer-mult-bounds/blob/c448d13c71908647f968b06cddb795ce7d288139/research/kappa-owned-relation-20261023/README.md)
+from PR5377. That package supplies D1, its COPY/zero argument and the original
+complete-cost verifier. The new work is the joint rank-eight system, seven
+further centers, eight simultaneous snapshots and the new complete bound.
+
+Cao Yifan's [PR #4610](https://github.com/CrocSwap/integer-mult-bounds/pull/4610)
+supplies the exact word, phase evidence and compiler lineage. Chris R's
+[PR #5241](https://github.com/CrocSwap/integer-mult-bounds/pull/5241) supplies the
+independent admission evidence now used by main; that audit does not cover
+this changed helper inventory. Cinna Davis's
+[PR #4470](https://github.com/CrocSwap/integer-mult-bounds/pull/4470) supplies the
+controller and productive-helper lineage. zxv's
+[PR #5283](https://github.com/CrocSwap/integer-mult-bounds/pull/5283) supplies the
+related cache contract and handoff to actual row/lifetime matches.
+
+The retained [pricing source](https://github.com/CrocSwap/integer-mult-bounds/blob/1ec1119972c9aefe42525172d07b332fcff81cb4/research/kappa-interface-round2-20261022/price_profile.py)
+and [native source](https://github.com/CrocSwap/integer-mult-bounds/blob/1ec1119972c9aefe42525172d07b332fcff81cb4/research/kappa-rebuild/complex/native_extensions.py)
+credit Dugongue's transported frames, zxv's native/compiler work, Jacob Alan
+Sussman's mixed-target recursion and the earlier contributors. Their notices
+and the original source bytes remain unchanged.
+
+## Open next questions
+
+An independent reviewer should check the eight pivot preparations and sixteen
+unrestricted identities, then the COPY/zero realization and complete bill.
+Independent physical and all-size acceptance remains necessary. A further
+construction must change another paid job or relation system: all eight
+backward centers are already removed here. Check live claims and price every
+lost target before that search. [TASK.json](TASK.json) records both questions,
+first checks and blockers. No optimum over helper relations is claimed.
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/RESULT.json b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/RESULT.json
new file mode 100644
index 0000000000..b6c9cd0da1
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/RESULT.json
@@ -0,0 +1,961 @@
+{
+ "arithmetic": {
+ "PR5377_raw_root_upper": "75559684087/25000000000000",
+ "compiler": {
+ "H": 31385200000000,
+ "N": "2^31385200000000",
+ "eta": {
+ "lower": "0.000000199495867924466542600392",
+ "upper": "0.000000199495867924466542600393"
+ },
+ "gap": "1/700000000",
+ "integer_test_exponent": 44836,
+ "logarithm_power": 1000,
+ "theta": "63/64",
+ "uniform_saving": "529667/175000000",
+ "word_materialized": false
+ },
+ "fixed_profile_ceiling": {
+ "decreasing_through": "1/20",
+ "derivative_upper": {
+ "lower": "-195473.450610684184815935477074865515",
+ "upper": "-195473.450610684184815935477074865514"
+ },
+ "remaining_interval_moment_upper": {
+ "lower": "-6820.155255095433991980526890420873",
+ "upper": "-6820.155255095433991980526890420872"
+ }
+ },
+ "full_backward": 16,
+ "full_forward": 2,
+ "gain_over_PR4610": "24421/5000000000",
+ "gain_over_PR5377": "431/100000000",
+ "kappa": "151333/50000000",
+ "kappa_decimal": ".00302666",
+ "margin_at_previous_kappa": {
+ "lower": "1.209169472215494738857340795394",
+ "upper": "1.209169472215494738857340795395"
+ },
+ "margin_at_previous_root_upper": {
+ "lower": "1.209152002019805295008574084544",
+ "upper": "1.209152002019805295008574084545"
+ },
+ "negative_controls": {
+ "closed_epsilon": [
+ "epsilon_below_one",
+ "global_gamma_power_slack",
+ "actual_logarithmic_gamma_guard",
+ "source_axis_superpolynomial",
+ "gaussian_above_main",
+ "new_semantic_guard_with_C1_one"
+ ],
+ "closed_uniform": [
+ "new_complex_uniform_saving_above_b"
+ ],
+ "old_BIT": [
+ "actual_bit_above_effective"
+ ],
+ "unearned_helper_credit": "Rejected by the independent complete census",
+ "unfunded_endpoint": [
+ "main_transform_above_kappa",
+ "global_coordinate_router_above_kappa",
+ "fused_gaussian_above_kappa",
+ "group_bit_router_above_kappa",
+ "boundary_algebraic_matrix_above_kappa"
+ ]
+ },
+ "nonrecursive": {
+ "additional_private_slots": 8,
+ "local_routes": 4834000,
+ "local_scalar": 158744,
+ "owned_slots_backward": 17,
+ "raw_budget": 1000000000,
+ "raw_scalar_upper": 181098496
+ },
+ "ordinary_BIT": {
+ "admitted": "17/5000",
+ "after_cover": "69/20000",
+ "atom": "1/250",
+ "before_cover": "3459/1000000",
+ "ordinary_saving": "8590884599/2500000000000",
+ "prime_rule": "odd q > 2^26*N^5 avoiding all fixed denominators and rank witnesses"
+ },
+ "outer": {
+ "functional_checks": {
+ "actual_new_BIT_stock_sublinear": "174299999253/175000000000",
+ "fixed_halo_explicit_metadata_branch": "13475000001/175000000",
+ "new_BIT_row_stock_sublinear_in_active_group": "697899997009/700000000000",
+ "new_semantic_group_guard": "3/700000000"
+ },
+ "margins": {
+ "boundary_algebraic_matrix": "296613239576267/98000000000000000",
+ "fused_gaussian": "296613238728801/98000000000000000",
+ "global_coordinate_router": "1059333/350000000",
+ "group_bit_router": "741533446822001/245000000000000000",
+ "group_scans": "349999999/350000000",
+ "main_transform": "296613099576267/98000000000000000",
+ "microbox_face_corrections": "13475000001/175000000",
+ "polynomial_products": "699999999/700000000",
+ "sparse_union_movement": "40109113239576267/98000000000000000"
+ },
+ "parameters": {
+ "a": "1059333/350000000",
+ "b": "2118667/700000000",
+ "beta": "699999997/700000000",
+ "bit_saving": "17/5000",
+ "cap_xi": "89109113099576267/98000000000000000",
+ "complex_uniform_saving": "529667/175000000",
+ "d": "1/700000000",
+ "epsilon": "699999999/700000000",
+ "kappa": "151333/50000000",
+ "lambda_": "199394667/200000000",
+ "lambda_prime": "139576267/140000000",
+ "layout": "1/700000000",
+ "q": "423733/140000000",
+ "r0": "1/7000000000",
+ "stop": "1/700000000",
+ "tested_saving": "302667/100000000"
+ },
+ "strict_checks": {
+ "actual_bit_above_effective": "130667/350000000",
+ "actual_logarithmic_gamma_guard": "1/700000000",
+ "actual_logarithmic_group_guard": "8890887110423733/49000000000000000",
+ "alpha_logarithm_absorption": "1/7000000000",
+ "boundary_algebraic_matrix_above_kappa": "559576267/98000000000000000",
+ "cap_above_band": "40109113099576267/98000000000000000",
+ "cap_below_cell": "8890886760423733/98000000000000000",
+ "cap_below_phase_cell_power": "106890886900423733/98000000000000000",
+ "complex_above_effective": "1/700000000",
+ "complex_below_one_over_32": "19756333/700000000",
+ "complex_endpoint": "1/350000000",
+ "epsilon_below_one": "1/700000000",
+ "epsilon_positive": "699999999/700000000",
+ "fine_prime_halo_umbrella": "7/2",
+ "fused_gaussian_above_kappa": "558728801/98000000000000000",
+ "gaussian_above_main": "69576267/49000000000000000",
+ "global_coordinate_router_above_kappa": "1/175000000",
+ "global_gamma_power_slack": "9/7000000000",
+ "group_below_dimension": "1/350000000",
+ "group_bit_router_above_kappa": "1746822001/245000000000000000",
+ "group_gauge_power_slack": "8890887103423733/49000000000000000",
+ "group_key_fits_record": "1/350000000",
+ "group_positive": "699999997/700000000",
+ "group_scans_above_kappa": "87235167/87500000",
+ "halo_covers_generic_inverse_radius": "5",
+ "improvement_over_user_baseline": "647844790400418148631/500000000000000000000000",
+ "lambda_above_internal": "1/1400000000",
+ "lambda_above_sigma": "3/1400000000",
+ "lambda_above_tau": "1/1400000000",
+ "lambda_prime_above_lambda": "1/1400000000",
+ "lambda_prime_above_leaf": "1397881333/490000000000000000",
+ "leaf_saving_above_effective": "697881333/490000000000000000",
+ "main_transform_above_kappa": "419576267/98000000000000000",
+ "membership_arithmetic_fits_record": "1/700000000",
+ "microbox_face_corrections_above_kappa": "26948940671/350000000",
+ "microbox_halo_volume": "55300000003/700000000",
+ "new_complex_uniform_saving_above_b": "1/700000000",
+ "new_semantic_guard_with_C1_one": "1/700000000",
+ "polynomial_products_above_kappa": "697881337/700000000",
+ "positive_layout_slack": "1/700000000",
+ "q_below_effective": "1/700000000",
+ "q_below_internal": "1/700000000",
+ "q_below_leaf": "1397881333/490000000000000000",
+ "q_positive": "423733/140000000",
+ "short_record_fallback": "697881333/700000000",
+ "source_axis_superpolynomial": "1/700000000",
+ "sparse_union_movement_above_kappa": "39812500559576267/98000000000000000",
+ "stop_below_one": "699999999/700000000",
+ "stop_positive": "1/700000000",
+ "strassen_integer_power_gap": "1951441519231",
+ "support_router_span": "3/700000000",
+ "theta_positive_polynomial_power": "2",
+ "union_header_fits_record": "3/700000000",
+ "union_tag_work_per_visit_fits_record": "3/700000000"
+ }
+ },
+ "paid": {
+ "1": 41170,
+ "16": 448,
+ "2": 7416,
+ "24": 448,
+ "3": 9180,
+ "32": 448,
+ "4": 2286,
+ "40": 448,
+ "48": 448,
+ "5": 720,
+ "56": 448,
+ "64": 448,
+ "72": 224,
+ "8": 16
+ },
+ "paid_calls": 64148,
+ "productive_fields": 10800,
+ "query_shears": 15,
+ "rank_mass_surplus": 752,
+ "raw_headroom": [
+ "1476807/100000000000000",
+ "184601/12500000000000"
+ ],
+ "raw_root_interval": [
+ "302667476807/100000000000000",
+ "37833434601/12500000000000"
+ ],
+ "strictification": {
+ "alpha": {
+ "lower": "0.999999995016963387587258118166",
+ "upper": "0.999999995016963387587258118167"
+ },
+ "cutoff": 20,
+ "delta": {
+ "lower": "0.951652473261883819699264316643",
+ "upper": "0.951652473261883819699264316644"
+ },
+ "floor": 21,
+ "gamma": {
+ "lower": "0.956968564096059991841792406781",
+ "upper": "0.956968564096059991841792406782"
+ },
+ "normalized_paid_upper": "2097152001953127/2097154147483648",
+ "power": 1024,
+ "reserve": "1/1000000000",
+ "tail_offset": "1/5",
+ "tested": "302667/100000000"
+ },
+ "targets": {
+ "145": 224,
+ "17": 448,
+ "25": 448,
+ "33": 448,
+ "4": 504,
+ "41": 448,
+ "49": 448,
+ "57": 448,
+ "65": 448,
+ "7": 126,
+ "73": 224,
+ "8": 846,
+ "9": 5740
+ }
+ },
+ "candidate_native": {
+ "backward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 318
+ },
+ "independent_owned_entry_columns": 17,
+ "independent_persistent_columns": 624,
+ "max_denominator": 64,
+ "max_formal_prefix_l1": "163",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2193,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40
+ },
+ "real_scalar_allowance": 158744,
+ "zero_identities": 8
+ },
+ "forward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 326
+ },
+ "independent_owned_entry_columns": 1,
+ "independent_persistent_columns": 632,
+ "max_denominator": 32,
+ "max_formal_prefix_l1": "457",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2201,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40,
+ "8": 8
+ },
+ "real_scalar_allowance": 158120,
+ "zero_identities": 0
+ }
+ },
+ "independent_source_identities": {
+ "checked": [
+ [
+ "center",
+ 11332
+ ],
+ [
+ "center",
+ 11358
+ ],
+ [
+ "center",
+ 11384
+ ],
+ [
+ "center",
+ 11410
+ ],
+ [
+ "center",
+ 11436
+ ],
+ [
+ "center",
+ 11462
+ ],
+ [
+ "center",
+ 11488
+ ],
+ [
+ "center",
+ 11514
+ ],
+ [
+ "zero",
+ 15584
+ ],
+ [
+ "zero",
+ 15870
+ ],
+ [
+ "zero",
+ 15876
+ ],
+ [
+ "zero",
+ 17245
+ ],
+ [
+ "zero",
+ 17256
+ ],
+ [
+ "zero",
+ 17264
+ ],
+ [
+ "zero",
+ 17580
+ ],
+ [
+ "zero",
+ 17722
+ ]
+ ],
+ "owned_pivots": [
+ 225,
+ 227,
+ 229,
+ 230,
+ 241,
+ 245,
+ 257,
+ 288
+ ],
+ "reduced_basis": {
+ "225": {
+ "225": "1",
+ "384": "-1",
+ "388": "-1",
+ "390": "1",
+ "391": "1",
+ "392": "1",
+ "397": "-1"
+ },
+ "227": {
+ "227": "1",
+ "231": "1",
+ "232": "-1",
+ "234": "1",
+ "235": "1",
+ "237": "1",
+ "238": "-1",
+ "239": "-1",
+ "324": "-1/2",
+ "326": "1/2",
+ "328": "1/2",
+ "333": "-1/2"
+ },
+ "229": {
+ "229": "1",
+ "231": "-1",
+ "236": "-1",
+ "238": "1",
+ "324": "-1/2",
+ "326": "1/2",
+ "328": "1/2",
+ "333": "-1/2"
+ },
+ "230": {
+ "230": "1",
+ "324": "-1",
+ "326": "1",
+ "328": "1",
+ "333": "-1"
+ },
+ "241": {
+ "241": "1",
+ "243": "-1",
+ "253": "-1",
+ "255": "1",
+ "324": "1/2",
+ "326": "-1/2",
+ "328": "-1/2",
+ "333": "1/2"
+ },
+ "245": {
+ "245": "1",
+ "247": "-1",
+ "252": "-1",
+ "254": "1",
+ "324": "-1/2",
+ "326": "1/2",
+ "328": "1/2",
+ "333": "-1/2"
+ },
+ "257": {
+ "257": "1",
+ "259": "-1",
+ "261": "1",
+ "263": "-1",
+ "268": "-1",
+ "269": "-1",
+ "270": "1",
+ "271": "1"
+ },
+ "288": {
+ "288": "1",
+ "294": "-1",
+ "296": "-1",
+ "297": "-1",
+ "300": "1",
+ "303": "1"
+ }
+ },
+ "relation_rank": 8,
+ "snapshot_terms_before_substitution": {
+ "11205": 61,
+ "11218": 63,
+ "11231": 73,
+ "11244": 68,
+ "11257": 64,
+ "11270": 75,
+ "11283": 64,
+ "11306": 62
+ },
+ "source_event_indices_are_zero_based": true,
+ "witnesses": [
+ {
+ "cached_event": 11205,
+ "cached_role": 92,
+ "copy_factor": "1",
+ "difference_factor": "1/4",
+ "event": 11332,
+ "frame": 254,
+ "relation": [
+ [
+ 230,
+ "1"
+ ],
+ [
+ 324,
+ "-1"
+ ],
+ [
+ 326,
+ "1"
+ ],
+ [
+ 328,
+ "1"
+ ],
+ [
+ 333,
+ "-1"
+ ]
+ ],
+ "zero_event": 15584,
+ "zero_factor": "-1/4",
+ "zero_role": 92
+ },
+ {
+ "cached_event": 11218,
+ "cached_role": 57,
+ "copy_factor": "1",
+ "difference_factor": "1/4",
+ "event": 11358,
+ "frame": 274,
+ "relation": [
+ [
+ 225,
+ "1"
+ ],
+ [
+ 384,
+ "-1"
+ ],
+ [
+ 388,
+ "-1"
+ ],
+ [
+ 390,
+ "1"
+ ],
+ [
+ 391,
+ "1"
+ ],
+ [
+ 392,
+ "1"
+ ],
+ [
+ 397,
+ "-1"
+ ]
+ ],
+ "zero_event": 17264,
+ "zero_factor": "-1/4",
+ "zero_role": 57
+ },
+ {
+ "cached_event": 11231,
+ "cached_role": 81,
+ "copy_factor": "1",
+ "difference_factor": "1/4",
+ "event": 11384,
+ "frame": 619,
+ "relation": [
+ [
+ 225,
+ "1"
+ ],
+ [
+ 227,
+ "-1"
+ ],
+ [
+ 229,
+ "1"
+ ],
+ [
+ 231,
+ "-2"
+ ],
+ [
+ 232,
+ "1"
+ ],
+ [
+ 234,
+ "-1"
+ ],
+ [
+ 235,
+ "-1"
+ ],
+ [
+ 236,
+ "-1"
+ ],
+ [
+ 237,
+ "-1"
+ ],
+ [
+ 238,
+ "2"
+ ],
+ [
+ 239,
+ "1"
+ ],
+ [
+ 384,
+ "-1"
+ ],
+ [
+ 388,
+ "-1"
+ ],
+ [
+ 390,
+ "1"
+ ],
+ [
+ 391,
+ "1"
+ ],
+ [
+ 392,
+ "1"
+ ],
+ [
+ 397,
+ "-1"
+ ]
+ ],
+ "zero_event": 17256,
+ "zero_factor": "-1/4",
+ "zero_role": 81
+ },
+ {
+ "cached_event": 11244,
+ "cached_role": 224,
+ "copy_factor": "1",
+ "difference_factor": "-1/4",
+ "event": 11410,
+ "frame": 279,
+ "relation": [
+ [
+ 227,
+ "1"
+ ],
+ [
+ 229,
+ "1"
+ ],
+ [
+ 232,
+ "-1"
+ ],
+ [
+ 234,
+ "1"
+ ],
+ [
+ 235,
+ "1"
+ ],
+ [
+ 236,
+ "-1"
+ ],
+ [
+ 237,
+ "1"
+ ],
+ [
+ 239,
+ "-1"
+ ],
+ [
+ 324,
+ "-1"
+ ],
+ [
+ 326,
+ "1"
+ ],
+ [
+ 328,
+ "1"
+ ],
+ [
+ 333,
+ "-1"
+ ]
+ ],
+ "zero_event": 17722,
+ "zero_factor": "1/4",
+ "zero_role": 224
+ },
+ {
+ "cached_event": 11257,
+ "cached_role": 11,
+ "copy_factor": "1",
+ "difference_factor": "1/4",
+ "event": 11436,
+ "frame": 621,
+ "relation": [
+ [
+ 241,
+ "1"
+ ],
+ [
+ 243,
+ "-1"
+ ],
+ [
+ 245,
+ "1"
+ ],
+ [
+ 247,
+ "-1"
+ ],
+ [
+ 252,
+ "-1"
+ ],
+ [
+ 253,
+ "-1"
+ ],
+ [
+ 254,
+ "1"
+ ],
+ [
+ 255,
+ "1"
+ ]
+ ],
+ "zero_event": 15876,
+ "zero_factor": "-1/4",
+ "zero_role": 11
+ },
+ {
+ "cached_event": 11270,
+ "cached_role": 240,
+ "copy_factor": "1",
+ "difference_factor": "-1/4",
+ "event": 11462,
+ "frame": 280,
+ "relation": [
+ [
+ 225,
+ "1"
+ ],
+ [
+ 241,
+ "-1"
+ ],
+ [
+ 243,
+ "1"
+ ],
+ [
+ 245,
+ "1"
+ ],
+ [
+ 247,
+ "-1"
+ ],
+ [
+ 252,
+ "-1"
+ ],
+ [
+ 253,
+ "1"
+ ],
+ [
+ 254,
+ "1"
+ ],
+ [
+ 255,
+ "-1"
+ ],
+ [
+ 324,
+ "-1"
+ ],
+ [
+ 326,
+ "1"
+ ],
+ [
+ 328,
+ "1"
+ ],
+ [
+ 333,
+ "-1"
+ ],
+ [
+ 384,
+ "-1"
+ ],
+ [
+ 388,
+ "-1"
+ ],
+ [
+ 390,
+ "1"
+ ],
+ [
+ 391,
+ "1"
+ ],
+ [
+ 392,
+ "1"
+ ],
+ [
+ 397,
+ "-1"
+ ]
+ ],
+ "zero_event": 17245,
+ "zero_factor": "1/4",
+ "zero_role": 240
+ },
+ {
+ "cached_event": 11283,
+ "cached_role": 9,
+ "copy_factor": "1",
+ "difference_factor": "1/4",
+ "event": 11488,
+ "frame": 624,
+ "relation": [
+ [
+ 257,
+ "1"
+ ],
+ [
+ 259,
+ "-1"
+ ],
+ [
+ 261,
+ "1"
+ ],
+ [
+ 263,
+ "-1"
+ ],
+ [
+ 268,
+ "-1"
+ ],
+ [
+ 269,
+ "-1"
+ ],
+ [
+ 270,
+ "1"
+ ],
+ [
+ 271,
+ "1"
+ ]
+ ],
+ "zero_event": 15870,
+ "zero_factor": "-1/4",
+ "zero_role": 9
+ },
+ {
+ "cached_event": 11306,
+ "cached_role": 288,
+ "copy_factor": "1",
+ "difference_factor": "1/4",
+ "event": 11514,
+ "frame": 281,
+ "relation": [
+ [
+ 288,
+ "1"
+ ],
+ [
+ 294,
+ "-1"
+ ],
+ [
+ 296,
+ "-1"
+ ],
+ [
+ 297,
+ "-1"
+ ],
+ [
+ 300,
+ "1"
+ ],
+ [
+ 303,
+ "1"
+ ]
+ ],
+ "zero_event": 17580,
+ "zero_factor": "-1/4",
+ "zero_role": 288
+ }
+ ]
+ },
+ "native_negative_controls": {
+ "missing_owned_input_clear": "Every independent main/helper endpoint: 0",
+ "uncleared_owned_output": "Every owned entry column is erased at return",
+ "under_or_overstated_paid_rank": "Exact paid rank and frame",
+ "wrong_copy_gauge": "Exact scalar destination frame",
+ "wrong_relation_sign": "Every independent main/helper endpoint: 0",
+ "wrong_snapshot_source": "Zero identity requires an identically zero full row",
+ "wrong_zero_input_frame": "Declared zero identity"
+ },
+ "phase_inheritance": {
+ "absolute_phase_receipt_reused": "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "all_retained_paid_events_and_warps_from_source": true,
+ "new_gaussian_operators": 0,
+ "new_native_maps": 0,
+ "new_operations": "Same-frame COPY, owned CLEAR/ADD, and physical identity on a proved zero row.",
+ "source_amplitudes_and_phase_lowering_freshly_replayed": false
+ },
+ "scope": "Exact finite word, full all-column endpoints, ownership, p16 bill and compiler arithmetic. Retains source native phase, allowed owned erasure, mixed-target all-size, analytic, precision, tape, prime and exact-recovery contracts. No selected-frontier update.",
+ "source_native": {
+ "backward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 326
+ },
+ "independent_owned_entry_columns": 1,
+ "independent_persistent_columns": 632,
+ "max_denominator": 64,
+ "max_formal_prefix_l1": "169",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2201,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40,
+ "8": 8
+ },
+ "real_scalar_allowance": 158168,
+ "zero_identities": 0
+ },
+ "forward": {
+ "helpers": {
+ "4": 28,
+ "7": 7,
+ "8": 47,
+ "9": 326
+ },
+ "independent_owned_entry_columns": 1,
+ "independent_persistent_columns": 632,
+ "max_denominator": 32,
+ "max_formal_prefix_l1": "457",
+ "owned_outputs_zero": true,
+ "paid": {
+ "1": 2201,
+ "2": 412,
+ "3": 510,
+ "4": 127,
+ "5": 40,
+ "8": 8
+ },
+ "real_scalar_allowance": 158120,
+ "zero_identities": 0
+ }
+ },
+ "source_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd",
+ "status": "PASS_CONDITIONAL_KAPPA_00302666_EIGHT_JOINT_RELATIONS",
+ "word_payload_sha256": "2aee5e997df99726fc763e510d9cb69fbe4f86114dc8d2cd33ad26c6c462a21d"
+}
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/SOURCES.json b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/SOURCES.json
new file mode 100644
index 0000000000..71c57c8a90
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/SOURCES.json
@@ -0,0 +1,90 @@
+{
+ "schema_version": 1,
+ "base_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "files": [
+ {
+ "path": "certificates/selected-result.json",
+ "usage": "provenance",
+ "git_blob": "b288ae44032fd84dd5564243422836cbcd29835e",
+ "sha256": "f9ed52bb642cd1e1486cf2743557ac5fa23cf1514a3277d786a644e39a565038"
+ },
+ {
+ "path": "docs/research/agent-task-catalog.json",
+ "usage": "provenance",
+ "git_blob": "f126dd2e2dad2b669e75d1d0d0bd05c600725602",
+ "sha256": "f7a48bfa2659b88378282a8eee7d9fe52cdf505594124c4d1686b58510fffd72"
+ },
+ {
+ "path": "research/free-word-tensor-lift-audit/PROOF.md",
+ "usage": "provenance",
+ "git_blob": "69c337a7704ce589798269ab4b8606189c070c4e",
+ "sha256": "cc8ad3698a673fb225419a3636a39aa99a66c7a0676f12e329b1e76564fa1459"
+ },
+ {
+ "path": "research/higher-moment-strictification/verify.py",
+ "usage": "input",
+ "git_blob": "4b24a5096154736ce060474eb8c72dc64c303699",
+ "sha256": "0ce7e7137422d5ffeda22085c81fa88471bbe963100fdad62e659f1e3bf89326"
+ },
+ {
+ "path": "research/joint-helper-lattice/CONTROLLER.json",
+ "usage": "input",
+ "git_blob": "49a2f0675819f9deeea27ed77be2c2b6ff2e87e5",
+ "sha256": "1f5d6aa267e4e66048818714b5d3b5eae17a58abe91d15deeaa34574f7391a5f"
+ },
+ {
+ "path": "research/kappa-causal-continuation/buffer-borrowing/verify_buffers.py",
+ "usage": "input",
+ "git_blob": "5a55034ec9e6185d981e16c28e1e2e455069e2cb",
+ "sha256": "106b4d5e052427230df452f0c901d5390a0583782960b80a8af94d9a984022c7"
+ },
+ {
+ "path": "research/kappa-interface-round2-20261022/price_profile.py",
+ "usage": "provenance",
+ "git_blob": "1d93e43d1cb888d128c2faa2be83a96d85b84295",
+ "sha256": "adde619968d3ac37147d239e25145b28150650e9ce0f76035f680f22589adcbb"
+ },
+ {
+ "path": "research/kappa-rebuild/architecture/mixed_target_probe.py",
+ "usage": "input",
+ "git_blob": "4fc05ab08138218ba9f09e5c89b649afae7c914e",
+ "sha256": "011c3c9d0cf81103dc84d709a0e36793eb7c5ae3f23c85eac27650ef13afa04a"
+ },
+ {
+ "path": "research/kappa-rebuild/complex/native_extensions.py",
+ "usage": "provenance",
+ "git_blob": "7f84894efc309546a903d314c7ac1473e7f594a8",
+ "sha256": "50ad007d9c386393657e86c99a96ae0a63a8fbc52872579b185002cc626e88e3"
+ },
+ {
+ "path": "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "usage": "input",
+ "git_blob": "46d929df83817b85a5387bcdb9745e0627d6366e",
+ "sha256": "7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05"
+ },
+ {
+ "path": "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "usage": "input",
+ "git_blob": "ac77b78547d6dbf2e6bd102e1047c5b16c1bca88",
+ "sha256": "6eae66ed3cfa8a1533e89b9660a57276908e6646640a12f8b1e3489f4ea1354b"
+ },
+ {
+ "path": "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "usage": "input",
+ "git_blob": "0fdb65f946d557c13d8e2781b9151e2a8ddee5c3",
+ "sha256": "b4f720a7ccbb5b46e472eaf85dc8739a40598986f19b37d26c4f9ecfbd31f0de"
+ },
+ {
+ "path": "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "usage": "input",
+ "git_blob": "340e1f0ffb8a1a9c38fbbd9119580b6d23e01b59",
+ "sha256": "d097e55f06c3f244f2074ffd7c1a0a5f3c4b4b6a6accf9619d1dde5c0ae85e15"
+ },
+ {
+ "path": "research/query-thinned-controllers/RESULT.json",
+ "usage": "input",
+ "git_blob": "e0695152c98d727edfd0d2034b58a1c7e8682c0c",
+ "sha256": "6ebfc8c0f09166f4834e9d7427410cb31aefff2cd4d4ce588c8e52c9c70e9a0f"
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/TASK.json b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/TASK.json
new file mode 100644
index 0000000000..5b57a9e823
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/TASK.json
@@ -0,0 +1,80 @@
+{
+ "schema_version": 1,
+ "task_id": "complex-new-helper-inventory",
+ "priority_revision": 7,
+ "base_commit": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "original_card": {
+ "id": "complex-new-helper-inventory",
+ "question": "Can a new local cost interface change the deficit-to-recursive-cost ratio beyond current packing?",
+ "starting_points": [
+ "docs/research/research-family-status.md",
+ "research/complex-local-word-ceiling/README.md",
+ "research/heterogeneous-owner-assembly/README.md",
+ "certificates/selected-result.json",
+ "research/selected-k8-unrestricted-ends/README.md"
+ ],
+ "methods": [
+ "Propose a changed helper inventory and derive an optimistic exact moment.",
+ "Design a small completed instance and independently verify its endpoint and rank bill."
+ ],
+ "acceptance_gate": "A new physically realizable contract outside the frozen catalogue whose per-call profile, screened with ceiling.ceiling(), beats the selected word's packing ceiling; a lower cap does not establish identical circuitry or order attainable optima, and is insufficient to pass the stronger-budget target under this model. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.",
+ "first_step": {
+ "command": [
+ "python3",
+ "-B",
+ "research/complex-local-word-ceiling/verify.py"
+ ],
+ "expected": "PASS_COMPLEX_LOCAL_WORD_CEILING",
+ "inspect": "Read the selected word's per-call local profile, its packing ceiling and the lever table; run levers.py for the ideal budget of the lever you target.",
+ "scope": "Positive control and planning budget only; this is not a new construction or full cold replay."
+ },
+ "first_experiment": "Before any synthesis, write the candidate per-call local profile (and centre charge / unpaid coordinates if changed) and screen it with ceiling.ceiling(); reject it if even the ideal ceiling does not beat the selected word's by your stated margin.",
+ "bottleneck_link": "Packing of the selected word is capped at +0.87% (ceiling model); only a lower local excess spend or a changed coverage law raises the cap.",
+ "allowed_variations": [
+ "Narrow to one changed boundary or helper type with explicit counts.",
+ "If the coverage law, template or guard changes, derive an applicable fully charged replacement bound instead of applying the incumbent ceiling outside its scope."
+ ],
+ "scope_change_triggers": [
+ "Mixing only providers already inside the pinned catalogue.",
+ "Only changing helper terminal subspaces and monotone frames within the fixed scalar word, entrances and cleanup contract already covered by #1995/#2013.",
+ "Continuing a partial cost improvement while leaving the same unpriced consumer, restoration or central-readout obligation unresolved; refresh the family expansion decision first. Local product-retiming evidence has a narrow scope and is not a ban on changed graphs or contracts."
+ ],
+ "overlap_terms": [
+ "helper inventory",
+ "heterogeneous-owner",
+ "mutable leaver"
+ ]
+ },
+ "scope_status": "refined",
+ "actual_scope": "Prepare eight independent cold-helper relations, replace all eight backward centers with exact snapshots, remove eight later zero jobs, and debit eight rank-nine helper targets per backward call.",
+ "scope_change_reason": "This uses the current helper-inventory priority. It changes the independent input inventory and scalar word; all physical native maps and the p16 controller remain fixed.",
+ "bottleneck_link": "https://github.com/CrocSwap/integer-mult-bounds/discussions/5125#discussioncomment-19154290",
+ "budget_minutes": 240,
+ "stop_rule": "Publish one exact complete-profile kappa improvement after native, ownership, phase-inheritance, compiler and cold-export checks.",
+ "outcome": "completed",
+ "evidence": "WITNESS.json, WORD.json.gz, RESULT.json and the full exact verifier. Conditional kappa 0.00302666.",
+ "author": "Ali Romman",
+ "ai_assistance": "Substantial OpenAI Codex assistance in discovery, code, proof, verification and publication.",
+ "open_questions": [
+ {
+ "question": "Can an independent reviewer validate the joint relation system and all inherited physical transfer premises?",
+ "why_it_matters": "The finite exact construction still uses the five selected framework assumptions.",
+ "first_step": "Check the sixteen unrestricted row identities, eight pivots and complete cost in README.md and RESULT.json.",
+ "blocked_by": "Independent review has not yet occurred."
+ },
+ {
+ "question": "Can a different relation system improve the complete bill beyond this fixed profile?",
+ "why_it_matters": "The new profile ceiling is not an optimum over helper relations.",
+ "first_step": "Check live claims, then charge each lost target and prove an additional removed job.",
+ "blocked_by": "All eight backward center jobs are already removed in this construction."
+ }
+ ],
+ "coordination": {
+ "claim": "https://github.com/CrocSwap/integer-mult-bounds/discussions/5125#discussioncomment-19154290",
+ "distinct_scopes": [
+ "https://github.com/CrocSwap/integer-mult-bounds/discussions/5355",
+ "https://github.com/CrocSwap/integer-mult-bounds/discussions/4930"
+ ],
+ "boundary": "This extends our frozen PR5377 relation to a joint rank-eight system. The original-input cache scope is released. The coded caller retains all original helpers; this package changes eight helper inputs per backward call. No shared controller or selected file changes."
+ }
+}
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/VERIFY.json b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/VERIFY.json
new file mode 100644
index 0000000000..8098df4c80
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/VERIFY.json
@@ -0,0 +1,38 @@
+{
+ "schema_version": 1,
+ "status": "ready",
+ "python": "3.12",
+ "requirements": [],
+ "inputs": [
+ "research/higher-moment-strictification/verify.py",
+ "research/joint-helper-lattice/CONTROLLER.json",
+ "research/kappa-causal-continuation/buffer-borrowing/verify_buffers.py",
+ "research/kappa-rebuild/architecture/mixed_target_probe.py",
+ "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "research/query-thinned-controllers/RESULT.json"
+ ],
+ "commands": [
+ {
+ "argv": [
+ "{python}",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "Exact native rows, owned entry columns, event ranks, independent source identities, p16 Laurent controller, complete asymmetric invoice, two interval engines, compiler and outer predicates, negative controls."
+ },
+ {
+ "argv": [
+ "{python}",
+ "-O",
+ "-B",
+ "{package}/verify.py"
+ ],
+ "timeout_seconds": 600,
+ "checks": "The same checks remain active with Python assertions disabled."
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/WORD.json.gz b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/WORD.json.gz
new file mode 100644
index 0000000000..a4a58afce1
Binary files /dev/null and b/research/joint-relations-independent-validation/capsule/repository/research/kappa-joint-relations-20261023/WORD.json.gz differ
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz b/research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz
new file mode 100644
index 0000000000..46d929df83
Binary files /dev/null and b/research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz differ
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz b/research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz
new file mode 100644
index 0000000000..ac77b78547
Binary files /dev/null and b/research/joint-relations-independent-validation/capsule/repository/research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz differ
diff --git a/research/joint-relations-independent-validation/capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md b/research/joint-relations-independent-validation/capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md
new file mode 100644
index 0000000000..4badb40f09
--- /dev/null
+++ b/research/joint-relations-independent-validation/capsule/repository/research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md
@@ -0,0 +1,313 @@
+# Finite precompilation of a mixed-target rule
+
+Status: constructive bridge under the precise native hypotheses below,
+independently audited in `../transfer-audit/AUDIT.md`. This is a written
+argument, not a formal proof or a completed integer-multiplication admission.
+The companion finite scheduler checks actual integer flow and ordering.
+The original immediate-normalization BIT interface failed hypothesis 3.
+`../bit/DELAYED-COVER-BRIDGE.md` supplies the distinct delayed-cover
+implementation, with a finite local-ring check and the native binding in
+`../bit/BIT-P3-NATIVE-BINDING.json`. Its fixed rational cover routes are a
+costed program schema, not dense coordinate gates in a plain native word.
+
+Substantial OpenAI assistance. Apache-2.0. The mixed-target asymptotic flow is
+Jacob Alan Sussman's Theorem 1G, PR4268, with the detailed proof at commit
+`563b4e6e913625637f36ba7869bf5fcd0dd4975a` of
+[`wht-power-saving-lean`](https://github.com/jacobalansussman/wht-power-saving-lean).
+The source, exact scheduling code and notices are preserved under `sources/`.
+The contribution proposed here is clearing the finite flow into a single
+uniform native supplier before applying the inherited outer theorem.
+
+## 1. What needs to be assumed
+
+Let a job of rank `s` apply a specified tensor operator to `s` selected
+coordinate blocks of one array, fixing all other coordinates. A block has
+an arbitrary positive tensor multiplicity `f`. A completed rank `s` job
+therefore acts on `s*f` axes. All productive inputs are arbitrary.
+
+Fix one mixed unit with productive targets `W_k` of ranks `k`, a chronological
+list of paid child ranks `r_j`, and a finite number of scalar and routing
+passes. These assumptions are required, separately from the moment inequality:
+
+1. **An all-column native word.** At every integer column count `c`, the unit
+ computes exactly its independent rank `k*c` output jobs. Its paid rounds
+ are rank `r_j*c` jobs in the stated order. All borrowed data return to the
+ declared endpoint, and owned storage is explicitly initialized and erased.
+ Its finite operation count is uniform in `c`.
+2. **Disjoint splitting and spectators.** A rank `a+b` job is a rank `a` job
+ followed by a rank `b` job on disjoint coordinates. The resulting programs
+ preserve arbitrary complete spectator fields and accept arbitrary data.
+3. **Whole-job adapters.** Any job passed between two units has an explicitly
+ priced, permitted embedding into its destination. For the intended complex
+ application these are fixed monomial binary address maps and unit quadratic
+ phases, together with role permutations. The adapters must work at every
+ tensor multiplicity. Rank equality by itself is insufficient.
+4. **Finite-program closure.** A finite composition of these words and
+ adapters is again a permitted finite supplier. Constantly many owned fields
+ may be supplied with their full cost and no productive output credit.
+ The eventual ordinary recursion must have the same arbitrary-input,
+ restoration, scalar and precision interface as the retained supplier.
+
+Put `m=max{k:W_k>0}`, `k_min=min{k:W_k>0}`, and
+`r_max=max{r_j}`. Require `r_max g*S`, keeps one
+external weight throughout the entire finite circuit, and lowers only its
+final rank-one leaves. All rational matchers, role routes and their inverses
+are fixed before choosing the odd prime and its exclusions. Every route
+uses complete equal-multiplicity cover fibers and the retained, costed row
+permutation primitive. This gives the same finite DAG argument in the
+rational-cover program category. The BIT binding supplies the actual native
+projectors; a rank count alone would not provide this implementation.
+
+## 2. Proposed conclusion
+
+Suppose the preceding hypotheses hold and the mixed balance has root
+`tau` in `(0,1)`:
+
+```
+sum_j r_j^tau = sum_k W_k k^tau.
+```
+
+For every `z` with `tau=2`, a fixed number `B_N` of productive arrays,
+and only rank-one paid children, whose number `P_N` satisfies
+
+```
+P_N < B_N * N^z.
+```
+
+Every productive output is the full rank-`N` job. The construction may have
+an enormous finite scalar word, role inventory and owned-storage requirement.
+Those quantities affect constants and the eventual input threshold. They are
+not omitted and are not credited as extra output jobs.
+
+If this uniform supplier is admitted under the retained native, precision and
+fixed-tape premises, the existing uniform recursion applies directly. A new
+dynamic RAM-to-Turing-machine simulation is not being assumed here.
+
+## 3. The integer lockstep flow at a fixed rank
+
+This is the part of Theorem 1G used by the compiler. At one fixed top rank
+`N`, its units, source jobs and exit jobs have integer multiplicities.
+For a multi-index `a` on the target types define
+
+```
+c(a) = product_k k^(a_k),
+u(a) = multinomial(|a|;a) * product_k W_k^(a_k).
+```
+
+The exact Pascal identity is
+
+```
+u(b) = sum_{k:b_k>0} W_k*u(b-e_k).
+```
+
+Let `G` be the largest `|a|` with `m*c(a)<=N`. A class is indexed by a
+sequence of paid rounds `s` of length `d<=G`; its dilation is
+`rho_s=product r_j`. It contains `u(a)` units at column `rho_s*c(a)` for
+each `a` with `|a|=G-d` and `m*rho_s*c(a)<=N`.
+
+For one parent paid round, the Pascal bijection matches its job copies to
+target roles of the child class, at exactly equal integer ranks. Missing
+demands are top sources. Separation ensures every parent job is consumed.
+The source ranks lie in `(N/m,N]`; only the deepest classes produce exit
+jobs, all strictly smaller than `N` once `N` is outside the finite base range.
+
+Process a class in word order. At round `j`, suspend every unit of that
+class, complete the entire child class fed by that round, and only then
+advance the parents to round `j+1`. This forbids a unit from requiring both
+an earlier and a later round of the same suspended parent. The resulting
+dependency graph is finite and acyclic. Its edges carry complete array jobs,
+not individual scalar values copied for free.
+
+These integer quantities exist before normalizing the sources to total
+weight one. Let `S_s` be the number of source jobs of rank `s`, let
+`S=sum_s S_s`, and let the ordered exit batches be `(e,t)` with `t` jobs
+of rank `e` each. This finite integer flow is the compiler input.
+
+## 4. Clear every batch denominator constructively
+
+Induct on the integer top rank `N`. For each smaller rank `e` the compiler
+has already constructed a uniform program on `B_e` arbitrary arrays,
+computing full rank `e` with `P_e` paid rank-one calls. For a sufficiently
+small rank use the ordinary sequential program: `B_e=1`, `P_e=e`.
+
+For the current flow choose an integer `a` divisible by every `B_e` needed
+for an exit and every `B_(N-s)` needed for a nonzero source remainder.
+The product of those finitely many positive integers is a valid choice;
+their least common multiple is a smaller optional choice. Set
+
+```
+B_N = a*S.
+```
+
+Assign `a*S_s` of the input arrays to each source rank `s`. On each of those
+arrays, first complete its `N-s` complementary coordinates using the
+already-compiled smaller uniform program. All such batches are integral
+because `a` is divisible by their program widths. This preliminary action
+commutes with the intended `s`-coordinate job and fixes its input coordinates.
+
+Make `a` copies of the integer lockstep flow. Route its source arrays to
+their exact input slots using permitted whole-array adapters. At a deepest
+exit batch, `a*t` is divisible by `B_e`; replace that batch by copies of
+the smaller uniform rank-`e` program. Restore its role ordering and adapters
+before resuming the suspended parent class. Execute the finite DAG in the
+lockstep order, and finally restore the original source-array ordering.
+
+Every array has now received its disjoint complementary job and source job,
+hence the full rank-`N` transform. No copied scalar input or blank helper is
+treated as another independent output. Every original array occurs exactly
+once as a source; interior target slots are jobs on those arrays, not new
+productive inputs.
+
+Induction removes all recursive calls: the only remaining paid children
+have rank one. Clearing denominators multiplies productive arrays and paid
+operations equally, so it preserves the per-array leaf count. In formulas,
+
+```
+P_N/B_N = (1/S) * [
+ sum_s S_s * (P_(N-s)/B_(N-s))
+ + sum_(ordered exit batches e,t) t * (P_e/B_e)
+].
+```
+
+Zero-rank terms vanish. Any plain rank-one exits are the ordinary base
+program. Scalar and routing passes have their own analogous nonnegative
+count and must be included in the asymptotic cost used to choose `N`.
+
+This construction uses full integer batches; it does not assume that
+fractional pieces of a physical array can be routed at zero cost. Its exact
+replication factors can be impractically large, which is acceptable for a
+fixed finite supplier existence statement but must be disclosed.
+
+## 5. Why some fixed N has the required saving
+
+The independent audit sharpened this step to a direct count of paid leaves.
+It does not require a running-time comparison between a RAM flow and native
+tapes. Let `L(n)=P_n/B_n`, let `w_s=S_s/S`, and let `x_e` be the exit counts
+normalized by the number S of source arrays. The actual integer compiler
+satisfies
+
+```
+L(n) = sum_s w_s L(n-s) + sum_e x_e L(e),
+sum_s w_s = 1,
+sum_e x_e e^tau = sum_s w_s s^tau.
+```
+
+The last equality follows by canceling every internal matched job in the
+exact tau-potential balance. The source ranks satisfy `n/m0`, concavity gives
+
+```
+n^z0 - sum_s w_s (n-s)^z0 >= eta * sum_s w_s s^z0.
+```
+
+Indeed, for `t=s/n` in `[1/m,1]`,
+`1-(1-t)^z0 >= z0*t >= eta*t^z0`. For every sufficiently large n the
+exit coefficient is less than `eta/2`. Every complement and exit has
+smaller rank than n, so strong induction on the exact recurrence proves
+`L(n)<=A*n^z0`, with finite A chosen to cover the smaller ranks. Eventually
+`L(N)= 2`;
+* `W` productive arrays, each receiving the **full** rank-`N` transform;
+* `P` rank-one paid children;
+* `U` copies of the mixed unit in the completely expanded finite word;
+* at most `O=U` owned centers, conservatively one per mixed-unit instance.
+
+For every rational `z` strictly above the mixed root and below one, the
+constructive count argument provides an `N` with `P < W*N^z`.
+“Finite” here means fixed before the eventual multiplication input grows.
+It can be astronomically large. Neither this note nor the receipts claim
+to have materialized the winning near-threshold instance. The later
+`../controller/EXPLICIT-TEMPLATE-BOUNDS.md` strengthens the existence
+argument to the specified complex rank `N=2^276540184361`, with uniform
+saving `0.002304`; no search for a successful rank is left unperformed.
+The integer recursion defines its exact finite `W,P,U`, and the constants
+below are computable functions of that finite result.
+
+The fully materialized, depth-zero `N=57` example has `W=2242`, `P=127570`,
+and `U=1`. It is a useful independent check that complementary source jobs
+are really paid: `57*2242-127570=224`. This small example is not claimed to
+attain the limiting mixed exponent.
+
+## 2. Every column count and every complete spectator field
+
+The local logical identities were replayed in a free noncommuting operator
+word algebra. Apart from rational scalar arithmetic, the checker uses only
+composition and cancellation of an operator with its recorded inverse.
+For any positive integer `f`, substitute the `f`-column physical operator
+for each such generator. This extends to an algebra homomorphism on the
+free word algebra and preserves the checked identities.
+
+This is not the false assertion that tensor power is additive on arbitrary
+matrix sums. The role-level scalar word is unchanged. Each physical address
+generator is replaced by its column lift, while its formal products and
+linear combinations are evaluated on the same independent role arrays.
+
+A rank-zero native monomial has the form
+
+```
+|x> -> i^(a+q(x)) |M*x+b>,
+```
+
+with invertible binary `M` and a permitted quadratic phase `q`. Its column
+lift has blockwise address map `M`, translation `b` in every column, and
+phase `a*f + sum_j q(x_j)` modulo four. This explicitly retains the absolute
+phase. A fixed coordinate matcher in the precompiler becomes the same
+fixed permutation of `f`-axis blocks. All untouched axes remain complete
+spectator fields. A rank-one leaf becomes the standard rank-`f` child.
+
+The retained exact Clifford normal form supplies the monomial factors
+around each child. The independent p3 audit checks the whole main boundary,
+including the output translations required by negative powers of `C_q`.
+The fixed THREE/base selection is valid for every column count: THREE/base
+and THREE/extra have identical entrance and exit operators; their difference
+is an internal frame and its associated warps. No layer-dependent selector
+is required for the endpoint contract.
+
+For any integer input width `e=N*f+r`, first apply the `r=2`, `B=P+E`, and `E>=64`,
+
+```
+2*B*(N-1) >= P+E,
+2*B*f+P*f+E <= 2*B*N*f <= 2*B*e.
+```
+
+Induction gives `A(e)<=2B e`. Completed disjoint selected-axis pieces have
+total width at most `d`. The retained prefix kernels, outer phases and
+normalization add at most `18d`, giving
+
+```
+A_layer <= (2*B+18)*d < C0*d.
+```
+
+Every calculation remains on one fixed fine grid. A child is never rounded,
+compressed, or re-encoded at return. The change is to the proof's bound on a
+completed value, not to its stored representation. Other fields remain
+parked while the child executes. This is why the linear semantic bound
+survives a huge scalar word and why the older pathwise `C1>1` estimate is
+unnecessary.
+
+The stopping rule can be any fixed rational `0=2N`, every internal call has the required positive `f`;
+the completed-leaf estimate remains `8e` at the stopping leaves. No old
+numerical cutoff is carried over.
+
+### An effective threshold, including enormous constants
+
+Suppose `d<=c*p^epsilon`, with fixed `c>=1` and rational
+`epsilon=a/b` in `(0,1)`. Let `L` be the binary bit length of
+`4*C0*ceil(c)` and choose
+
+```
+t = max(4, ceil(b*L/(b-a))), p0 = 2^t.
+```
+
+For all `p>=p0`, `p^(1-epsilon)>4*C0*c`, so the integer guard
+`Delta=C0*d` is at most `p/4`. Signed components with `p+Delta` fractional
+bits and `Delta+3` magnitude/sign bits have width
+
+```
+p+2*Delta+3 <= 2p.
+```
+
+The audit emits `p0` as a compressed power of two. It does not try to
+allocate that many bits. This construction proves the eventual `O(p)` word
+bound for the new finite template, including the current outer choice
+`epsilon=99999/100000`. Huge fixed constants change `p0`, not `C1` or the
+power in the final exponent inequalities.
+
+## 5. Productive stock, owned storage, and native tape closure
+
+For the ordinary uniform complex word, let
+
+```
+D(e)=0 if e=W^D(d)` for `K>=1`. Pad complete rows once to the next multiple
+of `W^D(d)`. The padding factor is below two. Every descendant then has
+exactly `1/W` of its parent's productive volume and enough divisibility for
+its remaining depth, with complete active, control and spectator fields.
+All-row endpoint correctness restores appended zero rows to zero.
+
+Owned storage contributes no factor to productive output credit. A safe
+choice is one full center field per finite mixed-unit instance, namely
+`O=U`. At an ordinary recursion node each such field has the same shape as
+one productive role stream, of volume `V/W`. Initialize, retain and clear
+it as its actual word prescribes. If simultaneously suspended units keep
+live centers, they receive distinct banks. Reusing one bank per recursion
+depth would not suffice. Owned-space scans and parking cost fixed multiples
+of volume; paid calls on those banks are already in `P`.
+
+The integer audit checks row divisibility and one-time padding at several
+floor-depth boundaries. It also gives an explicit sufficient threshold
+for `q0 2^26*N^5 avoiding all fixed denominators and rank witnesses"
+ },
+ "outer": {
+ "functional_checks": {
+ "actual_new_BIT_stock_sublinear": "17429997759/17500000000",
+ "fixed_halo_explicit_metadata_branch": "1347500003/17500000",
+ "new_BIT_row_stock_sublinear_in_active_group": "69789991027/70000000000",
+ "new_semantic_group_guard": "9/70000000"
+ },
+ "margins": {
+ "boundary_algebraic_matrix": "14504839378373/4900000000000000",
+ "fused_gaussian": "14504838135119/4900000000000000",
+ "global_coordinate_router": "51803/17500000",
+ "group_bit_router": "3626262033773/1225000000000000",
+ "group_scans": "34999997/35000000",
+ "main_transform": "14504629378373/4900000000000000",
+ "microbox_face_corrections": "1347500003/17500000",
+ "polynomial_products": "69999997/70000000",
+ "sparse_union_movement": "2005129839378373/4900000000000000"
+ },
+ "parameters": {
+ "a": "51803/17500000",
+ "b": "41443/14000000",
+ "beta": "69999991/70000000",
+ "bit_saving": "17/5000",
+ "cap_xi": "4455129629378373/4900000000000000",
+ "complex_uniform_saving": "103609/35000000",
+ "d": "3/70000000",
+ "epsilon": "69999997/70000000",
+ "kappa": "37/12500",
+ "lambda_": "19940797/20000000",
+ "lambda_prime": "69792791/70000000",
+ "layout": "3/70000000",
+ "q": "207209/70000000",
+ "r0": "3/700000000",
+ "stop": "3/70000000",
+ "tested_saving": "29603/10000000"
+ },
+ "strict_checks": {
+ "actual_bit_above_effective": "7697/17500000",
+ "actual_logarithmic_gamma_guard": "3/70000000",
+ "actual_logarithmic_group_guard": "444870685621627/2450000000000000",
+ "alpha_logarithm_absorption": "3/700000000",
+ "boundary_algebraic_matrix_above_kappa": "839378373/4900000000000000",
+ "cap_above_band": "2005129629378373/4900000000000000",
+ "cap_below_cell": "444870160621627/4900000000000000",
+ "cap_below_phase_cell_power": "5344870370621627/4900000000000000",
+ "complex_above_effective": "3/70000000",
+ "complex_below_one_over_32": "396057/14000000",
+ "complex_endpoint": "3/35000000",
+ "epsilon_below_one": "3/70000000",
+ "epsilon_positive": "69999997/70000000",
+ "fine_prime_halo_umbrella": "7/2",
+ "fused_gaussian_above_kappa": "838135119/4900000000000000",
+ "gaussian_above_main": "104378373/2450000000000000",
+ "global_coordinate_router_above_kappa": "3/17500000",
+ "global_gamma_power_slack": "27/700000000",
+ "group_below_dimension": "3/35000000",
+ "group_bit_router_above_kappa": "262033773/1225000000000000",
+ "group_gauge_power_slack": "444870675121627/2450000000000000",
+ "group_key_fits_record": "3/35000000",
+ "group_positive": "69999991/70000000",
+ "group_scans_above_kappa": "34896397/35000000",
+ "halo_covers_generic_inverse_radius": "5",
+ "improvement_over_user_baseline": "614514790400418148631/500000000000000000000000",
+ "lambda_above_internal": "3/140000000",
+ "lambda_above_sigma": "9/140000000",
+ "lambda_above_tau": "3/140000000",
+ "lambda_prime_above_lambda": "3/140000000",
+ "lambda_prime_above_leaf": "83875671/980000000000000",
+ "leaf_saving_above_effective": "41875671/980000000000000",
+ "main_transform_above_kappa": "629378373/4900000000000000",
+ "membership_arithmetic_fits_record": "3/70000000",
+ "microbox_face_corrections_above_kappa": "1347448203/17500000",
+ "microbox_halo_volume": "5530000009/70000000",
+ "new_complex_uniform_saving_above_b": "3/70000000",
+ "new_semantic_guard_with_C1_one": "3/70000000",
+ "polynomial_products_above_kappa": "69792797/70000000",
+ "positive_layout_slack": "3/70000000",
+ "q_below_effective": "3/70000000",
+ "q_below_internal": "3/70000000",
+ "q_below_leaf": "83875671/980000000000000",
+ "q_positive": "207209/70000000",
+ "short_record_fallback": "13958557/14000000",
+ "source_axis_superpolynomial": "3/70000000",
+ "sparse_union_movement_above_kappa": "1990625839378373/4900000000000000",
+ "stop_below_one": "69999997/70000000",
+ "stop_positive": "3/70000000",
+ "strassen_integer_power_gap": "1951441519231",
+ "support_router_span": "9/70000000",
+ "theta_positive_polynomial_power": "2",
+ "union_header_fits_record": "9/70000000",
+ "union_tag_work_per_visit_fits_record": "9/70000000"
+ }
+ },
+ "relative_gain_over_p7": "27353/268647",
+ "schema": "query-thinned-productive-controllers/1",
+ "scope": "Conditional native construction; all-column, erasure, whole-job matching, fixed-tape, precision, analytic, prime and exact-recovery premises retained. No unconditional theorem or selected promotion.",
+ "source_inputs_authenticated": 17,
+ "status": "PASS_CONDITIONAL_QUERY_THINNED_KAPPA_00296"
+}
diff --git a/research/joint-relations-independent-validation/custody/CANDIDATE-COMMIT.raw b/research/joint-relations-independent-validation/custody/CANDIDATE-COMMIT.raw
new file mode 100644
index 0000000000..b08b5f5efd
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/CANDIDATE-COMMIT.raw
@@ -0,0 +1,6 @@
+tree 7c8818178b05733b5d09a6decc34d53b84fdc213
+parent 1ec1119972c9aefe42525172d07b332fcff81cb4
+author Ali Romman <226877337+aliromman@users.noreply.github.com> 1792788545 -0500
+committer Ali Romman <226877337+aliromman@users.noreply.github.com> 1792788545 -0500
+
+Research: eight joint helper relations improve conditional kappa to 0.00302666
diff --git a/research/joint-relations-independent-validation/custody/CANDIDATE-FILES.json b/research/joint-relations-independent-validation/custody/CANDIDATE-FILES.json
new file mode 100644
index 0000000000..df59bfdad2
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/CANDIDATE-FILES.json
@@ -0,0 +1,62 @@
+[
+ {
+ "path": "research/kappa-joint-relations-20261023/README.md",
+ "size_bytes": 16479,
+ "sha256": "899027b74219ece1832d711e27def50eb49994cd28ede4fedcdd0bd0f2574c64",
+ "git_blob": "d0593a46e89eb63a533968cd6bc1d2a129f3c22e"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/RESULT.json",
+ "size_bytes": 22334,
+ "sha256": "d6a99bd75c6b7a2146b0fc4cfa038890aaf1d4adcdef42d767fdb40b687e61aa",
+ "git_blob": "b6c9cd0da1889ed92f3f1066127a203246f303d8"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/SOURCES.json",
+ "size_bytes": 3665,
+ "sha256": "3b1536861c5b6990966ad5107f3a619f5d9da548f3c4eaa454ec32341e640dd3",
+ "git_blob": "71c57c8a90585da602b8df163d582e7c77949c00"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/TASK.json",
+ "size_bytes": 5801,
+ "sha256": "4d536a9bd6162b64ecf7bba20bec35fa0ca8fe61abf8e1404cd010b58de07a3d",
+ "git_blob": "5b57a9e8233575c97042b774a8ee3881e6ece6f7"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/VERIFY.json",
+ "size_bytes": 1298,
+ "sha256": "1fc62a3afd087aa63f8d993beb1cba944b9b441824cd14e9135e792fcd45bab8",
+ "git_blob": "8098df4c806a6c6e9e2be7253ba4101744dab08d"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/WITNESS.json",
+ "size_bytes": 5482,
+ "sha256": "24599011da06325e1012619b2b84a4dd3aceb90ab42d3caaf6414879e7d16591",
+ "git_blob": "19665f9eac2238d709758e0296eb6016e71b2b1a"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/WORD.json.gz",
+ "size_bytes": 207650,
+ "sha256": "7883ba0faefc96505bb61ca7312d588fa22dfe2164050c817c1718b8fa28693a",
+ "git_blob": "a4a58afce144541603385e9bf4e0695c54eade7c"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/native.py",
+ "size_bytes": 16822,
+ "sha256": "3c8efab1f830868c054d33391ee2f8bc74f9bae9c134edf5b455790eb674c1c4",
+ "git_blob": "cbff46fe6e7d71c10fe439610f1916ad07fa3cd8"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/price.py",
+ "size_bytes": 13360,
+ "sha256": "6ec03cda9ab6cb27c4a281c12646bbbc232cc57b8ec179969c59b0072c4b59ba",
+ "git_blob": "2868905a1650d4b94fb92cdac9c86ea98877e047"
+ },
+ {
+ "path": "research/kappa-joint-relations-20261023/verify.py",
+ "size_bytes": 3474,
+ "sha256": "43fb20a4ef18fb17f168c9e3c1608898551a04fb64496405d3682983dbf47828",
+ "git_blob": "3f7eb9359a980f2467d202d567a100fceccd8f20"
+ }
+]
diff --git a/research/joint-relations-independent-validation/custody/CANONICAL-COMMIT.raw b/research/joint-relations-independent-validation/custody/CANONICAL-COMMIT.raw
new file mode 100644
index 0000000000..87c53f7af1
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/CANONICAL-COMMIT.raw
@@ -0,0 +1,6 @@
+tree bfb420045d2bc04dd026b5020aea84d547873ef4
+parent 7c472563474e60185e6ca101a17622133d047e56
+author Douglas R. Colkitt 1792786762 -0400
+committer Douglas R. Colkitt 1792786762 -0400
+
+Admit conditional PR4610 frontier through independent PR5241 audit [skip ci]
diff --git a/research/joint-relations-independent-validation/custody/PR5241-INVENTORY.json b/research/joint-relations-independent-validation/custody/PR5241-INVENTORY.json
new file mode 100644
index 0000000000..f8e05328a6
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/PR5241-INVENTORY.json
@@ -0,0 +1,191 @@
+{
+ "canonical_pin": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "files": [
+ {
+ "path": "research/final4610-independent-admission/CLAIM.json",
+ "git_blob": "49b35d3fec3960c29b88f974b19e29b2bf487355",
+ "sha256": "4f0f13fb4cd2b30fb52716df3e7299846dc6d11bbd207f2107bc6b06a9b18b61",
+ "bytes": 1894
+ },
+ {
+ "path": "research/final4610-independent-admission/FIRST-COLD-REPLAY.json",
+ "git_blob": "7b46f38ceee3152f753a13157852fdaaf60c31aa",
+ "sha256": "0b37e1741af786144e1eb78a752bee65424437107c5065181d8a28e05ec30122",
+ "bytes": 282091
+ },
+ {
+ "path": "research/final4610-independent-admission/LOCAL-INPUTS.json",
+ "git_blob": "ab99b0d3c93b512ca5add19712d2c541e1abf90c",
+ "sha256": "d3d5d8dd4037112c5952dc91e5d1287a13cf7c26927cd37fd446785e3a07a749",
+ "bytes": 488
+ },
+ {
+ "path": "research/final4610-independent-admission/PAID-CATALOG.jsonl.gz",
+ "git_blob": "73fa3ced93981949ad8f2432af840b787d9182c0",
+ "sha256": "964aa2e28057936825a67872ebe5c6b0abc3228e71a545dda6c1fc11adb983d5",
+ "bytes": 125818
+ },
+ {
+ "path": "research/final4610-independent-admission/PROOF.md",
+ "git_blob": "cc71e69b34835eff261b6073606dd585355e442c",
+ "sha256": "e573cbbe6fa5481c0533e773de404e10f4dc7907b5ebfe404bdcd02dcf9844d8",
+ "bytes": 14291
+ },
+ {
+ "path": "research/final4610-independent-admission/README.md",
+ "git_blob": "c70c1b436bbd1130332f737c2efab193674e8672",
+ "sha256": "df5a03f28c64e2de5d0b0000d1fe93ced20d99b9e99bbc1fa97432f783848f13",
+ "bytes": 8212
+ },
+ {
+ "path": "research/final4610-independent-admission/SOURCES.json",
+ "git_blob": "cf40c4d94f11f1058cfd2d04388dbba72051c1fe",
+ "sha256": "25fed1fae88cffefc64cdecf8114718f4f4bcff1ef11e69e7556b8f40110e9a6",
+ "bytes": 13513
+ },
+ {
+ "path": "research/final4610-independent-admission/SPECIALIZATION.md",
+ "git_blob": "7ee84b30892f7354e1c36611f1a5e9b082dc6147",
+ "sha256": "70430114f744108223bc1d44b98bc25b696c4b408b7b044c2a8bbdfdb434ac5c",
+ "bytes": 19802
+ },
+ {
+ "path": "research/final4610-independent-admission/TASK.json",
+ "git_blob": "761b7c6ba0684f62bc92a2106515ac24ac61fea9",
+ "sha256": "0697507662d6f33633bff5a509122b2c977a82644d758f8282f139e3e24bc8d2",
+ "bytes": 6649
+ },
+ {
+ "path": "research/final4610-independent-admission/VALIDATION.json",
+ "git_blob": "dfb812803040ae38aafb0c32a522161b6e1414e2",
+ "sha256": "e596d5cbe89e5688b16e0a3dd3b9f2dbe867d5e1be67f0186b2afb6a9d0b234e",
+ "bytes": 1633
+ },
+ {
+ "path": "research/final4610-independent-admission/VERIFY.json",
+ "git_blob": "8f4e95ea81bfd210d79ef2312247e92d0ecc7837",
+ "sha256": "3beda8479a0db2a01732a860b7299e05aecc35235943eacd494f179270f3cfc0",
+ "bytes": 3583
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/__init__.py",
+ "git_blob": "b8e75050ef87853ca5950ff8a9ff9b6b36d4cc3c",
+ "sha256": "0af9ca16983533aa5fcb9dbcfbbd6f91c6200c93f69515703c9d340f24fed748",
+ "bytes": 142
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/all_helpers.py",
+ "git_blob": "04d5a7427a55761a25a915d38b3e92e6ba9a14cc",
+ "sha256": "7bc813bbd400f851dcb0137ad31d53e7044f33d3a6cb729c60b070fddab0d1ef",
+ "bytes": 9219
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/arithmetic.py",
+ "git_blob": "407d9389ff973ff3900dea8b8ed3439cc8630edc",
+ "sha256": "d67b2f665d4cc9ee49ca20af88a06ac2c971923b6a3a7d2b22bfc19c296ca8b5",
+ "bytes": 3109
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/census_controls.py",
+ "git_blob": "dc76e295f2504df68d26428b3aee2af0527c3302",
+ "sha256": "35fb546ef060a56539be3ac0eaba9d36405bd10803a7829933bd45699c2873ea",
+ "bytes": 1371
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/claim.py",
+ "git_blob": "43daf7c305f1fe62ef99f3920b2cb7ed1d83aac6",
+ "sha256": "86bf973f21b6bb1fe54b5dc83b89264e0b406d0ff1a6f686133c055a9752f39a",
+ "bytes": 3509
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/compiler.py",
+ "git_blob": "6a6f9373fe33d20e6aa7588ddcf86dde6a33a26a",
+ "sha256": "4ec862afb1b0c18cecebec9b04d692be37083da64814da79ad692da96fd62bb5",
+ "bytes": 10669
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/frame.py",
+ "git_blob": "80a91d0a31bb64f662a7bed1eca90096e3b2cd69",
+ "sha256": "0ef2fa6794ccdc5895a7b72ff318b1f0b56da933ef829705f98ac6d35ee17bcf",
+ "bytes": 2019
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/helpers.py",
+ "git_blob": "57e54de4a09f6d4e7aba96856a6c29c4b131a13d",
+ "sha256": "a6516b310c41a07db9a83f1444c9ae63295286acdb5a5e3eb561bef46cdb22ce",
+ "bytes": 11245
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/independent_clifford.py",
+ "git_blob": "f33ac0d326d20b8b8422ded0fdae49acff16fbe9",
+ "sha256": "4953e06bd3837fa414372a62f2de57711854353e3a6ac6cea94e4c18ae42ea87",
+ "bytes": 3946
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/invoice.py",
+ "git_blob": "142f3db7796f9be8d58a0c14db747614f8b8b4ff",
+ "sha256": "c0a9f90dfbbacec2d6d065986fad3c2b985361b9601d941ceb8296361311a60a",
+ "bytes": 9584
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/lift.py",
+ "git_blob": "ebe89f02c41853dd695d84629954d699f97b0cc9",
+ "sha256": "5ca85c008be87d6b49ba24f7928f3f6cc9558d5342119a5e715abf28326ac9fa",
+ "bytes": 4513
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/lineage.py",
+ "git_blob": "9ad2be9453dda7cb1f4cb2483a17c190272a9ec8",
+ "sha256": "7eb01f6125dd65fad0aa404055b0ed3f0609cce01e3d407f5089e4d5f0ac9dbb",
+ "bytes": 3561
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/moments.py",
+ "git_blob": "21abd93594516dad073e40b658c6c37084db2c5f",
+ "sha256": "4de41cb8cff88de815f47b634709ef819f822544a03a66ae35c0bea76e5d94c9",
+ "bytes": 6502
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/native.py",
+ "git_blob": "0545a57fc35f6109cbb3bc06e0934d40777c2890",
+ "sha256": "49b3560fd1baefd3ac986854844d399f1d180f8fd96724b0c3b2065e98a44523",
+ "bytes": 10090
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/outer.py",
+ "git_blob": "39e62cac780b662903582cb5f8684990fa779bb3",
+ "sha256": "196be1bc2329500f2c7c995deaf5a82aecc5e27f0fef7805470cb65d187bb1c0",
+ "bytes": 3468
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/paid.py",
+ "git_blob": "b9740fa217e545f67e289ae89c75a2a6b492692e",
+ "sha256": "4c6ff3312440ec3ef0c3e2649a1d2dae0f81ef09a8c65b46866775b56be79907",
+ "bytes": 9184
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/source.py",
+ "git_blob": "d17583cd64d9e8c4d1ab2e61cd557bd0bd5037c9",
+ "sha256": "7b519f0d9326b630c142630fec55a6a8b03a7b2dee7f4fcb2ca68564c4e04e53",
+ "bytes": 4545
+ },
+ {
+ "path": "research/final4610-independent-admission/checks/specialization.py",
+ "git_blob": "4fe827ec0ea0b30c8749e8e476b5257fd292c1b1",
+ "sha256": "a4baf55b462bff8a1f4b9d49d928ff88018792710a1c36b87f859093969921d6",
+ "bytes": 13855
+ },
+ {
+ "path": "research/final4610-independent-admission/regenerate_paid.py",
+ "git_blob": "39eaf03f00c5d7e02795112afbd3364386564fca",
+ "sha256": "3ccd4bc6022f96b863c4611907640a04cecdb0f69ea6c1e9b23c8c88c9eea7e4",
+ "bytes": 1133
+ },
+ {
+ "path": "research/final4610-independent-admission/verify.py",
+ "git_blob": "1879aeffa158e5efa74e920fb3d326eb573b1f4e",
+ "sha256": "94ae718a0b5db7f91550c352a4b573edbf62d16aaa925cf250f01b4b8c15edeb",
+ "bytes": 3687
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/custody/PR5241-PHASE-REUSE.json b/research/joint-relations-independent-validation/custody/PR5241-PHASE-REUSE.json
new file mode 100644
index 0000000000..d00febaa87
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/PR5241-PHASE-REUSE.json
@@ -0,0 +1,154 @@
+{
+ "status": "AUTHENTICATED_SELECTED_PHASE_REUSE_INPUTS",
+ "observed_utc": "2026-10-23T21:11:41.313092+00:00",
+ "canonical_pin": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "snapshot": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/sources/pr5241",
+ "files": 31,
+ "receipt_sha256": "0b37e1741af786144e1eb78a752bee65424437107c5065181d8a28e05ec30122",
+ "receipt_status": "PASS_INDEPENDENT_FINAL4610_CONDITIONAL_ADMISSION",
+ "receipt_complete": true,
+ "source_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd",
+ "native": {
+ "status": "PASS_INDEPENDENT_ALL_180_NATIVE_PHASE_CLASSES",
+ "frame_classes_checked": 180,
+ "actual_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd",
+ "directions": {
+ "backward": 180,
+ "forward": 180
+ }
+ },
+ "helpers": {
+ "status": "PASS_ALL408_HELPER_RELATIVE_OPERATORS_AND_ABSOLUTE_PHASES",
+ "oriented_classes": 34,
+ "helper_roles": 408,
+ "helper_orientation_instances": 816,
+ "unique_ordered_endpoint_pairs": 17,
+ "word_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd",
+ "proof_method": "Exact Clifford conjugation on all18 Pauli generators plus exact nonzero unit-norm anchor amplitudes; yields equality on all512 basis columns and all vectors without enumerating them."
+ },
+ "paid": {
+ "status": "PASS_ALL_PAID_PAIR_PHASES_BOTH_ACTUAL_ORIENTATIONS",
+ "complete": true,
+ "oriented_classes": 5710,
+ "unique_union_pairs": 2863,
+ "covered_paid_event_instances": 6596,
+ "complete_paid_event_instances": {
+ "backward": 3298,
+ "forward": 3298
+ },
+ "catalog_sha256": "964aa2e28057936825a67872ebe5c6b0abc3228e71a545dda6c1fc11adb983d5",
+ "independent_verifier_imported_source_compiler": false,
+ "source_compiler_truth_assumed": false
+ },
+ "catalogue_header": {
+ "compiler_sha256": "2982ead07721e83358dc67c6f49c2b4c16a236a6bebdfd72f58221be1f5d0962",
+ "expected_complete_oriented_classes": 5710,
+ "expected_complete_union_pairs": 2863,
+ "partial": false,
+ "proposed_oriented_classes": 5710,
+ "proposed_pairs": 2863,
+ "schema": "paid-phase-candidate/1",
+ "word_payload_sha256": "cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd"
+ },
+ "receipt_checker_bindings": {
+ "checks/__init__.py": {
+ "receipt_sha256": "0af9ca16983533aa5fcb9dbcfbbd6f91c6200c93f69515703c9d340f24fed748",
+ "canonical_sha256": "0af9ca16983533aa5fcb9dbcfbbd6f91c6200c93f69515703c9d340f24fed748",
+ "equal": true
+ },
+ "checks/all_helpers.py": {
+ "receipt_sha256": "7bc813bbd400f851dcb0137ad31d53e7044f33d3a6cb729c60b070fddab0d1ef",
+ "canonical_sha256": "7bc813bbd400f851dcb0137ad31d53e7044f33d3a6cb729c60b070fddab0d1ef",
+ "equal": true
+ },
+ "checks/arithmetic.py": {
+ "receipt_sha256": "d67b2f665d4cc9ee49ca20af88a06ac2c971923b6a3a7d2b22bfc19c296ca8b5",
+ "canonical_sha256": "d67b2f665d4cc9ee49ca20af88a06ac2c971923b6a3a7d2b22bfc19c296ca8b5",
+ "equal": true
+ },
+ "checks/census_controls.py": {
+ "receipt_sha256": "35fb546ef060a56539be3ac0eaba9d36405bd10803a7829933bd45699c2873ea",
+ "canonical_sha256": "35fb546ef060a56539be3ac0eaba9d36405bd10803a7829933bd45699c2873ea",
+ "equal": true
+ },
+ "checks/compiler.py": {
+ "receipt_sha256": "4ec862afb1b0c18cecebec9b04d692be37083da64814da79ad692da96fd62bb5",
+ "canonical_sha256": "4ec862afb1b0c18cecebec9b04d692be37083da64814da79ad692da96fd62bb5",
+ "equal": true
+ },
+ "checks/frame.py": {
+ "receipt_sha256": "0ef2fa6794ccdc5895a7b72ff318b1f0b56da933ef829705f98ac6d35ee17bcf",
+ "canonical_sha256": "0ef2fa6794ccdc5895a7b72ff318b1f0b56da933ef829705f98ac6d35ee17bcf",
+ "equal": true
+ },
+ "checks/helpers.py": {
+ "receipt_sha256": "a6516b310c41a07db9a83f1444c9ae63295286acdb5a5e3eb561bef46cdb22ce",
+ "canonical_sha256": "a6516b310c41a07db9a83f1444c9ae63295286acdb5a5e3eb561bef46cdb22ce",
+ "equal": true
+ },
+ "checks/independent_clifford.py": {
+ "receipt_sha256": "4953e06bd3837fa414372a62f2de57711854353e3a6ac6cea94e4c18ae42ea87",
+ "canonical_sha256": "4953e06bd3837fa414372a62f2de57711854353e3a6ac6cea94e4c18ae42ea87",
+ "equal": true
+ },
+ "checks/invoice.py": {
+ "receipt_sha256": "c0a9f90dfbbacec2d6d065986fad3c2b985361b9601d941ceb8296361311a60a",
+ "canonical_sha256": "c0a9f90dfbbacec2d6d065986fad3c2b985361b9601d941ceb8296361311a60a",
+ "equal": true
+ },
+ "checks/lift.py": {
+ "receipt_sha256": "5ca85c008be87d6b49ba24f7928f3f6cc9558d5342119a5e715abf28326ac9fa",
+ "canonical_sha256": "5ca85c008be87d6b49ba24f7928f3f6cc9558d5342119a5e715abf28326ac9fa",
+ "equal": true
+ },
+ "checks/lineage.py": {
+ "receipt_sha256": "7eb01f6125dd65fad0aa404055b0ed3f0609cce01e3d407f5089e4d5f0ac9dbb",
+ "canonical_sha256": "7eb01f6125dd65fad0aa404055b0ed3f0609cce01e3d407f5089e4d5f0ac9dbb",
+ "equal": true
+ },
+ "checks/moments.py": {
+ "receipt_sha256": "4de41cb8cff88de815f47b634709ef819f822544a03a66ae35c0bea76e5d94c9",
+ "canonical_sha256": "4de41cb8cff88de815f47b634709ef819f822544a03a66ae35c0bea76e5d94c9",
+ "equal": true
+ },
+ "checks/native.py": {
+ "receipt_sha256": "49b3560fd1baefd3ac986854844d399f1d180f8fd96724b0c3b2065e98a44523",
+ "canonical_sha256": "49b3560fd1baefd3ac986854844d399f1d180f8fd96724b0c3b2065e98a44523",
+ "equal": true
+ },
+ "checks/outer.py": {
+ "receipt_sha256": "196be1bc2329500f2c7c995deaf5a82aecc5e27f0fef7805470cb65d187bb1c0",
+ "canonical_sha256": "196be1bc2329500f2c7c995deaf5a82aecc5e27f0fef7805470cb65d187bb1c0",
+ "equal": true
+ },
+ "checks/paid.py": {
+ "receipt_sha256": "4c6ff3312440ec3ef0c3e2649a1d2dae0f81ef09a8c65b46866775b56be79907",
+ "canonical_sha256": "4c6ff3312440ec3ef0c3e2649a1d2dae0f81ef09a8c65b46866775b56be79907",
+ "equal": true
+ },
+ "checks/source.py": {
+ "receipt_sha256": "7b519f0d9326b630c142630fec55a6a8b03a7b2dee7f4fcb2ca68564c4e04e53",
+ "canonical_sha256": "7b519f0d9326b630c142630fec55a6a8b03a7b2dee7f4fcb2ca68564c4e04e53",
+ "equal": true
+ },
+ "checks/specialization.py": {
+ "receipt_sha256": "a4baf55b462bff8a1f4b9d49d928ff88018792710a1c36b87f859093969921d6",
+ "canonical_sha256": "a4baf55b462bff8a1f4b9d49d928ff88018792710a1c36b87f859093969921d6",
+ "equal": true
+ },
+ "regenerate_paid.py": {
+ "receipt_sha256": "3ccd4bc6022f96b863c4611907640a04cecdb0f69ea6c1e9b23c8c88c9eea7e4",
+ "canonical_sha256": "3ccd4bc6022f96b863c4611907640a04cecdb0f69ea6c1e9b23c8c88c9eea7e4",
+ "equal": true
+ },
+ "verify.py": {
+ "receipt_sha256": "54417d35c2d2bb7811f0be246ac585a425415c9c0d20f92c0c26e3eb3fb8ffa5",
+ "canonical_sha256": "94ae718a0b5db7f91550c352a4b573edbf62d16aaa925cf250f01b4b8c15edeb",
+ "equal": false
+ }
+ },
+ "source_manifest_matches_receipt": true,
+ "wrapper_change": "Canonical verify.py differs from first-cold wrapper. Every other recorded Python file, including all phase/native/helper mathematical checkers and paid regeneration code, matches its receipt hash. No replay was run. Selected maintainer PROOF-REVIEW authorizes source-bound unchanged foundation reuse.",
+ "reuse_scope": "Original source cfcd36 signed native and paid/helper phases only. New relation substitution, changed ownership/scalar chronology, joint inventory and physical/compiler/outer applications require new independent evidence.",
+ "semantic_runs": 0
+}
diff --git a/research/joint-relations-independent-validation/custody/PR5387-COMMIT.raw b/research/joint-relations-independent-validation/custody/PR5387-COMMIT.raw
new file mode 100644
index 0000000000..eb78fd6a03
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/PR5387-COMMIT.raw
@@ -0,0 +1,6 @@
+tree 6d2b3a87d39cf33569d1b1f8a7d6177af59bd524
+parent 1ec1119972c9aefe42525172d07b332fcff81cb4
+author Dugongue <49054532+Dugongue@users.noreply.github.com> 1792789282 -0700
+committer Dugongue <49054532+Dugongue@users.noreply.github.com> 1792789282 -0700
+
+Tighten conditional eight-relation kappa to 0.003026674765
diff --git a/research/joint-relations-independent-validation/custody/PR5387-INVENTORY.json b/research/joint-relations-independent-validation/custody/PR5387-INVENTORY.json
new file mode 100644
index 0000000000..fece32c627
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/PR5387-INVENTORY.json
@@ -0,0 +1,78 @@
+{
+ "head": "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "author": "Dugongue",
+ "files": [
+ {
+ "path": "research/eight-owned-relations/PREDECESSOR-5383.json",
+ "bytes": 22334,
+ "sha256": "d6a99bd75c6b7a2146b0fc4cfa038890aaf1d4adcdef42d767fdb40b687e61aa",
+ "git_blob": "b6c9cd0da1889ed92f3f1066127a203246f303d8"
+ },
+ {
+ "path": "research/eight-owned-relations/PREDECESSOR.json",
+ "bytes": 1524,
+ "sha256": "a0fc52a167d033225cf62fcf88ac635317059d3ce09de336f9f81008450381ef",
+ "git_blob": "193625791f182b71005f0f34c546db7b7c6dc226"
+ },
+ {
+ "path": "research/eight-owned-relations/README.md",
+ "bytes": 9358,
+ "sha256": "5d5f033c82a8ed8b7e9c3fe3d3f18f559f4f651bb11d0e6a2c916e244777fb99",
+ "git_blob": "17901a8af82a17135f8414fa592c63c65d85a785"
+ },
+ {
+ "path": "research/eight-owned-relations/RELATIONS.json",
+ "bytes": 8859,
+ "sha256": "bc9ba05595497f399da5e5a548b2d2c83696e539fa1257ab7e2cb49d438cd9dd",
+ "git_blob": "f558b9ddd903badb2301944cb978824b32ad42f7"
+ },
+ {
+ "path": "research/eight-owned-relations/RESULT.json",
+ "bytes": 14772,
+ "sha256": "34ad456c1f98f7f8c361d63539ef26d75dad8ffb3444edf29652372acabf1aaf",
+ "git_blob": "2e13818df03e9fd93b9e13ada8663646ec948572"
+ },
+ {
+ "path": "research/eight-owned-relations/SOURCES.json",
+ "bytes": 3665,
+ "sha256": "3b1536861c5b6990966ad5107f3a619f5d9da548f3c4eaa454ec32341e640dd3",
+ "git_blob": "71c57c8a90585da602b8df163d582e7c77949c00"
+ },
+ {
+ "path": "research/eight-owned-relations/TASK.json",
+ "bytes": 5444,
+ "sha256": "e3d0ee26c8b6a409be30b83aada3a2c3d1b332408a59307733f4299c940ff8b8",
+ "git_blob": "8b9df431cc81487d1993dc1babb39dd466abfd59"
+ },
+ {
+ "path": "research/eight-owned-relations/VERIFY.json",
+ "bytes": 1298,
+ "sha256": "1fc62a3afd087aa63f8d993beb1cba944b9b441824cd14e9135e792fcd45bab8",
+ "git_blob": "8098df4c806a6c6e9e2be7253ba4101744dab08d"
+ },
+ {
+ "path": "research/eight-owned-relations/WORD.json.gz",
+ "bytes": 207423,
+ "sha256": "6412632c28e265597fb088087048091d81c19500fb28a0c9c9d2a48f61b8665b",
+ "git_blob": "c62fcb59643f87919208100517a2fbc4b57cb7d7"
+ },
+ {
+ "path": "research/eight-owned-relations/native.py",
+ "bytes": 16032,
+ "sha256": "21e616b991fdc3af414e5e390e9eb6bb93ba39a560e235d324f4bb303148c1e8",
+ "git_blob": "86c10d2e1e9ee83c0d6927c50f3ab8995825d6aa"
+ },
+ {
+ "path": "research/eight-owned-relations/price.py",
+ "bytes": 13912,
+ "sha256": "3785b27e75d85116706ecaf9f7174132a72d00e1c28cea2cd4afada4ba30e44a",
+ "git_blob": "ffc2b0fdfcf2010a4ca0c4de58d87625932fd821"
+ },
+ {
+ "path": "research/eight-owned-relations/verify.py",
+ "bytes": 3747,
+ "sha256": "d46b075109f4af659cc099801062fe34b9d714903edb1d2807c1bc75edac2757",
+ "git_blob": "3bcf8f5e05bbec9351c521addbd5593d805452cd"
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/custody/SOURCE-HISTORY.json b/research/joint-relations-independent-validation/custody/SOURCE-HISTORY.json
new file mode 100644
index 0000000000..3cbc74d993
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/SOURCE-HISTORY.json
@@ -0,0 +1,111 @@
+{
+ "status": "PASS_SCOPED_SOURCE_CUSTODY",
+ "observed_utc": "2026-10-23T21:07:15.912231+00:00",
+ "canonical_main": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "candidate": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "candidate_parent": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "canonical_base_ancestor": true,
+ "replacements_disabled": true,
+ "lazy_fetch_disabled_during_checks": true,
+ "not_a_full_repository_history_audit": true,
+ "source_rows": [
+ {
+ "path": "certificates/selected-result.json",
+ "mode": "100644",
+ "blob": "b288ae44032fd84dd5564243422836cbcd29835e",
+ "working_sha256": "f9ed52bb642cd1e1486cf2743557ac5fa23cf1514a3277d786a644e39a565038",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "docs/research/agent-task-catalog.json",
+ "mode": "100644",
+ "blob": "f126dd2e2dad2b669e75d1d0d0bd05c600725602",
+ "working_sha256": "f7a48bfa2659b88378282a8eee7d9fe52cdf505594124c4d1686b58510fffd72",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/free-word-tensor-lift-audit/PROOF.md",
+ "mode": "100644",
+ "blob": "69c337a7704ce589798269ab4b8606189c070c4e",
+ "working_sha256": "cc8ad3698a673fb225419a3636a39aa99a66c7a0676f12e329b1e76564fa1459",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/higher-moment-strictification/verify.py",
+ "mode": "100644",
+ "blob": "4b24a5096154736ce060474eb8c72dc64c303699",
+ "working_sha256": "0ce7e7137422d5ffeda22085c81fa88471bbe963100fdad62e659f1e3bf89326",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/joint-helper-lattice/CONTROLLER.json",
+ "mode": "100644",
+ "blob": "49a2f0675819f9deeea27ed77be2c2b6ff2e87e5",
+ "working_sha256": "1f5d6aa267e4e66048818714b5d3b5eae17a58abe91d15deeaa34574f7391a5f",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-causal-continuation/buffer-borrowing/verify_buffers.py",
+ "mode": "100644",
+ "blob": "5a55034ec9e6185d981e16c28e1e2e455069e2cb",
+ "working_sha256": "106b4d5e052427230df452f0c901d5390a0583782960b80a8af94d9a984022c7",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-interface-round2-20261022/price_profile.py",
+ "mode": "100644",
+ "blob": "1d93e43d1cb888d128c2faa2be83a96d85b84295",
+ "working_sha256": "adde619968d3ac37147d239e25145b28150650e9ce0f76035f680f22589adcbb",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-rebuild/architecture/mixed_target_probe.py",
+ "mode": "100644",
+ "blob": "4fc05ab08138218ba9f09e5c89b649afae7c914e",
+ "working_sha256": "011c3c9d0cf81103dc84d709a0e36793eb7c5ae3f23c85eac27650ef13afa04a",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-rebuild/complex/native_extensions.py",
+ "mode": "100644",
+ "blob": "7f84894efc309546a903d314c7ac1473e7f594a8",
+ "working_sha256": "50ad007d9c386393657e86c99a96ae0a63a8fbc52872579b185002cc626e88e3",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-round3-warp-20261022/ACTUAL-WORD.json.gz",
+ "mode": "100644",
+ "blob": "46d929df83817b85a5387bcdb9745e0627d6366e",
+ "working_sha256": "7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-round3-warp-20261022/PHASE-VALIDATION.json.gz",
+ "mode": "100644",
+ "blob": "ac77b78547d6dbf2e6bd102e1047c5b16c1bca88",
+ "working_sha256": "6eae66ed3cfa8a1533e89b9660a57276908e6646640a12f8b1e3489f4ea1354b",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/kappa-round6-compiler-tightening-20261022/ARITHMETIC.json",
+ "mode": "100644",
+ "blob": "0fdb65f946d557c13d8e2781b9151e2a8ddee5c3",
+ "working_sha256": "b4f720a7ccbb5b46e472eaf85dc8739a40598986f19b37d26c4f9ecfbd31f0de",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "mode": "100644",
+ "blob": "340e1f0ffb8a1a9c38fbbd9119580b6d23e01b59",
+ "working_sha256": "d097e55f06c3f244f2074ffd7c1a0a5f3c4b4b6a6accf9619d1dde5c0ae85e15",
+ "same_at_base_and_candidate": true
+ },
+ {
+ "path": "research/query-thinned-controllers/RESULT.json",
+ "mode": "100644",
+ "blob": "e0695152c98d727edfd0d2034b58a1c7e8682c0c",
+ "working_sha256": "6ebfc8c0f09166f4834e9d7427410cb31aefff2cd4d4ce588c8e52c9c70e9a0f",
+ "same_at_base_and_candidate": true
+ }
+ ]
+}
diff --git a/research/joint-relations-independent-validation/custody/git-objects/02fdbbad293e674b3e2300ee89b37ed4dc623f6f.tree b/research/joint-relations-independent-validation/custody/git-objects/02fdbbad293e674b3e2300ee89b37ed4dc623f6f.tree
new file mode 100644
index 0000000000..3636690bc8
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/02fdbbad293e674b3e2300ee89b37ed4dc623f6f.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree b/research/joint-relations-independent-validation/custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree
new file mode 100644
index 0000000000..e345e299e1
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/0994002341ec20dbea467f4c19fb8d4300cb88cc.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree b/research/joint-relations-independent-validation/custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree
new file mode 100644
index 0000000000..623cd2c546
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/19b1abce68e32239bd8ad6abf979584eb93ad269.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit b/research/joint-relations-independent-validation/custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit
new file mode 100644
index 0000000000..87c53f7af1
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/git-objects/1ec1119972c9aefe42525172d07b332fcff81cb4.commit
@@ -0,0 +1,6 @@
+tree bfb420045d2bc04dd026b5020aea84d547873ef4
+parent 7c472563474e60185e6ca101a17622133d047e56
+author Douglas R. Colkitt 1792786762 -0400
+committer Douglas R. Colkitt 1792786762 -0400
+
+Admit conditional PR4610 frontier through independent PR5241 audit [skip ci]
diff --git a/research/joint-relations-independent-validation/custody/git-objects/258aaa876ecb530c4c173c8e3ef93ccf87c81673.tree b/research/joint-relations-independent-validation/custody/git-objects/258aaa876ecb530c4c173c8e3ef93ccf87c81673.tree
new file mode 100644
index 0000000000..8b24a7991e
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/258aaa876ecb530c4c173c8e3ef93ccf87c81673.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree b/research/joint-relations-independent-validation/custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree
new file mode 100644
index 0000000000..c91ad9be2f
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/2f0243de4ff0d29f087894edbf247327c5bae8e9.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree b/research/joint-relations-independent-validation/custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree
new file mode 100644
index 0000000000..4bcefb562a
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/2f781f177482200db6432209f21d8e7d662fbba3.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/308866b397e4296d95f7a55ad38313ec11c69f3b.tree b/research/joint-relations-independent-validation/custody/git-objects/308866b397e4296d95f7a55ad38313ec11c69f3b.tree
new file mode 100644
index 0000000000..77a64ecf43
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/308866b397e4296d95f7a55ad38313ec11c69f3b.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/368780035287bad0b8e9cd1a9f7da73223dfa456.tree b/research/joint-relations-independent-validation/custody/git-objects/368780035287bad0b8e9cd1a9f7da73223dfa456.tree
new file mode 100644
index 0000000000..2f56069423
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/368780035287bad0b8e9cd1a9f7da73223dfa456.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree b/research/joint-relations-independent-validation/custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree
new file mode 100644
index 0000000000..23ace97515
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/3e58974508669b0b52f53c56371b5f9c253ece4b.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree b/research/joint-relations-independent-validation/custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree
new file mode 100644
index 0000000000..47f0968618
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/46dca2d79105e0d899594be581275b404bc812cd.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit b/research/joint-relations-independent-validation/custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit
new file mode 100644
index 0000000000..b08b5f5efd
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/git-objects/4bd6efa51a495a7c7b7754915cf0244e7e60969e.commit
@@ -0,0 +1,6 @@
+tree 7c8818178b05733b5d09a6decc34d53b84fdc213
+parent 1ec1119972c9aefe42525172d07b332fcff81cb4
+author Ali Romman <226877337+aliromman@users.noreply.github.com> 1792788545 -0500
+committer Ali Romman <226877337+aliromman@users.noreply.github.com> 1792788545 -0500
+
+Research: eight joint helper relations improve conditional kappa to 0.00302666
diff --git a/research/joint-relations-independent-validation/custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree b/research/joint-relations-independent-validation/custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree
new file mode 100644
index 0000000000..8e424660cc
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/6d2b3a87d39cf33569d1b1f8a7d6177af59bd524.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree b/research/joint-relations-independent-validation/custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree
new file mode 100644
index 0000000000..8d12c62cb7
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/74e7c585a7f3c853a2927a5028db379ac86b4a34.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree b/research/joint-relations-independent-validation/custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree
new file mode 100644
index 0000000000..424a4aeae7
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/7c8818178b05733b5d09a6decc34d53b84fdc213.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree b/research/joint-relations-independent-validation/custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree
new file mode 100644
index 0000000000..1582723732
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/87cbbbc8ccf824c7a3ceadac4f7ca3b041fb8ab6.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/8bed1ecc75af648c4b5fbf888b902e89ea94de00.tree b/research/joint-relations-independent-validation/custody/git-objects/8bed1ecc75af648c4b5fbf888b902e89ea94de00.tree
new file mode 100644
index 0000000000..f79421aac5
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/8bed1ecc75af648c4b5fbf888b902e89ea94de00.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/92bd281a274191242f183544f5ebab24b7f61127.tree b/research/joint-relations-independent-validation/custody/git-objects/92bd281a274191242f183544f5ebab24b7f61127.tree
new file mode 100644
index 0000000000..d979de00ce
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/92bd281a274191242f183544f5ebab24b7f61127.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/93c3da5da0a527baf42dbbe76e7af010384def87.tree b/research/joint-relations-independent-validation/custody/git-objects/93c3da5da0a527baf42dbbe76e7af010384def87.tree
new file mode 100644
index 0000000000..d29cf9cf8e
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/93c3da5da0a527baf42dbbe76e7af010384def87.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit b/research/joint-relations-independent-validation/custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit
new file mode 100644
index 0000000000..eb78fd6a03
--- /dev/null
+++ b/research/joint-relations-independent-validation/custody/git-objects/b1ab650d36f59e5be682a813145b7c67e219e341.commit
@@ -0,0 +1,6 @@
+tree 6d2b3a87d39cf33569d1b1f8a7d6177af59bd524
+parent 1ec1119972c9aefe42525172d07b332fcff81cb4
+author Dugongue <49054532+Dugongue@users.noreply.github.com> 1792789282 -0700
+committer Dugongue <49054532+Dugongue@users.noreply.github.com> 1792789282 -0700
+
+Tighten conditional eight-relation kappa to 0.003026674765
diff --git a/research/joint-relations-independent-validation/custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree b/research/joint-relations-independent-validation/custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree
new file mode 100644
index 0000000000..6a60b762ae
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/b3abe1a63f80b453a11823d70c836b9199e7c556.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree b/research/joint-relations-independent-validation/custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree
new file mode 100644
index 0000000000..b8ad0c43be
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/bfb420045d2bc04dd026b5020aea84d547873ef4.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree b/research/joint-relations-independent-validation/custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree
new file mode 100644
index 0000000000..f799f732a4
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/c211d4eb07730865bffd69a35a85a0642acc333d.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/ca6f51bb3b6474cfa4111ebafa02b1913a807446.tree b/research/joint-relations-independent-validation/custody/git-objects/ca6f51bb3b6474cfa4111ebafa02b1913a807446.tree
new file mode 100644
index 0000000000..f07ce901bc
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/ca6f51bb3b6474cfa4111ebafa02b1913a807446.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/d520959c0a8af33980dff881ed2cf6c4703bb338.tree b/research/joint-relations-independent-validation/custody/git-objects/d520959c0a8af33980dff881ed2cf6c4703bb338.tree
new file mode 100644
index 0000000000..aa856e6ede
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/d520959c0a8af33980dff881ed2cf6c4703bb338.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree b/research/joint-relations-independent-validation/custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree
new file mode 100644
index 0000000000..8c3ce2187f
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/db06c76a46083783b675e5a5ce418c52a400d350.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree b/research/joint-relations-independent-validation/custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree
new file mode 100644
index 0000000000..a9a11c97ad
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/df0da6ab4433542c03f089e50eeaabacb89fa6a4.tree differ
diff --git a/research/joint-relations-independent-validation/custody/git-objects/e9c70b9927d6e9233633e4e88108f831e7c5c5d9.tree b/research/joint-relations-independent-validation/custody/git-objects/e9c70b9927d6e9233633e4e88108f831e7c5c5d9.tree
new file mode 100644
index 0000000000..df81143d27
Binary files /dev/null and b/research/joint-relations-independent-validation/custody/git-objects/e9c70b9927d6e9233633e4e88108f831e7c5c5d9.tree differ
diff --git a/research/joint-relations-independent-validation/receipt_guard.py b/research/joint-relations-independent-validation/receipt_guard.py
new file mode 100644
index 0000000000..5f8fe8b1e6
--- /dev/null
+++ b/research/joint-relations-independent-validation/receipt_guard.py
@@ -0,0 +1,54 @@
+"""Bind newly generated checker outputs to both frozen literal-word claims."""
+import hashlib,json
+from fractions import Fraction as Q
+
+def need(ok,msg):
+ if not ok:raise ValueError(msg)
+def fresh(root,name):return json.loads((root/name).read_bytes())
+def positive(interval):return Q(interval[0])>0
+
+def validate(root,claims,binding):
+ indexed={c['pr']:c for c in claims['candidates']}; summaries={}
+ for pr in (5383,5387):
+ suffix='' if pr==5383 else '-5387';c=indexed[pr]
+ a=fresh(root,f'agents/algebra/RESULT{suffix}.json')
+ need(a['status']=='PASS_INDEPENDENT_JOINT_ALGEBRA','Partial algebra output')
+ need((a['candidate_pr'],a['candidate_head'],a['candidate_payload_sha256'])==(pr,c['head'],c['word_payload_sha256']),'Algebra claim binding')
+ need(a['relation_rank']==8 and a['all_16_unrestricted_identities_checked'] and len(a['source_identities'])==16,'Incomplete joint identities')
+ need(a['simultaneous_snapshot_count']==8 and a['forward_entire_word_unchanged'] and a['canonical_operators_frames_unchanged'],'Incomplete literal word equality')
+ need(a['candidate_replay']['independent_retained_inputs']==624 and a['candidate_replay']['arbitrary_owned_entry_inputs']==17,'Incomplete all-column algebra')
+ need(a['independently_derived_pivots']==[225,227,229,230,241,245,257,c['last_pivot']],'Wrong retained-domain pivots')
+ need(len(a['negative_controls'])==7,'Missing algebra controls')
+ o=fresh(root,f'agents/ownership/RESULT{suffix}.json')
+ need(o['status']=='PASS_EXACT_RUNTIME_OWNERSHIP' and o['candidate_head']==c['head'],'Incomplete candidate ownership')
+ need(o['candidate_word_sha256']==binding['digests'][f"capsule/{'repository/'+c['package'] if pr==5383 else 'agents/sources/pr5387/'+c['package']}/WORD.json.gz"],'Owner output binds different word')
+ for name,retained,owned in [('backward',624,17),('forward',632,1)]:
+ item=o['result'][name];need(item['all_exact_endpoints_checked'] and item['all_owned_last_writes_are_clears'] and item['retained_arbitrary_columns']==retained and item['owned_arbitrary_columns']==owned,'Incomplete exact endpoints '+name)
+ need(len(o['mutation_controls'])==12,'Missing owner controls')
+ summaries[str(pr)]={'head':c['head'],'kappa':c['kappa'],'word_payload_sha256':c['word_payload_sha256'],'joint_rank':8,'retained':624,'owned':17}
+ inv=fresh(root,'agents/prices/INVOICE.json');price=fresh(root,'agents/prices/RESULT.json')
+ need(price['status']=='PASS_INDEPENDENT_EVENT_INVOICE_AND_EXACT_PRICES','Incomplete prices')
+ need(inv['candidate_head']==indexed[5383]['head'] and inv['successor_head']==indexed[5387]['head'],'Invoice head identity')
+ need(inv['candidate']['paid_calls']==64148 and inv['candidate']['productive_fields']==10800,'Incomplete invoice')
+ need(inv['delta']=={'paid':{'1':-128,'8':-128},'targets':{'9':-128}},'Wrong complete invoice delta')
+ need(price['invoice_sha256']==hashlib.sha256((root/'agents/prices/INVOICE.json').read_bytes()).hexdigest(),'Price/invoice mismatch')
+ for label,c in [(f'PR{pr}',indexed[pr]) for pr in (5383,5387)]:
+ v=price['variants'][label];need(Q(v['kappa'])==Q(c['kappa']) and positive(v['raw_margin']),'Price kappa/margin')
+ need(Q(v['coarse_completed_upper'])<1 and Q(v['actual_completed_upper'])<1,'Unfunded completion')
+ outer=fresh(root,'agents/outer/RESULT.json');need(outer['status']=='PASS_SCOPED_ARITHMETIC' and len(outer['candidates'])==2,'Incomplete outer replay')
+ need({x['candidate'] for x in outer['candidates']}=={'PR5383','PR5387'},'Missing outer candidate')
+ for o in outer['candidates']:
+ c=indexed[int(o['candidate'][2:])];need(o['status']=='PASS_INDEPENDENT_OUTER_AND_FINITE_COMPILER_ARITHMETIC' and o['kappa']==c['kappa'],'Outer claim binding')
+ need(Q(o['minimum_strict_slack'])>0 and all(o['compiler']['checks'].values()),'Outer/compiler failure')
+ need(Q(o['BIT']['admitted'])==Q('17/5000'),'Wrong BIT supplier')
+ # This checker publishes all strict and functional rows, not only a tally.
+ rows=o['outer'];need(len(rows['strict_checks'])==54 and len(rows['functional_checks'])==4 and all(Q(v)>0 for v in [*rows['strict_checks'].values(),*rows['functional_checks'].values()]),'Incomplete 54+4 outer ledger')
+ app=fresh(root,'run-6.stdout');need(app['status']=='PASS_SCOPED_APPLICABILITY_COUNTS_AND_GUARDS' and set(app['candidates'])=={'5383','5387'},'Incomplete applicability')
+ for pr,c in app['candidates'].items():
+ need(c['raw_controller_owned_LOCAL_banks']==274 and c['local']['backward']['owned']==17 and c['local']['backward']['simultaneous_snapshots']==8,'Incomplete expanded stock specialization')
+ claim=indexed[int(pr)]; wordpath=f"capsule/{'repository/'+claim['package'] if pr=='5383' else 'agents/sources/pr5387/'+claim['package']}/WORD.json.gz"
+ need(c['word_sha256']==binding['digests'][wordpath],'Applicability output binds a different word')
+ mutants=fresh(root,'agents/falsifier/CONTROLS-FULL.json')
+ need(mutants['status']=='PASS_SEMANTIC_MUTANTS_REJECTED' and len(mutants['controls'])==6,'Incomplete semantic falsification')
+ need(all(x['status']=='REJECTED' and x['hash_changed'] and not x['old_digest_comparison_used_for_rejection'] for x in mutants['controls'].values()),'Semantic mutant was not independently rejected')
+ return {'candidates':summaries,'paid':64148,'productive':10800,'outer_predicates_per_candidate':{'strict':54,'functional':4},'literal_same_premises':claims['assumptions']}
diff --git a/research/joint-relations-independent-validation/reports/algebra/REPORT.md b/research/joint-relations-independent-validation/reports/algebra/REPORT.md
new file mode 100644
index 0000000000..727490d247
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/algebra/REPORT.md
@@ -0,0 +1,61 @@
+# Independent joint algebra audits of #5383 and #5387
+
+Candidate: Ali Romman's `4bd6efa51a495a7c7b7754915cf0244e7e60969e`, based on canonical main `1ec1119972c9aefe42525172d07b332fcff81cb4`. Original native word: Cao Yifan's round-three source. This review owns only the algebra packet; ownership/invoice, physical applicability and acceptance have separate reviewers.
+
+The parent extended scope to Dugongue's #5387, head `b1ab650d36f59e5be682a813145b7c67e219e341`. Its literal word is separately checked. This candidate changes the eighth snapshot from event 11306/L288 to 11296/L256 and the eighth zero replacement from 17580/L288 to 17233/L256, all in frame 281; its last surrendered pivot is 261 rather than 288. Equal paid/target histograms do not imply equal word semantics or equal retained domains. No #5383 algebra receipt is inherited for this changed word.
+
+## Execution status
+
+**Both #5383 and #5387 passed separate independent full joint-algebra replays.** `RUN-REQUEST.json` requests root-only serial runs, each with a 300-second wall deadline and 1 GiB memory guard. Source custody's `coordination/SOURCE-READY.json` declares the frozen working bytes ready. No existing package or source was changed.
+
+The first full attempt failed in the independent checker's scalar parser at source event 109: the legal rational SCALE encoding `[2,-1]` carries a negative denominator. This was a checker defect, not a candidate failure. The engine now normalizes the rational sign before validating the power-of-two denominator. Follow-up cheap probes compared addition and scaling against `Fraction` for all 30 scalar encodings present across both source orientations and 1,000 additional signed random cases; all matched. Zero and non-dyadic denominator controls rejected. The failed root-run receipt is preserved; the corrected frozen checker is `3ee4ae79a55188d5abf2306f678179f4aafb799602ffb970fc1bc8f76cb061d9`.
+
+The successful #5383 result is in `RESULT.json`. It replays all 21,449 source backward events with 632 independent logical inputs plus arbitrary center dirt, derives all 16 unrestricted identities and rank-eight pivots `225,227,229,230,241,245,257,288`, then replays all 21,551 candidate backward events on 624 retained independent inputs and 17 arbitrary owned entry inputs. Every retained endpoint/frame and zero owned return passes. All eight snapshots are live simultaneously before the first center. All seven local negative controls reject. The independently counted changed local paid profile is `{1:2193,2:412,3:510,4:127,5:40}`; the source profile is `{1:2201,2:412,3:510,4:127,5:40,8:8}`. This establishes the specified algebra component, subject to the retained physical interpretation contracts.
+
+`RUNTIME.json` records the three root-serial guard receipts; their raw receipt and stdout SHA256 hashes were rechecked in this lane. The initial failed attempt took 0.504773205 seconds and sampled 83,087,360 bytes peak descendant RSS. Corrected #5383 passed in 1.107352950 seconds with 98,623,488 bytes sampled peak; #5387 passed in 1.107757847 seconds with 98,639,872 bytes sampled peak. Both successful runs exited 0 under the 300-second/1024-MiB guard on CPython 3.12.3. These are sampled-watchdog measurements, not cgroup hard memory guarantees. The raw paths and log/receipt hashes are retained in `RUNTIME.json`; the failed receipt is never overwritten.
+
+The exact source decompressed SHA256 is `cfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd`, raw source SHA256 `7679daa4ec6a40f56fc7f0202379a6f454310e94945aba4f48beaaaafb838d05`. The #5383 candidate decompressed SHA256 is `2aee5e997df99726fc763e510d9cb69fbe4f86114dc8d2cd33ad26c6c462a21d`, raw candidate SHA256 `7883ba0faefc96505bb61ca7312d588fa22dfe2164050c817c1718b8fa28693a`.
+
+The successful #5387 result is in `RESULT-5387.json`. A separate replay of all 21,449 unrestricted source events derives its own 16 identities and rank-eight pivots `225,227,229,230,241,245,257,261`. The full changed word has 21,553 backward events; it preserves its own 624 retained independent inputs and erases all 17 arbitrary owned entry inputs, with the same independently counted paid histogram and seven rejecting local controls. Its eighth unrestricted center delta, in frame 281, is minus one quarter of
+
+```
+h225 - h257 + h259 + h261 - h263 - h268 + h269 + h270 - h271
+ - h324 + h326 + h328 - h333 - h384 - h388 + h390 + h391 + h392 - h397.
+```
+
+The actual saved row comes from L256 after source event 11296; its later unrestricted row at event 17233 is the negative of this center delta. Consequently #5387 retains arbitrary L288, whereas #5383 makes L288 an owned dependent pivot and retains L261. This is a real algebra/domain difference despite their common invoice. The #5387 decompressed word SHA256 is `9aa0d7112b4e13f1aa13a93dab0af6f4435ffe99b842aad841685becdafee492`, raw SHA256 `6412632c28e265597fb088087048091d81c19500fb28a0c9c9d2a48f61b8665b`. Both results bind the corrected frozen checker hash above. Dugongue receives credit for the #5387 modified word/compiler-margin contribution, alongside Ali Romman's credited predecessor mechanism and Cao Yifan's source word.
+
+Executed cheap prechecks under a 15-second CPU/wall limit and 128 MiB address-space cap:
+
+- Python syntax parsed successfully.
+- 1,000 deterministic dyadic row additions agreed with a separate `fractions.Fraction` implementation.
+- Free-generator inverse cancellation worked; distinct generators remained noncommuting.
+- Literal delta decoding found 62 preparation events, eight snapshot captures, eight center replacements, eight later zero replacements and eight final pivot clears. All eight snapshot captures precede the first center replacement.
+
+`probe_engine.py` and `PROBES.json` retain a reproducible version of the final cheap arithmetic checks: 2,060 exact addition/scaling comparisons, all 30 actual signed source encodings, the three invalid-denominator rejections, free inverse/noncommutation checks and alternate-pivot reduction. The saved probe ran successfully under the same hard 15-second/128-MiB limits. The separate literal delta decoding was read-only inspection; the full science receipts repeat and enforce it.
+
+## Independent method
+
+`check_joint.py` imports no author checker, native interpreter, expected `RESULT.json`, `VERIFY.json`, relation basis or `WITNESS.json`. It reads only the actual original and candidate word JSON. It decodes their chronological correspondence: every original event is retained in place except the named center/zero replacements, and every insertion has an exact position and frame. This is stronger than comparing separate operation-kind subsequences.
+
+The new row engine represents each register as integer numerators over a common power-of-two denominator. Terms are pairs `(independent input, reduced free operator word)`. Row addition uses integer arithmetic and normalization; warp action prefixes a signed generator and cancels only its adjacent inverse. This is separately implemented from the author's dictionary of per-term Fractions and predecessor interpreter.
+
+An unrestricted source replay retains all 632 independent logical inputs and arbitrary initial center dirt. At each literal snapshot and center it records the full formal row. The center-minus-snapshot rows are derived from those actual rows, rather than read from declared relations. They must contain only scalar cold helper inputs. At the actual later zero sites, the unrestricted row must equal the negative of its matching center delta. Eight exact source differences plus eight later rows give the 16 identities.
+
+A conventional exact rational matrix reduction of the eight derived rows determines the common rank and canonical reduced pivots. A second elimination with the actual prepared pivot columns first checks that those chosen columns have full rank and derives their unique assignments. The emitted preparation must equal these independently derived assignments. Thus a valid alternative pivot choice is allowed; no declared author relation or basis is accepted as an oracle. No pivot is allowed to occur on another pivot's right-hand side; all nonpivot coefficients must be dyadic. These checks establish simultaneous preparation for arbitrary nonpivot inputs, rather than assuming that eight separately valid substitutions commute. A cheap separate probe checked matrix reduction with two different valid pivot sets.
+
+The changed backward program is then replayed on all 624 retained independent inputs plus all 17 arbitrary owned entry inputs: eight helper pivots and nine C registers. Every scalar frame, paid transition, native warp, zero replacement, retained endpoint and final frame is checked. Owned fields must return zero. The forward literal program and all canonical frames/operators must match the original exactly; no new forward semantics are claimed by this checker.
+
+## All-column lift
+
+A formal row is a finite sum of rational coefficients multiplying reduced words acting on independent vector inputs. For any positive width, assign each generator its actual source tensor-power operator and its inverse the inverse operator. Evaluation respects concatenation and adjacent inverse cancellation, so every formal free-word identity remains an identity of operators at that width. Rational coefficients stay outside evaluation. In particular, the argument never distributes a tensor power over a sum.
+
+The pivot preparations use same-frame scalar linear operations, so setting their eight scalar relations to zero imposes the corresponding vector relations on entire payloads. Their independent reduced pivot system leaves the 624 other payloads arbitrary. Same-frame COPY then substitutes exactly the derived source value, and a complete zero vector is fixed by the removed linear Gaussian transition. Chronological preservation follows through each unchanged event. This argument is conditional on the retained native realization and allowed owned-erasure assumptions; it does not establish those assumptions afresh.
+
+## Controls and limits
+
+The planned full run contains local exact controls for a wrong preparation coefficient, sign, pivot, snapshot, COPY gauge, zero row and missing independent relation. These test the independent derived algebra or literal frame contract. An independent falsifier has been given the direct in-memory replay entry for stronger changed-program controls, including arbitrary owned dirt; their receipts are separate.
+
+No source absolute-phase lowering, finite physical tape execution, all-size compiler theorem, pricing/outer inequality or Lean proof is performed here. Source phase and physical interpretations remain inherited assumptions and independently assigned reviews. Algebra-only success must not be described as complete conditional admission.
+
+The low-level `replay` entry is an algebra-and-frame engine, not a standalone validator of every admissible physical scalar recipe. In particular, its SCALE action accepts algebraic dyadic rationals beyond the unit-power-of-two physical SCALE grammar. For the two fixed audited words, the full `decode_edits` chronological source binding and independently derived preparation equality prevent any such extra opcode from being introduced: retained SCALE operations are literal source operations and all new preparation scalars are the checked ADD/CLEAR assignments. The pricing review separately checks the physical scalar allowance grammar. The falsifier identified and bounded this interpreter-interface limitation; it is not a candidate defect.
diff --git a/research/joint-relations-independent-validation/reports/algebra/RUN-REQUEST.json b/research/joint-relations-independent-validation/reports/algebra/RUN-REQUEST.json
new file mode 100644
index 0000000000..a612de2042
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/algebra/RUN-REQUEST.json
@@ -0,0 +1,18 @@
+{
+ "task": "independent_joint_algebra_5383",
+ "status": "ready_for_root_serial_queue",
+ "checker_sha256": "3ee4ae79a55188d5abf2306f678179f4aafb799602ffb970fc1bc8f76cb061d9",
+ "prior_run_failure": "First full attempt rejected legal signed-denominator SCALE at source event109. Checker corrected by rational sign normalization; failed root receipt preserved. All30 actual scalar encodings and1000 signed random additions/scalings then matched independent Fraction arithmetic; three invalid-denominator controls rejected.",
+ "cwd": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453",
+ "command": ["python3", "-B", "swarm-execution-sol-high-20261024/agents/algebra/check_joint.py"],
+ "wall_deadline_seconds": 300,
+ "memory_limit_bytes": 1073741824,
+ "heavy_execution_owner": "root",
+ "intended_property": "Decode actual candidate edits without WITNESS data; replay unrestricted original backward source over free noncommuting words; derive rank-eight helper system and all16 COPY/zero identities; verify actual simultaneous pivot preparations; replay candidate on624 retained and17 arbitrary owned entry columns; reject seven exact local algebra mutants.",
+ "output": "swarm-execution-sol-high-20261024/agents/algebra/RESULT.json",
+ "second_candidate_command": ["python3", "-B", "swarm-execution-sol-high-20261024/agents/algebra/check_joint.py", "--candidate", "swarm-execution-sol-high-20261024/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz", "--candidate-pr", "5387", "--candidate-head", "b1ab650d36f59e5be682a813145b7c67e219e341", "--out", "swarm-execution-sol-high-20261024/agents/algebra/RESULT-5387.json"],
+ "second_candidate_property": "Independently check actual changed eighth snapshot11296/L256, later zero17233/L256 and different joint relation/pivot261. Do not reuse5383 actual word semantics.",
+ "source_readiness": "coordination/SOURCE-READY.json READY_FOR_INDEPENDENT_READS",
+ "prechecks_executed": ["AST syntax", "1000 independent Fraction comparison probes for dyadic engine", "free inverse cancellation and noncommutation", "literal patch decoding:62 preparation events,8 snapshots,8 centers,8 zeros,8 pivot returns"],
+ "precheck_resource_limits": {"cpu_seconds":15,"wall_seconds":15,"address_space_bytes":134217728}
+}
diff --git a/research/joint-relations-independent-validation/reports/applicability/FOUNDATION-SOURCES.json b/research/joint-relations-independent-validation/reports/applicability/FOUNDATION-SOURCES.json
new file mode 100644
index 0000000000..670274a10e
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/applicability/FOUNDATION-SOURCES.json
@@ -0,0 +1,14 @@
+[
+ {
+ "pin": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "path": "research/pr4359-p7-padding/source/research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md",
+ "local": "swarm-execution-sol-high-20261024/agents/applicability/FINITE-PRECOMPILATION.md",
+ "sha256": "4cb32f6b8e388ecf6ed41b5bbdeeb4539cb40c8424f194974afea58f7e0921e8"
+ },
+ {
+ "pin": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "path": "research/pr4359-p7-padding/source/research/kappa-rebuild/transfer-audit/FINITE-TEMPLATE-CLOSURE.md",
+ "local": "swarm-execution-sol-high-20261024/agents/applicability/FINITE-TEMPLATE-CLOSURE.md",
+ "sha256": "3f8508c63862dd83968bd30df91b08ba5afcee1e10db15ca546cdff0caef95d9"
+ }
+]
diff --git a/research/joint-relations-independent-validation/reports/applicability/REPORT.md b/research/joint-relations-independent-validation/reports/applicability/REPORT.md
new file mode 100644
index 0000000000..b379ffa530
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/applicability/REPORT.md
@@ -0,0 +1,132 @@
+# Joint eight-relation physical/compiler/precision applicability
+
+**Decision: scoped positive conditional specialization**, subject to the separately assigned unrestricted source identities, joint ownership/return, authenticated source phase foundation, completed invoice, directed moments and BIT/outer reviews. This is not a complete admission receipt. Exact candidates are Ali Romman's #5383 `4bd6efa51a495a7c7b7754915cf0244e7e60969e` and Dugongue's #5387 `b1ab650d36f59e5be682a813145b7c67e219e341`, against canonical main `1ec1119972c9aefe42525172d07b332fcff81cb4`, selected conditional kappa `.0030217758`.
+
+The new small checker imports no candidate evaluator. Its final run took under one second with hard 15 second CPU/128 MiB address-space limits. No uniform word, Lean, solver, heavy suite or external mutation ran here. `CHECK.json` binds both actual literal words and receipts; `FOUNDATION-SOURCES.json` binds the two copied canonical compiler/precision proof notes. Original work retains Ali Romman, Dugongue, Cao Yifan, Cinna Davis, Chris R / Clear1nsight, zxv, Jacob Alan Sussman, ToikY and all selected predecessor credit. This review used substantial OpenAI assistance.
+
+## Same quantified physical class
+
+The exact selected `research/final4610-independent-admission/SPECIALIZATION.md` permits fixed finite Gaussian-dyadic monomial/positive-child programs, arbitrary complete spectators, dyadic ADD/SCALE, owned COPY/CLEAR, complete two-sided adapters, fixed role/coordinate matchers, and distinct banks for suspended occurrences. Signed source phase classes are reused through authenticated selected foundation coverage. Neither rank, tableau nor a receipt's PASS label proves phase equality.
+
+For each positive integer f, evaluate every free generator at its inherited f-column source operator and every inverse at its inverse; keep rational coefficients outside this representation. This algebra homomorphism preserves the separately proved unrestricted identities for arbitrary nonseparable inputs. The scalar word is not tensor-powered. Monomial phases remain `a*f+sum_j q(x_j) mod4`. The checker verifies exact equality of the retained warp/adapter/phase itinerary in both words. No tensor power is distributed over a sum.
+
+Ideal algebra applies for every f>0. Physical tariffs retain `f<=p`, address bound `A=O(p)`, `K/log p -> infinity`, complete compact/control fields, restored dirty temporaries, and the source superpolynomial record fiber. At the eventual caller `f<=e<=floor(b_in^epsilon)`, `p=6*b_in`, with fixed epsilon<1. Binary row addition, swap and unit quadratic phase retain descriptor/repair charges. No extra gather, blank productive input, numerical zero predicate, field extension or changed movement exponent is introduced.
+
+## Exact operation and owner specialization
+
+The checker independently follows every scalar exact-frame contact and every warp/climb frame update; counts scalar tariffs/paid ranks; checks unchanged forward/canonical records; follows all snapshot lifetimes; and checks cold preparation uses only cleared owned pivots and nonpivot independent sources. It does not independently prove free-word identities: the algebra/ownership reviewers own the 16 unrestricted identities and full return proof.
+
+Every same-frame COPY targets a distinct cleared owned slot with scalar coefficient 1. At a center replacement its saved row and the old output have the same exact physical frame, so the proved logical equality includes the inherited gauge. At each zero marker the independently proved full row is zero; physical identity preserves zero in the common ambient space. The marker does not implement arbitrary nonzero frame transport. Approximate residuals must be bounded through the actual new circuit, which executes identity there; they cannot be assumed to vanish. The fresh semantic guard below concerns this actual circuit and the retained single fine-grid format.
+
+| Candidate | Owned L pivots | Backward scalar allowance | Simultaneous snapshots | Backward owners |
+|---|---|---:|---:|---:|
+| #5383 |225,227,229,230,241,245,257,288|158744|8|17|
+| #5387 |225,227,229,230,241,245,257,261|158776|8|17|
+
+Each forward has one C0 owner and allowance 158120. The 16 backward/2 forward LOCALs conservatively require `16*17+2=274`distinct complete owned banks before query/product/completion/compiler owners. L pivots reuse their physical slots and lose productive credit. Every suspended compiled occurrence gets its own tagged C0..C8 and pivot banks. A child may act on a correlated value on its parent's field, but its own banks are distinct; adapters/order return before its parent resumes. This is the selected arbitrary-input completed-child ABI. Eight live snapshots alone disprove one-bank-per-depth allocation. Borrowed fields cannot be cleared.
+
+Both backward paid profiles are `{1:2193,2:412,3:510,4:127,5:40}`. The invoice reviewer independently verifies 64148 paid/10800 productive and the joint loss 128 H 9 targets with deletion 128 H 1+128 H 8 paid. This report gives no productive credit to any private pivot, snapshot, query scratch or parked bank.
+
+## Constructive expanded integer bound, for every top rank
+
+The copied canonical `FINITE-PRECOMPILATION.md` gives exact integer lockstep flow, product clearing of smaller program widths, complete chronological substitution and one bank per relevant unit instance. The copied `FINITE-TEMPLATE-CLOSURE.md` gives the semantic/stock specialization. We give a conservative computable integer bound for these permitted explicit construction choices; no raw 10^9 cap becomes an expanded cap.
+
+First bound the strictified mixed unit, after its 1024-fold chronological product, charged completion and disjoint splitting. The raw controller's combined scalar/movement/phase/owner inventory is below 2^40: its charged raw 181098496<2^28, paid/independent arrays<2^17, rank 145<2^8, complete 9 axis recipes 342 records<1000 and 274 LOCALowned banks, with queries and return routes included. This is a record envelope, not a count of literal tape steps.
+
+For q raw factors, Cartesian role and paid/target label inventories have at most `(2^40)^q`entries. Chronological product substitution charges each copied circuit record and bank by its factor position and paired Cartesian role/paid labels. Thus `q*4^q*(2^40)^(2q)`is a conservative bound before whole-job routes. At q=1024 its ambient rank `m=145^1024<2^8192`. Completing a job uses at most m disjoint unit-axis jobs; splitting gives at most m pieces. Binary coordinate matchers and phases have row-elimination recipes bounded 64(m+1)^3 per whole-field record, and role ordering takes at most the square of the role inventory in swaps. Writing q=1024, the pre-route record logarithm is at most `82*q+10`. Completion and splitting multiply records by at most `m^2`, adding at most `2*8192`. Conservatively square that ENTIRE inventory for routing, and multiply by `64*(m+1)^3`. Its logarithm is at most `2*(82*1024+10+2*8192)+6+3*8193=225309<262144`. This directly pays both the role-square and rank-router factors. Therefore a common envelope for arities, records, coefficient-height charge, productive/paid/owned inventories and routers of this fixed strictified unit is
+
+`D=2^262144`.
+
+The coefficient allowance here is an integer SUM of elementary dyadic magnitude/denominator increments and unit-phase allowances, not the bitlength of that sum. Unit phases/permutations have zero height but retain record costs. Preparation coefficients are dyadic; the scalar tariff dominates their logarithmic height increment. Completion/splitting use canonical full jobs and monomial matchers, not new scalar mixing. Thus the same positive record envelope bounds G as a value.
+
+Define the following integer recursion:
+
+```
+F(0)=D
+X_n=(n+1)*(D+1)*(F(n-1)+1) (n>=1)
+F(n)=X_n^(16*(n+1)^2) (n>=1)
+```
+
+F is monotone and effectively computable by a terminating primitive recursion. We claim F(n) bounds every count W_n/P_n/O_n/R_n/G_n and complete emitted record inventory at top rank n, with concrete choices: use the product of distinct needed smaller widths as denominator clearing factor; sequential rank-one kernels in the finite base range; fresh tagged banks for every relevant instance; row elimination and swaps for complete coordinate/role routes. These choices are explicitly permitted by the source compiler and require no optimization oracle.
+
+Proof by strong induction. Base programs have one array and n elementary kernels. In a nonbase integer flow, the minimum target rank is at least 2, so depth `G<=log2(n)=1; every smaller expanded program has at most F(n-1)records/banks. Their complete incidence, primitive mixed units, ordinary base kernels and all tagged owner lifetimes therefore fit
+
+`I_n <= X_n^(3*n+5)`.
+
+At most the square of the incidence count suffices for role permutations/allocation maps; a cubic overestimate also covers instruction/descriptor passes, forward/inverse adapters and every boundary occurrence. A rank-n coordinate map and phase need at most 64(n+1)^3 elementary records. Thus all counts and emitted records fit
+
+`64*(n+1)^3*(I_n+1)^3 <= X_n^(9*n+20) <= F(n)`.
+
+The last inequality holds for EVERY n>=1 because `16*(n+1)^2-(9*n+20)=16*n^2+23*n-4>=35`; preceding inequalities use only the explicit factors of X_n and X_n>128. This proves the all-n induction. The check's finite exponent probes corroborate this algebra and are not its proof.
+
+For each candidate let `N=2^H`, `M=F(N)`and use the fresh envelopes
+
+```
+W_actual,P_actual,O_actual,R_actual,G_actual <= M
+Wbar=Pbar=Obar=Rbar=Gbar=M
+Zbar=Wbar+Obar=2*M
+Ebar=64*(Zbar+N+Pbar+Gbar+1)^3
+Bbar=Pbar+Ebar
+C0bar=32*N*Bbar^2
+```
+
+Actual W/P remain in the efficiency inequality. A larger envelope supplies no productive output and cannot improve P/W. F(N) is an explicit, terminating integer definition, not a practical numeric expansion. It is fixed before multiplication input growth and differs between candidate heights. No expanded word is materialized.
+
+## Semantic recurrence, error, stock and effective thresholds
+
+A completed u-axis child adds at most u to denominator excess and magnitude exponent. Unfinished child internals are not parent operands; return is never rounded or re-encoded. Monomial permutations/unit phases add zero coefficient height. Gbar includes the new dyadic preparation and erased-storage passes. The fresh cubic envelope satisfies
+
+`2*Gbar*Zbar^2+8*Pbar+4*Zbar+4+32*N=1 and N>=2, `2*Bbar*(N-1)>=Pbar+Ebar` proves by induction `A(e)<=2*Bbar*e`. Disjoint completed pieces plus the retained 18*e prefix/normalization allowance then give `A_layer<(2*Bbar+18)*d=1 and rational epsilon=a/b in(0,1), with `d<=c*p^epsilon`, set
+
+```
+Lprec=bit_length(4*C0bar*ceil(c))
+tprec=max(4,ceil(b*Lprec/(b-a)))
+p_prec=2^tprec
+```
+
+For p>=p_prec, `p^(1-epsilon)>4*C0bar*c`; hence Delta=C0bar*d<=p/4 and the selected signed fine-grid component takes at most 2 p bits. This is a computable threshold expression in the fresh constants, not a new numerical precision model. Conditioning, fine-grid correctness and exact recovery remain the selected conditional prescription.
+
+For ordinary recursion use `Dord(e)=0`for e=2^(2*(Lstock+2))`, the combined reserve takes at most `Lstock*log2(d)4*Lstock*t` holds at t=2(Lstock+2) and is monotone thereafter. Pad complete rows once to the next multiple of the entire stock product, with factor below 2. Owned volume gains no productive credit. This safe over-reservation includes all simultaneous tagged banks instead of assuming one bank per depth.
+
+Also require `d^beta>=2*N`above stopping, for example `d>=ceil((2*N)^(1/beta))`. Take the maximum of semantic/stock/stopping cutoffs and the selected movement/descriptor cutoffs for the new fixed Rbar and N. If the retained superpolynomial record-fiber domain is stated only asymptotically, its own domain-entry threshold remains part of that retained hypothesis; no numerical growth rate is invented here. Once inside that domain, the new fixed dimensions, tape inventory and descriptor polynomial degrees fit the same premise. Depth-first execution parks every parent's fields, banks and descriptors while its child runs. There are at most `Pbar^Dord(d)=d^O(1)`ordinary nodes, with a fixed degree. This changes constants and eventual cutoffs, preserving the source movement exponent and spectator restoration.
+
+## Exact compiler guard and endpoint scope
+
+| Candidate | Claimed kappa | Tested saving | Reserve | H | j | Outer gap |
+|---|---|---|---|---:|---:|---|
+| #5383 | .00302666 | .00302667 | 1 e-9 | 31385200000000 | 44836 | 1/700000000 |
+| #5387 | .003026674765 | .003026674766 | 1 e-12 | 409549000000000000 | 58507 | 1/7000000000000 |
+
+The checker directly verifies `(H+1)^1000<2^j`, failure at the preceding sufficient grid, splitting 20^64<21^63, both 97/100 tail-block guards, the product-rank initial size, and `1000*gap>1/(H+1)`. The latter makes the retained logarithmic-majorant ratio decrease beyond its threshold. It directly recomputes
+
+`normalized=1/(1+1024*reserve)+4/2^32<1`.
+
+Slacks are `2145530521/2097154147483648`and `97179323/1048576001073741824`respectively. With reserve 1 e-13 the same rounding budget fails. A prior 1 e-9 reserve cannot be applied at the new tested endpoint without a fresh alpha inequality. The independent price reviewer owns that interval premise, gamma/delta paid and target tails, eta/complement capacity, the actual 54 strict+4 functional outer ledger and BIT interface. An author interval receipt is not independently proved by reading it here.
+
+M=F(2^H) and all stock/precision cutoffs differ between candidates even though the recursive profile is the same. The exact compiler's W/P, rather than the extravagant count majorant, determines efficiency. Majorant inflation changes fixed stock/error constants and eventual thresholds, without creating uncharged child calls. #5387 is a funded reserve refinement of the same paid profile, not a new native saving.
+
+## Reuse, controls, invalidations and limits
+
+`check_applicability.py` and final `CHECK.json` are fresh read-only evidence. Mutants reject borrowed erase, missing snapshot owner, altered retained phase/warp itinerary, one-bank storage, stale raw cap and insufficient completion reserve. An initial checker failed on an unhandled inert adapter marker; one deep-copy mutation version exceeded its hard 128 MiB address-space limit. Explicit marker handling and shallow isolated mutations corrected these implementation/resource failures before the final passing run. Neither failure is mathematical evidence against a candidate.
+
+#5384 can supply the unchanged generic COPY/zero/all-f/selected-grammar lemma and authenticated phase foundation. Its single-relation stock/input inventory, scalar charge, compiler H/reserve and endpoint cannot certify these joint candidates. #5387 additionally changes its pivot choice from L288 to L261, invalidating literal #5383 preparation/owner evidence even though its paid profile matches. Exact joint identities, preparation rank, full owned returns, complete invoice, intervals, BIT/outer predicates, closed source replay and final independent acceptance remain separate coordinator obligations.
+
+The five retained assumptions remain native_all_columns, owned_erasure, compiler, precision_tape and analytic_recovery in their selected quantified domains. This report provides the candidate-specific finite specialization and fresh computable envelopes. It does not discharge those physical/analytic frameworks, supply independent human or formal-kernel review, publish anything, change selection, or prove an unconditional multiplication theorem.
diff --git a/research/joint-relations-independent-validation/reports/falsifier/CODE-AUDIT.md b/research/joint-relations-independent-validation/reports/falsifier/CODE-AUDIT.md
new file mode 100644
index 0000000000..9ed775977d
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/falsifier/CODE-AUDIT.md
@@ -0,0 +1,38 @@
+# Independent code scope audit
+
+This is a source review and falsification log, not unconditional theorem acceptance.
+Frozen main `1ec1119972c9aefe42525172d07b332fcff81cb4`; PR5383 `4bd6efa51a495a7c7b7754915cf0244e7e60969e`.
+
+## Author delta review
+
+`native.py` jointly row-reduces all eight helper relations and checks no preparation depends on another pivot. All relation inputs are common frame-zero helper inputs with rank-nine endpoints. The source constructor creates eight distinct scratch roles, takes captures after their stated production events, clears each center before copying its snapshot and clears snapshots after consumption. Eight pivot fields are owned and receive no productive credit. Every original retained column and owned initial dirt column is symbolically independent. Thus none of the usual silent-zero/cyclic-preparation/borrowed-erasure faults is visible in this implementation.
+
+The all-column row representation is rational free-group algebra: each warp prepends one signed generator, cancels only the adjacent inverse and leaves coefficients external. Group multiplication is injective on word keys. This supports the written termwise tensor evaluation, conditional on the actual signed native operator realization. Binary frame rank alone would not prove absolute phase, but phase is source-authenticated here rather than newly inferred from rank.
+
+The author runs both directions and compares the reconstructed entire candidate with its published word. Those are useful consistency checks, but a mutation rejected only by final published-word equality is not an independent semantic rejection.
+
+The author phase reuse function compares canonical geometry and each warp/adapter/phase subsequence separately. Taken alone that permits some event interleavings. The fixed constructor and whole-word equality constrain this exact submission; the independent audit must preserve that chronological binding explicitly. New algebra and ownership zippers both do so, discovering legal insertions/replacements while comparing every other source event in order. This resolves the initial phase-marker chronology concern for the actual candidate.
+
+## New independent checker review
+
+`agents/algebra/check_joint.py` imports no submitted Python evaluator, uses dyadic normalized integer rows, derives source center-minus-snapshot relations from source rows, performs conventional matrix RREF, and verifies actual preparation against that RREF. Its whole-source zipper binds unchanged native/phase/adapter chronology. Its candidate replay starts with arbitrary formal columns for all 632 logical and nine C roles and checks every retained output and owned return. Source rows, not author WITNESS/RESULT labels, establish the sixteen identities. Its direct `replay` entry bypasses payload pins and is appropriate for semantic mutation tests. The first root replay exposed a legal negative-denominator SCALE encoding that its initial parser rejected; the algebra owner normalized sign and checked all 30 actual source scalar encodings plus 1,000 signed random Fraction comparisons. The failed receipt remains a checker failure, not candidate evidence. The low-level replay accepts general dyadic SCALE values; full chronological source binding prevents adding nonunit/zero SCALE instructions and pricing separately checks the physical grammar. This interface limit was reported and documented. This script's forward reuse is explicit and justified by exact entire-word source equality.
+
+`agents/ownership/check.py` separately discovers pivot owners, captures, source jobs and lifetimes by chronological comparison; it checks distinct simultaneous C1..C8 banks, production-before-capture, unique reads, immediate retirement, legal dirt erasure and full output return. Exact mode independently interprets arbitrary columns; structural mode alone does not prove the zero rows. Invoice credit remains a separate obligation. Its stricter immediate-clean COPY discipline is acceptable for this exact witness, without claiming completeness for other legal algorithms.
+
+`agents/prices/check_prices.py` derives paid dimensions from event endpoints and helper credit from actual owners before constructing the controller bill. Its rational integer interval code uses outward rounding, finite atanh logarithm with explicit remainder and exponential Taylor with geometric remainder. This is independently coded arithmetic on common primary inputs. One control defect was found: `unearned_128_H9` initially constructed a changed target histogram then merely wrote a rejected label without executing any rejection predicate. Pricing owner repaired this by adding `validate_invoice_claim`: the actual event-derived bill is compared against the proposed bill, and the +128 H9 mutant is passed through it with a recomputed JSON hash and captured `ValueError`. Reviewed repaired code and its final `prices/RESULT.json` receipt: the mutant is rejected with `Proposed targets disagrees with literal event-derived census`, and its proposed-invoice SHA256 is recorded. The receipt binds repaired checker `e5f828e06b896723da4b58ca8c780609b8b94bde374a2ffeda1cab143323a335`. No wrong candidate invoice followed from the original control defect.
+
+`agents/applicability/check_applicability.py` correctly treats finite counts/grammar checks as scoped. Its initial expanded F/M recurrence was an asserted symbolic string supplemented by a finite n<1000 exponent sample. That is insufficient by itself to prove all-n compiler domination. Applicability owner supplied a written all-n strong induction, complete f,p/slot/restoration-domain specialization, fresh G-as-value/precision/stock constants and tagged 17-bank ownership per suspended occurrence. I reviewed those steps. The initial D exponent bookkeeping did not explicitly dominate the role-square route; this was corrected to `2*(82*1024+10+2*8192)+6+3*8193=225309<262144`, paying product records, completion/splitting, square of the full incidence inventory and rank routers. This resolves the expanded-count gap conditionally. Final reviewed applicability REPORT SHA256 is `500080de09e17619d7e9b34ca910fc242fa6691d377d5af9f7fa3de8b529832b`.
+
+`agents/outer/check_outer.py` independently transcribes and recomputes the retained 54+4 rational predicates and compiler integer grid. Its stated dependence on separate moment/invoice and physical lanes is correct; a scoped outer arithmetic PASS is not full candidate acceptance.
+
+## Semantic control design
+
+`check_mutants.py` changes actual PR5383 WORD data in memory, recomputes each full canonical payload digest, then invokes the independent mathematical replay or chronological parser directly. There is no comparison against a prior digest in the rejection path and no submitted author evaluator import.
+
+Cheap bounded controls already rejected (see CONTROLS-CHEAP.json): displacement of a phase/adapter marker across an adjacent unlike event while preserving all per-kind subsequences; laundering pivot L225 into borrowed/productive status while retaining its CLEAR. All six controls now passed under root serial execution; `CONTROLS-FULL.json` binds the final algebra checker `3ee4ae79a55188d5abf2306f678179f4aafb799602ffb970fc1bc8f76cb061d9`. Removal of arbitrary owned entry clear and reversed preparation sign each fail an exact retained endpoint. Same-frame wrong source L63 passes the initial gauge check and later fails `physical identity requires complete zero row`; omitted owned output clear fails owned return. The five replay controls test algebra/ownership; the displaced-marker control tests exact chronology. Full elapsed time recorded is 1.936 seconds. This is actual semantic rejection, independent of recomputed payload hashes.
+
+The initial manifest build exceeded the hard 128MiB address-space cap by keeping six full deep copies. This was a resource failure, not a mathematical result. The implementation now forks shallow immutable event lists and copies only changed events. Manifest and cheap controls subsequently completed under hard 15 CPU seconds / 128MiB address space. Full mathematical replay remains root-serialized.
+
+## Distinct successor caution
+
+PR5387 has the same economic profile but changes the eighth capture/zero site and pivot from 288 to 261. Sharing histograms does not establish sharing source identities or ownership. A separate exact semantic audit of its actual word is required. The parent and algebra worker are aware; this falsifier's current actual-word mutation harness names PR5383 explicitly.
diff --git a/research/joint-relations-independent-validation/reports/falsifier/EARLY-FINDINGS.md b/research/joint-relations-independent-validation/reports/falsifier/EARLY-FINDINGS.md
new file mode 100644
index 0000000000..702ec39b19
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/falsifier/EARLY-FINDINGS.md
@@ -0,0 +1,13 @@
+# Independent falsifier: early findings
+
+Frozen target: PR5383 `4bd6efa51a495a7c7b7754915cf0244e7e60969e`, canonical base `1ec1119972c9aefe42525172d07b332fcff81cb4`.
+
+Read the plan and complete author native/price verifier. No mathematical counterexample found at this stage. Source files and other workers' files remain unchanged.
+
+1. The author endpoint replay initializes every logical field and owned scratch with an independent formal column, clears only owned destinations, skips productive credit for all eight pivot fields, and checks arbitrary-column endpoint/owned return. Its simultaneous preparation eliminates other pivots exactly; it does not simply apply eight unproved single-relation copies.
+2. Source phase is reused rather than freshly replayed. Candidate construction retains source canonical data and each warp/adapter/phase subsequence, but that per-kind check alone does not bind arbitrary interleavings. Our independent checker should bind chronological event correspondence and exception sites, not rely on per-kind multisets/subsequences.
+3. Full author verification reconstructs WORD from source, so many mutations would be rejected merely as transport/serialization mismatch. Semantic controls must call mathematical/lifetime engines on mutated candidate content directly, with canonical payload hashes recomputed, and report that no old-hash comparison caused rejection.
+4. Potential stale numerical caps require the independent physical worker: author raw nonrecursive allowance and scalar L1 values do not by themselves establish expanded compiled stock/precision. This is an applicability obligation, not currently a demonstrated candidate error.
+5. Strong controls still needed: same-frame snapshot swap among live C slots (use a controlled same-frame miniword if exact snapshots have distinct frames); coherent helper-credit reinsertion; missing clear at entry with owned arbitrary dirt; source phase-marker displacement; duplicated pivot encoded with changed basis; zero replacement on a nonzero full row even if a chosen numeric evaluation vanishes.
+
+Pending: cheap exact structure probe; inspect independent worker code once written; coordinate semantic controls without duplicating heavy free-word replay. No scientific acceptance yet.
diff --git a/research/joint-relations-independent-validation/reports/falsifier/RUN-REQUEST.json b/research/joint-relations-independent-validation/reports/falsifier/RUN-REQUEST.json
new file mode 100644
index 0000000000..cfefb89eec
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/falsifier/RUN-REQUEST.json
@@ -0,0 +1,12 @@
+{
+ "status": "REQUEST_ROOT_SERIAL_ONLY",
+ "task": "six direct semantic mutants of actual PR5383 word, all canonical payload digests recomputed",
+ "command": ["python3", "-B", "agents/falsifier/check_mutants.py", "--mode", "full", "--out", "agents/falsifier/CONTROLS-FULL.json"],
+ "cwd": "swarm-execution-sol-high-20261024",
+ "wall_seconds": 300,
+ "sampled_descendant_rss_mib": 1024,
+ "expected_cost": "five mathematical backward replays, one cheap source-chronology decode; no imported author code or independent identity replay",
+ "warning": "Do not treat manifest-only evidence as actual rejection. Existing manifest generation completed under 15 CPU seconds and 128MiB hard address-space cap after replacing simultaneous deep copies with shallow read-only variants. The first manifest attempt hit the 128MiB cap and is not mathematical evidence.",
+ "output": "agents/falsifier/CONTROLS-FULL.json",
+ "dependency": "agents/algebra/check_joint.py"
+}
diff --git a/research/joint-relations-independent-validation/reports/falsifier/SAME-FRAME-CONTROL.json b/research/joint-relations-independent-validation/reports/falsifier/SAME-FRAME-CONTROL.json
new file mode 100644
index 0000000000..a565d5ca44
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/falsifier/SAME-FRAME-CONTROL.json
@@ -0,0 +1 @@
+{"status":"PASS_CHEAP_EXACT_FRAME_TRACE","candidate_head":"4bd6efa51a495a7c7b7754915cf0244e7e60969e","candidate_event":11269,"copy_target":"C1","copy_frame":254,"original_source":"L92","original_source_current_frame":254,"mutant_source":"L63","mutant_source_current_frame":254,"purpose":"Wrong snapshot mutant preserves source/destination gauge; rejection must address later nonzero row or endpoint rather than immediate frame mismatch","hard_cpu_seconds":15,"hard_address_space_bytes":134217728,"full_symbolic_rows_replayed":false}
diff --git a/research/joint-relations-independent-validation/reports/outer/REPORT.md b/research/joint-relations-independent-validation/reports/outer/REPORT.md
new file mode 100644
index 0000000000..7628d561c4
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/outer/REPORT.md
@@ -0,0 +1,103 @@
+# Independent BIT, outer and finite compiler arithmetic review
+
+**PASS for the scoped rational arithmetic of both pinned endpoints.** This lane checks Ali Romman's #5383 at `4bd6efa51a495a7c7b7754915cf0244e7e60969e`, κ `.00302666`, and Dugongue's #5387 at `b1ab650d36f59e5be682a813145b7c67e219e341`, κ `.003026674765`. It establishes 54 strict outer inequalities, four additional stock/semantic predicates, retained ordinary BIT arithmetic and the sufficient finite compiler's integer threshold. This is a component of same-premise conditional admission. It does not establish native/ownership/physical applicability, promote selection, or prove an unconditional multiplication theorem.
+
+The new standard-library checker is `check_outer.py`; exact values and observed resources are in `RESULT.json`. `SOURCES.json` pins every directly used source. Candidate Python code was read for contracts but never imported or executed. The separate independently transcribed #5241 ledger preserved in #5384 supplies explicit equation provenance; this checker implements those equations afresh and evaluates its own rational parameter family. The resulting rows are compared with the author receipts only after independent computation. Author receipt equality is an error check, not the decisive oracle.
+
+## Derivation and exact coverage
+
+Write `K` for outer κ, `C` for the tested complex saving and `g=(C-K)/7`. Allocate
+
+```
+uniform = K+6g, b = K+5g, a = K+4g, q = K+3g,
+epsilon = 1-g, beta = 1-3g, r0 = g/10, stop = layout = g.
+```
+
+The complex compiler must furnish `C > uniform > b > a > q > K`. The outer exponent definitions are `sigma=1-b`, `tau=1-a`, `internal=tau+(1-stop)max(sigma-tau,0)`, `leaf=sigma+stop(1-sigma)`, `lambda=1-(q+a)/2`, `xi=epsilon(1+q)-3/32+layout`, and record-key exponent `beta+1-epsilon`. The checker derives the nine work savings from these exponents, computes every named comparison independently, and checks all are strictly positive. The 54-row inventory includes the nine work savings minus `K`; the other 45 rows cover supplier savings, stopping/leaf recursion, lambda separations, cap/group bounds, logarithm absorption, layout, source geometry and semantic guards. Four additional predicates bind group semantics and inherited/current BIT stock.
+
+The binding work saving is always `main_transform=epsilon*q`; its headroom is
+
+```
+epsilon*q-K = g(3-K-3g).
+```
+
+| Quantity | #5383 | #5387 |
+| --- | --- | --- |
+| Tested saving C | .00302667 | .003026674766 |
+| g | 1/700000000 | 1/7000000000000 |
+| Uniform saving | 529667/175000000 | 21186723361/7000000000000 |
+| Effective BIT saving a | 1059333/350000000 | 21186723359/7000000000000 |
+| BIT .0034 minus a | 130667/350000000 | 2613276641/7000000000000 |
+| Main-transform headroom | 419576267/98000000000000000 | 10489406638321/24500000000000000000000000 |
+| Approximate main headroom | 4.2813904796e-9 | 4.2813904646e-13 |
+| Minimum of all 54 strict slacks | 1/7000000000 | 1/70000000000000 |
+| Strict/functional counts | 54 / 4 | 54 / 4 |
+
+The smallest strict slack is the assigned logarithm-absorption margin `r0`; it is not the binding work saving. Exact full row values are preserved in `RESULT.json`.
+
+## BIT compatibility
+
+Both candidate records must equal the unchanged BIT record from `research/query-thinned-controllers/RESULT.json` byte-for-value at the JSON object level. The checker recalculates
+
+```
+atom = 1/250,
+ordinary = (1-atom)(69/20000)+atom(.0000384599)
+ = 8590884599/2500000000000,
+admitted = 17/5000 = .0034.
+```
+
+It verifies `atom > ordinary > admitted > C`, `admitted > a`, `atom < 1-ordinary`, and `0 < beta(1-atom) < 1`. All 54 strict/four functional rows use the retained compatible supplier. This lane inherits that supplier's native/interface/precision admission; it does not re-prove the BIT native construction or replace it with a cross-field operation. Under this outer contract, the supplier requires strict `a>K`; hence `.0053` and `.0073` outer targets cannot be funded by the unchanged `.0034` BIT supplier.
+
+## Compiler threshold and reserve
+
+For power 1000, tensor exponent `v=1024`, and integer `step=1/g`, the sufficient inequality is
+
+```
+H = step*j, (H+1)^1000 < 2^j.
+```
+
+An independent exponential search and binary search computes the winning integer; arbitrary-size integer comparisons evaluate the strict winner and the immediately preceding index. The function `1000 log(step*j+1)-j log(2)` is strictly concave, equals zero at `j=0`, is positive at `j=1`, and eventually negative. Therefore these two exact comparisons establish the least winning positive integer on this specified `H=step*j` grid. They do not establish the least arbitrary height or an optimal compiler.
+
+| Compiler quantity | #5383 | #5387 |
+| --- | --- | --- |
+| j | 44836 | 58507 |
+| H | 31385200000000 | 409549000000000000 |
+| N encoding | 2^31385200000000 | 2^409549000000000000 |
+| Winning strict integer comparison | pass | pass |
+| Comparison at preceding j | fails | fails |
+| H > 8v | pass | pass |
+| Completion reserve rho | 1e-9 | 1e-12 |
+| Remaining normalized rounding margin | 2145530521/2097154147483648 | 97179323/1048576001073741824 |
+| Approximate margin | 1.02306762885e-6 | 9.26774243359e-11 |
+
+No enormous expanded word or `N` is materialized. All counts are encoded in integers, and the largest comparisons involve only tens of thousands of bits.
+
+The fixed rounding debit is `R=4/2^32`. Its funding condition is
+
+```
+1/(1+v*rho) + R < 1
+iff rho > R/[v(1-R)] = 1/1099511626752
+ approximately 9.0949470262e-13.
+```
+
+Both reserves strictly pass. A `1e-13` reserve strictly fails. Thus moving near the raw crossing cannot treat reserve as freely shrinkable under this fixed rounding construction. Exact decay checks `(.97)^128 < 1/16`, `4(.97)^1024 < 4/2^32`, target splitting `20^64 < 21^63`, and shifted-exit capacity `2*20^(1024*64) <= 145^(1024*63)` also pass. Independent interval checks for alpha, both completion tails, eta/complement capacity and initial range belong to the pricing lane and are separate dependencies of complete compiler admission.
+
+## Rejections and endpoint scope
+
+For **each endpoint**, the independently recomputed rows reject insufficient BIT `.0027`, closed BIT saving `bit=a`, closed complex saving `uniform=b`, unfunded outer endpoint `K=C` with the other funded parameters held fixed, closed epsilon `epsilon=1`, and absent layout `layout=0`. Separate exact checks reject `rho=1e-13`, a closed compiler gap `K=C`, and the preceding compiler grid integer.
+
+These controls test the actual mathematical margins, not file hashes. A rejected mutant does not imply all conceivable constructions under its altered parameters are impossible.
+
+The preceding **compiler j-grid** failure is distinct from a κ **next-grid** claim. Neither original author endpoint is certified optimal by this lane. The common raw profile crossing `(0.00302667476807, 0.00302667476808)`, independently reconstructed moments and tests at `.003026674767/.768` are assigned to the pricing lane. Any next-grid failure there applies to that named profile, tested saving, reserve and completion prescription. A raw crossing is not an outer theorem or a circuit ceiling.
+
+## Executed command and resources
+
+Executed from the project root, with no external writes, commits, PRs, solver, Lean or subagents:
+
+```bash
+timeout 15s bash -c 'ulimit -v 131072; ulimit -t 15; python3 -B swarm-execution-sol-high-20261024/agents/outer/check_outer.py --candidate PR5383 swarm-execution-sol-high-20261024/repository/research/kappa-joint-relations-20261023/RESULT.json --candidate PR5387 swarm-execution-sol-high-20261024/agents/sources/pr5387/research/eight-owned-relations/RESULT.json --bit-source swarm-execution-sol-high-20261024/repository/research/query-thinned-controllers/RESULT.json --out swarm-execution-sol-high-20261024/agents/outer/RESULT.json'
+```
+
+Final execution: Python 3.12.3, 0.120 seconds, 18,696 KiB maximum process RSS, exit 0. Hard address-space/CPU limits and a wall timeout were applied. This small arithmetic screen required no root-serialized heavy run. Only this lane's owned files were created or edited; all referenced packages remain read-only.
+
+Invalidation: changed candidate receipt bytes, C/K/rho, supplier/domain, compiler power/tensor/cutoff/tail/rounding constants, outer exponent contract, physical input class or precision/stock applicability invalidate the corresponding checks. This report's PASS remains scoped until the independent invoice, moment/tails and physical applicability dependencies are accepted by the integrator.
diff --git a/research/joint-relations-independent-validation/reports/outer/SOURCES.json b/research/joint-relations-independent-validation/reports/outer/SOURCES.json
new file mode 100644
index 0000000000..ed28eaf9fb
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/outer/SOURCES.json
@@ -0,0 +1,87 @@
+{
+ "candidate_heads": {
+ "PR5383": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "PR5384": "411648821f0208d60099be8ca42957ca3a1c4316",
+ "PR5387": "b1ab650d36f59e5be682a813145b7c67e219e341"
+ },
+ "canonical_main": "1ec1119972c9aefe42525172d07b332fcff81cb4",
+ "credit": [
+ "Ali Romman: public eight-relation mechanism and #5383 pricing implementation",
+ "Dugongue: #5387 smaller completion reserve application",
+ "Cao Yifan: #4610 native and compiler lineage",
+ "Cinna Davis: p16 controller",
+ "zxv: compiler, completion and source outer formulas",
+ "Jacob Alan Sussman: mixed-target recursion",
+ "Chris R / Clear1nsight: #5241 independent ledger, preserved by #5384"
+ ],
+ "independence": "New rational implementation derives the exponent allocations and all named rows. No author endpoint, native, price or interval module is imported or executed. Prior independently transcribed #5241 ledger used as explicit equation provenance, not an execution oracle. Numeric retained BIT admission is an inherited same-interface premise, with fresh arithmetic/source binding; no BIT native replay.",
+ "sources": [
+ {
+ "label": "research/kappa-joint-relations-20261023/RESULT.json",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/repository/research/kappa-joint-relations-20261023/RESULT.json",
+ "role": "candidate_5383_receipt",
+ "sha256": "d6a99bd75c6b7a2146b0fc4cfa038890aaf1d4adcdef42d767fdb40b687e61aa"
+ },
+ {
+ "label": "research/kappa-joint-relations-20261023/price.py",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/repository/research/kappa-joint-relations-20261023/price.py",
+ "role": "read_equations_not_executed",
+ "sha256": "6ec03cda9ab6cb27c4a281c12646bbbc232cc57b8ec179969c59b0072c4b59ba"
+ },
+ {
+ "label": "research/kappa-joint-relations-20261023/README.md",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/repository/research/kappa-joint-relations-20261023/README.md",
+ "role": "author_scope",
+ "sha256": "899027b74219ece1832d711e27def50eb49994cd28ede4fedcdd0bd0f2574c64"
+ },
+ {
+ "label": "pr5387/research/eight-owned-relations/RESULT.json",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/sources/pr5387/research/eight-owned-relations/RESULT.json",
+ "role": "candidate_5387_receipt",
+ "sha256": "34ad456c1f98f7f8c361d63539ef26d75dad8ffb3444edf29652372acabf1aaf"
+ },
+ {
+ "label": "pr5387/research/eight-owned-relations/price.py",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/sources/pr5387/research/eight-owned-relations/price.py",
+ "role": "read_equations_not_executed",
+ "sha256": "3785b27e75d85116706ecaf9f7174132a72d00e1c28cea2cd4afada4ba30e44a"
+ },
+ {
+ "label": "pr5387/research/eight-owned-relations/README.md",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/sources/pr5387/research/eight-owned-relations/README.md",
+ "role": "author_scope",
+ "sha256": "5d5f033c82a8ed8b7e9c3fe3d3f18f559f4f651bb11d0e6a2c916e244777fb99"
+ },
+ {
+ "label": "pr5384/engines/cost/frozen/compiler.py",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/sources/pr5384/research/owned-relation-independent-validation/engines/cost/frozen/compiler.py",
+ "role": "prior_independent_54plus4_provenance",
+ "sha256": "4ec862afb1b0c18cecebec9b04d692be37083da64814da79ad692da96fd62bb5"
+ },
+ {
+ "label": "pr5384/engines/cost/check_cost.py",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/sources/pr5384/research/owned-relation-independent-validation/engines/cost/check_cost.py",
+ "role": "prior_independent_scope_not_executed",
+ "sha256": "eb66bad5d584ab29d29dd3e9f2fa7b2e71405fc1b05a659eb299c428c1332443"
+ },
+ {
+ "label": "research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/repository/research/pr4359-p7-padding/dependencies/compiler-refill/endpoint.py",
+ "role": "named_outer_equations_read_not_executed",
+ "sha256": "d097e55f06c3f244f2074ffd7c1a0a5f3c4b4b6a6accf9619d1dde5c0ae85e15"
+ },
+ {
+ "label": "research/query-thinned-controllers/RESULT.json",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/repository/research/query-thinned-controllers/RESULT.json",
+ "role": "retained_BIT_source_binding",
+ "sha256": "6ebfc8c0f09166f4834e9d7427410cb31aefff2cd4d4ce588c8e52c9c70e9a0f"
+ },
+ {
+ "label": "agents/prices/INVOICE.json",
+ "path": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453/swarm-execution-sol-high-20261024/agents/prices/INVOICE.json",
+ "role": "cross_lane_event_census_dependency",
+ "sha256": "12c5e2ec53fdf1ae8486e5d9d2929b49a3f89636ef7bb4b5c79e4dff5352a8d8"
+ }
+ ],
+ "status": "SOURCE_PINNED_SCOPED_FORMULA_REVIEW"
+}
diff --git a/research/joint-relations-independent-validation/reports/ownership/REPORT.md b/research/joint-relations-independent-validation/reports/ownership/REPORT.md
new file mode 100644
index 0000000000..c31fb4b00f
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/ownership/REPORT.md
@@ -0,0 +1,244 @@
+# Independent joint-relation ownership and chronology audit
+
+Candidate: Ali Romman's #5383, exact head `4bd6efa51a495a7c7b7754915cf0244e7e60969e`.
+Canonical base: `1ec1119972c9aefe42525172d07b332fcff81cb4`.
+This is the ownership/runtime-contract component of the independent audit.
+It neither changes selection nor independently accepts a kappa or full physical theorem.
+Forward-transpose extensions are outside this assignment.
+
+## Evidence and method
+
+`check.py` imports only Python standard-library modules. It reads literal
+source/candidate words and the pinned source phase receipt. It does not import
+any candidate Python, call a source row engine, consume WITNESS.json or RESULT.json,
+or trust candidate relation_basis, paid_profiles or claimed counts. The author
+README/native.py were read to identify the asserted interface; their routines
+are not the oracle. `SOURCES.json` binds actual consumed working bytes.
+
+The source/candidate event zipper proves a stronger chronological fact than
+comparing per-kind event multisets: after the explicitly recognized prefix,
+snapshot pairs, center triples, zero retags and return clears, every source
+event occurs in its original order and with identical bytes. Any missing
+retained operation, added borrowed clear or changed phase marker is rejected.
+The event/frame pass checks real GF(2) frame inclusion, all scalar current
+frames and role distinctions, paid rank differences and every final L frame.
+It derives the eight owned pivots and lost rank-nine helper targets from the
+actual ownership/preparation/return contract and source endpoints.
+
+The cheap structural pass plus twelve controls passed under hard 15-second CPU
+and wall limits and 128 MiB address-space limit in about 7.1 seconds. See
+`STRUCTURE.json`; this receipt explicitly marks exact endpoint replay false.
+The root executed the full rational free-word replay through its serial queue.
+`RESULT.json` records **PASS_EXACT_RUNTIME_OWNERSHIP** for #5383, with all
+641 backward and 633 forward arbitrary entry columns and all twelve controls
+checked. No heavy check was launched by this worker.
+
+## Actual bank and def-use chronology
+
+Indices below are zero-based. Birth/use/retirement are emitted candidate-word
+indices; snapshot production and center are original source indices. A
+snapshot is copied immediately after the named source climb has produced the
+copied role in precisely the recorded frame.
+
+| Bank | Source production / role | Frame | Candidate birth | Candidate unique read | Candidate clear | Source center |
+|---|---|---:|---:|---:|---:|---:|
+| C1 | 11205 / L92 | 254 | 11269 | 11411 | 11412 | 11332 |
+| C2 | 11218 / L57 | 274 | 11284 | 11439 | 11440 | 11358 |
+| C3 | 11231 / L81 | 619 | 11299 | 11467 | 11468 | 11384 |
+| C4 | 11244 / L224 | 279 | 11314 | 11495 | 11496 | 11410 |
+| C5 | 11257 / L11 | 621 | 11329 | 11523 | 11524 | 11436 |
+| C6 | 11270 / L240 | 280 | 11344 | 11551 | 11552 | 11462 |
+| C7 | 11283 / L9 | 624 | 11359 | 11579 | 11580 | 11488 |
+| C8 | 11306 / L288 | 281 | 11384 | 11607 | 11608 | 11514 |
+
+Every birth is preceded immediately by a legal clear of that bank; every read
+is followed immediately by its legal clear. At candidate index 11384 all eight
+saved values are simultaneously live and none has yet been consumed. Thus a
+single sequential scratch bank cannot implement this word. The checker
+rejects reusing C1 for the C2 snapshot even if both corresponding clear/COPY
+destinations are consistently changed. C0 is a separate owner: its first clear
+is 11387 and its final read/clear are 11609/11610. Clearing C0 before each
+replacement is legal and does not touch a borrowed helper or a live snapshot.
+
+The eight pivot lifetimes are also simultaneous with the snapshot lifetimes.
+They are existing helper-role slots, while C1..C8 are eight additional slots.
+No pivot is used as a preparation source for another pivot. Their inputs are
+retained independent cold helpers in frame 0, so there is no dependency cycle
+or pivot read before production.
+
+| Owned helper | First clear | Last read | Final clear | Return frame |
+|---|---:|---:|---:|---:|
+| L225 | 0 | 21375 | 21543 | 1 |
+| L227 | 7 | 21147 | 21544 | 1 |
+| L229 | 19 | 21146 | 21545 | 1 |
+| L230 | 27 | 15685 | 21546 | 1 |
+| L241 | 32 | 21138 | 21547 | 1 |
+| L245 | 40 | 21135 | 21548 | 1 |
+| L257 | 48 | 21311 | 21549 | 1 |
+| L288 | 56 | 21121 | 21550 | 1 |
+
+The final clears occur strictly after the last reads. These helpers have no
+productive output credit: each is an owned temporary and returns zero. In
+particular L288 remains an owned pivot even though its intermediate value is
+also the source of C8. C8's copy does not transfer ownership of L288 or make
+its final helper target available for credit.
+
+## Arbitrary input and output contract
+
+Backward entry consists of 224 arbitrary main fields, 400 arbitrary retained
+helpers, eight arbitrary owned helper entries, and nine arbitrary owned C
+entries. There are 641 independent entry symbols in the direct-sum row model.
+Every owner is seeded with its own symbol, just as each borrowed field is.
+An owner is cleared before any read; no entry is silently initialized to zero.
+After clear/preparation the pivots are prescribed linear combinations of the
+400 retained helper inputs, not new borrowed inputs and not productive targets.
+
+The exact replay initializes a separate basis column for all 641 entries,
+tracks rational coefficients and freely reduced native operator words, and
+checks the complete endpoint for each retained role. Backward outputs are
+`L_i -> L_i-L_(i+112)` for `0<=i<112`; L112..L223 and the 400 retained helpers
+are restored in their exact source final frames. All 17 owned outputs are zero.
+The unchanged forward word has 632 retained inputs plus arbitrary owned C0,
+with the opposite main shear and all retained helper outputs restored. Native
+left multiplication is injective on reduced words, so the implementation's
+warp dictionary transformation cannot silently overwrite colliding terms.
+
+Read/write/frame checking alone cannot prove a zero retag's zero value or a
+correct snapshot's content. Those are tested by exact mode and proved uniformly
+by the independent algebra lane's sixteen unrestricted source identities.
+A structure-only PASS must never be promoted to the full algebraic contract.
+
+## Constructive proof at every positive tensor multiplicity
+
+Fix an allowed positive multiplicity f and a caller satisfying the selected
+native, ownership, compiler and precision/tape hypotheses. Each logical role
+is a separate complete slot in its stated actual frame, interpreted in the
+source f-fold internal vector space. Preparation uses only rational scalar
+ADDs in frame 0 and legal erasures of the eight owned pivot slots. The
+independent algebra proof of the joint reduced system therefore sets all
+eight relations to zero while leaving the other 624 inputs unrestricted.
+This applies to arbitrary correlated vectors as well as independently chosen
+ones; the formal columns are a proof device for a universal linear identity.
+
+Proceed by induction through the source chronology. A retained event is the
+identical source event. After a snapshot production, legal clear/COPY stores
+that exact vector in a disjoint owner of the same actual frame. All following
+source events preserve this bank as a spectator until its unique use. At a
+center replacement the source center output minus the saved vector is the
+proved relation multiple, hence zero on the prepared domain. The clear/COPY
+triple therefore produces exactly the old center output, in the identical
+output frame. At a zero replacement the source input vector is exactly zero;
+the physical identity leaves it zero and supplies the old job's zero output
+in the declared target frame. The source state on every continuing role is
+therefore preserved at each replacement. Final retained outputs follow from
+the source endpoint, and each owner is legally cleared after its last use.
+
+For the tensor lift, evaluate each free generator at its exact source
+f-fold native operator, including its absolute phase, and each inverse at
+that operator's inverse. Evaluation is a rational algebra homomorphism on
+finite formal sums of free words. Rational ADD coefficients stay outside
+the tensor substitution. The sixteen identities and complete endpoint
+identity therefore hold for this f. No tensor power of a scalar sum or
+register matrix is taken. Backward inverse-transpose generators are treated
+as their own generators and have the same lift argument.
+
+The zipper preserves every native map, phase marker, adapter and retained
+paid event in position relative to all continuing state. Canonical actual
+frames/maps are identical. The source absolute-phase receipt is bound to
+the exact decompressed word. New operations are same-frame scalar actions on
+owned slots and identity on a proved zero vector. Consequently no new native
+phase recipe is required. Source phase lowering is reused at these exact pins,
+not freshly rerun or inferred from a binary tableau.
+
+## Recursive suspension and constructive allocation handoff
+
+At a recursive event, suspend the parent chronological state, including all
+live pivot and snapshot slots. Use the retained supplier contract on the
+named target field in its actual input frame, with every other parent role
+and every external spectator untouched. In particular C1..C8 remain separate
+spectators across every intervening child call. A supplier that may overwrite
+one of these banks fails this contract even if it later claims a numerically
+correct target.
+
+A constructive address assignment is `(call path, local role)` for each
+private slot, with disjoint tagged coordinate ranges for the parent's
+persistent fields, its C banks, and every active child. While a child is
+active, no other frame at that depth uses its private range. Depth-first
+execution returns the child owners as zero before that range can be reused
+by a later sibling. The active stack therefore uses a sum of the local
+simultaneous bank demands across its ancestor frames. It does not reuse a
+live ancestor range, take a maximum in place of that sum, or count eight
+snapshots as one slot. This construction is an induction on the finite
+recursive execution/compilation tree: distinct path prefixes give disjoint
+live private ranges; a completed subtree releases only its own range.
+The selected recursive compiler/allocation premise supplies the actual
+finite physical hosting and stock bounds for this address construction.
+
+The changed local caller requires 17 simultaneously owned roles: eight owned
+existing helper slots, C0, and eight added C slots. Existing 624 retained roles
+remain borrowed and restored. Every child's scratch is additional to these
+live parent slots. The physical/precision lane must fund expanded routing,
+complete slot sizes, suspended ancestor storage and actual stock/precision
+bounds using this template. This report proves the handoff contract and
+provides an explicit nonaliasing allocation; it does not substitute the old
+numerical template cap or a newly assumed free gather/decoder for that funding.
+
+## Rejection controls and scope boundary
+
+Twelve structural mutants reject borrowed erasure, missing initial pivot
+clear, duplicate declared ownership, reuse of a live snapshot bank, wrong
+snapshot frame or source, missing owned return, removal of a retained output
+operation, undeclared storage, changed source phase marker, wrong final owned
+frame and wrong center COPY gauge. These tests operate directly on in-memory
+candidate event data and run without hash gates, so a freshly recomputed hash
+cannot turn a semantic failure into a pass.
+
+Price, compiler, expanded stock, scientific kappa acceptance and selection are
+separate obligations. The event replay gives no credit to the eight owned
+helper outputs. No finite replay alone establishes a physical all-size theorem.
+The uniform argument above is conditional on the unchanged quantified source
+premises and on the independently established joint identities. Ali Romman
+retains construction credit; Cao Yifan supplied the source word; Chris R,
+Cinna Davis, zxv, ToikY and earlier contributors retain the source/audit credit
+recorded in the frozen notices. This audit uses substantial OpenAI Codex assistance.
+
+## Separate audit of PR5387's actual word
+
+The execution scope was expanded to Dugongue's #5387, exact head
+`b1ab650d36f59e5be682a813145b7c67e219e341`, package `research/eight-owned-relations`.
+Its README explicitly credits Ali Romman's public predecessor for the
+mechanism and disclaims priority. Its row/price engines are adaptations of
+that predecessor, so running those engines would not give independent
+ownership evidence. This checker instead processes #5387's own actual word
+with `--candidate .../WORD.json.gz --candidate-head ...`. The consumed bytes
+are separately pinned in SOURCES.json. #5387 has a different native witness;
+an identical recursive invoice does not license reusing #5383's complete
+runtime proof.
+
+Its independently derived pivots are 225, 227, 229, 230, 241, 245, 257, **261**.
+The eighth snapshot is **L256**, copied after original source event **11296**
+in actual frame 281. It is born at candidate event **11376**, read at **11609**,
+and cleared at **11610**; the original center is still source event 11514.
+The eighth zero retag is **L256 at original source event 17233**, emitted
+candidate event 17329. Thus the #5383 L288/source11306/source17580 identity
+is explicitly inapplicable to this eighth replacement.
+
+The first seven snapshot births/reads/clears are each two candidate events
+later than the #5383 table; the source production roles/events and actual
+frames for those seven are unchanged. All eight #5387 snapshots are live
+by candidate index 11376, preceding the first read at 11413. C0 has first
+clear 11389 and final read/clear 11611/11612. Pivot L261 is cleared at 56,
+last read at 21316, and finally cleared at 21552 in frame 1. The other seven
+pivot first-clear positions are the same as #5383; their last reads and
+final clears are two events later. `STRUCTURE-5387.json` records every value.
+
+The separate #5387 structure/frame pass and all twelve mutation controls
+passed under hard 15s/128MiB limits. The root separately executed its independent exact mode through the serial
+queue: RESULT-5387.json records **PASS_EXACT_RUNTIME_OWNERSHIP**, all twelve
+controls rejected, with 641 backward entry columns and 633 forward entry
+columns checked. This is a fresh actual-word proof rather than a proof
+transfer from #5383. The uniform direct-sum/tensor argument
+and constructive recursive address allocation above apply to this separately
+checked chronological contract, conditional on #5387's own unrestricted
+identities and the unchanged source framework. Extra prep scalars are
+charged by the invoice/physical lanes; no price conclusion follows here.
diff --git a/research/joint-relations-independent-validation/reports/ownership/RUN-REQUEST.json b/research/joint-relations-independent-validation/reports/ownership/RUN-REQUEST.json
new file mode 100644
index 0000000000..56789472d4
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/ownership/RUN-REQUEST.json
@@ -0,0 +1,45 @@
+{
+ "status": "ROOT_COMPLETED_BOTH_EXACT_REPLAYS",
+ "purpose": "Independently replay complete emitted backward and unchanged forward event words over all arbitrary input columns; verify exact zero retags, all retained endpoints, and owned returns; separate complete proof for both actual words, not invoice-only reuse",
+ "cwd": "/home/d3lerium/.codex/.chatgpt-projects/g-p-6ad5817fd84881918865926b6fd51453",
+ "timeout_seconds": 120,
+ "memory_limit_bytes": 268435456,
+ "expected_property": "PASS_EXACT_RUNTIME_OWNERSHIP; backward 624 retained +17 arbitrary owned columns, forward 632+1; 12 meaningful structural mutants rejected",
+ "heavy": true,
+ "author_code_imports": false,
+ "source_head": "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "estimated_seconds": "unknown; structural-only +12 controls completed in 7.1 seconds under hard 15s/128MiB limit",
+ "checker_sha256": "69ab58e41ccf548d68d24c45b673ed9918e22845d5d819588d431eb7807eff24",
+ "commands": [
+ [
+ "python3",
+ "-B",
+ "swarm-execution-sol-high-20261024/agents/ownership/check.py",
+ "--exact",
+ "--controls",
+ "--output",
+ "swarm-execution-sol-high-20261024/agents/ownership/RESULT.json"
+ ],
+ [
+ "python3",
+ "-B",
+ "swarm-execution-sol-high-20261024/agents/ownership/check.py",
+ "--exact",
+ "--controls",
+ "--candidate",
+ "swarm-execution-sol-high-20261024/agents/sources/pr5387/research/eight-owned-relations/WORD.json.gz",
+ "--candidate-head",
+ "b1ab650d36f59e5be682a813145b7c67e219e341",
+ "--output",
+ "swarm-execution-sol-high-20261024/agents/ownership/RESULT-5387.json"
+ ]
+ ],
+ "source_heads": [
+ "4bd6efa51a495a7c7b7754915cf0244e7e60969e",
+ "b1ab650d36f59e5be682a813145b7c67e219e341"
+ ],
+ "receipts": [
+ "RESULT.json",
+ "RESULT-5387.json"
+ ]
+}
diff --git a/research/joint-relations-independent-validation/reports/prices/REPORT.md b/research/joint-relations-independent-validation/reports/prices/REPORT.md
new file mode 100644
index 0000000000..6fadacaae6
--- /dev/null
+++ b/research/joint-relations-independent-validation/reports/prices/REPORT.md
@@ -0,0 +1,58 @@
+# Independent event invoice and exact price audit
+
+Owner: execution prices lane, 2026-10-24 Australia/Sydney. Construction credit belongs to Ali Romman (#5383), with Dugongue's #5387 compiler-margin refinement; retained native/source and compiler lineage belongs to Cao Yifan, Cinna Davis, zxv, Jacob Alan Sussman and the other credited source contributors. This audit uses substantial OpenAI Codex assistance. It edits only its own package and publishes no external message or selected-record change.
+
+## Scope and inputs
+
+Canonical main is `1ec1119972c9aefe42525172d07b332fcff81cb4`. The selected conditional #4610/#5241 baseline remains `.0030217758`. The literal candidate is #5383 at `4bd6efa51a495a7c7b7754915cf0244e7e60969e`; the separate successor is #5387 at `b1ab650d36f59e5be682a813145b7c67e219e341`. `INVOICE.json` binds exact compressed source and candidate word hashes plus the controller hash. `coordination/SOURCE-READY.json` and the source lane's manifests establish the Git-byte bindings separately.
+
+The checker imports only the Python standard library. It does not import the candidate's `native.py`, `price.py`, interval engines, author `RESULT.json`, or #5384's audit code. Primary literal words and the retained controller are shared evidence; independent implementation does not mean independent construction. No #5384 arithmetic PASS is inherited. Native endpoint/phase/zero/ownership correctness, controller Laurent factorization and physical applicability remain dependencies owned by the corresponding independent audit lanes.
+
+## Invoice from events
+
+The audit reads both candidates' actual `WORD.json.gz`, not just their advertised paid profiles. It reconstructs binary frame bases, checks independence and nested paid-frame inclusions, tracks frames across every scalar/warp/paid/zero-retag event, derives each paid rank from endpoint frame dimensions, and checks final frames. It derives helper ranks from start/final frames, surrendering every owned `L` helper endpoint. The census is conditional on the separate proof that each retained endpoint is an eligible ordinary completed helper and each zero retag is valid.
+
+Whole-controller counts come from every actual `physical_events` entry: 16 backward and two forward LOCALs, 15 query shears, 15 IDLE windows, 90 ADDs and 16 SIGNED_SWAPs. Query volume is the canonical `v=112`; idle volume is `2v`; controller rank step is canonical `h−1=8`. Main completed targets are derived from the controller's diagonal exponents, subject to the separately checked controller identity. Author invoice fields are not used.
+
+Both literal candidates give:
+
+- Paid `P={1:41170,2:7416,3:9180,4:2286,5:720,8:16,16:448,24:448,32:448,40:448,48:448,56:448,64:448,72:224}`.
+- Productive `T={4:504,7:126,8:846,9:5740,17:448,25:448,33:448,41:448,49:448,57:448,65:448,73:224,145:224}`.
+- 64,148 paid calls, 10,800 productive fields; paid rank mass 237,982, productive rank mass 238,734, surplus 752.
+- Actual selected-source delta: paid `−128 H1−128 H8`, productive `−128 H9`. The removed paid rank mass 1,152 is exactly the lost productive rank mass 1,152; job counts decrease by 256 paid and 128 productive.
+
+For `00`. Strictness follows because `(x+1)^t−x^t` decreases with `x>0` and is strictly less than its value 1 at `x=0`. This cheap direction proof does not establish legal simultaneous preparation or native semantics.
+
+The distinct #5387 literal preparation has pivot 261 where #5383 has pivot 288, so it is checked separately. The independently counted scalar tariff maxima are #5383 **158,744**, #5387 **158,776**, versus source backward **158,168**; both forward words have 158,120. These use the retained dyadic scalar tariff (two real operations per clear/copy and the source's binary scalar realization), calculated from actual scalar events. Route, stock, movement, precision and expanded all-size obligations belong to the physical lane; they are not silently set to zero by this recursive invoice.
+
+## Independent arithmetic method
+
+Every interval endpoint is an integer multiple of `10^-65`. Arithmetic rounds outward using exact Python integers. Natural logs use binary range reduction followed by the rational `2*atanh(z)` series with an explicit geometric remainder (`z<=1/3`); exponentials use positive Taylor terms with an explicit geometric remainder. Negative powers use outward reciprocal intervals. The checker re-derives target/paid raw moments, alpha, the paid higher-moment gamma, target-completion delta, both completion tails and the reserve/rounding bound. No floating-point sign decides acceptance.
+
+It tests both parameter choices separately: #5383 `K=.00302666,C=.00302667,rho=10^-9`; #5387 `K=.003026674765,C=.003026674766,rho=10^-12`. Both use tensor power 1024, cutoff 20, floor 21, higher-moment offset 1/5, tail limits 97/100, and theta 63/64 with logarithmic power 1000. The outer lane independently owns seven-way gaps, finite H/grid predicates, admitted BIT compatibility and all 54 strict plus four functional outer predicates.
+
+The root-serialized run produced `PASS_INDEPENDENT_EVENT_INVOICE_AND_EXACT_PRICES` in `RESULT.json`, bound to checker SHA-256 `e5f828e06b896723da4b58ca8c780609b8b94bde374a2ffeda1cab143323a335`. Both parameter choices pass all listed price/tail/capacity checks. The following values are decimal approximations for reading; the machine receipt retains outward rational intervals.
+
+| Quantity | #5383 | #5387 |
+| --- | ---: | ---: |
+| Raw moment surplus | 0.001176849586965156 | 0.000000512036327369 |
+| Alpha | 0.999999995016963388 | 0.999999999997831927 |
+| Paid higher-tail gamma | 0.956968564096059992 | 0.956968566609975897 |
+| Target completion delta | 0.951652473261883820 | 0.951652475842024106 |
+| Alpha correction budget after reserve | 0.000940678416953355 | 0.000000275865161369 |
+| Coarse normalized-completion slack | 0.000001023067628850 | 0.000000000092677424 |
+| Capacity eta | 0.000000199495867924 | 0.000000199491021600 |
+
+The unique raw crossing is strictly between `.00302667476807` and `.00302667476808`. Its headroom above #5383's claimed K is `(0.00000001476807,0.00000001476808)`; above #5387's K it is `(0.00000000000307,0.00000000000308)`. Both fixed reserved certificates afford **zero extra H1 calls**. The derivative negation is bounded below by more than 195,473 on `[0,.05]`, and the remaining moment is bounded above by less than −6,820 on `[.05,1]`.
+
+Proving this profile's ceiling or increasing root precision supplies no new native mechanism. #5387 is a compiler-margin refinement on the same paid/target profile, with fresh preparation charges.
+
+## Controls and boundary of the result
+
+The checker rejects one extra unpriced H1 at #5383's tested saving. At #5387's stronger tested saving it separately requires rejection of the predecessor `10^-9` alpha reserve. The coarse sufficient bound with fixed rounding allowance `4/2^32` rejects reserve `10^-13`; this is failure of that stated sufficient certificate, not a universal impossibility for every tail/rounding analysis. Both actual directed tail powers and the stated coarse sufficient bound are checked for the accepted choices.
+
+At `rho=10^-12`, the next tested-saving tick `.003026674767` still passes reserved alpha with positive budget about `2.9046542321*10^-8`; `.003026674768` fails with budget about `−2.1777207673*10^-7`. Therefore #5387's printed endpoint is not established optimal. Passing a later alpha tick does not certify a later outer endpoint; failing an H predecessor only locates the sufficient compiler grid minimum for its declared gap. No global endpoint optimality follows. The exact interval engine checks positivity at `.00302667476807`, negativity at `.00302667476808`, strict decreasing moment on `[0,.05]`, and negative moment on `[.05,1]`; thus the bracket bounds the unique raw crossing for this exact profile on `0