Comment on A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

48954246@lemmy.world ⁨1⁩ ⁨week⁩ ago

• bravesilvernest@lemmy.ml ⁨1⁩ ⁨week⁩ ago

  Agreed, I figured they’d have at least some psuedocode but alas

  source

  • sp3tr4l@lemmy.zip ⁨1⁩ ⁨week⁩ ago

    For those in a rush:

    Initial paper outlining theorem (2021):

    arxiv.org/pdf/2111.12800

    Paper that demonstrates and proves its validity (2025):

    arxiv.org/pdf/2501.02305

    I tried a quick search, but I’m not seeing any public implementations that specifically mention or cite ‘Krapavin’ or ‘Tiny Pointers’ anywhere.

    source