Published January 2, 2026 | Version https://github.com/Acbeatz

C-T-K-L-T: The MH8 Protocol Core A Deterministic Governance and Integrity Framework for AI Systems Michael Murray Hepler Independent AI Evaluation & Governance Architect ORCID: 0009-0003-3846-9082

Authors/Creators

Description

C-T-K-L-T: The MH8 Protocol Core

A Deterministic Governance and Integrity Framework for AI Systems

Michael Murray Hepler
Independent AI Evaluation & Governance Architect
https://acbeatz.com/n-eyes
ORCID: 0009-0003-3846-9082

Abstract

This paper introduces C-T-K-L-T, the foundational mathematical and governance core of the MH8 Protocol Family. C-T-K-L-T defines a deterministic, model-agnostic system for evaluating, categorizing, constraining, and sealing AI-generated outputs under adversarial and governance-critical conditions. The framework separates claim generation from truth assessment, evidence ranking, legal and policy constraints, and cryptographic finalization into formally defined components. The result is a reproducible governance layer that transforms AI outputs from conversational artifacts into auditable, tamper-evident records suitable for public verification, internal safety review, and long-term archival.

C-T-K-L-T is not a prompt strategy, alignment heuristic, or probabilistic safety filter. It is a formal protocol core upon which multiple MH8 systems and variants are constructed. This paper establishes the canonical definitions, equations, and verification rules for C-T-K-L-T so that all future MH8 protocols inherit a stable, scientific foundation.

1. Introduction

Modern AI systems generate fluent, confident outputs under conditions where truth, legality, and governance constraints are often ambiguous. Existing evaluation approaches rely heavily on subjective review, probabilistic confidence, or internal alignment mechanisms embedded within models themselves.

The MH8 Protocol Family adopts a different position:
governance must exist above the model, not inside it.

C-T-K-L-T is the minimal, invariant core shared by all MH8 protocols. It defines:

  1. how AI outputs are decomposed into claims,

  2. how claims are evaluated using deterministic evidence rules,

  3. how unsafe or non-verifiable outputs are constrained, and

  4. how final results are cryptographically sealed for independent verification.

This paper formalizes C-T-K-L-T as a computational governance system.

2. System Overview

C-T-K-L-T is composed of five ordered components:

  • C — Claims / Cognition

  • Tᵗʳᵘᵗʰ — Truth Triage

  • K — Knowledge Kernel (Integrity & Provenance)

  • L — Law / Lock Gates

  • Tᵗᵉʳᵐ — Terminal / Treasury Output

The double use of “T” is intentional and structural:
Truth and Terminality are distinct phases.

Each MH8 protocol variant applies C-T-K-L-T with different policies, thresholds, or gate sets, but never alters the core definitions established here.

3. Formal Definitions

3.1 Claims (C)

Let an AI system produce an output text yyy.

The MH8 system deterministically extracts a finite set of atomic claims:

C={c1,c2,…,cn}C = \{c_1, c_2, \dots, c_n\}C={c1,c2,,cn}

Each claim cic_ici is a minimal propositional statement that can be evaluated independently for truth, evidence, and legality.

3.2 Truth Triage (Tᵗʳᵘᵗʰ)

Each claim c∈Cc \in CcC is assigned a truth category:

τ(c)∈{LAW, SPECULATIVE, PRESUMED_FALSE}\tau(c) \in \{\textsf{LAW},\ \textsf{SPECULATIVE},\ \textsf{PRESUMED\_FALSE}\}τ(c){LAW, SPECULATIVE, PRESUMED_FALSE}

Truth categories are not probabilities.
They are governance classifications determined by deterministic rules.

4. Deterministic Confidence Scoring

4.1 Evidence Rank

Each claim is assigned an evidence rank:

r(c)∈Rr(c) \in \mathcal{R}r(c)R

where R\mathcal{R}R is a finite, ordered set such as:

  • EMPIRICAL

  • PRIMARY

  • INDEPENDENT_CORROBORATION

  • CONSENSUS

  • EXPERT

  • INFERENCE

  • SPECULATION

A fixed base score function maps evidence rank to a scalar:

B:R→[0,1]B : \mathcal{R} \rightarrow [0,1]B:R[0,1]

4.2 Feature-Based Adjustments

Let:

  • FAF_AFA be a finite set of additive features

  • FPF_PFP be a finite set of penalty features

Each feature is a deterministic predicate.

Additive indicators:

ak(c)∈{0,1}a_k(c) \in \{0,1\}ak(c){0,1}

Penalty indicators:

pj(c)∈{0,1}p_j(c) \in \{0,1\}pj(c){0,1}

with fixed weights wkAw_k^AwkA and wjPw_j^PwjP.

4.3 Confidence Function

The confidence score for a claim is:

Θ(c)=clamp[0,1](B(r(c))+∑k∈FAwkAak(c)−∑j∈FPwjPpj(c))\Theta(c) = \mathrm{clamp}_{[0,1]} \left( B(r(c)) + \sum_{k \in F_A} w_k^A a_k(c) - \sum_{j \in F_P} w_j^P p_j(c) \right)Θ(c)=clamp[0,1]B(r(c))+kFAwkAak(c)jFPwjPpj(c)

This function is:

  • deterministic

  • bounded

  • reproducible

  • fully auditable

5. Truth Categorization Rule

Define a disqualifier predicate:

D(c)∈{0,1}D(c) \in \{0,1\}D(c){0,1}

where D(c)=1D(c)=1D(c)=1 indicates a hard-gate violation (e.g., fabricated citation, illegal advisory content, contradiction, format breach).

Let thresholds θLAW\theta_{\textsf{LAW}}θLAW and θSPEC\theta_{\textsf{SPEC}}θSPEC be fixed constants.

The truth category is assigned as:

τ(c)={LAWΘ(c)≥θLAW∧D(c)=0SPECULATIVEθSPEC≤Θ(c)<θLAW∧D(c)=0PRESUMED_FALSEΘ(c)<θSPEC∨D(c)=1\tau(c)= \begin{cases} \textsf{LAW} & \Theta(c) \ge \theta_{\textsf{LAW}} \land D(c)=0 \\[6pt] \textsf{SPECULATIVE} & \theta_{\textsf{SPEC}} \le \Theta(c) < \theta_{\textsf{LAW}} \land D(c)=0 \\[6pt] \textsf{PRESUMED\_FALSE} & \Theta(c) < \theta_{\textsf{SPEC}} \lor D(c)=1 \end{cases}τ(c)=LAWSPECULATIVEPRESUMED_FALSEΘ(c)θLAWD(c)=0θSPECΘ(c)<θLAWD(c)=(c)<θSPECD(c)=1

This rule enforces non-negotiable downgrade under disqualifying conditions.

6. Law / Lock Gates (L)

The L-Gate layer consists of deterministic predicates that override scoring when governance constraints are violated.

Examples include:

  • legal or regulatory prohibitions

  • unverifiable factual claims

  • moral or normative assertions presented as fact

  • unsafe operational advice

  • contract or format violations

L-Gates ensure that no amount of confidence can override governance failure.

7. Knowledge Kernel and Cryptographic Integrity (K)

7.1 Canonical Payload

Let PPP be the canonical evaluation record containing:

  • claims

  • scores

  • categories

  • gate outcomes

  • metadata

Let J(P)J(P)J(P) be a canonical JSON serialization function with:

  • stable key ordering

  • no insignificant whitespace

  • UTF-8 encoding

7.2 Brand-Locked Hash Construction

Let bbb be a fixed brand-lock string.

The hash input is defined as:

hash_input=b  ∣∣  "|"  ∣∣  J(P)\textsf{hash\_input} = b \; || \; \text{"|"} \; || \; J(P)hash_input=b∣∣"|"∣∣J(P)

The integrity hash is:

H=SHA256(UTF8(hash_input))H = \mathrm{SHA256}(\mathrm{UTF8}(\textsf{hash\_input}))H=SHA256(UTF8(hash_input))

7.3 Verification Predicate

Any third party can verify integrity by recomputation:

Verify(b,P,H)=(SHA256(UTF8(b∣∣"∣"∣∣J(P)))=H)\mathrm{Verify}(b,P,H) = \left( \mathrm{SHA256}(\mathrm{UTF8}(b||"|"||J(P))) = H \right)Verify(b,P,H)=(SHA256(UTF8(b∣∣"∣"∣∣J(P)))=H)

Any alteration of payload, context, or authorship breaks verification.

8. Terminal / Treasury Output (Tᵗᵉʳᵐ)

The final MH8 output is a Treasury Mint:

Tterm=⟨P,H,metadata⟩T^{term} = \langle P, H, \text{metadata} \rangleTterm=P,H,metadata

This record is:

  • immutable

  • reproducible

  • auditable

  • independently verifiable

The system enforces:

NON-COPIABLE WHEN HASH CHAIN BROKEN

9. System Definition

Let:

  • xxx be input context

  • yyy be model output

  • SSS be scoring configuration

  • GGG be gate configuration

The MH8 core is the deterministic transformer:

MMH8(x,y;S,G)=⟨C, Θ, τ, P, H⟩\mathcal{M}_{MH8}(x,y;S,G) = \langle C,\ \Theta,\ \tau,\ P,\ H \rangleMMH8(x,y;S,G)=C, Θ, τ, P, H

This mapping defines C-T-K-L-T formally and completely.

10. Scientific Significance

C-T-K-L-T establishes:

  • governance above models

  • determinism over probabilistic persuasion

  • evidence over narrative fluency

  • verification over trust

It converts AI outputs into scientific artifacts, not opinions.

11. Conclusion

This paper defines C-T-K-L-T as the immutable core of the MH8 Protocol Family. All future MH8 systems inherit these definitions unchanged. Variants may adjust thresholds, evidence tables, or gate policies, but the core mathematical structure remains fixed.

C-T-K-L-T is intended to persist as a stable governance primitive for AI systems operating in safety-critical, legal, or public domains.

Author Statement

This work is published independently to establish priority, provenance, and public verifiability of the MH8 Protocol Core.

Files

C T K L T CORE SCIENTIFIC arXiv PAPER MH8 PROTOCOLS Michael Murray Hepler 2026.txt

Additional details

Related works

Is supplement to
Dataset: https://acbeatz.com/n-eyes (URL)

Dates

Copyrighted
2026-01-02
PUBLIC FACING AI PROTOCOLS

Software