QuotableSatoshi on Nostr: In this paper, we propose a solution to the double-spending problem using a ...
In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.
Published at
2024-10-22 12:21:02Event JSON
{
"id": "183cfc496e428bf600e9386ba3c26762973306eaca99811b023414261f0606eb",
"pubkey": "87570647ca3b7549e66cb6c4bb8d197f5bc91de73b58eb1ade78c8ddd5fec7eb",
"created_at": 1729599662,
"kind": 1,
"tags": [],
"content": "In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.",
"sig": "9f3bf9fb425a470d7310fb097f606866c696a9b0e9ac220319e6d1290e3f1333dc5256c02ab31d1539210136a30d0ada55713dd2cc319923e19071f6be775c10"
}
