Bitcoin Forum
May 13, 2024, 02:59:11 PM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: Blockchain Scalability Idea: Private Sparse Merkle Trees  (Read 205 times)
btcraver (OP)
Newbie
*
Offline Offline

Activity: 1
Merit: 4


View Profile
March 01, 2019, 01:15:53 AM
Merited by odolvlobo (1), ABCbits (1), hugeblack (1), aliashraf (1)
 #1

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
1715612351
Hero Member
*
Offline Offline

Posts: 1715612351

View Profile Personal Message (Offline)

Ignore
1715612351
Reply with quote  #2

1715612351
Report to moderator
"The nature of Bitcoin is such that once version 0.1 was released, the core design was set in stone for the rest of its lifetime." -- Satoshi
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
aliashraf
Legendary
*
Offline Offline

Activity: 1456
Merit: 1174

Always remember the cause!


View Profile WWW
March 01, 2019, 04:22:16 PM
Merited by hugeblack (1)
 #2

Andrew, very glad to have you onboard in this forum, welcome  Smiley
End-to-End cryptographic proofs are an important and exciting field of investigation and we have zero knowledge proof line of algorithms that are very interesting and I strongly recommend taking a look at zero-knowledge Succinct Non-interactive ARgument of Knowledge , zk-SNARK concept which is the backbone of Zcash and most privacy centric coins.

As of your article: In first glance, it seems to me a bit odd, solving a sophisticated problem like this by simply burning the addresses, without giving birth to them ever. The simple question would be: What stops a spammer from flooding the blockchain with fake 'burn' messages?


Pages: [1]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!