PHDAG achieves depth-independent O(1) gas cost for appends in on-chain provenance registries, outperforming incremental Merkle trees beyond very small depths, with linear-time trustless reconstruction from event logs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parent-Hash DAG: A Cost Analysis of Constant-Time Append for On-Chain Registries
PHDAG achieves depth-independent O(1) gas cost for appends in on-chain provenance registries, outperforming incremental Merkle trees beyond very small depths, with linear-time trustless reconstruction from event logs.