Cryptology ePrint Archive: Report 2017/751

Twisting Lattice and Graph Techniques to Compress Transactional Ledgers

Rémi Géraud and David Naccache and Răzvan Roşie

Abstract: Keeping track of financial transactions (e.g., in banks and blockchains) means keeping track of an ever-increasing list of exchanges between accounts. In fact, many of these transactions can be safely “forgotten”, in the sense that purging a set of them that compensate each other does not impact the network’s semantic meaning (e.g., the accounts’ balances). We call nilcatenation a collection of transactions having no effect on a network’s semantics. Such exchanges may be archived and removed, yielding a smaller, but equivalent ledger. Motivated by the computational and analytic benefits obtained from more compact representations of numerical data, we formalize the problem of finding nilcatenations, and propose detection methods based on graph and lattice-reduction techniques. Atop interesting applications of this work (e.g., decoupling of centralized and distributed databases), we also discuss the original idea of a “community-serving proof of work”: finding nilcatenations constitutes a proof of useful work, as the periodic removal of nilcatenations reduces the transactional graph’s size.

Category / Keywords: applications /

Original Publication (in the same form): SecureComm17

Date: received 3 Aug 2017

Contact author: razvan rosie at ens fr

Available format(s): PDF | BibTeX Citation

Version: 20170807:163406 (All versions of this report)

Short URL: ia.cr/2017/751

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]