arXiv subjects

Jiho Park

Publications and source records attributed to Jiho Park.

21 records · Page 2Linked to original sources

arXiv2018

Fantom: A scalable framework for asynchronous distributed systems

We describe \emph{Fantom}, a framework for asynchronous distributed systems. \emph{Fantom} is based on the Lachesis Protocol~\cite{lachesis01}, which uses asynchronous event transmission for practical Byzantine fault tolerance (pBFT) to create a leaderless, scalable, asynchronous Directed Acyclic Graph (DAG). We further optimize the \emph{Lachesis Protocol} by introducing a permission-less network for dynamic participation. Root selection cost is further optimized by the introduction of an n-row flag table, as well as optimizing path selection by introducing domination relationships. We propose an alternative framework for distributed ledgers, based on asynchronous partially ordered sets with logical time ordering instead of blockchains. This paper builds upon the original proposed family of \emph{Lachesis-class} consensus protocols. We formalize our proofs into a model that can be applied to abstract asynchronous distributed system.

cs.DC↗

arXiv2018

OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems

This paper introduces a new family of consensus protocols, namely \emph{Lachesis-class} denoted by $\mathcal{L}$, for distributed networks with guaranteed Byzantine fault tolerance. Each Lachesis protocol $L$ in $\mathcal{L}$ has complete asynchrony, is leaderless, has no round robin, no proof-of-work, and has eventual consensus. The core concept of our technology is the \emph{OPERA chain}, generated by the Lachesis protocol. In the most general form, each node in Lachesis has a set of $k$ neighbours of most preference. When receiving transactions a node creates and shares an event block with all neighbours. Each event block is signed by the hashes of the creating node and its $k$ peers. The OPERA chain of the event blocks is a Directed Acyclic Graph (DAG); it guarantees practical Byzantine fault tolerance (pBFT). Our framework is then presented using Lamport timestamps and concurrent common knowledge. Further, we present an example of Lachesis consensus protocol $L_0$ of our framework. Our $L_0$ protocol can reach consensus upon 2/3 of all participants' agreement to an event block without any additional communication overhead. $L_0$ protocol relies on a cost function to identify $k$ peers and to generate the DAG-based OPERA chain. By creating a binary flag table that stores connection information and share information between blocks, Lachesis achieves consensus in fewer steps than pBFT protocol for consensus.

cs.DC↗

arXiv2017

Quantum Interference between Autonomous Single-Photon Sources from Doppler-Broadened Atomic Ensemble

To realize a quantum network based on quantum entanglement swapping, bright and completely autonomous sources are essentially required. Here, we experimentally demonstrate Hong-Ou-Mandel (HOM) quantum interference between two independent bright photon pairs generated via the spontaneous four-wave mixing in Doppler-broadened ladder-type 87Rb atoms. Bright autonomous heralded single photons are operated in a continuous-wave (CW) mode with no synchronization or supplemental filters. The four-fold photon coincidence counts per hour correspond to 5000 events for a temporal range of 10 ns, one order higher than those of previously reported for autonomous single photons. We observe an HOM dip with 83% visibility with the two autonomous heralded single photons for an effective measurement time of 900 s. The achievement of the HOM interference between the two bright autonomous photon-pair sources has made an important step towards a practical scalable quantum network.

quant-ph↗