[Pharo-project] speeding up BigNum/Fractions calculations using NativeBoost?

[Lawson English]

I'd like to see how fast a Mandelbrot Set algorithm could be implemented 
in Squeak/Pharo by using NativeBoost to bypass the VM whenever possible. 
Is that a worthwhile optimization, do you think?

Lawson