MYOBTC 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 proof-of-worker than any cooperating group of attacker nodes."
— Satoshi Nakamoto
Published at
2025-05-21 22:45:35 GMTEvent JSON
{
"id": "2814eec949cba8c5038dafbdb218d6d385599a6571f3a653e34a0971e1f60a18",
"pubkey": "33a5782e9590e3898eccb9d18b439cc2e568f6111a313f08c29047b1b504d255",
"created_at": 1747867535,
"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 proof-of-worker than any cooperating group of attacker nodes.\"\n\n— Satoshi Nakamoto",
"sig": "13ab82a455ff1774be1e626535675ce55335102af1290b003c0b69f43828bfba9389e96e479e97d9354cc642b56bd12d2b1968fb84753b65227531b39b55b53d"
}
