Hacker News Reader

It is an example of algorithm that is theoretically faster, but not with our sizes and hardware optimisations:

it's a huge step theory-wise, but in practical terms it's only slightly better than the previous best which is 2.371177.

Also by my understanding it’s not an algorithm, it’s just an upper bound. Some other model (presumably) needs to find the actual algorithm now

Yes, that was my understanding too.