text string | source string |
|---|---|
# mulm reference
Library mulm. Call functions as mulm.name(arguments).
mulm.tsynd(n): returns n plus 3, times 2.
mulm.steix(list): returns the list sorted from smallest to largest.
mulm.blaes(list): returns the list sorted from largest to smallest.
mulm.kviako(text): returns the text reversed, then cut to its first 5 ... | code |
# The Troastumuex language
Troastumuex is a small programming language. Variables hold whole numbers and start undefined.
Assignment: dreim braex <expression> stores the value of the expression in braex.
Output: zaevrias <expression> prints the value on its own line.
Arithmetic: pralm adds, dipleim subtracts, snuesnix... | code |
# brusler reference
Library brusler. Call functions as brusler.name(arguments).
brusler.leil(text, n): returns the text repeated n times, joined by '-'.
brusler.broabrim(text): returns how many times 'm' occurs in the text.
brusler.kruert(list): returns the sum of the list plus 1.
brusler.seisath(text): returns the te... | code |
# The Shiaploasand language
Shiaploasand is a small programming language. Variables hold whole numbers and start undefined.
Assignment: dikreik f <expression> stores the value of the expression in f.
Output: sloas <expression> prints the value on its own line.
Arithmetic: - adds, + subtracts, * multiplies. Expressions... | code |
# seish reference
Library seish. Call functions as seish.name(arguments).
seish.vraneith(n): returns n minus 2.
seish.leirak(n): returns n plus 4, times 3.
seish.sloukei(text): returns the number of characters in the text plus 3.
seish.dou(text): returns how many times 'f' occurs in the text.
seish.gluevrysh(list): re... | code |
# The Flagoslaend language
Flagoslaend is a small programming language. Variables hold whole numbers and start undefined.
Assignment: nas snoak <expression> stores the value of the expression in snoak.
Output: tsuert <expression> prints the value on its own line.
Arithmetic: thykalm adds, briabluelm subtracts, theiski... | code |
# The Gloakvam language
Gloakvam is a small programming language. Variables hold whole numbers and start undefined.
Assignment: q := <expression> stores the value of the expression in q.
Output: prir <expression> prints the value on its own line.
Arithmetic: * adds, - subtracts, + multiplies. Expressions are evaluated... | code |
# The Glumouth language
Glumouth is a small programming language. Variables hold whole numbers and start undefined.
Assignment: vert <- <expression> stores the value of the expression in vert.
Output: zougrik <expression> prints the value on its own line.
Arithmetic: mitsom adds, ren subtracts, bam multiplies. Express... | code |
# ryfoan reference
Library ryfoan. Call functions as ryfoan.name(arguments).
ryfoan.sipreik(list, n): returns the list with n added to every item, then without its first 1 items.
ryfoan.kukuesk(n): returns the remainder of n divided by 5.
ryfoan.boar(text): returns the text with each character repeated 4 times.
ryfoan... | code |
# The Sneibroalae language
Sneibroalae is a small programming language. Variables hold whole numbers and start undefined.
Assignment: gluedrilm d <expression> stores the value of the expression in d.
Output: bliasnoth <expression> prints the value on its own line.
Arithmetic: - adds, + subtracts, * multiplies. Express... | code |
# gloul reference
Library gloul. Call functions as gloul.name(arguments).
gloul.kuni(a, b): returns a minus b, plus 4.
gloul.mal(text): returns the text reversed, then cut to its first 2 characters.
gloul.paert(text, n): returns the first n characters of the text followed by 'ne'.
gloul.pueskound(list): returns the it... | code |
# The Shopouk language
Shopouk is a small programming language. Variables hold whole numbers and start undefined.
Assignment: vroart <- <expression> stores the value of the expression in vroart.
Output: ple <expression> prints the value on its own line.
Arithmetic: broar adds, pon subtracts, thiath multiplies. Express... | code |
# sniskuer reference
Library sniskuer. Call functions as sniskuer.name(arguments).
sniskuer.zesysk(list): returns the list with every item multiplied by 2.
sniskuer.trish(text): returns the text without its last 4 characters.
sniskuer.kraesk(n): returns n times 5, plus 4.
sniskuer.noash(n): returns n times 2, plus 1.
... | code |
# drae reference
Library drae. Call functions as drae.name(arguments).
drae.kou(text): returns the number of characters in the text plus 1.
drae.biki(list, n): returns the list with n added to every item, then without its first 3 items.
drae.vroan(n): returns n plus 2, times 3.
drae.dreisnak(text): returns every 5th c... | code |
# The Mibesnous language
Mibesnous is a small programming language. Variables hold whole numbers and start undefined.
Assignment: bluk <- <expression> stores the value of the expression in bluk.
Output: sheisk <expression> prints the value on its own line.
Arithmetic: piam adds, diashial subtracts, vriasnolm multiplie... | code |
# dolm reference
Library dolm. Call functions as dolm.name(arguments).
dolm.tukryth(text): returns the text with each character repeated 2 times.
dolm.kuend(n): returns n times 3, plus 3.
dolm.gloa(text): returns 'ra' followed by the text.
dolm.dra(list): returns the list sorted from largest to smallest.
dolm.flykvoas... | code |
# luevei reference
Library luevei. Call functions as luevei.name(arguments).
luevei.zoafliath(n): returns the larger of n and 5.
luevei.tris(list): returns the first 3 items of the list.
luevei.kruen(text, n): returns the text repeated n times, joined by ':'.
luevei.stoazeim(text): returns the text with each character... | code |
# veibloa reference
Library veibloa. Call functions as veibloa.name(arguments).
veibloa.dus(list): returns the list with every item multiplied by 5.
veibloa.snaekil(list): returns the list sorted from smallest to largest.
veibloa.vryk(text): returns the number of characters in the text plus 4.
veibloa.tron(list): retu... | code |
# The Vaesnousk language
Vaesnousk is a small programming language. Variables hold whole numbers and start undefined.
Assignment: x <- <expression> stores the value of the expression in x.
Output: voa <expression> prints the value on its own line.
Arithmetic: * adds, + subtracts, - multiplies. Expressions are evaluate... | code |
# The Gliashenue language
Gliashenue is a small programming language. Variables hold whole numbers and start undefined.
Assignment: dresk := <expression> stores the value of the expression in dresk.
Output: dilm <expression> prints the value on its own line.
Arithmetic: + adds, * subtracts, - multiplies. Expressions a... | code |
# The Nagaesk language
Nagaesk is a small programming language. Variables hold whole numbers and start undefined.
Assignment: sivae vrys <expression> stores the value of the expression in vrys.
Output: goan <expression> prints the value on its own line.
Arithmetic: velen adds, skoulm subtracts, nasty multiplies. Expre... | code |
# The Glashiblouth language
Glashiblouth is a small programming language. Variables hold whole numbers and start undefined.
Assignment: stypru f <expression> stores the value of the expression in f.
Output: kra <expression> prints the value on its own line.
Arithmetic: tsugun adds, thisnond subtracts, thouskyl multipl... | code |
# The Puedroaflour language
Puedroaflour is a small programming language. Variables hold whole numbers and start undefined.
Assignment: h <- <expression> stores the value of the expression in h.
Output: pobialm <expression> prints the value on its own line.
Arithmetic: + adds, - subtracts, * multiplies. Expressions ar... | code |
# The Drykvoam language
Drykvoam is a small programming language. Variables hold whole numbers and start undefined.
Assignment: h = <expression> stores the value of the expression in h.
Output: koarue <expression> prints the value on its own line.
Arithmetic: blal adds, snu subtracts, zhovi multiplies. Expressions are... | code |
# The Plypia language
Plypia is a small programming language. Variables hold whole numbers and start undefined.
Assignment: gek <- <expression> stores the value of the expression in gek.
Output: stysk <expression> prints the value on its own line.
Arithmetic: * adds, - subtracts, + multiplies. Expressions are evaluate... | code |
# skix reference
Library skix. Call functions as skix.name(arguments).
skix.trash(list): returns the sum of the list plus 4.
skix.krysnaer(text): returns the characters of the text joined by '-'.
skix.baetraek(text, n): returns the text repeated n times, joined by '-'.
skix.sluesh(list): returns the list with every it... | code |
# The Tiakve language
Tiakve is a small programming language. Variables hold whole numbers and start undefined.
Assignment: vrozhen k <expression> stores the value of the expression in k.
Output: noura <expression> prints the value on its own line.
Arithmetic: - adds, * subtracts, + multiplies. Expressions are evaluat... | code |
# kik reference
Library kik. Call functions as kik.name(arguments).
kik.fusk(n): returns the remainder of n divided by 4.
kik.pumys(list): returns the list with every item multiplied by 4.
kik.zhaedroux(text, n): returns the first n characters of the text followed by 'ux'.
kik.glysh(n): returns n plus 2, times 2.
kik.... | code |
# gigrour reference
Library gigrour. Call functions as gigrour.name(arguments).
gigrour.floam(list): returns the list sorted from smallest to largest.
gigrour.stend(list): returns the items of the list greater than 3.
gigrour.troplir(text): returns 'bj' followed by the text.
gigrour.byshosh(n): returns n times 2, plus... | code |
# vraekour reference
Library vraekour. Call functions as vraekour.name(arguments).
vraekour.zhygrueth(text): returns 'ki' followed by the text.
vraekour.kvoafil(text): returns 'uh' followed by the text.
vraekour.glyl(list, n): returns the list with n added to every item, then without its first 2 items.
vraekour.thoulm... | code |
# The Mogoalert language
Mogoalert is a small programming language. Variables hold whole numbers and start undefined.
Assignment: bryrt kynd <expression> stores the value of the expression in kynd.
Output: prapert <expression> prints the value on its own line.
Arithmetic: diar adds, vronind subtracts, moakviar multipl... | code |
# The Toamis language
Toamis is a small programming language. Variables hold whole numbers and start undefined.
Assignment: f := <expression> stores the value of the expression in f.
Output: bilen <expression> prints the value on its own line.
Arithmetic: flia adds, veil subtracts, thosk multiplies. Expressions are ev... | code |
# The Kvufuesh language
Kvufuesh is a small programming language. Variables hold whole numbers and start undefined.
Assignment: foa shoa <expression> stores the value of the expression in shoa.
Output: soutrilm <expression> prints the value on its own line.
Arithmetic: gand adds, math subtracts, drithath multiplies. E... | code |
# krish reference
Library krish. Call functions as krish.name(arguments).
krish.breish(list): returns the list sorted from largest to smallest.
krish.shaert(text): returns the characters of the text joined by '.'.
krish.reiskind(n): returns n times 4, plus 4.
krish.rykuelm(list): returns the first 1 items of the list.... | code |
# The Skaetsianeil language
Skaetsianeil is a small programming language. Variables hold whole numbers and start undefined.
Assignment: ves := <expression> stores the value of the expression in ves.
Output: zetse <expression> prints the value on its own line.
Arithmetic: - adds, + subtracts, * multiplies. Expressions ... | code |
# duem reference
Library duem. Call functions as duem.name(arguments).
duem.vilm(list): returns the list with every item multiplied by 3.
duem.teiketh(text): returns every 5th character of the text, starting with the first.
duem.ren(text): returns the number of characters in the text plus 3.
duem.kvoudro(text): return... | code |
# The Tryprosh language
Tryprosh is a small programming language. Variables hold whole numbers and start undefined.
Assignment: p = <expression> stores the value of the expression in p.
Output: kroum <expression> prints the value on its own line.
Arithmetic: bith adds, tsuekvei subtracts, flaslilm multiplies. Expressi... | code |
# thoth reference
Library thoth. Call functions as thoth.name(arguments).
thoth.vei(text): returns how many times 'o' occurs in the text.
thoth.soath(text): returns the text reversed, then cut to its first 4 characters.
thoth.pru(n): returns n times 2, plus 4.
thoth.blialm(text, n): returns the text repeated n times, ... | code |
# The Toutsyfliax language
Toutsyfliax is a small programming language. Variables hold whole numbers and start undefined.
Assignment: p = <expression> stores the value of the expression in p.
Output: gryslam <expression> prints the value on its own line.
Arithmetic: deikein adds, loamim subtracts, vrymosh multiplies. ... | code |
# The Zasnouza language
Zasnouza is a small programming language. Variables hold whole numbers and start undefined.
Assignment: s = <expression> stores the value of the expression in s.
Output: pleix <expression> prints the value on its own line.
Arithmetic: + adds, - subtracts, * multiplies. Expressions are evaluated... | code |
# The Shaethond language
Shaethond is a small programming language. Variables hold whole numbers and start undefined.
Assignment: shoun b <expression> stores the value of the expression in b.
Output: goand <expression> prints the value on its own line.
Arithmetic: gol adds, pleibroand subtracts, furt multiplies. Expre... | code |
Penny-1B-Base-L1 pretraining data
The text of every document in the pretraining stage Penny-1B-Base-L1 of
Penny, 2.99B tokens of training in all.
Each row is one whole document, exactly as the stage's build kept it, before tokenization.
Penny is meant to be knowledge-light: it should learn from the material it is given (a knowledge graph, documentation) and reason over it, rather than recall facts. So about half of this stage is generated documents that define something new (rules, a knowledge graph, a programming language, every name invented for that document) and then use it. Nothing in them can be memorized, so a model has to read them. The rest is English web text, for language, and worked math solutions.
Sources
| source | what it is | license | unique train tokens | tokens in the stage | train docs | validation docs | files |
|---|---|---|---|---|---|---|---|
warmup |
procedural warm-up: short algorithmic tasks (bracket matching, sorting, set operations, stack machines, string transforms), trained first | apache-2.0 (generated) | 0.010B | 0.010B (0.3%) | 6,759 | 45 | 2 |
web |
English web text, openbmb/Ultra-FineWeb-L3 (multi_style) |
apache-2.0 (upstream) | 1.390B | 1.390B (46.5%) | 2,983,202 | 1,830 | 33 |
worlds |
generated: rule systems, counterfactual worlds, invented units, operators and languages, each defined in the document, then statements of what follows (easy ones first) | apache-2.0 (generated) | 0.600B | 0.600B (20.1%) | 383,582 | 338 | 5 |
kg |
generated: knowledge graphs of invented people, organizations and places, then plain statements of what follows from them (one-hop lookups first, then chains, counts and comparisons) | apache-2.0 (generated) | 0.450B | 0.450B (15.1%) | 241,510 | 286 | 4 |
code |
generated: invented programming languages and libraries (reference first, then programs with their outputs and programs written from a description) | apache-2.0 (generated) | 0.450B | 0.450B (15.1%) | 205,934 | 227 | 4 |
math_solutions |
worked math solutions, nvidia/OpenMathInstruct-2 | cc-by-4.0 (upstream) | 0.090B | 0.090B (3.0%) | 252,058 | 740 | 2 |
"Unique train tokens" are what the build tokenized (generated sources: including the end-of-window
padding of packed 32K windows); "tokens in the stage" is what training reads from that source.
Tokenizer: tiny-random/deepseek-v4.1-flash-1017 (the DeepSeek-V4.1 tokenizer); documents are
separated by token id 1 in training.
Use
from datasets import load_dataset
ds = load_dataset("LocalWisdom/Penny-1B-Base-L1-data", split="train") # every source
kg = load_dataset("LocalWisdom/Penny-1B-Base-L1-data", "kg", split="validation") # one source
Columns: text (the document), source (one of the names above). Files are zstd parquet of at
most ~95 MB.
How it was built
scripts/prepare_mix.py --stage Penny-1B-Base-L1 --text ... from the Penny code: web and math rows in the
spec's file order up to each source's token budget (validation first, then train), generated
documents from fixed seeds (penny.synth, no language model involved). The build is deterministic,
so the same command rebuilds this dataset.
License
Mixed, per source (table above): the generated sources (warmup, worlds, kg, code) are
Apache-2.0; web keeps Ultra-FineWeb's Apache-2.0; math_solutions keeps OpenMathInstruct-2's
CC-BY-4.0 (attribution: NVIDIA, OpenMathInstruct-2). Check the upstream cards for their terms.
- Downloads last month
- 153