Datasets:
id stringlengths 51 121 | text stringlengths 95 248k | task stringclasses 7
values | phase stringclasses 1
value | generator stringclasses 5
values | group_id stringlengths 16 16 | prompt_chars int64 0 0 | n_tokens int64 39 120k | text_sha256 stringlengths 64 64 | meta stringlengths 86 145 |
|---|---|---|---|---|---|---|---|---|---|
c/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.c | // file: c/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.c
#include "sample.h"
#include <limits.h>
/* GCC's integer extension is scratch storage, never a public ABI type. */
__extension__ typedef unsigned __int128 Wide;
_Static_assert(SIZE_MAX <= UINT64_MAX, "coefficient extent needs at most 64 b... | source | stable | codex | 358c01e678baf788 | 0 | 758 | 40e3db25a61a8e968f4c2c903660d966bcf02efa9392353e57b75f8eccd41934 | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
c/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.h | // file: c/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.h
#ifndef SYNTH_COUNTS_H
#define SYNTH_COUNTS_H
#include <stddef.h>
#include <stdint.h>
typedef enum {
COUNT_OK,
COUNT_INVALID_ARGUMENT,
COUNT_ZERO_POLYNOMIAL,
COUNT_NONPOSITIVE_LEADING,
COUNT_OVERFLOW
} CountStatus;
/* ... | source | stable | codex | 358c01e678baf788 | 0 | 295 | ee9a4f8c9932506f751307f21727789a281c35fb4ba0efa23d63cc80ca8cf341 | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
c/01-foundations.mathematics.asymptotic-analysis/focused-sample/tests/test_sample.c | // file: c/01-foundations.mathematics.asymptotic-analysis/focused-sample/tests/test_sample.c
#include "../sample.h"
#include <assert.h>
#include <limits.h>
#include <stdio.h>
__extension__ typedef unsigned __int128 Wide;
static void literal_three_loops(void) {
for (uint64_t n = 0; n <= 96; ++n) {
uint64_t l... | test | stable | codex | 358c01e678baf788 | 0 | 1,978 | e3cc045504d032cce3ed704b4c3e19d3678b8f48c891529f509c5e27c883e3f7 | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
c/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/walkthrough.md | <!-- file: c/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/walkthrough.md -->
# From visits to a universal polynomial bound
A visit count answers a finite combinatorial question. An eventual certificate answers a quantified question about every sufficiently large input. We will derive both withou... | walkthrough | stable | codex | 358c01e678baf788 | 0 | 2,774 | 3841d17954ab29d5cf2cea30780dff300b9e284557de40a47f9c74c5162a2f04 | {"artifact_kind": "textbook-walkthrough", "lang": "c", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
python/01-foundations.mathematics.asymptotic-analysis/focused-sample/README.md | <!-- file: python/01-foundations.mathematics.asymptotic-analysis/focused-sample/README.md -->
# Exact counts before growth classes
Run from this directory with Python 3.11 or newer:
```sh
python3 sample.py
python3 -m unittest discover -s tests -v
```
`linear_visits` and `doubling_visits` introduce exact counts; `tri... | readme | stable | codex | 66ea0d63c908ab10 | 0 | 325 | 8aef06b3ba78f29340c4f1fe9a2ac602913a7691037263c812be806010043000 | {"artifact_kind": "focused-sample", "lang": "python", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
python/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.py | # file: python/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.py
"""Exact operation counts and derived eventual polynomial growth bounds."""
from __future__ import annotations
from dataclasses import dataclass
from fractions import Fraction
def nonnegative_integer(value: int) -> int:
if ty... | source | stable | codex | 66ea0d63c908ab10 | 0 | 723 | e06fdf61ac95268aa334985060c9fa352690b4d0e250e836da6bf64877dce9a8 | {"artifact_kind": "focused-sample", "lang": "python", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
python/01-foundations.mathematics.asymptotic-analysis/focused-sample/tests/test_sample.py | # file: python/01-foundations.mathematics.asymptotic-analysis/focused-sample/tests/test_sample.py
"""Independently derived loop oracles and certificate boundary checks."""
from __future__ import annotations
import unittest
from fractions import Fraction
from sample import (
certify_growth,
doubling_visits,
... | test | stable | codex | 66ea0d63c908ab10 | 0 | 889 | 23152834dfe504406aedcb7b21d9fcaa6324398d62a3931275db0a3bdc694aa5 | {"artifact_kind": "focused-sample", "lang": "python", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
python/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/README.md | <!-- file: python/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/README.md -->
# Asymptotic-analysis walkthrough
Read [the staged explanation](walkthrough.md). The adjacent program and tests are exact versioned copies of our accepted Python component; every Python snippet is checked against that s... | readme | stable | codex | 66ea0d63c908ab10 | 0 | 90 | 479416db8c39a5350affc386e9a00c7a70bb78afd0f2caa564f9a464b826599d | {"artifact_kind": "textbook-walkthrough", "lang": "python", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
python/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/walkthrough.md | <!-- file: python/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/walkthrough.md -->
# From loop visits to an eventual bound
This walkthrough builds an executable argument in three stages: exact visits, a paired sum, and a polynomial growth certificate. Its snippets are exact excerpts from the adja... | walkthrough | stable | codex | 66ea0d63c908ab10 | 0 | 1,657 | 81228d2a6352ab97bbd3d4b57ff6afe8f9f5f9cfa8d3e474f9b338dd127ad499 | {"artifact_kind": "textbook-walkthrough", "lang": "python", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/Cargo.toml | # file: rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/Cargo.toml
[package]
name = "asymptotic-counts"
version = "0.1.0"
edition = "2024"
publish = false
[dependencies]
| manifest | stable | codex | 6c0b8c5b0519ef2b | 0 | 78 | b55daccb5668a39fbfc224e4dfb176e7ed34330f2b8fd62b4be578a677db8116 | {"artifact_kind": "focused-sample", "lang": "rust", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/rust-toolchain.toml | # file: rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/rust-toolchain.toml
[toolchain]
channel = "nightly-2026-07-12"
profile = "minimal"
components = ["rustfmt", "clippy"]
| manifest | stable | codex | 6c0b8c5b0519ef2b | 0 | 79 | 23bc9044ffeccad39f4a9c7286daa96ece0fc8b89cdc7c5921d99a8b645a9d1a | {"artifact_kind": "focused-sample", "lang": "rust", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/src/lib.rs | // file: rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/src/lib.rs
//! Exact bounded operation counts and positive-leading polynomial certificates.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum CountError {
ZeroPolynomial,
NonpositiveLeading,
ArithmeticOverflow,
}
#[derive(Debu... | source | stable | codex | 6c0b8c5b0519ef2b | 0 | 2,152 | 7a60a9a953e5e46793319264e1ab3ab73be00c868855d1957e0d439b5830717e | {"artifact_kind": "focused-sample", "lang": "rust", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/src/main.rs | // file: rust/01-foundations.mathematics.asymptotic-analysis/focused-sample/src/main.rs
use asymptotic_counts::{certify_growth, doubling_visits, linear_visits, triangular_visits};
fn main() {
let certificate = certify_growth(&[-9, 3, 2]).expect("fixed coefficients fit");
println!("certificate: {certificate:?}"... | source | stable | codex | 6c0b8c5b0519ef2b | 0 | 153 | 6ed96c5ca04c695a6eeca2a89b8fe1b533157904886f0cd4c7d7d76f3e7d1768 | {"artifact_kind": "focused-sample", "lang": "rust", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/README.md | <!-- file: typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/README.md -->
# Exact operation counts with TypeScript bigint
The beginner counts validate nonnegative bigint lengths; doubling counts binary digits in n−1. The intermediate triangular count uses exact bigint multiplication and integer... | readme | stable | codex | 60931b9fe0d64f7c | 0 | 498 | 4c98dd59f1bafc5a94962c045cac8bc9e479bec3a6c2a2c93bc826cad82ea885 | {"artifact_kind": "focused-sample", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/package.json | file: typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/package.json
{
"name": "original-asymptotic-counts",
"private": true,
"version": "0.1.0",
"type": "module"
}
| manifest | stable | codex | 60931b9fe0d64f7c | 0 | 75 | 90a69c09ceb185d5332fa8fe2c5d4a498d4737c002b46ebeb7dc5ae2c04e78ca | {"artifact_kind": "focused-sample", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.ts | // file: typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/sample.ts
/** Exact counts and eventual bounds using explicit bigint inputs. */
function nonnegativeInteger(n: bigint): bigint {
if (typeof n !== "bigint") throw new TypeError("a bigint length is required");
if (n < 0n) throw new Rang... | source | stable | codex | 60931b9fe0d64f7c | 0 | 759 | 6b98cc6289bb3871769057b8ca5e2d1ad9732b4af2b8afe500add7a5781cd183 | {"artifact_kind": "focused-sample", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/tsconfig.json | file: typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/tsconfig.json
{
"compilerOptions": {
"target": "ES2022",
"module": "NodeNext",
"moduleResolution": "NodeNext",
"strict": true,
"noUncheckedIndexedAccess": true,
"exactOptionalPropertyTypes": true,
"noEmit": tru... | manifest | stable | codex | 60931b9fe0d64f7c | 0 | 171 | 3483e50228c647a3005fa2d2c74957754f50a6245c6651821b358f920fea41e7 | {"artifact_kind": "focused-sample", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/tests/test_sample.ts | // file: typescript/01-foundations.mathematics.asymptotic-analysis/focused-sample/tests/test_sample.ts
import assert from "node:assert/strict";
import { test } from "node:test";
import {
certifyGrowth,
doublingVisits,
linearVisits,
polynomialValue,
triangularVisits,
} from "../sample.js";
test("literal loops... | test | stable | codex | 60931b9fe0d64f7c | 0 | 1,025 | 46d9db6e75df791d7928be65c579f227b5577d3170a92dbbc7ae8cb2cf5db82d | {"artifact_kind": "focused-sample", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/README.md | <!-- file: typescript/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/README.md -->
# TypeScript asymptotic-analysis walkthrough
Read [the original staged explanation](walkthrough.md). The implementation and tests are versioned copies of our accepted TypeScript sample. Eight excerpts match checked ... | readme | stable | codex | 60931b9fe0d64f7c | 0 | 95 | 54870b2a102ba31c87477573d45bc474d03c0cd02c15c2cd3687e22591a19d65 | {"artifact_kind": "textbook-walkthrough", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
typescript/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/walkthrough.md | <!-- file: typescript/01-foundations.mathematics.asymptotic-analysis/textbook-walkthrough/walkthrough.md -->
# Exact discrete counts at a JavaScript boundary
We build exact loop counts and an eventual polynomial bound using TypeScript with bigint arithmetic. The executable code is a versioned copy of our accepted focu... | walkthrough | stable | codex | 60931b9fe0d64f7c | 0 | 2,066 | 9345f78a1aad9d9df1ca427794723a9dadc35f314458219a3bb1dc2bf6c3dadf | {"artifact_kind": "textbook-walkthrough", "lang": "typescript", "topic": "01-foundations.mathematics.asymptotic-analysis"} |
c/01-foundations.mathematics.binomial-coefficients/focused-sample/README.md | <!-- file: c/01-foundations.mathematics.binomial-coefficients/focused-sample/README.md -->
# Binomial coefficients in checked C17 arithmetic
This sample implements the [original contract](../../../../../docs/specifications/binomial-coefficients.md) at three levels:
- Beginner: an exact truncated Pascal row, updated r... | readme | stable | codex | e08fb29206cb6b23 | 0 | 652 | f565790caa591bccdc2b147619e44769a532dddeaabe48c99aa5aff5cee68afd | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.binomial-coefficients"} |
c/01-foundations.mathematics.binomial-coefficients/focused-sample/sample.c | // file: c/01-foundations.mathematics.binomial-coefficients/focused-sample/sample.c
#include "sample.h"
#include <stdlib.h>
static uint32_t shorter_column(uint32_t n, uint32_t k) { return k < n - k ? k : n - k; }
static uint64_t add_residues(uint64_t a, uint64_t b, uint64_t modulus) {
return a >= modulus - b ? a ... | source | stable | codex | e08fb29206cb6b23 | 0 | 1,225 | cfbb00c65772bf22e90286565c85241f276e7a45f483b6a9f5ac465ec5136156 | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.binomial-coefficients"} |
c/01-foundations.mathematics.binomial-coefficients/focused-sample/sample.h | // file: c/01-foundations.mathematics.binomial-coefficients/focused-sample/sample.h
#ifndef SYNTH_BINOMIAL_H
#define SYNTH_BINOMIAL_H
#include <stddef.h>
#include <stdint.h>
typedef enum {
CHOOSE_OK,
CHOOSE_INVALID_ARGUMENT,
CHOOSE_RESOURCE_LIMIT,
CHOOSE_ALLOCATION_FAILURE,
CHOOSE_OVERFLOW,
CHO... | source | stable | codex | e08fb29206cb6b23 | 0 | 406 | 0f4305cd0ce3f630e20863c7431359a190f466e7c344a5300b44d87652a4a620 | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.binomial-coefficients"} |
c/01-foundations.mathematics.binomial-coefficients/focused-sample/tests/test_sample.c | // file: c/01-foundations.mathematics.binomial-coefficients/focused-sample/tests/test_sample.c
#include "../sample.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
static uint64_t subset_count(unsigned n, unsigned k) {
uint64_t total = 0;
for (unsigned mask = 0; mask < (1u << n); ++mask) {
... | test | stable | codex | e08fb29206cb6b23 | 0 | 47,967 | 561d3e22a926c78b34d9c18f48187bc8c052bdabbd0f58eacafceab901d49b37 | {"artifact_kind": "focused-sample", "lang": "c", "topic": "01-foundations.mathematics.binomial-coefficients"} |
c/01-foundations.mathematics.binomial-coefficients/textbook-walkthrough/walkthrough.md | <!-- file: c/01-foundations.mathematics.binomial-coefficients/textbook-walkthrough/walkthrough.md -->
# Choose a subset, then choose the arithmetic
A binomial coefficient counts k-element subsets of n positions. This walkthrough develops an exact Pascal recurrence, a modular recurrence, and a product with cancelled de... | walkthrough | stable | codex | e08fb29206cb6b23 | 0 | 2,697 | 198ed755ce7e6cbad8d133a2b4cd9223d1fdda773a93b7797df6e68332c5ef28 | {"artifact_kind": "textbook-walkthrough", "lang": "c", "topic": "01-foundations.mathematics.binomial-coefficients"} |
python/01-foundations.mathematics.binomial-coefficients/focused-sample/README.md | <!-- file: python/01-foundations.mathematics.binomial-coefficients/focused-sample/README.md -->
# Exact Python binomial coefficients
Run `python3 sample.py` and `python3 -m unittest discover -s tests -v` from this directory. The queue additionally enforces Ruff lint/format and ty using the repository lockfile.
The [s... | readme | stable | codex | d0eff3ab5079c9e1 | 0 | 372 | 5270a8d22e9fded756baabbf074c12033894299fba1d3df7e6f77ab17cbea8a0 | {"artifact_kind": "focused-sample", "lang": "python", "topic": "01-foundations.mathematics.binomial-coefficients"} |
ALEA synthetic code files
Raw files from synthetic code artifacts in C, Rust, TypeScript and Python: focused samples and textbook-style walkthroughs on topics from mathematics and data structures to file formats and application foundations. One document per file, with a path header in the file's own comment syntax; files include source, tests, text fixtures and data, READMEs, walkthroughs and package manifests.
10,930 documents, 28,621,267 tokens (alea-v2b-sw32k, the ALEA R4 tokenizer, counting each document's start and end tokens).
Part of the ALEA R4 training mix
This dataset contains all trained rows of this family except 2 files omitted for internal-path hygiene: R4 trained on 10,932 documents (28,629,787 tokens) in its stable pretraining mixture (second data stage, one pass each), and 10,930 are released here. Every released row is byte-identical to the trained text; text_sha256 is the SHA-256 of text.
Held-out evaluation items generated by the same code are not part of this release.
Composition
| task | documents | tokens |
|---|---|---|
source |
2,994 | 9,434,434 |
readme |
2,264 | 2,187,885 |
test |
2,124 | 9,879,574 |
manifest |
1,261 | 118,269 |
walkthrough |
1,011 | 3,934,079 |
data |
868 | 2,401,194 |
prose |
408 | 665,832 |
| generator | documents | tokens |
|---|---|---|
codex |
8,000 | 19,760,910 |
unknown |
1,363 | 4,192,708 |
claude-sonnet |
1,183 | 3,507,277 |
codex-gpt-6.1-sol |
376 | 1,146,568 |
claude-sonnet+codex-draft |
8 | 13,804 |
How it was made
The artifacts were written by coding agents in an ALEA code-synthesis campaign. The generator column gives the generator recorded in each artifact's provenance file: codex (OpenAI Codex), codex-gpt-6.1-sol (OpenAI Codex with GPT-6.1-sol), claude-sonnet (Anthropic Claude Sonnet), claude-sonnet+codex-draft (a Claude Sonnet artifact from a Codex draft), and unknown where the provenance file does not record one.
Sources
- Synthetic code artifacts (no third-party repositories)
Verification
- File-level drops (detection only): infrastructure strings and absolute host paths, secrets, binaries, captured logs and stdout, provenance and review records, exact duplicates, walkthrough code near-duplicating the same topic's sample, and Markdown dominated by process text.
- A blind review judged sampled files against the bar for a curated natural-code corpus and hand-checked worked examples.
- Decontamination: training rows that shared a word 13-gram with a held-out evaluation item of this or any sibling family were removed, and rows overlapping ALEA's evaluation sets were removed or logged according to ALEA's decontamination policy.
- Every file in this release was scanned for API keys, access tokens and private keys; none were found.
Columns
| column | content |
|---|---|
id |
row id from the generator (not always unique: a few families reuse an id across variants, and a handful of exact duplicate documents were trained twice and appear twice) |
text |
the document exactly as trained; chat documents use ALEA's chat template, whose control tokens appear as text (`< |
task |
task kind |
phase |
stable (trained in R4's stable pretraining mixture) |
generator |
what wrote the row (deterministic = code only) |
group_id |
source passage / record group; all variants of one group share it |
prompt_chars |
length in characters of the request part of text (0 for plain documents; null where not recorded) |
n_tokens |
tokens under alea-v2b-sw32k, including the document start and end tokens |
text_sha256 |
SHA-256 of text |
meta |
JSON: the generator's structured fields (source, presentation, answer form, gold values, checks) |
Known limitations
- Files keep natural-repository quirks: some docstrings and READMEs mention tiers, contracts, fixtures or review steps, and some identifiers are seed words.
- Tests may reference fixtures that are not included.
- Code was written by models; review it before reuse.
License
CC-BY-4.0 for this compilation and the generated text. Public-domain and public-record source text keeps its status; Wikidata is CC0; OpenGloss and SHELF are CC-BY-4.0.
Published by the ALEA Institute.
- Downloads last month
- 17