Governed Matched-Pair Settlement

Two agents settle on matched signed observations, by continuity, with no clearer.

Primary technical disclosure

Secondary technical

The Derived-Artifact Provenance Chain and Chain-Head Identifier A tamper-evident, locally verifiable derived-artifact provenance chain that records every retraining agent behind an inference artifact and commits to the whole history through a self-committing chain-head identifier, verified at each lifecycle operation without any registry.Provenance Withdrawal and the Provenance-Withdrawn Attribute A structural account of provenance withdrawal in Adaptive Query: how a signed, verifiable governed observation lets an upstream model provider retract endorsement of a derived inference artifact without deleting history, halting dispatch as a positive abstention.Matched-Pair-Gated Corpus Contribution A bilateral matched-pair gate that admits counterparty training-corpus contributions only against a settled contribution identifier, binding each contribution to a corpus policy version, scope partitions, and action classes for later provenance and encumbrance.Partition-Scoped Escrow Release Gated on Intersection Non-Emptiness How partition-scoped escrow in Adaptive Query binds settlement content to the intersection of two agents' scope partitions, refusing release outside it and rolling back to the placing party on timeout with no refusal-meter charge.The First-Encounter Settled Pair and Promotion to the Persistent Tier How a semantic agent admits a never-before-seen counterparty with no certificate authority or registry, using an ephemeral-tier identity record, a scaffolding observation naming absent fields, and a completing observation that promotes the record to the persistent tier by slope continuity.Contribution Encumbrance on Severance or Quarantine: Governing Dispatch to Models Trained on a Severed Counterparty's Corpus Without Retraining or Deletion How a semantic agent handles model endpoints trained on a severed or quarantined counterparty's corpus: a contribution-encumbered attribute written into each affected endpoint, a per-endpoint encumbrance count of distinct encumbering counterparties, and an encumbrance narrowing record in that counterparty's scope object rendering dispatch inadmissible for actions whose affected-party class maps to it, with no retraining and no deletion.Encumbrance Bounds That Bar Persistence Promotion and Onward Tool-Source Emission Once the Per-Endpoint Count Exceeds the Bound How a policy-declared encumbrance bound on the per-endpoint count of severed or quarantined contributors bars persistence promotion and onward tool-source emission of a retrained inference endpoint once the count exceeds the bound, without retraining, deletion, or any transmitted quality measure.Blinded Encumbrance Commitments: Carrying a Severed Contributor's Encumbrance Along With an Inference Endpoint Emitted to a Peer Agent How a set of magnitude-ordered blinded contribution identifiers attached to an emitted inference endpoint lets a peer agent, on a successful membership test, encumber its own copy for a contributor it has itself severed, disclosing no contributor identity, count, or quality measure.Release of a Contribution Encumbrance: Matched-Pair Re-Admission or a Substitution With an Empty Intersection In a governed AI agent tool registry, a contribution-encumbered model endpoint is released only by bilateral matched-pair re-admission of each settled contribution identifier or by a substitution event whose successor recorded contribution set shows an empty intersection, never by elapsed time, a policy update, or lifting of quarantine alone.Registering Third-Party Reliance on a Settled Matched Pair: The Reliance Record and the Settled-Party Reliance Register Technical disclosure of the reliance record and settled-party reliance register: how a third party that verifies and consumes a settled matched pair registers a per-determination dependency with both settled parties, and how that register conditions a later reversal.Conditioning a Settlement Reversal on a Reliance-Completeness Predicate Evaluated Over the Reverting Party's Own Reliance Register How a reliance-completeness predicate conditions a settlement reversal on the reverting party's own enumeration of its reliance register, giving effect to the reversal only where every registered relying party and consuming determination is matched, with no other party polled or voting.The Relying Party's Reversal Mark: Barring a Reversed Settlement as a Determination Input and Re-Resolving the Determination That Consumed It How a relying party appends a reversal mark against a reversed or amended settlement, bars that settlement identifier as a determination input, and re-resolves the consuming determination under an append-only lineage field, a recorded abstention class, and a conversion bar.Transitive Reliance Records and the Reliance Chain: Registering Second-Order Dependency on a Settlement Without Any Party Enumerating the Whole Chain How a transitive reliance record carries an upstream-reliance reference to another party's reliance record in place of a settlement identifier, forming a reliance chain along which a reversal notice travels one hop at a time while no party holds an enumeration of the whole chain.Transitive Reversal Notices That Carry a Settlement Reversal One Hop at a Time Along a Reliance Chain No Party Enumerates How a party of a reliance chain that admits a settlement reversal emits a transitive reversal notice to each downstream party in its own reliance register, propagating a reversal or amendment one hop at a time along a chain no single party enumerates.Contested Pairing in Matched-Pair Settlement: Withheld Recognition, a Distinct-Identity Claimant Count, and the Not-Determinable Resolution How contested pairing handles plural qualifying answers to one settlement offer by withholding matched-pair recognition until the temporal proximity window elapses, counting distinct claimant identities, and ending a contest in a recorded not-determinable outcome.Attributable Contest Resolution: Settling a Contested Offer by Re-Emitting a First Governed Observation That Names Exactly One Claimant How an offering party resolves a contested offer by re-emitting a first governed observation naming exactly one enumerated claimant, so the selection is attributable and independent of arrival order, while unnamed claimants receive a notice that is not a refusal.Local Outcome-Quality Records and Smoothed Endpoint Selection Preference for Governed Inference Dispatch How a persistent semantic agent ranks its own registered inference endpoints from locally held counts of accepted and rejected determinations, corrections, reversals, and dispatch failures, with abstention counts entering neither term of the selection preference.

Applications · general

Applications · specific

ISO 20022 and Settlement Messaging: Matched Pairs in Financial Infrastructure How ISO 20022 financial messaging and matched-pair agent settlement differ on where finality lives, what supplies identity, and what a refusal costs the party that refuses, and how a conduct layer can run alongside standardized payment instructions.Stripe Agent Toolkit: Agent Payments and the Settlement Layer How the Stripe Agent Toolkit fits the agentic payments category, and how it differs architecturally from matched-pair bilateral settlement between AI agents using signed governed observations, proximity windows, and per-party settlement lineage.Visa Intelligent Commerce: Mandates, Trust, and Bilateral Settlement How Visa Intelligent Commerce approaches agentic payments through credentialed mandates and network authorization, and how matched-pair settlement between autonomous agents differs on identity, finality, and what a refusal costs the party that refuses.Mastercard Agent Pay: Tokenized Agent Identity and Settlement How Mastercard Agent Pay's tokenized agent credentials and matched-pair agent settlement differ on where finality attaches, what supplies identity absent enrollment, and what declining costs the party that declines in agent-to-agent commerce.Coinbase x402: Machine-Native Payments and Governed Settlement How the x402 payment protocol and the matched-pair governed settlement architecture occupy adjacent layers of agentic commerce: machine-native payment authorization over HTTP alongside signed bilateral conduct records, identity by continuity, and per-party settlement lineage.Skyfire: Agent Payment Rails and Counterparty Conduct Records How Skyfire's agent payment and identity infrastructure compares with matched-pair settlement between semantic agents, where a signed governed observation from each side, recognized in a proximity window, forms the counterparty conduct record.

Terminology