Nakamoto Institute [21BTC]
17 members
Apr 25, 2021(5y)
0% tax
Combat
Kills48
Losses44
Efficiency52%
Danger Ratio75%
ISK
Destroyed61.40b
Lost20.57b
ISK Eff.75%
Balance+40.83b
Activity
Solo Kills5
Final Blows36
Points48
Members17
Last 90 Days
Kills0
Losses0
ISK Destroyed0
ISK Lost0
Combat
Kills48
Losses44
Efficiency52%
Danger Ratio75%
ISK
Destroyed61.40b
Lost20.57b
ISK Efficiency75%
Balance+40.83b
Activity
Solo Kills5
Final Blows36
Points48
Members17
Last 90 Days
Kills0
Losses0
ISK Destroyed0
ISK Lost0
No data available
Bio
Corp Diplos: Bitcoiner, Katrina Irken Shikkoken
Bitcoin: A Peer-to-Peer Electronic Cash System
Satoshi Nakamoto
[email protected]
www.bitcoin.org
Abstract. A purely peer-to-peer version of electronic cash would allow online
payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending.
We propose a solution to the double-spending problem using a peer-to-peer network.
The network timestamps transactions by hashing them into an ongoing chain of
hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power.
As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers.
The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.
Bitcoin: A Peer-to-Peer Electronic Cash System
Satoshi Nakamoto
[email protected]
www.bitcoin.org
Abstract. A purely peer-to-peer version of electronic cash would allow online
payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending.
We propose a solution to the double-spending problem using a peer-to-peer network.
The network timestamps transactions by hashing them into an ongoing chain of
hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power.
As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers.
The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.
Active Members
Stats
Kills0
Losses0
Efficiency0%
ISK Destroyed0
ISK Lost0
ISK Efficiency0%
Solo Kills0
NPC Losses0
Final Blows0
Points0