 The implementation is efficient.It can be configured to use the GNU Multi-Precision Library as kernel for speed-critical inner loops and implements advanced algorithms like Schönhage–Strassen multiplication, binary splitting and others.All CLN objects are either immediate or reference counted, providing for non-interruptive garbage collection with no burden on the main application.