arXiv (OAI Expanded)
open access
Almost sure one-endedness of a random graph model of distributed ledgers
Blockchain and other decentralized databases, known as distributed ledgers, are designed to store information online where all trusted network members can update the data with transparency. The dynamics of ledger's development can be mathematically represented by a directed acyclic graph (DAG). One
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Almost sure one-endedness of a random graph model of distributed ledgers#798535
- Sharpedo: Dual-Mode Uncertified DAG-Based Consensus Protocol#972635
- Asymptotic versus mesoscopic spectral dimensions in networks and inhomogeneous structures#798664
- Asymptotic versus mesoscopic spectral dimensions in networks and inhomogeneous structures#797250
- Efficient Algorithms for Parallel Dynamic Graph Processing: A Study of Techniques and Applications#707058
Record · ID 797122
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive