Abstract

A method is disclosed for synchronizing paired records between two ticket stores whose state vocabularies differ in richness, without an update loop. A pairing row links each record one-to-one to its twin and persists a content digest per side over a normalized tuple of declared fields. For the source side it records the digest the source held when the bridge last propagated it; if the source's current digest still equals that value, the source is unchanged since the bridge last acted and the pair is skipped without a write. Suppression compares content, not an origin or actor stamp, so it survives the loss of such a stamp. For the written side it records the digest of that side's projected post-write state, which an agreement shortcut consults. Agreement is decided by set membership, never by string equality or timestamp ordering: each coarse state declares the finer states that agree with it, including every finer state that collapses onto it, so a lossy round trip is quiet by construction and clock skew is irrelevant. Each synchronized field is written in one direction only: the writer toward the coarser store builds its update from an allow-list, and the opposite direction has no update path for those fields on a linked pair, so no field can ping-pong. A per-pair windowed write counter, whose window opens at the first counted write and resets once the span has elapsed, parks a pair that keeps writing in a conflict state for operator review.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS