Synchronic Web Digital Identity: Speculations on the Art of the Possible

Justin Li; Ken Goss; Mitch Negus; Thien-Nam Dinh

REVIEW 4 major objections 6 minor 19 references

Synchronic Web Digital Identity: Speculations on the Art of the Possible

T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Digital identity, the paper argues, is an unbroken sequence of states in a well-defined digital space, and a global network of entangled Merkle trees can anchor every statement to an author and a time.

desk verdict A well-scoped vision paper that honestly labels its open problems; the central cryptographic primitive may be impossible, but the taxonomy and clearly posed question deserve a referee. read the letter →

arxiv 2506.01856 v1 pith:4IIWIDOB submitted 2025-06-02 cs.CR

Thien-Nam Dinh , Justin Li , Mitch Negus , Ken Goss This is my paper

classification cs.CR

keywords digitalidentitycryptographicprovenanceMerkletreeentangledstatesSynchronicWebplausibledeniabilityzero-knowledgeproofsdecentralized

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that the usual notion of digital identity—logins, credentials, identifiers—should be replaced by a broader one: a digital identity is an unbroken sequence of computational states, in a well-defined digital space, that corresponds to a real-world entity. On this view, the two objectively knowable facts about any statement are who made it and when, and the paper's central bet is that a global network of entangled Merkle-tree states, called the Synchronic Web, will someday emerge to make those facts cryptographically verifiable at Internet scale. If that bet pays off, provenance would become an infrastructure rather than a platform promise, and social consensus could build on an objective foundation while the subjective truth of statements remains outside the system. The paper is openly speculative: it describes a design space, not a deployed system, and it names the feasibility of deniable proofs as an open research question.

What carries the argument

The central object is the binary Merkle tree: leaves hold semantically meaningful content, internal nodes hold cryptographic hashes of their children, and the root hash acts as a fixed-size fingerprint of the whole tree under a collision-resistant hash function. Entanglement is the operation that makes the root of one tree a leaf of another, so that the state of one node is cryptographically committed inside the state of another; because entanglement is transient, an arbitrarily large network of such commitments can form. This object carries the argument because it turns "who said what, when" into a question that can be answered by checking a root hash. A second, still-open piece of machinery is the proposed proof system that would combine zero-knowledge proofs (proofs that reveal nothing beyond the claim being made) with message authentication codes (shared-secret tags that authenticate a message) to let a prover convince a verifier of integrity and location in the tree while keeping the proof non-replayable, thereby preserving plausible deniability.

What would settle it

A concrete falsification would be a protocol-level attack or impossibility result showing that any proof a prover hands to a verifier in such a system can always be replayed by the verifier to convince a third party, with no way to bind the proof to the original verifier; alternatively, a direct demonstration that the proposed zero-knowledge-proof-plus-MAC combination cannot simultaneously preserve soundness and deniability would settle the question negatively.

Watch

Extended reading notes

Core claim

The paper's core claim is that identity is not a credential or an account but a complete, semantically linked history of states of an entity on an information system. From that definition, the paper develops a model in which every state is a node in a Merkle tree and trees can be entangled by making one tree's root a leaf of another; the global graph of such entanglements is the Synchronic Web. The paper claims this network already exists in partial form, because public blockchains already commit, through chains of hashes, to the roots of millions of other semantic trees, and that it will eventually grow to cover the Internet. On top of this substrate it describes verifiable links, hubs, and chains as microstructures, and centralized, federated, interoperated, and decentralized topologies as macrostructures that different use cases would choose between. The paper's stated goal is to provide a more rigorous and more expansive foundation for digital identity than existing self-sovereign identity frameworks, while explicitly leaving subjective truth and normative questions out of scope.

Load-bearing premise

The load-bearing premise is that a proof system can be built that combines zero-knowledge proofs with message authentication codes so that a prover can convincingly prove integrity and location of a statement without any verifier being able to replay that proof to a third party; the paper itself states that the feasibility of such a system is an open research question.

Editorial extensions

If this is right

