empirical birthday paradox calculator - for hashes

bday-paradox.js

const hashBits = parseInt(process.env.bits || 32);
const hashValues = Math.pow(2, hashBits);

const checkPoints = Array.from({ length: 9 }, (e, i) => 1 - (i+1)/10);

for(var uniqueHashValuesRemaining = hashValues, p = 1;
	 	p > 0.1; 
		uniqueHashValuesRemaining -= 1, p *= uniqueHashValuesRemaining/hashValues
		) {
	
	if(p < checkPoints[0]) {
		checkPoints.shift();
		console.log("after", hashValues - uniqueHashValuesRemaining, "hashes, p(collision) = ", ((1 - p) * 100).toFixed(0), "%");
	}
}