RE: Randomness sources for the IETF 2015-2016 Nomcom Selection

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



> Picking out of a hat is random enough. It's just not very verifiable. I'm not saying
> that Harald would manipulate the draw, but some people might and we won't
> be able to prove to them that the process was not manipulated.

This thread is really fun. Don't we all love engineering and over-engineering? 

As Yoav said, the process was designed to provide a verifiable equivalent to picking names from a hat. The main thread here is manipulation by the person doing the picking, so we designed a verifiable process. And since we are engineers, we had some fun picking verifiable outside sources of randomness. But really, this is about emulating picking from a hat in a way that let any observer verify the picking.

In theory, since we are picking 10 names out of a pool maybe 100 to 200 volunteers at most, we would need 44 to 55 bits of entropy. The lotteries in Harald's list provide about 74 such bits. The debt numbers' entropy are less easy to compute, and depending on your assumptions add 10 to 50 other bits. As many have pointed out, it is extremely unlikely that any of those numbers might be manipulated for the sole purpose of influencing the nom com selection. So basically, we are good. 

But it is fun.

-- Christian Huitema









[Index of Archives]     [IETF Annoucements]     [IETF]     [IP Storage]     [Yosemite News]     [Linux SCTP]     [Linux Newbies]     [Fedora Users]