# EML-RKD-05 ReleasePack v0.1

Paper 05 of the Recursive Knowing-Difference Algebra series.

## Canonical source
- `EML_RKD_05_Recursive_Epistemic_Bound_Theory_v0.1.md`

## Central result
For any bounded sequence `(a_n) in [0,1]`, an exact-coherent graded tower can be constructed with functional meta-amplitude `nu_n = a_n`.

Therefore recursion depth alone does **not** imply:
- monotone decay
- monotone amplification
- convergence to zero
- convergence at all
- finite maximal horizon

## Bound layers
1. algebraic bounds
2. fixed-protocol observational bounds
3. architecture-dependent conditional bounds

## Package
- canonical Markdown
- `CLAIM_REGISTRY_v0.1.json`
- `SYMBOL_TABLE_v0.1.csv`
- `BOUND_TYPE_MATRIX_v0.1.csv`
- `PROFILE_EXAMPLES_v0.1.csv`
- `EXTERNAL_SEARCH_NOTES_2026-08-16.md`
- `DEPENDENCY_MANIFEST_v0.1.json`
- `validation.json`
- `CHECKSUMS.sha256`

UTF-8, LF, no BOM. Math uses `$...$` / `$$...$$`.