gno.land/p/nym-moultest123/x/daily/countminsketch/v0

Count–Min Sketch: frequency estimates in fixed space — New, NewDefault, Add, AddN, Estimate, MightHave, Merge, Reset, Clone, Row, Index, Total, Counters.

1import "gno.land/p/nym-moultest123/x/daily/countminsketch/v0"
2
3s := countminsketch.NewDefault()   // 256 x 4 = 1024 counters, forever
4for _, e := range stream { s.Add(e) }
5s.Estimate("alice")   // an UPPER BOUND on how often "alice" appeared
6s.MightHave("bob")    // false is definitive: never added

An exact frequency map costs one entry per distinct element — unbounded storage driven by whatever users feed it, which on chain is a liability. A sketch is sized once and never grows.

The error is one-sided, and that is the whole contract: Estimate never undercounts. Collisions can only add other elements' counts to a row, so the true frequency is always ≤ the estimate. Taking the minimum across depth independently-seeded rows makes an overestimate require a collision in every row at once. Treat the result as "at most this often", never "exactly this often". The guarantee is tested against a deliberately tiny sketch where collisions are certain.

Sizing: width controls the error, depth controls the odds of hitting it — roughly, the overestimate stays within total/width with probability 1 - (1/2)^depth.

Hashing is FNV-1a with a per-row seed, computed in pure gno, so the counters are identical on every node. Distinct() is deliberately absent — a Count–Min Sketch cannot answer cardinality; use a HyperLogLog.

Live demo: r/moul/x/daily/countminsketchdemo · render it at /r/nym-moultest123/x/daily/countminsketchdemo/v0.

Part of moul/gno-contracts — moul's versioned gno.land contracts. See the repository for the full catalog, build/test tooling, and usage.

🧪 Highly experimental — potentially vibe-coded. Not audited; may break, change, or be removed at any time. Do not use with anything of value. Full disclaimer: DISCLAIMER.