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

@kamiyo-org/hive-merkle

v1.0.0

Published

Poseidon merkle tree for Hive agent membership proofs

Readme

@kamiyo-org/kamiyo-mitama-merkle

Poseidon Merkle tree implementation for ZK membership proofs on the BN254 curve.

Installation

pnpm add @kamiyo-org/kamiyo-mitama-merkle

Usage

import {
  createMerkleTree,
  PoseidonMerkleTree,
  MerkleProof,
  bigintToBytes32,
  bytes32ToBigint,
} from '@kamiyo-org/kamiyo-mitama-merkle';

// Create a new tree (depth 20, ~1M leaves)
const tree = await createMerkleTree();

// Insert commitments
const commitment = 123456789n;
const index = tree.insert(commitment);

// Get current root
const root = tree.getRoot();

// Generate membership proof
const proof: MerkleProof = tree.getProof(index);
// proof.path: bigint[] - sibling hashes at each level
// proof.indices: number[] - 0 = left, 1 = right

// Check membership
const exists = tree.contains(commitment);

// Get proof by commitment value
const proofByValue = tree.getProofByCommitment(commitment);

API

createMerkleTree(): Promise<PoseidonMerkleTree>

Creates and initializes a new Poseidon Merkle tree with depth 20.

PoseidonMerkleTree

| Method | Returns | Description | |--------|---------|-------------| | insert(commitment: bigint) | number | Insert leaf, returns index | | getRoot() | bigint | Current Merkle root | | getProof(index: number) | MerkleProof | Generate membership proof | | getProofByCommitment(commitment: bigint) | MerkleProof | Get proof by value | | contains(commitment: bigint) | boolean | Check if leaf exists | | size | number | Number of leaves | | getLeaves() | bigint[] | All leaf values |

MerkleProof

interface MerkleProof {
  path: bigint[];    // Sibling hashes (length 20)
  indices: number[]; // Path direction (0=left, 1=right)
}

Utilities

// Convert bigint to 32-byte array (big-endian)
bigintToBytes32(n: bigint): Uint8Array

// Convert 32-byte array to bigint
bytes32ToBigint(bytes: Uint8Array): bigint

Technical Details

  • Hash function: Poseidon (circuit-efficient, collision-resistant)
  • Curve: BN254 (alt_bn128)
  • Tree depth: 20 levels (~1,048,576 max leaves)
  • Zero value: 0n (used for empty siblings)

License

MIT