Hey @Mostalive
To report back, I’ve now ran some of my code in Purerl, specifically an algorithm which is about iterating over an ETS table, doing some simple numerical comparisons and appending to the accumulator. Contrary to my expectations there is 0 overhead for the naive version of the algorithm and for a maxxed out version where the needs for ETS calls (they’re the bottleneck) are minimized Purerl seems to have more than a 2x advantage.
2 Likes
