Impact of delay classes on the data structure in IOTA

  title={Impact of delay classes on the data structure in IOTA},
  author={Andreas Penzkofer and Olivia Saa and Daria Dziubałtowska},
In distributed ledger technologies (DLTs) with a directed acyclic graph (DAG) data structure, a message-issuing node can decide where to append that message and, consequently, how to grow the DAG. This DAG data structure can typically be decomposed into two pools of messages: referenced messages and unreferenced messages (tips). The selection of the parent messages to which a node appends the messages it issues, depends on which messages it considers as tips. However, the exact time that a… 

Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG

A framework to analyse liveness and safety under different communication and adversary models is proposed, which allows providing impossibility results in some edge cases and in the asynchronous communication model.

Some mathematical topics in blockchain and digital ledger technology

One of the mathematical themes addressed is the topic of one-way functions, and it is shown how this idea is used to provide security protocols for Bitcoin and a mathematical algorithm which is being used on digital exchanges to facilitate automatic trading, thereby providing profit opportunities for cryptocurrency investors.

A Markov Process Theory for Network Growth Processes of DAG-based Blockchain Systems

A continuous-time Markov process is set up to analyze the DAG-based blockchain system and it is proved that the QBD process must be irreducible and positive recurrent, and a new method for computing the average sojourn time of any arriving internal tip at this system is proposed.

Robustness of the Tangle 2.0 Consensus

The experimental results demonstrate that the Tangle 2.0 protocol is robust to the bait-and-switch attack up to the theoretical upper bound of the adversary’s 33% voting weight.



Perigee: Efficient Peer-to-Peer Network Design for Blockchains

Perigee is simple, computationally lightweight, adversary-resistant, and compatible with the selfish interests of peers, making it an attractive p2p protocol for blockchains.

A Comparative Analysis of DAG-Based Blockchain Architectures

A comparative analysis of most popular DAG based blockchain architectures including Nxt, IOTA, Orumesh, Dag coin, DagCoin, Byteball, Nano and XDAG to outline the best of all worlds DAG-based blockchain architecture.

The Tangle

The mathematical foundations of IOTA, a cryptocurrency for the Internet-of-Things (IoT) industry, are analyzed, and a family of Markov Chain Monte Carlo (MCMC) algorithms are contributed.

FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures

Distributed Ledger Technology: Blockchain Compared to Directed Acyclic Graph

This paper examines the applied data structures for maintaining the ledger, consensus mechanisms, transaction confirmation confidence, ledger size, and scalability in Bitcoin, Ethereum and Nano.

Blockchain-Free Cryptocurrencies : A Framework for Truly Decentralised Fast Transactions

This paper proposes to forgo the “blocks” and “chain” entirely, and build a truly distributed ledger system based on a lean graph of cross-verifying transactions, meaning that any valid transaction entering the system will quickly become enshrined into the ancestry upon which all future transactions will rest.

The Coordicide

4 Autopeering 17 4.1 Peer discovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4.2 Neighbor selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.3 Network

Robustness and efficiency of voting consensus protocols within byzantine infrastructures

Information propagation in the Bitcoin network

This paper analyzes how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas, and verifies the conjecture that the propagation delay in the network is the primary cause for blockchain forks.

Bitcoin: A Peer-to-Peer Electronic Cash System

This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.