markov state

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.

maxGen

// clamp for Generate / Render so output stays bounded

Prefix

Prefix is a sliding window of the last prefixLen words seen. It mirrors the Prefix type in the original program.

suffixList

suffixList is the value stored per prefix: every word observed to follow it, in order (duplicates kept so frequency biases the random walk, just like the original \[]string in the chain map).

Chain

Chain is the on-chain Markov chain. table maps prefix key -> \*suffixList; prefix is the rolling build window so successive Feed calls extend one continuous corpus rather than restarting; words is the running word count.

newChain

nextRand

nextRand is a 64-bit linear congruential generator (the PCG/Knuth multiplier + increment). Deterministic and dependency-free — all the entropy comes from the caller's seed.

seedFor

seedFor derives a Generate seed from the current chain height so the babble changes block to block yet stays reproducible for anyone querying the same height.

mc

mc is the single on-chain corpus, seeded at deploy time.

init.9

Feed

Feed appends text to the on-chain corpus, extending the Markov chain. Any caller may enrich the corpus — this is the open-membership demo model.

Generate

Generate babbles up to nWords of Markov text from the current corpus, seeded deterministically by the chain height. Read-only.

Stats

Stats returns (totalWords, prefixCount) for the current corpus.

parseN

parseN pulls a trailing positive integer out of a Render path such as "/40" or "gen/40"; it returns 0 when there is none.

Render

Render shows a freshly generated sample plus corpus stats. The path may carry a word count, e.g. Render("/60").