Prove exact connector price with correlated source updates

research/correlated-update-delivery/SELECTION.json

@@ -0,0 +1,60 @@
+{
+  "seed": "829a355b1cafac3569bc060e0062cf20",
+  "track": "recursive-interfaces",
+  "suggestions": [
+    {
+      "task_id": "persistent-boundary",
+      "scope_key": "73c0a233e7e1abdccbfe",
+      "question": "Can a specified pair of consecutive calls eliminate a restoration that the next call reconstructs?",
+      "method": "Derive a lower bound for the compulsory transitions of one proposed typed interface.",
+      "starting_points": ["research/heterogeneous-owner-assembly/README.md", "certificates/selected-result.json"],
+      "acceptance_gate": "Show actual eliminated work and legal composition; changing a scalar recurrence into a matrix is insufficient.",
+      "first_step": {"command": ["python3", "-B", "scripts/research_baseline.py"], "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", "inspect": "Find a concrete consecutive-call boundary in the selected review and list its entry/exit obligations.", "scope": "Positive control / source-bound orientation only; this is not a new construction or full cold replay."},
+      "first_experiment": "Specify two call types and one operation actually removed by composition; derive the normalized recurrence.",
+      "bottleneck_link": "Eliminating compulsory boundary work can lower recursive cost beyond packing gains.",
+      "allowed_variations": ["A two-type pilot or one explicit deferred restoration."],
+      "scope_change_triggers": ["Rewriting the old scalar recurrence as a matrix without eliminating work."],
+      "overlap_terms": ["persistent boundary", "deferred restoration", "multitype"],
+      "scope_rule": "If you change the card's premise, record scope_status=changed and explain why. A package metadata check cannot establish mathematical relevance."
+    },
+    {
+      "task_id": "centre-path-sharing",
+      "scope_key": "a55534776f5479f1686c",
+      "question": "Can the 64-per-call centre path (eight rank-8 COPY/ERASE totals through the private temporary) be shared across calls or shrunk?",
+      "method": "Prove a lower bound on copied information per call for the selected decoder contract.",
+      "starting_points": ["research/complex-local-word-ceiling/README.md", "research/split-centres-global/proofs/PR386-BIT-GEOMETRY.txt", "certificates/selected-result.json"],
+      "acceptance_gate": "Show the changed centre charge and copy profile per call with every added restoration or hosting cost charged, and its ceiling via ceiling.ceiling(centre=...).",
+      "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": "Write the per-call centre charge and copy children for sharing across k = 2 calls, charge the sharing overhead, and screen it; stop this route if even the ideal sharing gains under 10%. Ideal budgets: free 2.80x, shared by two 1.90x (levers.py).",
+      "bottleneck_link": "The centre path consumes 64 of about 99.6 unpaid coordinates per call, i.e. about 64% of the raw deficit.",
+      "allowed_variations": ["One sharing pattern across a fixed number of calls.", "One reduced copied-total contract for the existing decoder.", "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": ["Removing copies without a replacement contract for the decoder's copied totals."],
+      "overlap_terms": ["centre path", "copied totals", "private temporary", "shared centre", "batching"],
+      "scope_rule": "If you change the card's premise, record scope_status=changed and explain why. A package metadata check cannot establish mathematical relevance."
+    },
+    {
+      "task_id": "coverage-law-change",
+      "scope_key": "225dda4a25bdcb8e3086",
+      "question": "Can a template or call contract leave two or more unpaid coordinates per live family?",
+      "method": "State a replacement for the coverage identity (mass = 72W + 64N) and the contract change that realizes it, with its implementation cost.",
+      "starting_points": ["research/complex-local-word-ceiling/README.md", "research/idle-axis-hosting/PROOF.md", "certificates/selected-result.json"],
+      "acceptance_gate": "An explicit replacement identity, verified on a small complete instance with dirty inputs, priced with ceiling.ceiling(unpaid=...).",
+      "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": "Explain where the single unpaid coordinate per family comes from in the hosted template; propose one change and price it. Ideal budget: two unpaid coordinates per family is 3.77x (levers.py).",
+      "bottleneck_link": "The deficit is one coordinate per family minus the centre charge; doubling unpaid coordinates per family scales it directly.",
+      "allowed_variations": ["One template change or one endpoint-contract change.", "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": ["Counting a coordinate as unpaid while leaving it unadvanced in the data endpoint."],
+      "overlap_terms": ["coverage identity", "unpaid coordinate", "deficit law", "W - 64N"],
+      "scope_rule": "If you change the card's premise, record scope_status=changed and explain why. A package metadata check cannot establish mathematical relevance."
+    }
+  ],
+  "base_commit": "e112d71c8d7bb32435debcc54df932593dd8223a",
+  "catalog_assessed_on": "2026-10-13",
+  "priority_revision": 3,
+  "priority_log": "docs/research/research-priority-log.md",
+  "catalog_sha256": "6686ad58f1fbdbc87134a78901b60fd53a20d3984355e91defbbebc9e9fa8075",
+  "selected_record_sha256": "10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32",
+  "selected": {"kappa": "836330098538459/500000000000000000", "review": "docs/research/community-batch1099-review.md", "source_manifest": "research/community-frontier1094-audit/SELECTED-SOURCE.json", "reproduce": "make frontier1094-verify"},
+  "status": "SUGGESTIONS_ONLY_NOT_RESERVED",
+  "next_step": "Check live overlap, refine one question's object and domain, and record a bounded task card. A different seed or scope key is not evidence of novelty."
+}

research/correlated-update-delivery/SOURCES.json

@@ -0,0 +1,42 @@
+{
+  "schema_version": 1,
+  "base_commit": "e112d71c8d7bb32435debcc54df932593dd8223a",
+  "files": [
+    {
+      "path": "certificates/selected-result.json",
+      "usage": "input",
+      "git_blob": "ae6a99f28aa468649eb66a361e764d769363bf11",
+      "sha256": "10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32"
+    },
+    {
+      "path": "docs/research/agent-task-catalog.json",
+      "usage": "provenance",
+      "git_blob": "06c96f5579bb67ed1b86d334e78fbed7da6945f1",
+      "sha256": "6686ad58f1fbdbc87134a78901b60fd53a20d3984355e91defbbebc9e9fa8075"
+    },
+    {
+      "path": "research/connector-delivery-cut-optimum/README.md",
+      "usage": "input",
+      "git_blob": "2268bdf205b4e13d81b9851fae3d87654dc94e47",
+      "sha256": "5a4a8d5356b115e68e4c157cefed232cb32f84c19588d38daef8fda87f0507ba"
+    },
+    {
+      "path": "research/mutable-connector-delivery-optimum/README.md",
+      "usage": "input",
+      "git_blob": "46d056047b547c6e6f4894ced2cd3f066edc8b59",
+      "sha256": "158f4cb5b032ff2757c565e9a408382a58ef09083e7880833b794ebb43fd1906"
+    },
+    {
+      "path": "research/mutable-source-persistent-connector/README.md",
+      "usage": "input",
+      "git_blob": "53ef4d0d3e527ece35b5f09816ec756b6bc9f100",
+      "sha256": "1cb2636f93330e41cfdbc9436bc4df6706ce1141fe05da8fd7b72f29fe682f4d"
+    },
+    {
+      "path": "research/observable-connector-repair/README.md",
+      "usage": "input",
+      "git_blob": "813732c094bfd606a6df8c2b9c7a80382d5ccf3b",
+      "sha256": "3029e516808c275aaf49e51eb3d67ab035318c83bed101d4609f88993fdce39a"
+    }
+  ]
+}

research/correlated-update-delivery/TASK.json

@@ -0,0 +1,71 @@
+{
+  "schema_version": 1,
+  "task_id": "persistent-boundary",
+  "priority_revision": 3,
+  "base_commit": "e112d71c8d7bb32435debcc54df932593dd8223a",
+  "original_card": {
+    "id": "persistent-boundary",
+    "question": "Can a specified pair of consecutive calls eliminate a restoration that the next call reconstructs?",
+    "starting_points": [
+      "research/heterogeneous-owner-assembly/README.md",
+      "certificates/selected-result.json"
+    ],
+    "methods": [
+      "Write typed entry/exit contracts and a contracting multitype recurrence.",
+      "Derive a lower bound for the compulsory transitions of one proposed typed interface."
+    ],
+    "acceptance_gate": "Show actual eliminated work and legal composition; changing a scalar recurrence into a matrix is insufficient.",
+    "first_step": {
+      "command": [
+        "python3",
+        "-B",
+        "scripts/research_baseline.py"
+      ],
+      "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY",
+      "inspect": "Find a concrete consecutive-call boundary in the selected review and list its entry/exit obligations.",
+      "scope": "Positive control / source-bound orientation only; this is not a new construction or full cold replay."
+    },
+    "first_experiment": "Specify two call types and one operation actually removed by composition; derive the normalized recurrence.",
+    "bottleneck_link": "Eliminating compulsory boundary work can lower recursive cost beyond packing gains.",
+    "allowed_variations": [
+      "A two-type pilot or one explicit deferred restoration."
+    ],
+    "scope_change_triggers": [
+      "Rewriting the old scalar recurrence as a matrix without eliminating work."
+    ],
+    "overlap_terms": [
+      "persistent boundary",
+      "deferred restoration",
+      "multitype"
+    ]
+  },
+  "scope_status": "changed",
+  "actual_scope": "Exact all-length dirty-connector query optimum with sequential delivery cuts and known binary dependencies among source updates; a source-bound four-request PR1439/PR1780 pilot and independent full-alphabet finite oracle.",
+  "scope_change_reason": "The selected source does not supply the required recursive caller. This is a source-bound successor to PR1780's explicit independent-update interface, changing that independence hypothesis, not claiming selected-supplier admission or a contracting recurrence.",
+  "bottleneck_link": "Known update dependencies can cancel otherwise compulsory connector restoration. The deliverable identifies exactly when that boundary work disappears in the complete-call alphabet; physical routing and selected-supplier costs remain separate.",
+  "budget_minutes": 120,
+  "stop_rule": "Derive the exact endpoint syndrome before enumeration. Stop the construction claim if the repeated-update pilot has no strict full query saving over the strengthened PR1780 coherent comparator. Exhaust only d=1,2 and lengths 1..4 under three fixed tariffs; no larger-domain search or supplier claim.",
+  "outcome": "completed",
+  "evidence": "README arbitrary-length proof and RESULT.json: 300 cases agree with unrestricted-query Dijkstra and parity enumeration; 72 strict coherent-price gains; 4096 exact map triples; pilot 59/63/87 XORs with all mutations and delivery cuts; 11 semantic and 5 integrity controls. No supplier or kappa claim.",
+  "author": "Adam Gall (@adamgall)",
+  "ai_assistance": "Substantial OpenAI Codex (GPT-6 Astra) assistance in derivation, implementation, exact checking, and prose. No independent human or formal-kernel review is claimed.",
+  "seed": "829a355b1cafac3569bc060e0062cf20",
+  "track": "recursive-interfaces",
+  "scope_key": "correlated-update-delivery/known-F2-dependence/no-prewrites/all-query-words",
+  "predecessor_heads": {
+    "1780": "15a91b5d634023a3a14129cbb240854c4b188111",
+    "1439": "3852c2d03044895cebdc9b31b0c7131a617774d2",
+    "1442": "7c573bc769798ce4e336fd5be630060bd9d69a71"
+  },
+  "method_domain": "All k>=1, d>=0 and arbitrary compatible F2-linear A_i,B,C under the declared indivisible complete-call alphabet; finite independent census d=1,2, k=1..4, every update vector in F2^d, three positive rational/integer price assignments.",
+  "optimistic_full_budget": "Four repeated-update epochs using PR1439 B=(3,6,7), C=e0 and alternating readers (2,4,1),(3,2,4): candidate 4*7+2*(3+4+3+4)+3=59 scalar XORs, versus coherent persistent minimum 63 and separately closed 87. No D repairs are unpaid: they are omitted only if the final syndrome is zero. Charge all mandatory mutations, all reader calls, source calls, storage, dispatch and actual return-to-origin movements. These scalar counts are not a recursive rank bill.",
+  "success_falsification": "Every delivered output and final dirty connector must be exact for arbitrary inputs; independent arbitrary-multiplicity oracle must agree with the formula. Changed update dependence, missing closing source call, premature/late writes, omitted mutation, and uncharged work must be rejected. No kappa or supplier acceptance claim.",
+  "open_questions": [
+    {
+      "question": "Does an admitted recursive caller have the required correlated source updates while retaining sequential deliveries and a reserved hidden connector?",
+      "why_it_matters": "Only a real occurrence with complete tariffs could turn the exact query saving into a paid recursive-profile gain.",
+      "first_step": "Extract one actual caller's update-dependence matrix, output cuts and complete port-specific B/A/D tariffs, then compare the emitted optimal word with an equally fused baseline.",
+      "blocked_by": "No such source-bound physical caller, frame/hosting plan, or precision/tape admission is established here."
+    }
+  ]
+}

research/correlated-update-delivery/VERIFY.json

@@ -0,0 +1,25 @@
+{
+  "schema_version": 1,
+  "status": "ready",
+  "python": "3.12",
+  "requirements": [],
+  "inputs": [
+    "certificates/selected-result.json",
+    "research/connector-delivery-cut-optimum/README.md",
+    "research/mutable-connector-delivery-optimum/README.md",
+    "research/mutable-source-persistent-connector/README.md",
+    "research/observable-connector-repair/README.md"
+  ],
+  "commands": [
+    {
+      "argv": ["{python}", "-I", "-O", "-B", "{package}/verify.py"],
+      "timeout_seconds": 180,
+      "checks": "Exact source-bound theorem fixtures: all 300 unrestricted-query oracle cases, arbitrary dirty endpoints, 4096 map triples, complete 59/63/87 pilot invoices, predecessor specialization and eleven semantic controls."
+    },
+    {
+      "argv": ["{python}", "-I", "-O", "-B", "{package}/test_package.py"],
+      "timeout_seconds": 600,
+      "checks": "Five integrity/portability controls: optimized read-only relocation, source corruption, receipt undercharge, occupied-output preservation and canonical regenerated evidence."
+    }
+  ]
+}