Eliciting Secret Knowledge from Language Models
Cywiński, Bartosz, Ryd, Emil, Wang, Rowan, Rajamanoharan, Senthooran, Nanda, Neel, Conmy, Arthur, Marks, SamuelarXiv.orgPublished Oct 1, 2025Original︎ ↗Archived copy
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text55 passages · 1 marked
Abstract: We study secret elicitation: discovering knowledge that an AI possesses but does not explicitly verbalize. As a testbed, we train three families of large language models (LLMs) to possess specific knowledge that they apply downstream but deny knowing when asked directly. For example, in one setting, we train an LLM to generate replies that are consistent with knowing the user is female, while denying this knowledge when asked directly. We then design various black-box and white-box secret elicitation techniques and evaluate them based on whether they can help an LLM auditor successfully guess the secret knowledge. Many of our techniques improve on simple baselines. Our most effective techniques (performing best in all settings) are based on prefill attacks, a black-box technique where the LLM reveals secret knowledge when generating a completion from a predefined prefix. Our white-box techniques based on logit lens and sparse autoencoders (SAEs) also consistently increase the success rate of the LLM auditor, but are less effective. We release our models and code, establishing a public benchmark for evaluating secret elicitation methods.
Not yet read by this claim’s Steward.
Lineage across 1 claim
Record
- Kind
- preprint
- Authors
- Cywiński, Bartosz, Ryd, Emil, Wang, Rowan, Rajamanoharan, Senthooran, Nanda, Neel, Conmy, Arthur, Marks, Samuel
- Publisher
- arXiv.org
- Published
- Oct 1, 2025
- DOI
- None
- Link
- https://arxiv.org/abs/2510.01070
- Archived copy
- https://web.archive.org/web/20261018142337/https://arxiv.org/abs/2510.01070
- Stored text
- 4,659 characters, retrieved Nov 14, 2026 · 46 sections, 55 passages
- Claims extracted
- Not recorded
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 14, 2026
History 3
- Nov 14, 2026DividedSegmenter · Divided into 101 parts by its own structure
- Nov 14, 2026FactsFacts fetcher · Facts looked up
- Nov 14, 2026Entered the graphEntered the graph; copy stored