Proof-of-Descendancy: Identity for Self-Replicating LLM Agents
A Blockchain-Based Framework for Verifiable Agent Lineage in OpenClaw
M. Ahmed (TU Delft - Electrical Engineering, Mathematics and Computer Science)
J.A. Pouwelse – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
B. Nasrulin – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
A.E. Zaidman – Graduation committee member (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Self-replicating OpenClaw agents need decentralised identity and authorisation mechanisms that do not rely on centralised providers or registries. However, ordinary key ownership cannot show whether an agent is an authorised descendant of a trusted origin rather than a spoofed, cloned, or unauthorised instance. This thesis proposes a proof-of-descendancy framework that combines hierarchical deterministic key separation, parent-signed child certificates, Merkle-batched Bitcoin anchoring, revocation and capability checks, and IPv8/OpenClaw admission. Parent-signed child certificates provide the primary authorisation evidence, while Bitcoin anchoring supplies tamper-evident commitment evidence rather than authorisation by itself. A prototype evaluation with mock Bitcoin anchoring showed that valid lineage proofs were accepted, tested malformed and adversarial proofs were rejected, proof size and verification latency increased predictably with lineage depth, and lineage verification could influence OpenClaw admission decisions. The result is a unified lineage-aware identity and admission model for self-replicating agents, demonstrating feasibility within a prototype setting.