- Kills
- 10
- +0 in the last 90 days
- Losses
- 5
- +0 in the last 90 days
- Efficiency
- ISK Efficiency 99%
- ISK destroyed
- 15.37B
- +0 in the last 90 days
- Activity
- Inactive
- 0 kills/day · last 90 days
Combat Record
Career-long numbers from eve-kill
Combat
- Kills
- 10
- Losses
- 5
- Danger Ratio
- 40%
- Final Blows
- 2
- Points
- 10
ISK
- Destroyed
- 15.37B
- Lost
- 103.7M
- Balance
- +15.26B
- ISK Efficiency
- 99%
Solo
- Solo Kills
- 0
- Solo Ratio
- 0%
- Avg Kills/Day
- —
Other
- NPC Losses
- 3
- NPC Loss Ratio
- 60%
- Activity
- Inactive
Damage Dealt5.9M
Damage Ratio · 100%
Damage Taken14.2K
Activity
What they fly, where they fight, latest kills and losses
Most Valuable
The priciest kills in the window
Matchups
Who they kill, who kills them, what they lose
Last 90d
Killed
Killed By
Hulls LostLosses broken down by hull class.
In-game 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.