util and stuff
Create HTML tables from Javascript Objects
Mock implementation of @kessler/s3-store using local file system
Node.js package for Gemma 4 — local multimodal inference and agent system
Gemma 4 agent reasoning loop with tool calling
Opinionated modern exponential backoff retry driver
a fork of kessler/grapevine with some added features
Render markdown files in the browser using hcat
command line tool to send notification to your phone using [gcm-server](https://github.com/kessler/gcm-server) and [android notifier](https://github.com/kessler/android-notifier)
like Promise.all() but with limit on concurrency
a search api and cli tool
turn [darkmagic](https://github.com/kessler/darkmagic) code into normal code. this module does not overwrite your code but rather creates a new copy of the transformed result in a separate directory
A connect web application used in [jamesbond](https://github.com/kessler/node-jamesbond) to accept github webhook calls
creates a short report about project's dependencies (license, url etc)
Node.js wrapper for EmbeddingGemma — local vector embeddings for semantic search
download stuff found in sources.json and extract them. this tool is set to download geolite2 mmdb databases. for older geolite databases use [version 1.x.x](https://github.com/kessler/maxmind-download/tree/v1.0.1)
async conditional execution for async.js or standalone usage
a CRUD layer over s3 that utilizes conditional writes to maintain strong consistency for optimistic concurrency
a command queue
A Personal AI assistant CLI tool
personal tokenize util
a tool for splitting csv files
🛰️ Intelligent CLI tool to find and safely clean build artifacts & caches
loadbalance
Kessler is a library for simulating fragmentation events in low Earth orbit.
Professional-grade audio analysis engine for DJ applications: BPM detection, key detection, and beat tracking
A Rust library implementing the Butler-Portugal algorithm for tensor canonicalization
Unified wrapper around different prime-order cryptographic groups where the discrete log, computational Diffie–Hellman, and decisional Diffie–Hellman problems are believed to be hard.
Collection of cryptographic primitives built on top of Elliptic Curve groups, with a focus on Zero-Knowledge Proofs.