Log inference on the Ripple Protocol: testing the system with an empirical approach
Marijn Roelvink (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Annibale Panichella – Mentor (TU Delft - Software Engineering)
Mitchell Olsthoorn – Mentor (TU Delft - Software Engineering)
Ranga Rao Venkatesha Prasad – Graduation committee member (TU Delft - Embedded Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Ripple is a relatively new payments network that aims to improve the financial system by unifying its underlying infrastructure. Given its critical function, its system must be reliable and free of bugs. Therefore it should be tested extensively. One of the test methods that has not been used on it yet is log inference, a method that has a good potential for modelling complex communication protocols. Therefore, we have developed an empirical model of the Ripple Consensus Protocol by learning a Deterministic Finite Automaton (DFA) from the log files of two servers in the Ripple network. We have also developed a theoretical DFA of the Ripple Consensus Protocol and compared this to the empirical model to verify that the two systems function comparably. There has been found one notable difference between the two models, but whether this difference has a critical impact remains to be discussed.