KADLOG R&D · AI Genetics

From configurable determinants to testable behavioural phenotypes.

AI Genetics is a research and experimental program testing whether persistent, configurable determinants of LLM-based AI systems can be organized in a genetics-like cybernetic representation that adds measurable explanatory or predictive value.

Research architecture

Two connected tracks — not one asserted equivalence.

The project deliberately separates the empirical study of configurable LLM systems from the mathematical theory of viability-preserving regulation. Their connection is a research object in its own right.

AI Genetics v0.1

Empirical configuration → behaviour research

Study persistent instructions, memory, retrieval, tools, agent policies and other controllable determinants under standardized environments, repeated executions and measurable behavioural metrics.

  • controlled variants
  • reproducible protocols
  • statistical phenotype characterization
  • prediction as a validation criterion
CGF v1.0

Mathematical persistence and viability framework

Model an artificial cognitive system through a state space, a viability domain, a cybernetic genome of regulatory operators and the regulatory field generated by their activation.

  • viability preservation
  • persistence attractors
  • regulator ablation
  • criticality and viability cores
Open bridge: whether configuration-level determinants in real LLM-based systems can be mapped usefully to CGF entities remains to be demonstrated experimentally.

Formal mathematical foundation

Cybernetic Genome Framework

CGF v1.0 defines persistence as a dynamical property of trajectories maintained inside a viability domain by regulatory fields.

C = (X, V, Γ, ΦΓ)
Xstate space
Vviability domain
Γset of regulatory operators
ΦΓglobal genomic regulatory field
ẋ = f(x) + ΦΓ(x)
In the current mathematical model, a “cybernetic gene” is an abstract regulatory operator gi : X → Rⁿ. Explicit gene mechanisms and mappings to real AI architectures belong to the next operationalization step.

Candidate operational mapping

Determinants + environment → measured phenotype.

Candidate persistent determinantssystem instructions · persistent prompts · memory · tools · retrieval · agent policies · model configuration
+
Environmenttask · user prompt · contextual documents · conversation state · language · external information
→
Expression / interactionactivation · determinant interaction · feedback · regulatory context
→
Behavioural phenotypetask performance · consistency · factuality · uncertainty · instruction adherence · tool selection · response structure

A single output is not a phenotype. In AI Genetics, phenotype refers to a stable or statistically characterized behavioural property observed across controlled repetitions.

CGF Explorer

Explore the model — without pretending to show results that do not yet exist.

The Explorer now separates two uses: a numerical viability demonstrator derived from the minimal CGF model, and a controlled-experiment designer for the LLM research track. The second builds a protocol; it does not fabricate behavioural outcomes.

CYBERNETIC GENOME Γclick to ablate / restore
ΦΓ(x) = Σ ai(x) gi(x)
Demonstrator parameters
SYSTEM STATE x(t)VIABLE
Viability margin—
Simulation time—
TRAJECTORIESẋ = −Dx + ΦΓ(x)
PROJECTED ABLATION SENSITIVITYfixed horizon H = 10

The displayed κH proxy is defined in this demonstrator as the loss of projected terminal viability margin over horizon H after removing one regulator. It is related to the paper’s criticality idea but is not presented as an empirical measurement or as the final CGF definition.

Generated controlled protocol

Variant A
Variant B
Locked environmentsame task · same context · same evaluation rubric · same tool set unless it is the tested determinant
Measurement
No simulated phenotype. This panel defines an experiment. Behavioural results must come from actual repeated model executions and statistical analysis.

Experimental research interface. Numerical values in the viability demonstrator are illustrative parameters of a tractable minimal model, not measurements from a production LLM. The current project does not claim biological equivalence with DNA, direct correspondence with neural-network weights, consciousness, sentience or a validated general theory of intelligence.

Falsifiable numerical program

Four initial CGF experiments.

These experiments belong to the minimal mathematical model. Their role is to test viability preservation and the emergence of regulatory criticality before broader claims are made.

01

Extinction dynamics

ẋ = −Dx

Baseline without genomic regulation: test whether trajectories decay toward the non-viable region.
02

Persistence attractor

ẋ = −Dx + ΦΓ(x)

Test whether regulatory fields can maintain trajectories inside the viability domain.
03

Regulator ablation

Γ(−i) = Γ \ {gi}

Remove one regulator at a time and quantify the effect on viability.
04

Criticality ranking

κi

Test whether a minimal viability-preserving core emerges rather than being imposed a priori.

Scientific status

What is formalized, what is next, what is not claimed.

This distinction is part of the research method: the website should evolve only when the project produces a new definition, protocol, result or falsification.

FORMALIZED · CGF v1.0

Mathematical foundation

Quadruplet C = (X,V,Γ,ΦΓ), dynamic law, viability domain, persistence attractors, criticality concept and an initial falsifiable numerical program.

NEXT · OPERATIONALIZATION

Explicit regulators and computational validation

Define the candidate Layer-I regulators NDX1, ENR, PRSV, ACC2 and PHY0 through target variables, activation functions, regulatory vector fields and measurable contributions to viability; then execute the numerical program.

OPEN · EMPIRICAL BRIDGE

Mapping to real LLM-based systems

Determine which persistent AI determinants, if any, deserve CGF gene/genotype status and whether that representation improves prediction beyond simpler configuration descriptions.

Research progression

1Foundations→2Experimental validation→3Formalization→4Generalization→5Engineering

Progression is evidence-driven, not calendar-driven.