Thanks for the great response! I had about a dozen or so people contact
me with solutions for one or more questions, and even a anonymous
donation of 75mBTC to cover the rewards.
I'll start with my summaries of those solutions:
On Tue, Feb 04, 2014 at 08:03:13AM -0500, Peter Todd wrote:
On Tue,
Here’s a new release announcement with full ID’s this time:
The v0.11 tag is signed by Andreas Schildbach’s GPG key (fingerprint E944 AE66
7CF9 60B1 004B C32F CA66 2BE1 8B87 7A60). The commit hash is
410d4547a7dd20745f637313ed54d04d08d28687.
Key: 16vSNFP5Acsa6RBbjEA7QYCCRDRGXRFH4m
Signature:
On Tue, Feb 4, 2014 at 10:04 AM, Peter Todd p...@petertodd.org wrote:
On Tue, Feb 04, 2014 at 04:17:47PM +0100, Natanael wrote:
Because it's trivial to create collisions! You can choose exactly what
output you want. That's why XOR is a very bad digest scheme.
You're close, but not quite.
Hello,
I'm pleased to announce the release of bitcoinj 0.11, a library for writing
Bitcoin applications that run on the JVM. BitcoinJ is widely used across the
Bitcoin community; some users include Bitcoin Wallet for Android, MultiBit,
Hive, blockchain.info, the biteasy.com block explorer
On Tue, Feb 04, 2014 at 01:01:12PM +0100, Mike Hearn wrote:
Hello,
I'm pleased to announce the release of bitcoinj 0.11, a library for writing
Bitcoin applications that run on the JVM. BitcoinJ is widely used across the
Bitcoin community; some users include Bitcoin Wallet for Android,
On Tue, Feb 04, 2014 at 02:13:12PM +0100, Mike Hearn wrote:
Hah, good point. If nobody completes the homework, I'll post a fixed
version tomorrow :)
Heh, here's another 25mBTC while we're at it:
On Tue, Feb 4, 2014 at 8:17 AM, Peter Todd p...@petertodd.org wrote:
Bonus question: What was I smoking? (hint: where do I live?)
Cryptographers smoke... hash, right?
(couldn't resist)
--
Jeff Garzik
Bitcoin core developer and open source evangelist
BitPay, Inc. https://bitpay.com/
On Tue, Feb 04, 2014 at 09:43:31AM -0500, Jeff Garzik wrote:
On Tue, Feb 4, 2014 at 8:17 AM, Peter Todd p...@petertodd.org wrote:
Bonus question: What was I smoking? (hint: where do I live?)
Cryptographers smoke... hash, right?
(couldn't resist)
groan
I think we have a winner; as you
Because it's trivial to create collisions! You can choose exactly what
output you want. That's why XOR is a very bad digest scheme.
- Sent from my phone
Den 4 feb 2014 14:20 skrev Peter Todd p...@petertodd.org:
On Tue, Feb 04, 2014 at 02:13:12PM +0100, Mike Hearn wrote:
Hah, good point. If
On Tue, Feb 04, 2014 at 04:17:47PM +0100, Natanael wrote:
Because it's trivial to create collisions! You can choose exactly what
output you want. That's why XOR is a very bad digest scheme.
You're close, but not quite.
So, imagine you have a merkle tree, and you're trying to timestamp some
Well the point of the Merkle tree is that if I all you have is the top,
and all I give you is a leaf node and the siblings of all parents of that
leaf, then by simply hashing you can check if the node was actually
present in the tree.
The only reason this works is because it's hard for an
11 matches
Mail list logo
