Low-latency partition tolerant distributed ledger

Andrew T. Gorczyca; Audrey M. Decker

doi:10.1117/12.2305022

9 May 2018 Low-latency partition tolerant distributed ledger

Andrew T. Gorczyca, Audrey M. Decker

Proceedings Volume 10652, Disruptive Technologies in Information Sciences; 106520V (2018) https://doi.org/10.1117/12.2305022
Event: SPIE Defense + Security, 2018, Orlando, FL, United States

Abstract

In this work, we present a low-latency partition tolerant distributed ledger using a novel directed acyclic graph (DAG) structure. By forcing information to be published at specific deterministic locations, we avoid complex consensus algorithms and eliminate confirmation periods. We implement our DAG over a fully decentralized overlay network, leveraging BitTorrent concepts for peer-to-peer (P2P) rendezvous and block propagation. We compute overall expected latency using Erd¨os-R´enyi random graph models and present initial proof-of-concept software. The resulting work will allow anyone to create fully decentralized services (records, databases, etc.) resistant to attack, manipulation, and censorship.

Citation Download Citation

Andrew T. Gorczyca and Audrey M. Decker "Low-latency partition tolerant distributed ledger", Proc. SPIE 10652, Disruptive Technologies in Information Sciences, 106520V (9 May 2018); https://doi.org/10.1117/12.2305022

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available