Horyzont

Building and studying a Polish private/public corpus for model training, validation and data research.

Developed by Oris Team. The project is deliberately practical: collect, preserve, measure, train small models, inspect what they learn, then feed the result back into the data pipeline.

State · last three months

MonthTokensStatus
June 2026—no snapshot
July 2026—no snapshot
August 2026≈7Bactive corpus work

Horyzont v1 → v1.5

The first phase was intentionally simple. It existed to make the pipeline measurable before making it clever. Documents were routed into KEEP, CLEAN, SPLIT and DROP. That routing remains useful as a historical diagnostic, but Horyzont is now moving from v1 to v1.5: decisions are no longer treated as final labels produced by one teacher or one scoring pass.

V1 · KEEP37.34%

≈870k classified records

V1 · CLEAN21.03%

≈490k classified records

V1 · SPLIT5.15%

≈120k classified records

V1 · DROP36.48%

≈850k classified records

These percentages describe the early ≈2.33M-record routing experiment, not the token share of the full corpus.

What v1.5 is doing

v1.5 is a feedback loop rather than a single filter. A larger teacher is useful for bootstrapping judgments, but its scores are not treated as ground truth. The same applies to later pipeline models: a confident score is still only one measurement of a document.

01
Raw web data stays recoverable

Source text, provenance and compact routing decisions are kept before destructive processing. Even material currently marked DROP can be useful later when the scoring model, tokenizer or target model changes.

02
Bielik 11B Q8 bootstraps the first strong labels

It reviews noisy/web-derived material, proposes cleaning or routing decisions and produces candidate examples. It is a teacher and a tool, not an oracle.

03
Manual gold checks the teacher

A smaller manually reviewed set is used to measure where teacher judgments are reliable and where they fail. This is also the reference point for later small filtering models.

04
Small models test data reduction per sequence

Koliber 1.0, APT3 and Liquid 230M-class models are used as practical probes. The question is not only “does this document look good?”, but “does keeping or removing this type of sequence help a model at this scale?”

05
Build more labels, retrain, repeat

The accepted/rejected boundary is iterated instead of frozen. The goal is a higher and better-understood accept/reject signal, not a one-pass quality score.

06
ORIS BERT Small C re-scores the remaining corpus

After enough gold and model feedback exist, the compact encoder can be used for a much broader pass, including a new evaluation of data already processed by earlier versions.

Preservation does not mean duplicating every intermediate artifact forever. A 40 GB source corpus should not quietly become 60 GB because each stage emits another metadata-heavy copy. v1.5 therefore keeps the original data and the information needed to reproduce or audit a decision, while avoiding gratuitous per-stage metadata expansion.

Do not over-trust the score

A teacher can reject useful data. A small classifier can learn the teacher's bias. A later target model can value a sequence that looked unimportant to both. For that reason, Horyzont treats KEEP/CLEAN/SPLIT/DROP as routing decisions with provenance, not as permanent truths.

DROP is not deletionDROP means “not selected by the current policy”. The source should remain recoverable so a future model or policy can revisit it.
Scores are conditionalQuality depends on model size, tokenizer, domain mixture, duplication, sequence packing and the training objective. A score without that context is easy to over-interpret.
Storage is also a constraintAuditability matters, but storing every transient feature or transformed copy can become its own failure mode. Keep enough to reproduce the decision, not enough to duplicate the corpus several times.

Data logic is mostly mathematics

The most useful first filters are often the least glamorous ones: counts, ratios, entropy, repetition statistics, length distributions, token frequencies, near-duplicate similarity and distribution shifts. Mathematics is the best friend of anyone working on language-model data because human-readable text and model-useful text are not the same thing.

A paragraph can look perfectly reasonable to us while being highly repetitive under the tokenizer, nearly duplicated elsewhere, badly segmented, statistically out of distribution, or disproportionately expensive for the information it adds.

Koliber 1.1 · data, tokenizer and saturation

Data, data and data again.

A model is, to a large extent, what you feed it. For Koliber 1.1 the data problem is therefore being split into several connected questions: how much repetition a small model can tolerate, what mixture of domains is useful, when filtering removes diversity, how vocabulary size changes the effective corpus, and where the boundary lies between data the model should see and data that only consumes limited parameter capacity.

