January 1, 2019· IACR Cryptology ePrint Archive
preprint
k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain.
Authors:Zvi Schreiber *
Abstract
No abstract metadata is available for this record.
Community
0 commentsUse Connect Wallet in the navigation
No discussion yet
Be the first to share a question or observation.