HNHacker News
TopNewBestAskShowJobs

ieviev

50 karma · joined February 26, 2026

submissionscomments
ieviev··on RE#: how we built the fastest regex engine in F#
There's currently only a string solver with the same core library, but not a full regex engine https://github.com/ieviev/cav25-resharp-smt

I will open source the rust engine soon as well, some time this month.

As for the benchmarks, it's the fastest for large patterns and lookarounds, where leftmost-longest lets you get away with less memory usage so we don't need to transition from DFA to NFA.

In the github readme benchmarks it's faster than the exponential implementations of .NET Compiled so the 35 000x can be an arbitrary multiplier, you can keep adding alternatives and make it 1000000x.

for a small set of string literals it will definitely lose to Hyperscan and Rust regex since they have a high effort left-to-right SIMD algorithm that we cannot easily use.

ieviev··on RE#: how we built the fastest regex engine in F#
ah thank you for letting me know, fixed it now!
← PreviousPage 2 of 2