[address-policy-wg] 2007-05 New Policy Proposal (IPv6 ULA-Central)
- Previous message (by thread): [address-policy-wg] 2007-05 New Policy Proposal (IPv6 ULA-Central)
- Next message (by thread): [address-policy-wg] 2007-05 New Policy Proposal (IPv6 ULA-Central)
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Vince Fuller
vaf at cisco.com
Fri May 4 20:56:37 CEST 2007
> The general solution of > the probability of a collision after d draws from n possible values > is given by: > > P = 1 - ((n!) / ((n**d)((n-d)!))) > > Given that the value for n is 2.199,023,255,552, then the objective > is to find the lowest value of d for which P is greater than or equal > to 0.5. In this case the value for d is some 1.24 million. > > > http://draft-huston-ipv6-local-use-comments.potaroo.net Are people going to pick random values? I'd expect a more likely outcome to be that they will pick strings that are easy to remember. How many collisions will there be if that is the case? Remember DEADBEEF? --Vince
- Previous message (by thread): [address-policy-wg] 2007-05 New Policy Proposal (IPv6 ULA-Central)
- Next message (by thread): [address-policy-wg] 2007-05 New Policy Proposal (IPv6 ULA-Central)
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]