Every statement made through the system can be anchored to an author and a time, so verification of provenance becomes a local hash check rather than a call to a platform.
Standards bodies could publish their decisions as explicit branches of a global cryptographic data structure, making the standardization process itself auditable.
Key recovery can be implemented as a social mechanism: with $n$ entangled issuers, a holder can declare that any $m$ of them may help establish a new key.
Credential revocation becomes a spectrum from issuer-controlled to holder-controlled credentials, trading integrity against confidentiality.
The global network of entangled states is expected to organize into locally optimal topologies, with small-world structure, rather than one uniform design.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The authors leave open what happens to "right to be forgotten" under this model; a direct extension is that erasure and cryptographic provenance can only be reconciled by building expiry or rotation into the state sequence itself, which the paper does not design.
If the deniable-proof system proves impossible, the synchronic web's value does not necessarily collapse: it could still serve as a global audit layer for entities that do not require deniability, such as organizations and public officials.
A testable extension would be to measure current entanglement in public blockchains: counting how many independent semantic trees are committed under common root hashes would give an early quantitative check on the "already emerging" hypothesis.
The identity-as-state-sequence definition suggests a research program in which identity verification is reduced to state-machine synchronization, potentially connecting to formal methods for distributed systems that the paper only gestures at.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

This is not a research paper; it's a research agenda from Sandia, and it is honest about being one. The useful parts are the taxonomy of microstructures (links, hubs, chains) and macrostructures (centralized, federated, interoperated, decentralized) applied to digital identity, and the explicit naming of an open cryptographic problem in Section 5.2. The identity-as-sequence-of-states framing is borrowed from Parfit, reasonably credited, and the Merkle-tree entanglement is essentially a restatement of hash-linked state structures already common in blockchains. What is new is the organizational language and the application to identity infrastructure, not the underlying primitives.

The paper does several things well. It is clearly written, well-scoped, and candid about its own limits. The authors state directly that concrete results are future work, that the feasibility of the plausibly-deniable proof system is an open research question, and that formal methods and emulation remain to be done. That is rare and credible. The coverage of existing standards (IETF, W3C, ISO) and decentralized-web projects is a fair, informative sample.

The stress-test concern is real and lands on the paper's own admission. The central vision depends on a ZKP-plus-MAC construction that lets Peggy convince Victor without giving him transferable evidence. As the stress-test note observes, if the proof is convincing, it can be replayed unless bound to a secret shared only by Peggy and Victor; but if Victor knows that secret, he can forge proofs from Peggy. The paper acknowledges the difficulty but offers no sketch or argument that the requirements are simultaneously satisfiable. This is a load-bearing gap, not a minor one. The paper's phrase 'will someday emerge' (Section 3.1) is consequently more wish than prediction. I do not think the authors are hiding this—they flag it explicitly—but it means the paper's value is in posing the question, not answering it.

Other soft spots are minor relative to the genre: the SDK description is an aside, the 'Synchronic Web' brand is heavier than the concept, and the references are fine but not exhaustive. None of that undercuts the paper as a vision piece.

Who gets value from this? Someone designing identity architectures or thinking about the plausible-deniability cost of provenance systems. It could inform a research agenda, especially the open problem in Section 5.2. I would not cite it for technical results, but I might cite it as a position piece.

Recommendation: send it to peer review at a venue that accepts vision papers or speculative system designs. At a top-tier security or systems venue it lacks technical substance and would reasonably be desk-rejected; at a workshop or a more reflective venue it deserves referee time. The paper deserves a serious referee because it frames a genuinely hard problem clearly enough to guide future work.

Referee Report

4 major / 6 minor

Summary. This paper proposes a conceptual framework for digital identity built on a hypothetical “Synchronic Web,” a global network of mutually entangled Merkle-tree states. It defines digital identity as an unbroken sequence of semantic states over time, then describes microstructures (verifiable links, hubs, chains) and macrostructures (centralized, federated, interoperated, decentralized) as components of this infrastructure. The paper explicitly acknowledges that the central cryptographic mechanism needed to preserve plausible deniability—a non-replayable proof of authorship—is an open research question, and it frames concrete results as future work.

Significance. If the proposed vision were realized, the Synchronic Web would provide cryptographic provenance for every statement at Internet scale, potentially serving as an objective foundation for digital identity, reputation, and social consensus. The paper’s taxonomy of network topologies and its honest acknowledgment of the open cryptographic problem are useful starting points for discussion. The manuscript contains no formal derivation, no experimental data, no code, and no machine-checked proofs, so its value is as a speculative roadmap rather than a validated technical contribution.

major comments (4)

