Two answers, one offer, and a record with no counterparty

A matched pair (600) comprises a first governed observation (608) from a first party representing an offer, a tender, a claim, a demand, or a commitment, and a second governed observation (610) from a second party representing an acceptance, a counter-tender, an acknowledgment, a refusal, or a fulfillment. The two are recognized as a pair by a pairing rule within one or more of a spatial proximity window and a temporal proximity window (602), each such window declared in the governing policy object. The pair is bound into a settlement record (604) comprising the two signed observations, a cryptographic binding over both, and an attestation of the window within which the pair was recognized.

The filed disclosure treats the plurality case ahead of the resolution. No matched pair (600) is recognized upon a first governed observation (608) until its temporal proximity window has elapsed, and each second observation (610) satisfying the pairing rule is held pending and appended as received with its emitter's identity, epoch, and receipt time. On elapse, a contested-pairing detector counts the distinct emitter identities held pending: zero resolves as a timeout, one pairs and settles, and two or more identifies a contest.

Where a contest is identified, no observation of the plurality pairs, no settlement-lineage entry is written, and the first observation resolves to a not-determinable outcome (126) of the offering party's abstention class. Every second observation stands appended, no meter of any party is incremented, and the offering party appends a contested-offer record enumerating each claimant's identity, epoch, and receipt time. A plurality of observations bearing one identity counts as one claimant, so a party that retried is one claimant rather than several.

What that record holds is an enumeration of claimants and no selected counterparty.

How a named re-emission settles a contested offer

The offering party resolves a contested-offer record by re-emitting a fresh first governed observation (608). A governed observation is a signed structure comprising, at minimum and in sequence, an authority credential field, a continuity hash field encoding identity continuity of the emitting party, a spatial reference field, a temporal reference field, a time-to-live field, a payload field, and an observation lineage field. Emission is complete upon emission, the emitting party requiring no acknowledgment, no handshake, no delivery confirmation, and no registration with a central authority as a condition of emission.

The named-claimant field carries the selection. That field names exactly one identity primitive, drawn from the record's claimant enumeration. Two constraints are recited together: the cardinality of the field, which is one, and the set from which the name is drawn, which is the enumeration already appended in the contested-offer record.

Malformed forms are recorded rather than dropped. A field naming none, naming several, or naming an unenumerated party is appended as attempted and given no effect.

The pairing rule narrows to the named party. The re-emitted observation's pairing rule is satisfied only by a second observation (610) from the named claimant, so any other party's observation does not pair. Where the named claimant answers and the rule is satisfied, settlement occurs upon recognition and admission of the pair on the ordinary terms of Section 6.

The offering party appends a contest resolution entry recording the selection, which is thereby attributable to it and independent of arrival order. Receipt time is carried in the claimant enumeration as a recorded attribute of each claimant, and the selection is stated as independent of that ordering.

Claimants not named are told. The offering party emits to each non-named enumerated claimant a non-selected claimant notice that is not a refusal, increments no meter, and leaves that claimant's credentials and pairing capacity unimpaired. The filing's refusal path is metered differently: emission of a refusal observation by a party that declines to complete a pairing is metered by a refusal meter carried in the memory field (102) of the refusing party, against that party's own settlement-binding authorization, the meter being incremented once upon each emission of a refusal observation. Responsive to that meter satisfying a bound declared in the governing policy object, the settlement-binding authorization is written from a granting state to a withheld state. A non-selected claimant notice is expressly not a refusal.

Silence of the named claimant is provided for, and bounded. Where the named claimant is silent within the window, the offering party may re-emit naming a different enumerated claimant, subject to a re-emission count bound. Each element of that permission is conditional: it arises on silence within the window, the differently named party must itself be an enumerated claimant, and the sequence is subject to the stated bound. A first governed observation (608) receiving no matching second observation within the temporal proximity window (602) is identified by the timeout detector, and a timeout resolves nothing against either party, neither the party whose observation went unanswered nor the party that did not answer incurring any adverse consequence.

Which quantities the filing declares and which it leaves to policy

Cardinality is fixed and stated: the named-claimant field names exactly one identity primitive, drawn from the record's claimant enumeration. The disqualifying forms are recited as naming none, naming several, or naming an unenumerated party, and the consequence attached to each is the same, being appended as attempted and given no effect.

Counting in the detector is over identities rather than messages. The recited thresholds are zero, one, and two or more distinct emitter identities held pending on elapse, and a plurality of observations bearing one identity counts as one claimant.

The re-emission count bound is named without being sized. A further re-emission naming a different enumerated claimant is subject to that bound, for which the filing states no numeric value, no default, and no permitted range.

Window duration is likewise declared rather than valued. The temporal proximity window (602) is declared in the governing policy object and defined by one or more of an absolute duration measured from the first governed observation (608), a declared relative event, a multi-event condition, a credentialed authority timing, an operational-context window, an adaptive window, a count of epochs of the dynamic agent hash chain, and any temporal-window form declared in the governing policy object.

No metering quantity is engaged along this path. On a contest, no meter of any party is incremented, and the non-selected claimant notice increments no meter. The refusal increment and the refusal-meter bound are policy-declared quantities of the refusal observation, which this notice is not.

Where the resolution sits in the settlement architecture

