Bitcoin Forum
June 27, 2019, 09:16:17 AM *
News: Latest Bitcoin Core release: 0.18.0 [Torrent] (New!)
 
  Home Help Search Login Register More  
  Show Posts
Pages: [1]
1  Bitcoin / Development & Technical Discussion / Blockchain Scalability Idea: Private Sparse Merkle Trees on: March 01, 2019, 01:15:53 AM
https://medium.com/@abarisser/blockchain-scalability-idea-2-private-sparse-merkle-trees-f3aa100bfe80

Please give me feedback on this idea.

I'm happy to answer questions / feedback on this article in this thread.

In short, addresses sign root hashes of Sparse Merkle Trees (SMT).  For a Blockchain consisting of non-fungible tokens, each token corresponds to a unique leaf in an SMT.  An address sends a coin by providing proofs of membership and non-membership of txs off-chain to a receiving address.  These proofs of membership and non-membership are "anchored" by SMT root hash commitments that are on-chain.  Each SMT root hash commitment is specific to that address and commits to a (potentially very large) set of transactions for that block.

I'm trying to solve the blockchain scalability problem by putting a minimum commitment on-chain that correspond to a very large number of transactions off-chain.

I can't think of a way to falsify double-spends under this scheme, while I do think it gives a novel new way to improve blockchain throughput capacity.  But maybe I've missed something.

In any case, if you read the article, I would appreciate a discussion and feedback.  Let me know also if anything is unclear.

Thanks,
Andrew Barisser
Pages: [1]
Sponsored by , a Bitcoin-accepting VPN.
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!