Prefix‑Trie‑TS is a tiny, case‑insensitive trie implementation written in TypeScript (≈800 B gzipped) that lets developers build, update, and query prefix trees for autocomplete or word‑list extraction. It provides simple methods to add, remove, list, and search words, and can be used in browsers or Node.js via npm. Ideal for front‑end or server‑side projects that need a lightweight, type‑safe autocomplete data structure.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.