Existing Decentralised Identifier (DID) methods require coordination, an agreed global order of operations, to update a DID document: blockchain-anchored methods incur fees and latency; lightweight peer methods (did:key, did:peer) offer no update mechanism; and Sidetree methods still require blockchain ordering for finality. We present did:crdt, a DID method that targets W3C DID Core and removes the need for coordination entirely: there is no ledger, no sequencer, and no global total order. Each DID document is composed of signed Conflict-Free Replicated Data Types (CRDTs), one per document field, each chosen so that concurrent edits merge deterministically. By the CALM Theorem, the state-merge path is then confluent: replicas that see the same updates reach the same document in any arrival order. The signed-delta path needs only causal delivery, applying an update after those it builds on, which is far weaker than the total ordering ledgers impose and needs no agreement protocol. We are explicit about scope: every untrusted-peer path is authenticated, so Byzantine fault tolerance (safety even when peers lie or send malformed data) holds for signed deltas and verified-bundle replay, while the unauthenticated state-merge path is a trusted-domain optimisation and key-compromise recovery is bounded by revocation semantics. We give the data and threat model, CRUD semantics, conflict resolution, and a Rust reference implementation with property-based convergence tests and microsecond-scale merge latency.

翻译：现有去中心化标识符（DID）方法在更新DID文档时需要协调机制与全局操作顺序共识：锚定区块链的方法会产生费用和延迟；轻量级对等方法（did:key、did:peer）缺乏更新能力；Sidetree方法仍需区块链顺序化以实现最终一致性。我们提出did:crdt——一种面向W3C DID核心规范、完全消除协调需求的DID方法：无需账本、序列化器或全局全序。每个DID文档由签名后的无冲突复制数据类型（CRDT）组成，每个文档字段对应一个专用CRDT，确保并发编辑可确定性合并。根据CALM定理，状态合并路径具有汇合性：接收相同更新集的副本无论到达顺序如何都将收敛至同一文档。签名增量路径仅需因果传递（在依赖更新生效后应用新更新），其约束远弱于账本施加的全序，且无需共识协议。我们明确界定应用范围：所有非可信对等路径均经身份认证，因此对签名增量与验证包重放具有拜占庭容错性（即使用户作恶或发送错误数据仍能保障安全性），而未认证的状态合并路径则作为可信域优化手段，且密钥泄露恢复受撤销语义约束。我们给出了数据模型与威胁模型、CRUD语义、冲突解决方案，以及包含基于属性的收敛测试与微秒级合并延迟的Rust参考实现。