← 최신 프로덕트

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.

thomasahle.com 방문외부 사이트

반응 (1)

비슷한 프로덕트

설명이 비슷한 순

  1. SHAllenge

    shallenge.quirino.net

    Compete to get the lowest hash

    Hacker News123점

  2. Speeding up LLM inference 2x times (possibly)

    asciinema.org

    Here's a project I've been working on for the last few months.

    Hacker News419점

  3. Matrix Multiplication with Half the Multiplications

    github.com

    Algebraic enhancements for GEMM & AI accelerators

    Hacker News310점

  4. Maxxwell

    maxxwell.dev

    The IDE for Optimal Tokenmaxxing

    Hacker News11점

  5. Detecting collision between 500k circles below 5ms

    github.com

    1D/2D/3D Hierarchical Spatial Hash Grid written in C

    Hacker News59점