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

@finwo/lgfec

v0.1.1

Published

Lagrange interpolation based forward error correction

Readme

LG FEC

Lagrange interpolation based forward error correction

What

This library is built to split a Uint8Array into separate equally-sized chunks, adding chunks to be able to reconstruct the original Uint8Array as long as {quorum} chunks remain.

The chunks are generated (and restored) using lagrange interpolation, similar to how shamir secret sharing works over a finite field (2^8), using the original data as the lower-bound shares.

Quirks

When your data is not nicely dividable by the quorum number, 0-bytes will be appended to the data.

If you need an exact reconstruction, use splitExact and combineExact instead. These will prefix the data with a length indicator before handing the data off to split and combine, limiting the max data size to 2GiB but ensuring you get back the exact same bytes.

Usage

import { split, combine } from '@finwo/lgfec';

// Prepare data
const original = "Hello World!";
const encoder  = new TextEncoder();
const decoder  = new TextDecoder();
const data     = encoder.encode(original);

// Configuration of this example
const shares = 8;
const quorum = 5;

// Generate FEC chunks
let chunks = split(data, shares, quorum);

// Delete chunks, keep {quorum}
delete chunks[2];
delete chunks[4];
delete chunks[6];
chunks = Object.values(chunks);

// Reconstruct the original
const reconstructed = combine(chunks);
if (!reconstructed) {
  throw new Error("Error during combining chunks");
}

// Get back a string
const decoded = decoder.decode(reconstructed);

// And some debug logging
console.log({ original, decoded });