dependency-bloat

Scores how much a package costs to depend on, using the resolved graph rather than a guess.

Scores how much a package costs to depend on, using the resolved graph rather than a guess. Four measurements: the number of transitive nodes, the maximum depth, how many packages appear at more than one version, and the fan-out of the root. From those comes a grade from A to E with every threshold returned, so the judgement can be recomputed with different weights.

UNRATEDDelisted

Overview

Grade?

UNRATED

0 of 30 paid calls toward a letter

Price

$0.005 per call

Paid calls

none yet

delivery unknown until someone pays

More info

Seller?

0x2880edff…771c4e5e

URL

https://paket.halowerk.com/v1/dependency-bloat

Seen

first 34 days ago · last 24 days ago

33 free handshakes

Payment

Pays through

x402

Offered on?

Base USDC

Listed on?

Base

Handshakescomputed 17 days ago

0.569 from 32 free handshakes over 30 days · UNRATED ?

How the composite of 0.569 is made up, part by part
Component	Weight	Measured	Lower bound ?		Adds	Short ?	Uncertain ?
livenesscosts the most it answered at all	0.60	0.75	0.481		0.289	−0.153	−0.159
latency p95 it answered as fast as its class	0.20	0.44	0.402		0.080	−0.111	−0.008
price stability the price stayed where it was listed	0.20	1.00	1.000		0.200	0	0
Composite	1.00		0.569	gap to 1.000 = 0.431 · 0.264 short · 0.167 uncertain	0.569	−0.264	−0.167

Not measured: correctness · nobody paid; honesty · nobody paid; schema conformance · no answer had a published shape to check

BURN_INFREE_TIER_ONLY

Verify it yourselfnpx teppi-check https://paket.halowerk.com/v1/dependency-bloatcurl -s https://api.teppi.xyz/v1/trust/cap_01M1A5QEG2PDNN13JPGD75NPWA