Bitcoiner
Apr 10, 2021(5y)
Apr 10, 2027(303d)
Combat
Kills10
Losses5
Efficiency67%
ISK
Destroyed15.37b
Lost103.75m
ISK Eff.99%
Solo
Solo Kills0
Solo Ratio0%
Final Blows2
Points10
Other
NPC Losses3
NPC Loss Ratio60%
Avg Kills/Day0.01
ActivityInactive
Bitcoiner
Birthday
Apr 10, 2021 (5 years old)
Next Birthday
Apr 10, 2027 (303 days)
Combat
Kills10
Losses5
Efficiency67%
Danger Ratio40%
ISK
Destroyed15.37b
Lost103.75m
ISK Efficiency99%
Balance+15.26b
Solo
Solo Kills0
Solo Ratio0%
Final Blows2
Points10
Other
NPC Losses3
NPC Loss Ratio60%
Avg Kills/Day0.01
ActivityInactive
No data available
Bio
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.
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.
Dashboard
Stats
Kills0
Losses0
Efficiency0%
ISK Destroyed0
ISK Lost0
ISK Efficiency0%
Solo Kills0
Solo Losses0
NPC Losses0
Blob Factor0
Active TimezoneUSTZ
Final Blows0
Points0
Activity Heat Map (EVE Time)
00
0
01
0
02
0
03
0
04
0
05
0
06
0
07
0
08
0
09
0
10
0
11
0
12
0
13
0
14
0
15
0
16
0
17
0
18
0
19
0
20
0
21
0
22
0
23
0
Intel Profile
PlaystyleSolo (0 kills)
Avg Fleet: -