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

@a0n/aeon-bazaar

v0.1.0

Published

Negotiation engine powered by void walking on gnosis topologies

Readme

@a0n/aeon-bazaar

Negotiation engine powered by void walking. Unbounded -- the market runs forever, no termination guarantee, no mediator. Agents interact directly on gnosis topologies.

For bounded dispute resolution with convergence certificates, see aeon-neutral.

Install

bun add @a0n/aeon-bazaar

Quick Start

import {
  createVoidBoundary,
  updateVoidBoundary,
  complementDistribution,
  createMetaCogState,
  c0Choose,
  c0Update,
  c1Measure,
  c3Adapt,
} from '@a0n/aeon-bazaar';

// Create an agent with 3 choices
const boundary = createVoidBoundary(3);
const state = createMetaCogState(3);

// Choose, observe outcome, update void boundary
const choice = c0Choose(state);
const outcome = { accepted: false, reward: -1 };

const updated = updateVoidBoundary(boundary, choice, outcome);
const complement = complementDistribution(updated);

// Metacognitive adaptation
const measurement = c1Measure(state, updated);
const adapted = c3Adapt(state, measurement);

bazaar vs neutral

| | aeon-bazaar | aeon-neutral | |--|------------|-------------| | Mode | Unbounded negotiation | Bounded dispute resolution | | Termination | No guarantee | Convergence certificate | | Mediator | None (walkers interact directly) | Third walker on the convergence site | | Use case | Markets, open-ended bargaining | Mediation, arbitration, settlement | | Walkers | 1+ self-interested agents | 2 game walkers + 1 Skyrms site walker |

API

Void Walker (core primitives)

| Export | Description | |--------|-------------| | createVoidBoundary(n) | Initialize void boundary for n choices | | updateVoidBoundary(boundary, choice, outcome) | Record outcome, grow the void | | decayVoidBoundary(boundary, rate) | Time-decay old observations | | complementDistribution(boundary) | Compute distribution from what didn't work |

Measurement

| Export | Description | |--------|-------------| | shannonEntropy(dist) | Information content of a distribution | | excessKurtosis(dist) | Peakedness -- how concentrated is the distribution | | inverseBule(dist) | Topological deficit measure | | giniCoefficient(dist) | Inequality measure across choices |

Metacognitive Walker (c0-c3)

| Export | Description | |--------|-------------| | createMetaCogState(n) | Initialize walker state for n choices | | c0Choose(state) | Choose action from complement distribution | | c0Update(state, choice, outcome) | Update walker after observing outcome | | c1Measure(state, boundary) | Measure kurtosis, entropy, inverse Bule | | c2SelectGait(state) | Select trot/canter/gallop gait | | c3Adapt(state, measurement) | Adapt exploration/exploitation balance |

Gait System

Three gaits for adaptive exploration:

| Gait | Depth | Behavior | |------|-------|----------| | Trot | Shallow | Broad exploration, high entropy | | Canter | Medium | Balanced exploration/exploitation | | Gallop | Deep | Focused exploitation, low entropy |

GAIT_DEPTH maps each gait to its pipeline depth for the laminar kurtosis pipeline.

Performance

  • 1,548 rounds/ms (laminar pipeline, depth 16)
  • 2,084 rounds/ms (adaptive gait)
  • 10,000 negotiations in 6.5ms
  • 17.3x throughput at pipeline depth 16

The Skyrms Equilibrium

The fixed point of the void gradient flow. Self-interested agents with perfect knowledge of the void boundary converge to strategies 55 percentage points more cooperative than Nash in Hawk-Dove.

Named for Brian Skyrms (Evolution of the Social Contract, 1996).

Development

bun test

Related

  • aeon-neutral -- bounded mediation with convergence certificates
  • Gnosis -- GGL language for negotiation topologies
  • Aeon -- TLA+ specs for negotiation convergence

License

Copyright Taylor William Buley. All rights reserved.

MIT