npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

@lymit/core

v0.1.0

Published

Pure rate-limit algorithms (fixed window, sliding window, token bucket), config resolution and a block cache. Zero dependencies, zero I/O. The algorithms inside @lymit/sdk and the Lymit edge.

Readme

@lymit/core

Pure rate-limit algorithms and shared types. Design: docs/architecture/algorithms.md. Zero runtime dependencies, zero I/O — no clocks, no network, no storage. Every function takes now as an argument, which is what makes the algorithms testable at 0 ms and lets the same code run in the Edge API, the SDK, and any future storage backend.

Algorithms

All three share one shape:

algorithm(state | null, resolvedConfig, now, cost = 1) → { state, response }
  • state is the next state to persist (input is never mutated; null means "no record yet").
  • response is a LimitResponse { success, limit, remaining, reset, retryAfter? }.
  • cost is a non-negative integer; 0 peeks without consuming. Rejections never consume.

| Algorithm | State | Notes | | --------------- | ---------------------------------------------- | -------------------------------------------------------------------------------------------------------------------------------- | | fixedWindow | { windowStart, count } | Epoch-aligned windows, so every node agrees on boundaries with no coordination. | | slidingWindow | { windowStart, currentCount, previousCount } | Weighted two-window approximation; O(1) state. retryAfter is solved exactly. | | tokenBucket | { tokens, lastRefill } | Lazy continuous refill; all-or-nothing deduction. reset = time until full (success) or until cost is affordable (rejection). |

All three honour a stored state that is ahead of the local clock rather than resetting it, so a fast-clocked node can never hand out a fresh allowance.

Helpers

  • resolveConfig(config) — validates a user LimitConfig and converts durations ("30s", "1h", "1d", or ms) to a ResolvedLimitConfig. Throws LymitConfigError naming the bad field.
  • BlockCache — bounded LRU cache of known-blocked keys. Stores only retryable rejections, so a stale entry can cost a round trip but never leak capacity.
  • toHeaders(response) — X-RateLimit-Limit/Remaining/Reset and Retry-After (whole seconds, never 0).
  • keyFor(workspaceId, namespace, identifier) — injective storage/cache key using the ASCII unit separator, which no part may contain.