Timeline for What is the Bitcoin equivalent of /dev/null?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2015 at 14:13 | comment | added | dionyziz | What do you mean by "nobody can theoretically claim"? What is your "theory" here? Because if you use any reasonable theory for polynomial computational abilities, no, polynomial agents cannot claim these addresses (given we key the private and public addresses correctly). This is the same theory that supports, for example, the unbreakability of RSA and ECDSA. Specifically, for practical purposes, as you mention bit sizes, you'd need to brute-force a space of 2^160 which is impossible. The fact that the private key space is larger is insignificant. | |
| May 24, 2012 at 2:45 | history | edited | Chris Moore | CC BY-SA 3.0 |
mention the 'eater' address
|
| May 23, 2012 at 19:45 | history | answered | Chris Moore | CC BY-SA 3.0 |