Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Double Spend Proofs #407

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Double Spend Proofs #407

wants to merge 2 commits into from

Conversation

cpacia
Copy link
Contributor

@cpacia cpacia commented Aug 21, 2020

Spec: https://gitlab.com/-/snippets/1883331

TODO:

  • Validate proof.

  • Send proof to RPC server and gRPC server.

  • RPC servers handle dsproof subscriptions. On subscribe should scan mempool to see if any proofs exist. Relay if so.

  • FetchDSProof mempool method.

  • Remove dsproofs from mempool on confirmation.

  • Generate dsproofs when double spend is detected.

  • Handle orphan proofs.

@cpacia cpacia added the in progress Work is ongoing label Aug 21, 2020
@zquestz
Copy link
Contributor

zquestz commented Aug 21, 2020

This is awesome. Didn't know you were working on this already!

wire/invvect_test.go Outdated Show resolved Hide resolved
// DoubleSpendProofVersion is the prootocol version which added
// double spend proof relaying.
// FIXME: What is this supposed to be?
DoubleSpendProofVersion uint32 = 70016
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

We would just need to come to agreement between the different node implementations. I like just using 70016 myself, but ideally we put this in the spec for other BCH nodes. I know BU is already in the 80k range...

@elderapo
Copy link

Any update on this? :((((

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
in progress Work is ongoing
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants