[cryptonector]

> The single fixed allocation is interesting, and odd. It then has gc...so why On the not just use malloc the manage the pool? I wonder if the performance is that much better?

Ever look at Chicken Scheme? It uses the stack as a heap, and its functions never unwind the stack to return. Hitting the stack size limit triggers a copy garbage collection that resets the stack.

I imagine Fe has a similar design.

Allocation is super fast in the Chicken Scheme way, and GC is, well, GC, and you don't have fragmentation to worry about.