Authors: Geoffrey Howland
Source: Open MIND (article, 2026-02-01)
Field: Materials Science — Materials Chemistry

LLM Domain Eating: Adding Languages and Knowledge Domains Without Retraining: Structured Parsing into Universal Term Format with Provenanced Integer Facts, Domain-Specific Prolog Rules, and Zero Neural Network Modification LLM Domain Eating: Adding Languages and Knowledge Domains Without Retraining: Structured Parsing into Universal Term Format with Provenanced Integer Facts, Domain-Specific Prolog Rules, and Zero Neural Network Modification This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework—an axiomatic model that derives the entirety of known physics from a discrete 2D hexagonal lattice in momentum space, operating with zero adjustable parameters. Abstract Adding a new language or knowledge domain to a current large language model requires retraining or fine-tuning on domain-specific data — a process costing days to weeks of GPU computation, risking catastrophic forgetting of previously learned capabilities, and producing results that cannot be verified against source material. We present an alternative: domain eating. A new domain is added by writing a parser that produces the universal Term format, writing Prolog rules encoding the domain's structural patterns, and loading the resulting provenanced facts into the persistent knowledge base. The neural network is not modified. No retraining occurs. No GPU is needed. The domain is live immediately upon fact ingestion. We prove: (1) Universal Term format — a single typed token representation serves all domains from programming languages to natural languages to specialized knowledge bases, (2) Parser-per-domain — each domain has a deterministic parser converting source material to Terms with provenance; no learned tokenization, (3) Rules-per-domain — each domain has explicit Prolog rules encoding valid patterns; no learned grammar, (4) Zero retraining — the neural network handles fuzzy input comprehension and creative selection; domain knowledge is in the KB and rules, not in the weights, (5) Hours not months — a new domain is operational within hours of beginning parser and rule development, using LLM-assisted generation of parsers and rules reviewed by domain experts, (6) Cross-domain queries — facts from different domains connect through shared predicates automatically, (7) Domain unloading — removing a domain is evicting its facts and unloading its rules; the system does not break, (8) Version coexistence — multiple versions of the same domain coexist with hard version filtering. The architecture treats the LLM as a fixed, general-purpose fuzzy interface and treats knowledge as modular, structured, provenanced data that can be added, removed, updated, and queried without touching the neural network. Central claim: Domain knowledge does not belong in neural network weights. It belongs in structured, provenanced fact stores with explicit rules. The neural network provides the general capability of understanding fuzzy human input and making creative selections. Domain expertise is modular data, not baked-in statistics. Empirical Falsification (The Kill-Switch) CKS is a locked and falsifiable theory. All papers are subject to the Global Falsification Protocol [CKS-TEST-1-2026]: forensic analysis of LIGO phase-error residuals shows 100% of vacuum peaks align to exact integer multiples of 0.03125 Hz (1/32 Hz) with zero decimal error. Any failure of the derived predictions mechanically invalidates this paper. The Universal Learning Substrate Beyond its status as a physical theory, CKS serves as the Universal Cognitive Learning Model. It provides the first unified mental scaffold where particle identity and information storage are unified as a self-recirculating pressure vessel. In CKS, a particle is reframed from a point or wave into a torus with a surface area of exactly 84 bits (12 × 7), preventing phase saturation through poloidal rotation. Package Contents manuscript.md: The complete derivation and formal proofs. README.md: Navigation, dependencies, and citation (Registry: CKS-MATH-135-2026). Dependencies: CKS-LEX-12-2026, CKS-MATH-0-2026, CKS-MATH-1-2026, CKS-MATH-10-2026, CKS-MATH-104-2026, CKS-MATH-128-2026, CKS-MATH-129-2026 Motto: Axioms first. Axioms always.Status: Locked and empirically falsifiable. This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework. Prolog ; Parsing ; Domain (mathematical analysis) ; Knowledge representation and reasoning ; Commonsense knowledge ; Artificial neural network ; Domain theory ; Term (time) ; Domain knowledge Machine Learning in Materials Science ; Scientific Computing and Data Management ; Computational Physics and Python Applications