I’ve been thinking about this for days.

mhoye

I’ve been thinking about this for days. Incredible stochastic algorithm, gets more reliable the larger your input, incredibly fast, trivial to implement and deterministic on its inputs. It really has so much going for it.

(Via @jonathankoren )

Greg Pfeil

@mhoye @jonathankoren And no false positives!

mhoye

@sellout @jonathankoren right!?

Dan Ports

@mhoye @jonathankoren wow, so much more efficient than the state-of-the-art algorithm: asking a LLM whether x is prime

RyeNCode 🇨🇦

@mhoye @sellout @jonathankoren
It's accuracy asymptotically approaches 100%
That's amazing!
Slight cavities about using it for cryptographic purposes or around smallish numbers.

philosophizes whilst swimming

@jonathankoren @mhoye they’re all good algorithms, Brent

jonathankoren™

@adardis @mhoye there are no bad algorithms. There are only bad use cases.

groxx

@mhoye @jonathankoren it's branchless too, and easily parallelized onto a GPU to speed it up

Ollie Boermans

@mhoye @jonathankoren @daedalus I hope the crypto crew catch wind of this. Has potential to save a lot of electricity

eirias

@jonathankoren @adardis @mhoye this is like that weather aphorism, isn't it

Mark Reid

@mhoye @jonathankoren @rmondello Surprising fact: exactly the same algorithm works even better for many other problems: perfect numbers, powers of two, busy beaver, etc.

Tom Bortels

@jonathankoren @mhoye

The problem is its inaccuracy for smaller input sets involving low-digit-count numbers.

Trivially fixed by hardcoding the results for 3-digit and lower input. Ship it!

The Doctor

@jonathankoren @adardis @mhoye Can I quote you on that?

mhoye

@drwho @jonathankoren @adardis It's such a good line.

cubeos

@mhoye @jonathankoren It also provides the script for a math party trick: "Tell me any 100 digit number and I will tell you if it's prime!'

jonathankoren™

@drwho @adardis @mhoye why would I care?