residue-classes

A class-wide exact-two obstruction for modulus 9 in finite odd covering systems, established through a computer-assisted mathematical proof with exact certificates and reproducible verification.

An incremental residue‑class algorithm for generating prime numbers in C++. Provides a minimal‑state prime generator based on a novel residue‑class method operating without division, multiplication, or explicit modulo computations. Suitable for number‑theory applications, embedded environments, and streaming scenarios.

Preprint and reproducibility package for the NID / HELIX Goldbach workbench using finite rooms, active mirror doors, blocker walls, Lean, and Sage.