[§5.2] The central cryptographic requirement—a proof that convinces Victor of Peggy’s authorship but cannot be replayed by Victor to a third party—is load-bearing for the entire paper, yet the paper states that “the feasibility of designing such a system is an open research question.” This is not a minor caveat: if such a proof cannot exist, the claimed ability to anchor every statement to an author and time collapses. The authors should either provide a concrete construction or proof sketch, or give an explicit impossibility/possibility argument. As stated, the requirements appear to be in tension: a proof carrying transferable evidence of authorship violates condition (3), while a proof bound to a secret shared only between Peggy and Victor would allow Victor to forge proofs from Peggy to himself, undermining the authenticity guarantee.
[§3.1–3.2] The central hypothesis that a global synchronic web “will someday emerge” is presented without a mechanism, incentive structure, or comparison to existing interoperability efforts. Section 3.2 notes that public blockchains already approximate entangled states, but it does not explain how the current fragmented ecosystem would converge into the proposed global identity-bearing structure. Without a clearer argument for emergence, the prediction remains an article of faith rather than a defensible claim about the future.
[§4.1–4.2] The micro- and macrostructure definitions are informal. Terms such as “entanglement,” “complete set of all links,” and “rounds” are not formally defined, making claims like “a verifier can only verify a hub if the prover can formally define the set of relevant links” untestable. A precise formal model of state, time, and link semantics is necessary to give the proposed security properties concrete meaning and to allow future falsification.
[§5.2] The paper discusses trade-offs between integrity and deniability but never defines an adversarial model. To evaluate whether the proposed system is secure, one must know the assumed capabilities of attackers (e.g., adaptive vs. static, computationally bounded vs. unbounded, network-level vs. cryptographic) and the exact definition of “repudiation” in this setting. Without a threat model, the claimed trade-off space cannot be assessed, and the reader cannot determine whether the proposed primitive is even coherent.

minor comments (6)

[Abstract] The sentence “The primary objective of this document to extend the body of existing work” is missing the verb “is” before “to extend.”
[§1] The phrase “the confidence value that an digital identity is willing” should be “that a digital identity is willing.”
[§2.2] The protocol name “ActivityHub” in the Mastodon bullet should be “ActivityPub,” matching reference [18].
[§3.2] The phrase “The most current piece of software that we maintain is an SDK” is awkward; consider “The most recent piece of software we maintain is an SDK.”
[§5.3] The “proof-of-concept path-finder system” is mentioned but never described; please clarify what this prototype is and how it relates to the SDK mentioned in Section 3.2.
[References] Several standards are cited only through inline URLs (footnotes 3 and 4) rather than through the numbered reference list; please make the citation format consistent throughout.

Circularity Check

0 steps flagged · score 0.0 of 10

No material circularity: the paper is an explicitly speculative proposal whose central claim is a stated hypothesis, not a derivation that reduces to its own inputs.

full rationale

The paper makes no quantitative derivation, fits no parameters, and offers no prediction that could be statistically forced. Its central assertion is explicitly a hypothesis: 'We hypothesize that such a network will someday emerge' (Section 3.1). The one hard technical requirement it identifies is expressly left open: 'The feasibility of designing such a system is an open research question' (Section 5.2). The definition of digital identity as an unbroken sequence of states is stipulated as a philosophical premise, not derived, so no self-definitional reduction occurs. The phrase 'a Sandia-developed infrastructure' asserts institutional origin but is not used as evidence in a derivation chain; no uniqueness theorem or prior-work citation is load-bearing. The cost discussion in Section 5.2 is an honest limitation, not a hidden input. Accordingly, none of the enumerated circularity patterns appear: there is no fitted input called a prediction, no imported uniqueness, no ansatz smuggled via citation, and no renaming of a known result presented as derivation. Any concerns about the feasibility of the proposed zero-knowledge/MAC system belong under correctness risk, not circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

The central claims rest on several unproved assumptions about the existence and security of a global entangled state network, plus a definition of identity adopted from prior philosophy. No free parameters are fitted because the paper makes no quantitative predictions.

assumptions (4)

standard math A collision-resistant hash function yields a 1:1 relationship between root hash and tree contents.
Invoked in Section 3.1 as the basis for referring to any information by a fixed-size root hash.
domain assumption Digital identity is an unbroken sequence of states in a well-defined digital space.
Adopted in Section 1 from Derek Parfit's characterization and used as the foundation of the entire model.
domain assumption Entangling Merkle trees yields a 'unique, secure context' enabling joint computations.
Stated without proof in Section 3.1; the security and capability properties of entanglement are not formally analyzed.
ad hoc to paper A global synchronic web will emerge over time.
Explicitly hypothesized in Sections 3.1 and 4.2 with no evidence provided; the paper treats this as a future possibility.

invented entities (2)

