Hello again,
I am sorry, too tired and written something wrong:
On 6/26/2016 1:29 AM, s7r wrote:
> Very soon Tor will include an unique random value we call "Consensus
> Shared Randomness [SRVALUE]" in every consensus, you can just use that.
> This is proposal 250. This seams like a better standa
Hello,
If you hash the consensus entirely, yes that should produce unique
hashes every time that are unpredictable until the consensus is available.
However, you cannot guarantee it will be the same value for everyone at
a given time, because consensus documents overlap and two clients/relays
mig
Hi Razvan,
The consensus has signatures from all directory operators on it, and computing
those ahead of time requires a lot of private keys. Because they also all
contain the date, they're all unique. So yea, they're both unique and
unpredictable.
As for your idea: it should be noted that th
Hello everyone,
I couldn't find a detailed description of the Tor consensus, so I'm
checking that my understanding of it is correct. Basically, would it be
correct to assume that the consensus document (or a hash thereof) for a
date in the future is an unpredictable value that will also be unique
Hello!
I had a discussion with David Goulet about RB trees [0]. More
particularly about the usage of RB trees for some Tor operations like
[1] or HSDir cache.
David said that Nick wants to use a FreeBSD implementation - is this
one[2]? If it is, I think it could be hard for new contributors like
