Loading
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….
Attention: 1 HN points · 0 HN comments. Engagement counts are shown as context. Ansar does not treat popularity as significance.
A launch is the first point at which a product can be evaluated.
Strongest verification behind this event, aged, and discounted by how sure we are it belongs to this company.
How much this moves the ecosystem, independent of your interests.
Share of marketing vocabulary detected in the headline and summary.
Distinct kinds of checkable fact found: amounts, versions, measured changes.
These are Ansar’s estimates, not source claims. The summary above was assembled from source text, not generated.
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…