Compute polynomials twice as fast
Compute polynomials twice as fast
A few years ago my coauthor and I was wondering if we could reduce the number of multiplications used for hashing algorithms. We had a construction and a 100 page proof, but we were not 100% sure it was correct. Now we have a full Lean proof, so we decided to publish it. I made this website to make it easy for anyone how has polynomials to evaluate to see how it would be done using our method, as well as a number of previous approaches by Knuth and others.
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Incorrect prediction on native model
Similar products
Keen Compute
Share compute functions while hiding the implementation
GPU Compute with a Conscience
Metashade – a Pythonic GPU shading/compute EDSL
Extremely simple cluster-compute software
Sat, the tiny WebAssembly compute module
Modern OpenGL ES (3.0 / 3.1 compute shaders) with Java for Android 5.0+
opub, donated compute for open-source
Ephemeral Hadoop Clusters Using Google Compute Platform
Find It Fast