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

raffler

v0.1.0

Published

Select winners from a list using a fair algorithm

Readme

Raffler

Raffler is an algorithm to select a winner from a provably fair source of randomness.

The Algorithm

The algorithm is as follows:

  • Prior to starting, create an ordered list of participants (L_0)
  • Select some random string S_0 from an unbiased source of randomness
  • For each prize n, (n = 1, 2, ..., N):
    • Calculate H_n = HMAC_SHA256(S_0, string(n))
    • Interpret H_n as a integer Z_n
    • The winner is Z_n mod length(L_(n-1))
    • Remove the winner from the list to get L_n

Some things to point out:

  • There are no special requirements for the list. The order doesn't matter. You could use the names of the participants in some lexicographical order agreed upon beforehand, for example
  • A good source of randomness could be the hash of the first blockchain block generated after the submission deadline