Synchronic Web
purpose: A hypothesized global network of entangled Merkle-tree states intended to underpin digital identity and provenance at Internet scale.
No implementation, measurement, or external validation is provided. The paper says the network 'will someday emerge' as a hypothesis, and the concept is introduced by the authors themselves.
Verifiable links, hubs, and chains
purpose: Proposed microstructures for modeling identity relationships within the synchronic web.
Descriptive naming of design patterns without formal specification, security analysis, or implementation.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Synchronic Web Digital Identity: Speculations on the Art of the Possible." pith.science (2026). https://pith.science/paper/4IIWIDOB

@misc{pith2026250601856,
  author       = {Pith},
  title        = {Pith review of: Synchronic Web Digital Identity: Speculations on the Art of the Possible},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4IIWIDOB}},
  note         = {Machine review of arXiv:2506.01856}
}

read the original abstract

As search, social media, and artificial intelligence continue to reshape collective knowledge, the preservation of trust on the public infosphere has become a defining challenge of our time. Given the breadth and versatility of adversarial threats, the best--and perhaps only--defense is an equally broad and versatile infrastructure for digital identity. This document discusses the opportunities and implications of building such an infrastructure from the perspective of a national laboratory. The technical foundation for this discussion is the emergence of the Synchronic Web, a Sandia-developed infrastructure for asserting cryptographic provenance at Internet scale. As of the writing of this document, there is ongoing work to develop the underlying technology and apply it to multiple mission-specific domains within Sandia. The primary objective of this document to extend the body of existing work toward the more public-facing domain of digital identity. Our approach depends on a non-standard, but philosophically defensible notion of identity: digital identity is an unbroken sequence of states in a well-defined digital space. From this foundation, we abstractly describe the infrastructural foundations and applied configurations that we expect to underpin future notions of digital identity.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

19 extracted references · 18 canonical work pages

[1]

extensible access control markup language (xacml) version 1.0

Anne Anderson, Anthony Nadalin, B Parducci, D Engovatov, H Lockhart, M Kudo, P Humenn, S Godik, S Anderson, S Crocker, et al. extensible access control markup language (xacml) version 1.0. Oasis, 2003

work page 2003
[2]

The Coq proof assistant reference manual: Version 6.1

Bruno Barras, Samuel Boutin, Cristina Cornes, Judicaël Courant, Jean-Christophe Filliatre, Eduardo Gimenez, Hugo Herbelin, Gerard Huet, Cesar Munoz, Chetan Murthy, et al. The Coq proof assistant reference manual: Version 6.1. PhD thesis, Inria, 1997

work page 1997
[3]

Remote ATtestation procedureS (RATS) Architecture

Henk Birkholz, Dave Thaler, Michael Richardson, Ned Smith, and Wei Pan. Remote ATtestation procedureS (RATS) Architecture. RFC 9334, January 2023

work page 2023
[4]

Idris, a general-purpose dependently typed programming language: Design and implementation

Edwin Brady. Idris, a general-purpose dependently typed programming language: Design and implementation. Journal of functional programming, 23(5):552–593, 2013

work page 2013
[5]

The policy machine: A novel architecture and framework for access control policy specification and enforcement

David Ferraiolo, Vijayalakshmi Atluri, and Serban Gavrila. The policy machine: A novel architecture and framework for access control policy specification and enforcement. Journal of Systems Architecture, 57(4):412–424, 2011

work page 2011
[6]

System for Cross-domain Identity Management: Core Schema

Phil Hunt, Kelly Grizzle, Erik Wahlstroem, and Chuck Mortimore. System for Cross-domain Identity Management: Core Schema. RFC 7643, September 2015

work page 2015
[7]

Personal identification - iso-compliant driving license - part 5; mobile driving license (mdl) application

ISO/IEC. Personal identification - iso-compliant driving license - part 5; mobile driving license (mdl) application. 2021

work page 2021
[8]

Bluesky and the at protocol: Usable decentralized social media

Martin Kleppmann, Paul Frazee, Jake Gold, Jay Graber, Daniel Holmgren, Devin Ivy, Jeromy Johnson, Bryan Newbold, and Jaz Volpert. Bluesky and the at protocol: Usable decentralized social media. arXiv preprint arXiv:2402.03239, 2024

arXiv 2024

Show all 19 references

[9]

Cosmos whitepaper

Jae Kwon and Ethan Buchman. Cosmos whitepaper. A Netw. Distrib. Ledgers, 27, 2019

2019
[10]

Michael Myers, Rich Ankney, Ambarish Malpani, Slava Galperin, and Carlisle Adams. X. 509 internet public key infrastructure online certificate status protocol-ocsp. Technical report, 1999

1999
[11]

