Cat to [email protected]English • 21 hours agoA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgexternal-linkmessage-square16fedilinkarrow-up161arrow-down11cross-posted to: technology[email protected]
arrow-up160arrow-down1external-linkA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgCat to [email protected]English • 21 hours agomessage-square16fedilinkcross-posted to: technology[email protected]
minus-square@48954246linkEnglish13•edit-217 hours agoThis is very cool news. Would be nice if it had some details on the implementation though Time to read the paper I guess
minus-squarebrvslvrnstlinkfedilinkEnglish5•16 hours agoAgreed, I figured they’d have at least some psuedocode but alas
minus-squaresp3ctr4llinkfedilinkEnglish5•13 hours agoFor those in a rush: Initial paper outlining theorem (2021): https://arxiv.org/pdf/2111.12800 Paper that demonstrates and proves its validity (2025): https://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.
This is very cool news. Would be nice if it had some details on the implementation though
Time to read the paper I guess
Agreed, I figured they’d have at least some psuedocode but alas
For those in a rush:
Initial paper outlining theorem (2021):
https://arxiv.org/pdf/2111.12800
Paper that demonstrates and proves its validity (2025):
https://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.