this post was submitted on 11 Feb 2025
65 points (98.5% liked)

Technology

1935 readers
188 users here now

Which posts fit here?

Anything that is at least tangentially connected to the technology, social media platforms, informational technologies and tech policy.


Rules

1. English onlyTitle and associated content has to be in English.
2. Use original linkPost URL should be the original link to the article (even if paywalled) and archived copies left in the body. It allows avoiding duplicate posts when cross-posting.
3. Respectful communicationAll communication has to be respectful of differing opinions, viewpoints, and experiences.
4. InclusivityEveryone is welcome here regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, education, socio-economic status, nationality, personal appearance, race, caste, color, religion, or sexual identity and orientation.
5. Ad hominem attacksAny kind of personal attacks are expressly forbidden. If you can't argue your position without attacking a person's character, you already lost the argument.
6. Off-topic tangentsStay on topic. Keep it relevant.
7. Instance rules may applyIf something is not covered by community rules, but are against lemmy.zip instance rules, they will be enforced.


Companion communities

!globalnews@lemmy.zip
!interestingshare@lemmy.zip


Icon attribution | Banner attribution


If someone is interested in moderating this community, message @brikox@lemmy.zip.

founded 1 year ago
MODERATORS
top 17 comments
sorted by: hot top controversial new old
[–] 48954246@lemmy.world 13 points 1 week ago* (last edited 1 week ago) (1 children)

This is very cool news. Would be nice if it had some details on the implementation though

Time to read the paper I guess

[–] bravesilvernest@lemmy.ml 5 points 1 week ago (1 children)

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

[–] sp3tr4l@lemmy.zip 6 points 1 week ago

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.

[–] xtrapoletariat@beehaw.org 6 points 1 week ago

This is quite cool. They shattered a 40 year-old conjecture on map-insertion speed boundaries. To understand the practical impact I have to read the paper, but given their abundance in CS the potential is huge.

[–] NigelFrobisher@aussie.zone 3 points 1 week ago

All we have to do is rename b-trees to “hash tables” and database lookup times will be changed forever.

[–] JackbyDev@programming.dev 1 points 1 week ago (1 children)

I need to look more into this, I would've thought query time on hash tables was already constant.

[–] CookieOfFortune@lemmy.world 2 points 1 week ago

Only if there’s no collisions. With lots of collisions it’s far from constant.

[–] possiblylinux127@lemmy.zip 1 points 1 week ago (1 children)

Oh yes, the new revolutionary data structure called a hash table

[–] expr@programming.dev 9 points 1 week ago (1 children)

Did you read the article? The claim is that they have invented a new kind of hash table that has vastly improved algorithmic complexity compared to standard hash tables.

I haven't read the paper yet, but if what the article claims is true, it could be revolutionary in computer science and open up a ton of doors.

[–] possiblylinux127@lemmy.zip 1 points 1 week ago (1 children)
[–] expr@programming.dev 8 points 1 week ago* (last edited 1 week ago)

You can read the full paper yourself here: https://arxiv.org/pdf/2501.02305.

I haven't had time to fully read it yet, but glancing through, it looks pretty legit.

This is a graduate computer science student working with accomplished CS faculty at Rutgers and Carnegie Mellon, we aren't talking about some rando making outlandish claims.

The thing about theoretical computer science is that, like math, it isn't subject to the pitfalls of empirical science. It isn't dependent on reproduction. The proof is provided in the paper, so either it indeed proves what it claims to, or the proof is erroneous, which can readily be refuted.

[–] p03locke@lemmy.dbzer0.com -4 points 1 week ago (2 children)

"Data structures called hash tables"? Editor thinks this is some arcane little-used data technology.

Hashes are used in literally every programming language that's worth using.

[–] veroxii@aussie.zone 10 points 1 week ago (1 children)

What are you on about? The first paragraph says hash tables are "widely used" and the second says they are "common".

"Data structures called hash tables" seems to just be a factual statement of what we're dealing with, especially for people who are not programmers.

[–] JackbyDev@programming.dev 1 points 1 week ago (1 children)

It just feels bizarre. You wouldn't say something like "a car part called a catalytic converter".

[–] oyo@lemm.ee 6 points 1 week ago (1 children)

A catalytic converter also might be part of a wood stove. A lay-person may have no idea what a hash table is, or if they are also used in fields other than computer science.

Why would you specify that it's a turbo encabulator, everyone knows they're all turbo.

[–] JackbyDev@programming.dev 0 points 1 week ago

It feels just as odd to say "a component of fuel consuming engines called a catalytic converter". You're missing the point.

[–] AnotherDirtyAnglo@lemmy.ca 1 points 1 week ago

Some of my best, most useful programs sort data from disparate sources into enormous Hash-Of-Hash structures to produce extremely insightful reports. And I wrote the first version 25 years ago.