TokenizerVocabulary size, token entropy, compression ratio and domain mismatch change both the sequence distribution and the amount of information that fits into a fixed context window.
Data saturationMore tokens are not automatically more useful tokens. Repetition and near-repetition can spend compute on memorization while adding little new information.
Quality vs diversityFiltering only for the cleanest-looking text can erase useful domains and rare structures. The target is a useful distribution, not a beauty contest for documents.
Model scaleThe same corpus policy does not have to be optimal for a 100M-class model and a multi-billion-parameter model. Horyzont is explicitly testing where those boundaries move.

Research reference points

These papers are reference points, not a specification for Horyzont. They frame the questions being tested locally; the pipeline is not presented as a reproduction of any one of them.

RepetitionInternal Data Repetition Destroys Language Models ↗ — Chudnovsky et al., 2026. A direct reference for how repeated training data can waste compute and damage generalization.
Tokenizer entropyAn Information-Theoretic Perspective on LLM Tokenizers ↗ — Erdogan et al., 2026. Token entropy, compression, vocabulary size and domain mismatch.
Zipf / vocabularyPre-trained Models Perform the Best When Token Distributions Follow Zipf's Law ↗ — He et al., EMNLP 2025. A frequency-distribution view of vocabulary-size selection.
Vocabulary scalingOver-Tokenized Transformer: Vocabulary is Generally Worth Scaling ↗ — Huang et al., ICML 2025. A useful counterweight to the assumption that smaller vocabularies are always more efficient.
Tokenizer practiceGetting the most out of your tokenizer for pre-training and domain adaptation ↗ — Dagan et al., ICML 2024. Practical ablations on vocabulary size, pre-tokenization and tokenizer training data.
Beyond fixed tokensByte Latent Transformer: Patches Scale Better Than Tokens ↗ — Pagnoni et al., ACL 2025. A strong reference point for questioning whether a fixed tokenizer is necessary at all.
Mixture selectionRegMix: Data Mixture as Regression for Language Model Pre-training ↗ — Liu et al., ICLR 2025. A data-driven alternative to choosing domain proportions by intuition.
Quality + diversityQuaDMix: Quality-Diversity Balanced Data Selection for Efficient LLM Pretraining ↗ — Liu et al., 2025. A reference for why “keep only the highest-quality samples” is too simple.
Web curationThe FineWeb Datasets: Decanting the Web for the Finest Text Data at Scale ↗ — Penedo et al., NeurIPS 2024. A practical reference for web filtering, deduplication and large-scale corpus ablations.
Corpus pipelineDolma: an Open Corpus of Three Trillion Tokens for Language Model Pretraining Research ↗ — Soldaini et al., ACL 2024. A full open pretraining-corpus pipeline and documentation reference.
Near-duplicate memoryThe Mosaic Memory of Large Language Models ↗ — Shilov, Meeus & de Montjoye, Nature Communications 2026. A reference for why exact deduplication alone does not capture all repetition-like memorization effects.

What is being built

DatasetA privately assembled and curated corpus built from publicly available sources. “Private/public” refers to how the dataset is maintained, not to obscure provenance: source, license and usage conditions should remain as clear as practical.
WebBotAn independent crawler used to test robots.txt handling, source policies and discovery of publicly available material.
ScoringScoring is becoming a multi-stage measurement problem rather than a synonym for CLEAN. Knowledge value, quality, diversity, duplication and model-specific usefulness are treated as separate questions.

The goal is not to “collect the internet”. It is to preserve enough raw material to keep future options open, then learn which parts are actually worth spending model capacity and compute on.

Community context

Horyzont is developed alongside work already happening in the Polish data community. SpeakLeash and SlayerLab / Polish DynaWord are useful reference points and signals that more open, documented Polish data work is worth doing.

SpeakLeashDatasets ↗

Extended Wikipedia

Polish Wikipedia is valuable but limited in size and domain coverage. One direction is to preserve more of the structured information that conventional text extraction tends to discard, and to cautiously extend coverage with larger documented sources.

Not only proseWikipedia contains tables, infoboxes, lists and relations between facts. A “clean text” export can remove information that may be just as useful to a model as the surrounding paragraphs.
Example · AWKIn one existing export, the article lost the built-in-variable table (FILENAME, FS, RS, NF, NR, OFS, ORS, OFMT, SUBSEP), the operator-precedence table and an infobox containing basic facts about the language.

This is simply an example of the difference between extraction optimized for clean prose and extraction optimized for preserving knowledge.