Multilevel Verification on a Single Digital Decentralized Distributed (DDD) Ledger

TL;DR

Addresses the limitation of single-level verification in decentralized ledgers by proposing a multilevel hierarchical verification framework. It defines a fixed $n$-ary tree of height $l$ with bottom-up verification and a leader who finalizes blocks. The approach includes a formal risk model with the adversarial success probability $P(e|λ)$ and a Poisson waiting-time analysis, and it assesses interactions via partial dependence analyses. The framework is applicable to both DDD and CDD ledgers and offers potential for domain deployment in finance, healthcare, and IoT, with future work on time-evolving hierarchies.

Abstract

This paper presents an approach to using decentralized distributed digital (DDD) ledgers like blockchain with multi-level verification. In regular DDD ledgers like Blockchain, only a single level of verification is available, which makes it not useful for those systems where there is a hierarchy and verification is required on each level. In systems where hierarchy emerges naturally, the inclusion of hierarchy in the solution for the problem of the system enables us to come up with a better solution. Introduction to hierarchy means there could be several verification within a level in the hierarchy and more than one level of verification, which implies other challenges induced by an interaction between the various levels of hierarchies that also need to be addressed, like verification of the work of the previous level of hierarchy by given level in the hierarchy. The paper will address all these issues, and provide a road map to trace the state of the system at any given time and probability of failure of the system.

Figures (6)

• Figure 1: Hierarchy of Authorities
• Figure 2: Single Block of Proposed DDD Ledger
• Figure 3: State Diagram of Proposed DDD Ledger
• Figure 4: One-way interaction Partial Dependence Plots
• Figure 5: Two-Way Interaction Partial Dependence Plots.