Skip to content
Sprint projectJul 27, 2026Shanghai

Runtime-Instantiated Secret Loyalty: Covert Serving-State Substitution at an Unowned Trust Boundary

Lianyu Lu · Team SL-KV

Submitted to Secret Loyalties Hackathon. Sprint projects are early-stage work by participants, not Apart Research publications.

Read the report

Report: Runtime-Instantiated Secret Loyalty: Covert Serving-State Substitution at an Unowned Trust Boundary

Share

A secret loyalty does not have to be trained in. We instantiate one in the serving-layer KV cache: served weights stay bit-identical to the released checkpoint, no training dataset exists, and the prompt log holds only a benign system prompt — so dataset monitoring, the defence Lamerton & Roger found effective against trained organisms, inspects an empty room.

Reusing their metrics, affordance levels and audit prompts, we find the effect is principal-conditioned, established by a principal-swap organism rather than a within-arm slot comparison, shifting principal probability 0.017 → 0.237. One finding transfers beyond our setting: decisiveness tracks the principal's prior standing with the model, not injection strength — the same injection is merely relative for a principal the model rates poorly and decisive for one it already favours.

We separate two axes a trained-loyalty setup conflates: a cache buys artifact-invisibility, not interrogation resistance. Our defence recomputes the cache from the logged prompt inside a trusted verifier; the cheap length check is trivially evaded and recompute is the load-bearing one. Two token-free attack families failed under four controls and are reported as failures.

Reviews

Judging this Sprint?

Review this project

Your public critique appears on this page without your name. Your private critique is not published; only the Apart team reads it. If you agree below, we share your review with grantmaking.ai (opens in new tab) and the Transformative AI Fund so strong projects can be funded.

Not shown on this page.

Shown on this page, without your name.

Only the Apart team reads this, and funders if you agree below.

Share my name publicly on grantmaking.ai *
Share my private critique with funders *

How much would this matter for AI safety if it worked? How innovative is it? For scores of 4-5: is this actually new to the field, or replicating recent work?

Scoring guide
  1. 1Negligible. No clear problem addressed, or no meaningful novelty.
  2. 2Limited. Addresses a real problem but with a generic or well-trodden approach. Incremental at best.
  3. 3Moderate. Clear problem with a reasonable approach; some novelty in framing or method beyond routine application of existing tools.
  4. 4Significant. Important problem with an original approach, or identifies a neglected problem area. A valuable contribution others could build on.
  5. 5Exceptional. Tackles a critical AI safety problem with a genuinely novel approach, or opens a new research direction. Clear theory of change. You'd be excited to share this with researchers in the area.

How sound are methodology, implementation, and findings?

Scoring guide
  1. 1Seriously flawed. Methodology broken, results uninterpretable, or implementation doesn't work.
  2. 2Weak. Approach has significant gaps: missing validation, flawed experimental design, or incomplete implementation.
  3. 3Competent. Technically solid given the short duration. Methodology makes sense, results are interpretable, limitations acknowledged, work builds toward clear conclusions.
  4. 4Strong. Thorough methodology with convincing validation. Results clearly support conclusions. Immediately useful for future work.
  5. 5Exceptional. Ambitious scope executed rigorously. Surprising findings, novel methods, or unusually robust validation.

How clearly are work, findings, and impact potential communicated?

Scoring guide
  1. 1Incomprehensible. Cannot determine what the project is actually claiming or doing.
  2. 2Hard to follow. Key information buried, missing, or diluted by excessive length. Significant effort to extract main points.
  3. 3Clear enough. Can understand the problem, approach, and results without undue effort. Core content clearly present: problem, method, findings, limitations.
  4. 4Well presented. Easy to follow, well-structured, appropriate level of detail. Target audience would get it quickly.
  5. 5Exceptionally clear. A pleasure to read. Complex ideas made accessible. Could serve as a model for how to present this type of work.

  1. This is excellent work. One observation I had: your channel table treats the KV cache as not inspected. But the attack still needs code that decouples the served cache from the logged prompt, and that decoupling is the same invariant your own detector checks. So a reviewed serving path gives a partial and cheaper defense than your table would allow. Say this, and promote the compromised CI credential from one example to your central case. Additionally you can raise the audit sample above three per cell.

  2. This paper makes a valuable systems-security contribution by distinguishing verified weights and logged prompts from the serving state actually consumed during inference. The principal-swap control, reporting of absolute decisiveness, length-matched detector test, negative low-norm experiments, and candid provenance audit are particularly strong. The central claim should remain narrowly framed as covert prompt substitution through KV state rather than a newly learned form of loyalty. The most important next step is a native serving-stack demonstration: implement the attack and verifier in vLLM or another production runtime, specify the exact compromise path that bypasses ordinary deployment review, and measure recomputation under batching, tensor parallelism, quantization, prefix reuse, and realistic nondeterminism. Detector validation should include a substantially larger clean sample, joint noise conditions, ROC analysis across multiple norms, and an explicit time-of-check/time-of-use test. Behavioral evaluation would also benefit from randomized option positions, free-generation decisions, additional models, and multiple principal swaps. The paper could be made substantially more effective by separating the primary attack-and-defense result from the exploratory audit and activation-steering studies.

    Read full reviewShow less
  3. Optimize Verification: Implement a cryptographic hash-matching layer for the KV cache to avoid a full compute-heavy rebuild on every request.

    Dynamic Vulnerability Mapping: Probe how shifting benign system prompts alters the model's "prior standing" toward specific principals.

    Harden the Data Pipeline: Secure the logging pipeline inside a trusted execution environment (TEE) to guarantee the verifier reads the exact prompt the model processed.

Cite this project

@misc{lu2026runtimeinstantiated,
  title = {{Runtime-Instantiated Secret Loyalty: Covert Serving-State Substitution at an Unowned Trust Boundary}},
  author = {Lianyu Lu},
  year = {2026},
  month = jul,
  note = {Submitted to Secret Loyalties Hackathon, an Apart Research Sprint},
  howpublished = {\url{https://apartresearch.com/sprints/projects/runtimeinstantiated-secret-loyalty-covert-servingstate-substitution-at-an-unowned-trust-boundary-hxlr}},
  url = {https://apartresearch.com/sprints/projects/runtimeinstantiated-secret-loyalty-covert-servingstate-substitution-at-an-unowned-trust-boundary-hxlr}
}

Build something like this at the next Sprint

AI Collusion Research Sprint · Oct 23 - 25, 2026