Fraud Proofs for SPV using the Spend Tree

[tomtomtom7]

I have showed earlier how Bitcrust uses a Spend Tree to track the transaction graph and verify order.

I believe this same structure can also be used to tackle the difficult Fraud Proof problem by making the processing of hints indicating absent transactions, virtually free.

I propose creating a "Fraud Proof SPV" node (FSPV), by syncing this Spend Tree. It is explained here: https://bitcrust.org/blog-fraud-proofs

Please let me know what you think,

Tomas van der Wansem
Bitcrust

[1714057588]

1714057588

[1714057588]

1714057588

[1714057588]

1714057588

[1714057588]

1714057588

[1714057588]

1714057588

[1714057588]

1714057588

[jonald_fyookball]

This is very exciting, or seems so... i'm surprised there's not more discussion here.  Maybe people are studying your work.

It seems that this is key in decentralization and relevant to the scaling debate. 

I think it could be very beneficial if you had time to write more about
the security model of Bitcoin and how the various strengths of fraud proofs
can help ensure SPV clients are able to validate the network...and reduce
the need for most users to run full nodes.

[tomtomtom7]

This is very exciting, or seems so... i'm surprised there's not more discussion here.  Maybe people are studying your work.

It seems that this is key in decentralization and relevant to the scaling debate. 

I think it could be very beneficial if you had time to write more about
the security model of Bitcoin and how the various strengths of fraud proofs
can help ensure SPV clients are able to validate the network...and reduce
the need for most users to run full nodes.

Thank you Jonald,

There has been some discussion here: https://www.reddit.com/r/btc/comments/684l7w/fraud_proofs_for_spv_using_spend_tree/

I will definitely write more, although I am hoping to also have time to code