Mechanism

The UID resolution query protocol is the interface layer through which platform and application integrations interact with the anchor network. A querying client first computes a candidate UID and a variance band from the candidate artifact using the extraction pipeline. It then dispatches a band-targeted query to the primary anchor cluster governing the identified variance band. The anchor lookup module searches that band's UID index for slope-proximate entries and returns a ranked candidate match list with cosine similarity scores. A policy validation stage evaluates each candidate match against applicable policy objects and filters the results to policy-permitted entries. The result aggregator consolidates the ranked matches and returns a final resolution response comprising matched UIDs, cosine similarity scores, lineage annotations, and policy constraints.

Because the UID is derived deterministically from the artifact's internal variance structure rather than assigned by storage location, file name, or transmission metadata, the querying party submits only the locally computed UID and never transmits the artifact itself. Routing is by variance band rather than by IP address resolution, DNS lookup, or static path traversal: any node that knows the variance value of a target UID can determine which band governs it and direct the query to the appropriate anchor cluster without consulting a central directory.

Four Resolution Modes

The protocol defines four resolution modes, each distinguished by where the candidate's cosine similarity to registered entries falls relative to the policy-declared thresholds. Identity resolution returns exact or near-exact matches, indicating the candidate is a known registered artifact. Derivative resolution returns matches with cosine similarity between the policy-declared continuity threshold and the identity threshold, indicating the candidate is a probable derivative of a known artifact. Orphan resolution returns an empty match set, indicating the candidate has no registered lineage within the governed corpus. Conflict resolution returns multiple matches with overlapping lineage claims and routes to the fork adjudication handler.

These modes are not separate code paths bolted onto a generic lookup. They are readings of a single similarity-scored response against the thresholds carried in the governing policy object, so the same query yields an identity answer, a derivative answer, an orphan answer, or a conflict answer depending on what the anchor index actually contains for that variance band.

Cross-Band Referral

If no match is found in the primary band, the cross-band referral module dispatches adjacency-ordered referral queries to neighboring band clusters in order of variance proximity. The band adjacency graph records which bands share governance boundaries, enabling cross-band resolution pathfinding for content that drifts between bands under mutation. Where an alias is queried without knowledge of the associated slope band, anchors may perform an index pathfinding traversal using deterministic band adjacency rules to locate the governing anchor cluster.

Referral is bounded by policy scope limits and anchor resource availability. The result aggregator consolidates ranked matches from both the primary band query and any referred band queries before returning the final resolution response, so a single client-facing answer reflects results gathered across the adjacent bands that were actually consulted.

Conflict and Fork Adjudication

When a resolution query reveals conflicting alias claims across slope-divergent UIDs, the conflict resolution mode routes to the fork adjudication handler. Adjudication proceeds through anchor quorum review, which evaluates registration timestamps, variance proximity to the canonical UID, policy lineage, and trust zone authority. The quorum may resolve the conflict in favor of one registration, freeze both registrations pending external governance escalation, or quarantine the alias pending variance continuity verification.

All adjudication outcomes are recorded and are accessible to querying parties as provenance metadata. The conflict is surfaced as a first-class resolution outcome with its quorum-recorded determination rather than silently resolved, and all resolution attempts, including negative results, are recorded in the anchor event log to support auditability and conflict detection.

Stateless, Policy-Scoped Resolution

The resolution protocol is stateless from the querying client's perspective. Each query carries the candidate UID, the querying party's policy scope identifier, and a timestamp, and receives a complete resolution response without requiring any prior session establishment or registration by the querying party. Anchor nodes verify the policy scope identifier against the governing policy object for the relevant band and return only those resolution results that fall within the querying party's authorized scope.

This stateless, policy-scoped design lets the protocol be implemented over any transport layer, including HTTP, WebSockets, WebRTC, and delay-tolerant mesh protocols. It supports deployment in disconnected environments where queries are batched and resolved upon reconnection to the anchor network, because no live session state has to survive the disconnection for a later query to be answered correctly.

Bulk Resolution

The protocol supports bulk resolution, in which a querying client submits a batch of candidate UIDs from multiple variance bands in a single request. The anchor network routes each UID in the batch to its corresponding band cluster in parallel, aggregates the results, and returns a bulk resolution response whose entries are indexed to the submitted UIDs.

Bulk resolution enables platforms processing large volumes of content, such as upload pipelines, content moderation systems, and training data ingestion pipelines, to resolve the identity and admissibility status of many artifacts in a single request rather than issuing one query per artifact. Because the per-UID routing happens in parallel within the network, the per-artifact resolution latency is reduced to the latency of a single network round-trip amortized over the batch size.

Prior-Art Distinctions

Conventional content delivery and asset indexing systems reference assets by static identifiers such as uniform resource locators, cryptographic hash pointers, or file-system paths derived from storage location or transmission metadata rather than from the internal structure of the content. Such identifiers are invalidated by mutation, format conversion, resolution change, lossy compression, or replication, and the content distribution networks built on them route on geographic or address-based heuristics that are structurally unaware of payload semantics. They provide no mechanism for derivative attribution, remix lineage, or variance-based similarity across stored objects.

The UID resolution query protocol is distinguished by resolving against a slope-indexed anchor network using variance-derived identifiers. Resolution is directed to the anchor cluster governing a UID's variance band rather than to a network address, similarity is reported as a directly computable cosine score over variance vectors rather than as an opaque exact-match flag, and derivative, orphan, and conflict conditions are returned as explicit resolution modes rather than collapsed into a hit-or-miss lookup. Because the client transmits only the computed UID and the response carries policy constraints, the protocol governs identity and admissibility together without a central registry.

Disclosure Scope

The UID resolution query protocol, comprising the band-targeted query to the primary anchor cluster, the anchor lookup module's ranked candidate match list with cosine similarity scores, the policy validation stage, the cross-band referral module's adjacency-ordered referral in order of variance proximity, the result aggregator, the four resolution modes of identity, derivative, orphan, and conflict resolution, the routing of conflicts to the fork adjudication handler, the stateless and policy-scoped query and response design over arbitrary transports, and bulk resolution across multiple variance bands, is disclosed in PCT International Application No. PCT/US26/28630 at Section 16, together with the supporting variance band classification and anchor distribution of Section 5, the semantic alias registration and resolution and fork adjudication of Section 7, and the semantic routing and cache policy enforcement of Section 9. This article describes that disclosed mechanism.

The disclosure is not limited to any particular transport layer, hash function, or band granularity. It contemplates finer band granularity or a continuous slope spectrum with fuzzy band boundaries, implementation over connected or delay-tolerant transports, and resolution in disconnected environments where queries are batched and resolved upon reconnection. The structural guarantees depend on variance-derived identity, slope-band routing, and policy-scoped resolution rather than on any specific instantiation of those components.