📅 Original date posted:2017-05-05
📝 Original message:I would like some feedback on the idea to use a node type a bit heavier
then SPV (dubbed FSPV) to solve Fraud Proofs.
An FSPV node not only downloads block headers, but also the "spend-tree
blocks", consisting of all TXIDs and all previous output indices and
TXIDs. The latter can be compacted using a scheme similar to Compact
Blocks, which will make the spend-tree block ~80kb in size.
ThIs way the FSPV can track the full transaction graph at little cost.
The advantage is, that Fraud Hint messages for absent/withheld
transactions become feasible. A normal SPV is reduced to Full Node by
such (cheaply faked) hint, but for an FSPV the cost is almost zero.
All it needs to do is add a taint-bit in the tree and propagate the
taint to the transaction graph. It then knows it needs to request the
Fraud Hinted transaction to consider any descendant transaction valid.
This makes it sufficient to punish fraudulent fraud hints or withheld
transactions by normal "banscore" procedures.
All other fraud can be proven by transaction-sets.
More information here: https://bitcrust.org/blog-fraud-proofs
Tomas
Bitcrust
Tomas [ARCHIVE] /
npub1rs…9evk4
2023-06-07 18:00:49
in reply to nevent1q…ydjq
Author Public Key
npub1rsp4w56r24w3zv4xy8zfgesep45qmf9rq6aghxfw3wr7yemqnnwsf9evk4Published at
2023-06-07 18:00:49Event JSON
{
"id": "9e29baa86233c311dc3ca1864e0bf54c9ca75936b5eb48d1b7a92dab0fb44469",
"pubkey": "1c03575343555d1132a621c49466190d680da4a306ba8b992e8b87e267609cdd",
"created_at": 1686160849,
"kind": 1,
"tags": [
[
"e",
"8b829debe1afebf3cd5498b3e5b4ac2ba91719a2a373bfd3717b84693db3a368",
"",
"reply"
],
[
"p",
"a23dbf6c6cc83e14cc3df4e56cc71845f611908084cfe620e83e40c06ccdd3d0"
]
],
"content": "📅 Original date posted:2017-05-05\n📝 Original message:I would like some feedback on the idea to use a node type a bit heavier\nthen SPV (dubbed FSPV) to solve Fraud Proofs.\n\nAn FSPV node not only downloads block headers, but also the \"spend-tree\nblocks\", consisting of all TXIDs and all previous output indices and\nTXIDs. The latter can be compacted using a scheme similar to Compact\nBlocks, which will make the spend-tree block ~80kb in size.\n\nThIs way the FSPV can track the full transaction graph at little cost.\n\nThe advantage is, that Fraud Hint messages for absent/withheld\ntransactions become feasible. A normal SPV is reduced to Full Node by\nsuch (cheaply faked) hint, but for an FSPV the cost is almost zero.\n\nAll it needs to do is add a taint-bit in the tree and propagate the\ntaint to the transaction graph. It then knows it needs to request the\nFraud Hinted transaction to consider any descendant transaction valid.\n\nThis makes it sufficient to punish fraudulent fraud hints or withheld\ntransactions by normal \"banscore\" procedures.\n\nAll other fraud can be proven by transaction-sets.\n\nMore information here: https://bitcrust.org/blog-fraud-proofs\n\nTomas\nBitcrust",
"sig": "ef84c7a1c9891300823323c3c76551b88e190101a5f1b0e57da6aac31cf59aa21d044f5d7a574f803541d515e1550269bd8801a8f4af71504835f521704650b6"
}