Reasons and persons

Derek Parfit. Reasons and persons. Oxford University Press, 1987

1987
[12]

Openid connect core 1.0

Natsuhiko Sakimura, John Bradley, Mike Jones, Breno De Medeiros, and Chuck Mortimore. Openid connect core 1.0. The OpenID Foundation
[13]

Solid: a platform for decentralized social applications based on linked data

Andrei Vlad Sambra, Essam Mansour, Sandro Hawke, Maged Zereba, Nicola Greco, Abdurrahman Ghanem, Dmitri Zagidulin, Ashraf Aboulnaga, and Tim Berners-Lee. Solid: a platform for decentralized social applications based on linked data. MIT CSAIL & Qatar Computing Research Institut...

2016
[14]

Verifiable credentials data model 1.1

Manu Sporny, Dave Longley, and David Chadwick. Verifiable credentials data model 1.1. 2022

2022
[15]

Decentralized Identifiers (DIDs) v1.0

Manu Sporny, Dave Longley, Markus Sabadello, Drummond Reed, Orie Steele, and Christopher Allen. Decentralized Identifiers (DIDs) v1.0. 2021. 16

2021
[16]

Bharadwaj Vijay, Hubert Le Van Gong, Dirk Balfanz, Alexei Czeskis, Arnar Birgisson, Jeff Hodges, Michael Jones, Rolf Lindeman, and J.C. Jones. Web authentication: An api for accessing public key credentials level 1. 2017

2017
[17]

Networks, dynamics, and the small-world phenomenon

Duncan J Watts. Networks, dynamics, and the small-world phenomenon. American Journal of sociology, 105(2):493–527, 1999

1999
[18]

Activitypub

Christopher Lemmer Webber, Jessica Tallon, Erin Shepherd, Amy Guy, and Evan Prodromou. Activitypub. W3C, 2018

2018
[19]

Polkadot: Vision for a heterogeneous multi-chain framework

Gavin Wood. Polkadot: Vision for a heterogeneous multi-chain framework. White paper, 21(2327):4662, 2016. 17

2016

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [1]

extensible access control markup language (xacml) version 1.0

Anne Anderson, Anthony Nadalin, B Parducci, D Engovatov, H Lockhart, M Kudo, P Humenn, S Godik, S Anderson, S Crocker, et al. extensible access control markup language (xacml) version 1.0. Oasis, 2003

work page 2003

[2] [2]

The Coq proof assistant reference manual: Version 6.1

Bruno Barras, Samuel Boutin, Cristina Cornes, Judicaël Courant, Jean-Christophe Filliatre, Eduardo Gimenez, Hugo Herbelin, Gerard Huet, Cesar Munoz, Chetan Murthy, et al. The Coq proof assistant reference manual: Version 6.1. PhD thesis, Inria, 1997

work page 1997

[3] [3]

Remote ATtestation procedureS (RATS) Architecture

Henk Birkholz, Dave Thaler, Michael Richardson, Ned Smith, and Wei Pan. Remote ATtestation procedureS (RATS) Architecture. RFC 9334, January 2023

work page 2023

[4] [4]

Idris, a general-purpose dependently typed programming language: Design and implementation

Edwin Brady. Idris, a general-purpose dependently typed programming language: Design and implementation. Journal of functional programming, 23(5):552–593, 2013

work page 2013

[5] [5]

The policy machine: A novel architecture and framework for access control policy specification and enforcement

David Ferraiolo, Vijayalakshmi Atluri, and Serban Gavrila. The policy machine: A novel architecture and framework for access control policy specification and enforcement. Journal of Systems Architecture, 57(4):412–424, 2011

work page 2011

[6] [6]

System for Cross-domain Identity Management: Core Schema

Phil Hunt, Kelly Grizzle, Erik Wahlstroem, and Chuck Mortimore. System for Cross-domain Identity Management: Core Schema. RFC 7643, September 2015

work page 2015

[7] [7]

Personal identification - iso-compliant driving license - part 5; mobile driving license (mdl) application

ISO/IEC. Personal identification - iso-compliant driving license - part 5; mobile driving license (mdl) application. 2021

work page 2021

[8] [8]

Bluesky and the at protocol: Usable decentralized social media

Martin Kleppmann, Paul Frazee, Jake Gold, Jay Graber, Daniel Holmgren, Devin Ivy, Jeromy Johnson, Bryan Newbold, and Jaz Volpert. Bluesky and the at protocol: Usable decentralized social media. arXiv preprint arXiv:2402.03239, 2024

arXiv 2024