const PrefixLen
PrefixLen is the number of words in a prefix. Two is the classic choice from the Go codewalk: long enough to sound plausible, short enough to keep the chain well-connected.
v0 source pure
Package markov is a deterministic Markov-chain text generator — a port of Go's canonical example "Generating arbitrar...
View source
gno.land/p/moul/x/daily/markov/v0
Deterministic Markov-chain text generator — a port of Go's canonical example
"Generating arbitrary text: a Markov chain algorithm"
with math/rand replaced by a caller-supplied seed.
A Chain maps every two-word prefix to the list of words observed to follow
it (duplicates kept, so frequency biases the walk), storing that map in a
persistent avl.Tree. Build folds text into the chain; Generate walks it
from the start prefix, picking one suffix per step from a small LCG seeded by
the uint64 you pass — so generation is pure and replayable, and the caller
decides where entropy comes from (on-chain, the block height). No chain imports,
no ambient state.
1import "gno.land/p/moul/x/daily/markov/v0"
2
3c := markov.New()
4c.Build("it was the best of times it was the worst of times") // fold in a corpus
5words := c.Generate(40, seed) // walk it, seeded
6c.Stats() // (totalWords, prefixCount)
7c.Iterate(func(prefix string, suffixes []string) bool { ... }) // inspect the map
Live demo: r/moul/x/daily/markovdemo
· render it at /r/moul/x/daily/markovdemo/v0.
Part of moul/gno-contracts — moul's versioned gno.land contracts. See the repository for the full catalog, build/test tooling, and usage.
Dependency graph:
🧪 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.
Package markov is a deterministic Markov-chain text generator — a port of Go's canonical example "Generating arbitrary text: a Markov chain algorithm" (https://go.dev/doc/codewalk/markov/) with math/rand replaced by a caller-supplied seed.
It is a pure library: it imports no chain APIs and reads no ambient state. A Chain maps every PrefixLen-word prefix to the list of words observed to follow it (duplicates kept, so frequency biases the walk), storing that map in a persistent avl.Tree. Build folds text into the chain; Generate walks it from the start prefix, picking one suffix per step from a small LCG seeded by the uint64 the caller passes — so generation is deterministic and replayable, and the caller decides where entropy comes from (on-chain, the block height).
A realm wires it up by holding a *Chain in a package-level var, calling Build to grow the corpus and Generate with a height-derived seed. For a complete, live example see the demo realm r/moul/x/daily/markovdemo(/r/moul/x/daily/markovdemo/v0).
1
1
2
type Chain
structChain is a Markov chain over a persistent avl.Tree. table maps prefix key -> *suffixList; prefix is the rolling build window so successive Build calls extend one continuous corpus rather than restarting; words is the running word count.
Methods on Chain
func Build
method on ChainBuild tokenizes text on whitespace and folds each word into the chain, recording it as a suffix of the current prefix and then shifting. It returns the number of words added. This is the analogue of Chain.Build from the codewalk.
func Generate
method on ChainGenerate walks the chain from the start prefix, picking one suffix per step via an LCG seeded by seed, and returns up to n words. It stops early if it reaches a prefix with no recorded suffixes (a dead end). Pure: the same (n, seed) always yields the same words for a given chain.
func Iterate
method on ChainIterate calls fn for each prefix in ascending key order, passing the prefix key and the list of words recorded to follow it. Returning true from fn stops the iteration early; Iterate reports whether it was stopped that way.
func Stats
method on ChainStats returns (totalWords, prefixCount) for the current chain.
type Prefix
slicePrefix is a sliding window of the last PrefixLen words seen. It mirrors the Prefix type in the original program.
2
- gno.land/p/nt/avl/v0 package
- strings stdlib