Explore >> Select a destination
|
You are here 
|
orlp.net | ||
| | | | |
lemire.me
|
|
| | | | | ||
| | | | |
danlark.org
|
|
| | | | | When it comes to hashing, sometimes 64 bit is not enough, for example, because of birthday paradox -- the hacker can iterate through random $latex 2^{32}$ entities and it can be proven that with some constant probability they will find a collision, i.e. two different objects will have the same hash. $latex 2^{32}$ is around... | |
| | | | |
xoranth.net
|
|
| | | | | ||
| | | | |
austinmorlan.com
|
|
| | | Ive been getting into FPGAs lately. Last year I built an FPGA version of Ben Eaters breadboard computer, but Ive been wanting to do a more advanced project to help me gain experience with Verilog and FPGAs in general. For his breadboard computer, Ben Eater followed the design laid out in a book called Digital Computer Electronics by Malvino and Brown. The book builds what it calls the Simple-as-Possible (SAP) Computer. | ||