The mechanism appears in Section 10.5 of the filing, titled "Tool provenance, reliance, and contested pairing," and draws on the paragraph immediately preceding it, which supplies the held-pending discipline, the contested-pairing detector, and the contested-offer record whose enumeration the named-claimant field draws from.

Beneath both paragraphs sits Section 6. The re-emitted artifact is a governed observation under Section 6.1; the pairing rule and windows it operates in are those of Section 6.2; an unanswered re-emission is identified by the timeout detector of Section 6.5. A settlement writes the settlement record (604), writes the settlement-lineage entry (606) of Section 6.6 into the append-only lineage field (104) of each party, writes the settled state into the counterparty identity record (114) each party holds of the other, and effects the state transition the pair was formed to effect, being a transition of the authorization gate (300) for an enumerated action class, a promotion or demotion of a persistence designation, or a transfer of a settlement-binding authorization. Section 6.3 attaches three negative conditions to that settlement: no third-party intermediary participates, no centralized consensus is computed, and no pre-negotiated session state exists between the parties.

Section 5 governs what the contest itself emitted. Where an input required by a determination is unavailable, incomplete, or unresolvable, the determination emits an outcome entry of a recorded abstention class identifying the unavailable input, and emits no outcome adverse to the semantic agent (100), to an asserting party (118), or to a counterparty. The conversion bar (502) forecloses a consuming determination from converting an abstention outcome into a scalar value, into a default value, into an operand of a threshold comparison (510), or into a consequence adverse to any party, and no counter of the architecture is incremented by an abstention outcome.

Downstream, a settlement reached by named re-emission is reachable by the rest of Section 10.5 on the same terms as any other. A relying party that independently verifies the settled pair and then produces a determination consuming that settlement appends a reliance record and emits it to both settled parties, which enter it in a reliance register. A settled party reversing or amending the settlement evaluates a reliance-completeness predicate against its own register, and where the predicate is not satisfied the reversal record is appended as an attempted-reversal entry and the settlement is not reversed. Challenge to the pair itself runs through the credentialed dispute procedure of Section 6.16, no step of which increments any refusal meter of either party.

Distinguishing consensus rounds, order books, and reservation locks

Several established lines of engineering address the same underlying condition, contention for a single opportunity. The comparisons below are structural and assert nothing about any product, party, or practice.

Consensus and leader-election protocols resolve contention by agreement among a set of participants, using quorums, ballots, or total ordering to decide which proposal prevails. The filed settlement layer recites the opposite precondition: no quorum, no distributed ledger commit, and no consensus round is a condition of settlement, and finality attaches upon recognition and admission of the pair itself.

Timestamp-priority and first-come-first-served matching, familiar from order books and reservation systems, awards the opportunity to the earliest arrival. Receipt time survives in this filing as a recorded attribute inside the claimant enumeration, and the selection is recited as independent of arrival order.

Randomized backoff, used in contention-based media access, answers a detected collision by having the contenders retry after randomized intervals. In the filed path the re-emission is performed by the offering party rather than by the claimants, and it carries the selection inside the named-claimant field of the re-emitted observation.

Venue-adjudicated auction and request-for-quote flows place bids with a marketplace that awards the deal and notifies losing bidders. Here the offering party appends the contest resolution entry itself, and the settlement that follows is subject to the recital that no clearing party, no payment processor, no platform adjudicator, and no escrow party is required for the pair to settle.

Reservation-and-confirm locking, including two-phase commit style holds, resolves contention by locking a resource to one claimant while others are rejected. Nothing is locked in the filed path. Every second observation of the plurality stands appended, no meter of any party is incremented, and a non-named enumerated claimant retains its credentials and pairing capacity unimpaired.

Score-based tie-breaking picks among claimants by a computed reputation, priority, or quality value. The filed paragraph recites the cardinality of the named-claimant field and the set the name is drawn from, and recites no score; the abstention outcome the contest produced could not become an operand of a threshold comparison (510).

Each of these approaches answers a real requirement and can coexist with what the filing describes. What the filed paragraph adds is narrower: a resolution performed inside a re-emitted first observation whose pairing rule admits one named answerer, recorded by the offering party as its own act.

Disclosure Scope

This article describes subject matter disclosed in U.S. Provisional Application No. 64/117,812, at Section 10.5, paragraph [0414], titled "Attributable contest resolution by named re-emission." Its immediate predicate is paragraph [0413] of the same section, titled "Contested pairing and the not-determinable resolution," which supplies the held-pending discipline, the contested-pairing detector, and the contested-offer record. Supporting architecture appears at Section 6.1 for the governed observation, Section 6.2 for the matched pair (600) and the temporal proximity window (602), Section 6.3 for the three negative conditions, Section 6.5 for the timeout detector, Section 6.6 for the settlement-lineage entry (606), Section 6.7 for the refusal meter, Section 6.16 for credentialed dispute resolution, Section 5.1 for the abstention invariant, Section 5.4 for the conversion bar (502), and paragraphs [0408] through [0409] for reliance registration and the reliance-completeness predicate.

Everything asserted above is drawn from that filed disclosure. Descriptions are of embodiments, and the scope of any exclusive right is determined by the claims of any application claiming benefit of that provisional, not by this article. Publication establishes public, timestamped prior art on this mechanism. It is not a license, an offer, or legal advice.