Invented Words

Order-n Markov chains over real vocabulary — noise at 2, plagiarism at 4.

words.pseudo · v1 · renderer text

enched
pounten
shered
rench
strated
ridged
anach
stuccupia
puckle
blady
bliving
mobing

Controls · from schema()

How many

1 60

Chain order

2 4

2 is soup, 3 is pronounceable, 4 mostly regurgitates real words.

Shortest

3 12

Longest

4 16

Trained on

Entropy source

Picking a source changes the story on the receipt, never the quality: anything below class A is mixed with the OS CSPRNG before it reaches you. This result actually came from Bitcoin Proof-of-Work.

seed token 04BHZ71SMSYMPG8R9QRKXNRF94

Re-render keeps this token. Generate replaces it. That is the whole idea.

entropy in

16 bytes

stream used

298 bytes

entropy out

208.2 bits

rejections

duration

31,124 µs

order

corpus

large

corpus words

7,776

rejected total

rejected wrong length

rejected as corpus words

rejected without vowel

exhausted

entropy note

Summed surprisal of the characters actually drawn — the chain is not uniform, so this is lower than log₂(alphabet) per letter.

Seed receipt

Class B · Public beacon cached

Bitcoin block 973,606 — 20 leading zeros of proof-of-work, found about ten minutes ago.

Published openly — anyone can look this value up after the fact.

source: Bitcoin Proof-of-Work
observed: 2026-10-28T23:06:24+00:00
latency: 0ms
mixed with: csprng — always

https://mempool.space/block/00000000000000000000b18ace1d5c4854406e3c21809abe7eac0afda3de4ac9 ↗

Permalink

The token is the seed, so this link recomputes the result rather than looking it up. No database, and it works for as long as v1 does.

This page and /api/v1/g/words.pseudo run the same code. There is no private endpoint.

Invented Words

Result

Measurements

Seed receipt

Permalink