TheCryptoDonkey - Nostr Hypermedia

Managing multiple personas usually means unmanageable key sprawl?? I just shipped nsec-tree, which is a production-ready, fully offline CLI for hierarchical Nostr identity. Instead of juggling random keys, you can derive unlimited, one-way nsecs from a single master secret. To prove it works, I just initialized my own offline identity tree. My official nsec-tree Master Root Pubkey is: d6b3a6496c529d8e7f6e10cc7bb89f794ef931770c700f68a859cd24234a2645 Zero relays. Zero network calls. Just composable, scriptable identity using standard BIP-340 math. Try it right now: npx nsec-tree root create ...(Watch the replies for a live demonstration of a cryptographic linkage proof).

TheCryptoDonkey 7 months ago

Shipped toll-booth - L402 middleware that turns any HTTP API into a Lightning paywall. Five backends (Phoenixd, LND, CLN, LNbits, Alby). Three payment rails (Lightning, Cashu, NWC). Runs on Express, Deno, Bun, and Cloudflare Workers. Cashu-only mode means you can gate a serverless API behind payments with zero Lightning infrastructure. Already running in production gating a Valhalla routing engine at routing.trotters.cc. npm install @thecryptodonkey/toll-booth

GitHub

GitHub - forgesworn/toll-booth: Any API becomes a Lightning toll booth in one line. L402 middleware for Express, Hono, Deno, Bun, and Workers.

Any API becomes a Lightning toll booth in one line. L402 middleware for Express, Hono, Deno, Bun, and Workers. - forgesworn/toll-booth

TheCryptoDonkey 8 months ago

Just shipped rendezvous-kit; an open-source library for finding fair meeting points. The problem: every "meet in the middle" tool uses geographic midpoint. That's just a straight line on a map. It ignores roads, terrain, coastlines, everything that actually determines how long it takes to get somewhere. rendezvous-kit uses real routing engines to compute isochrones (reachability zones), intersects them, discovers actual venues inside the overlap via OpenStreetMap, and ranks them by fairness. Three fairness modes: > min_max: nobody travels too long > min_total: group minimises total travel > min_variance: equalise journey times Routing is engine-agnostic; plug in Valhalla, ORS, GraphHopper, or OSRM. Self-host your routing infrastructure with zero API keys. Venue search queries OpenStreetMap's Overpass API. You can point it at your own Overpass instance if you want full control; or use the public endpoint for free. Only runtime dependency is geohash-kit (also ours). Zero third-party dependencies. TypeScript, ESM-only, MIT licensed. Interactive demo with real UK scenarios; cycling in the Lake District, coastal concavity on the Severn Estuary, 5-person tight budgets in Manchester: https://thecryptodonkey.github.io/rendezvous-kit Source:

GitHub

GitHub - forgesworn/rendezvous-kit: Find fair meeting points for N participants — isochrone intersection, venue search, fairness scoring

Find fair meeting points for N participants — isochrone intersection, venue search, fairness scoring - forgesworn/rendezvous-kit

TheCryptoDonkey 8 months ago

Just shipped geohash-kit - a TypeScript library for building location-based Nostr apps. - Multi-precision g-tag ladders for geographic discoverability - REQ filters from coordinates + radius with neighbour ring expansion - Smart polygon coverage — cover any area with compact geohash sets - Parse g-tags from events, find the best precision match - Zero dependencies, 736 tests