Repository navigation
Prove exact connector price with correlated source updates - #2060
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Result
A scoped all-length exact query theorem for a persistent dirty connector when imposed source updates have a known binary dependence matrix. This changes the independence hypothesis of Ross Richardson's merged PR1780; sequential no-prewrite/no-late-write output deliveries, arbitrary dirty inputs, and every mandatory source update are retained.
For update prefixes s_i and query/correction parities q_i,t_j, the exact complete-query bill is
subject to
XOR q_i=0andXOR(q_i*s_i) XOR XOR(t_j*v_j)=0. The proof covers arbitrary query multiplicities, not just paired-readout candidates. Two reads around a source query attain every feasible parity choice without requiring intermediate connector coherence. Independent updates recover PR1780's formula.The source-bound PR1439/PR1780 four-request pilot reuses one update row. It needs 59 scalar XORs, versus 63 for the strengthened best coherent schedule and 87 separately closed. All mutations, readouts and source calls are paid. Actual return-to-origin head steps are 1128/1176/1472; the declared unit local-backend totals are 1423/1491/1907. The correlated word attains the componentwise query minimum of 4B+8A+0D.
Limits: this is an optimum in the explicitly indivisible call alphabet. Opening the pilot's maps gives a cheaper, checked 31-XOR direct-fusion program. No selected physical caller, recursive rank-profile gain, supplier admission, contracting recurrence, formal-kernel theorem, measured runtime improvement or new kappa is claimed.
Evidence and reproduction
Only
research/correlated-update-delivery/is added, with README proof, complete SELECTION/TASK/SOURCES/VERIFY metadata, source-parsed fixture, certificate, primary optimizer, code-disjoint full-alphabet Dijkstra oracle and integrity checks.Observed on CPython3.12.12, Darwin arm64:
The 300 cases exhaust d=1,2, k<=4, every update-vector sequence and three tariffs including exact fractions. The independent oracle settles21070states and agrees with an additional exhaustive parity enumeration;72cases beat coherent pricing. Checks include4096arbitrary2x2 map triples, all19dirty basis columns of each literal pilot,384exhaustive scalar dirty executions,16independent-update predecessor specializations and24periodic fixtures. Controls reject dependence drift, missing/late/early operations, omitted restoration, false invoices, source/receipt corruption and occupied-output overwrites. Optimized relocated replay and canonical regenerated evidence pass. No hosted-CI result is claimed.
Provenance and overlap
Fresh base
e112d71c8d7bb32435debcc54df932593dd8223a. Single chooser draw829a355b1cafac3569bc060e0062cf20, recursive-interfaces / persistent-boundary. The complete draw and declared changed scope are retained.Credit Ross Richardson PR1780 (
15a91b5d634023a3a14129cbb240854c4b188111) and PR934/943; woklerx PR1439 (3852c2d03044895cebdc9b31b0c7131a617774d2) / PR1442 (7c573bc769798ce4e336fd5be630060bd9d69a71); Hanson Sun's observable-connector-repair (different two-B/future-prewrite contract). Exact live heads were rechecked and all three numbered predecessors are merged. Shared cached coverage was329openPRs includingdrafts and692discussions/comments/replies, with complete pagination at18:11–18:12UTC; targeted final queries and Discussion1776 found no overlapping successor, without treating no-match as novelty proof.Claim: #research-claim-and-completion-record
Prepared for Adam Gall with substantial OpenAI Codex (GPT-6 Astra) assistance in derivation, implementation, exact checking and prose. Apache-2.0. The selected record, frozen packages, upstream sources and shared indices are unchanged.
Research claim and completion record
Status: completed. The claim record is preserved here so this PR is self-contained. Historical coordination links in the committed research metadata refer to this record; the separate coordination discussion is being removed.
DONE / claim released — #2060 . Full commit: 3555161. Base e112d71; one chooser draw 829a355b1cafac3569bc060e0062cf20, recursive-interfaces / persistent-boundary. Package research/correlated-update-delivery/.
Changed premise: source updates have a known binary dependence matrix, rather than PR1780 independent inputs. Sequential no-prewrite/no-late-write deliveries, arbitrary dirty connector and all imposed mutations are retained. Exact all-length query optimum follows from final parity/syndrome constraints, a lower bound permitting arbitrary multiplicities, and an attaining A,B,A,[B] word without intermediate coherence.
Source-bound PR1439/1780 repeated-row pilot: 59 XORs versus best coherent 63 and closed 87, including all mutations/readouts/source calls. Declared head-step invoices: 1128/1176/1472. Direct fusion is only 31 XORs outside the indivisible alphabet: no unrestricted circuit, admitted supplier, recursive-profile or kappa claim.
CPython 3.12.12 optimized focused and registered replay PASS: 300 cases agree with code-disjoint unrestricted-query Dijkstra and exhaustive parities; 72 strict coherence gains; 4096 map triples; 19 dirty basis columns/pilot; 384 scalar dirty executions; 11 semantic and 5 integrity/portability controls. Parent independently reviewed/replayed before publication; no hosted-CI, independent-human or formal-kernel review claim.
Reproduce:
uv run --python 3.12 --no-project python scripts/research_package.py --package research/correlated-update-delivery.Credit Ross Richardson PR1780/934/943, woklerx PR1439/1442, and Hanson Sun observable-connector-repair; their scopes remain valid. Open blocker: a real admitted caller with these dependencies and complete routing/hosting/precision/lifetime tariffs. Full original scope/selection and pre-computation budget are retained in the package. Substantial OpenAI Codex (GPT-6 Astra) assistance for Adam Gall; Apache-2.0.