This project provides an extremely fast, GC-friendly double-ended queue implementation in JavaScript using a circular buffer. It's designed for performance-critical applications where constant-time `O(1)` insertions and removals at both ends are needed, serving as a high-performance alternative to arrays for queue and stack operations.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.