https://medium.com/@abarisser/blockchain-scalability-idea-2-private-sparse-merkle-trees-f3aa100bfe80Please 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