Consequently you can now securely and very network/space efficiently
securely delegate searching a block by computing the private key for the
IBE pub key that any sender would use for that block, and sending it as
a query to a random (or node-capture defended random selected node).
The node
On Sat, Jan 25, 2014 at 05:19:01PM +0100, Adam Back wrote:
[quote author=adam3us link=topic=431756.msg4729682#msg4729682
date=1390660452]
So have been talking with Greg Maxwell, Peter Todd, Jeremy Spillman,
Mike Hearn, Bytecoin and others about reusable addresses.
There is a summary of the
On Sun, Feb 02, 2014 at 01:16:20AM -0800, Jeremy Spilman wrote:
Consequently you can now securely and very network/space efficiently
securely delegate searching a block by computing the private key for the
IBE pub key that any sender would use for that block, and sending it as
a query to a
I think you Peter Jeremy figured it out - dont disagree with the
explanation details.
And it seems better explained between the two posts than I did. I think
Peter is right that you do not need an explicit prefix, the prefix after
decryption can be a chosen number of leading 0s and this gives a
On Sat, Jan 25, 2014 at 05:19:01PM +0100, Adam Back wrote:
I think I figured out a proof of existance for a space efficient way to do
better than bloom filters/prefix/bloom-bait. (Must have been dreaming on it
as I woke up with the idea following Peter's suggestion to try prove instead
if its
I think I figured out a proof of existance for a space efficient way to do
better than bloom filters/prefix/bloom-bait. (Must have been dreaming on it
as I woke up with the idea following Peter's suggestion to try prove instead
if its possible or not:).
I wrote up the details here:
6 matches
Mail list logo