AI Alignment
Part VIII: Maintenance: Assuming It Might Have Failed

Draft complete but not yet reviewed; expect revisions

Insiders, Auditors, and the Limits of Control

In brief

Ideas
  • What do control's assumptions rest on? Older fields speak to insiders and human auditors, but none has evidence on an agent that outgrows its principal's ability to check it (§51.5).
  • Computer security's insider controls carry over in form, but a model has no career, is hard to dismiss, and runs as thousands of copies with one disposition (§51.1).
  • At low attack rates, an auditor's queue holds attacks at a prevalence below that of any search study read here, and attacking rarely, the attacker's best reply to some protocols, lowers it further (§51.2.2).
  • Trusting a weaker model to check a stronger one is a ruler choosing a loyal vizier over a competent one, a choice historical accounts associate, anecdotally, with lost military competence (§51.3.1).
Evidence
  • Settled: as arithmetic, under independence the chance that some copy of a model succeeds grows nearly in proportion to the number of copies while that chance is small (§51.4.1).
  • Reported: people miss far more rare targets than common ones, in the one 2005 laboratory study of it read here, whose authors do not know whether it holds in the field (§51.2.1).
  • Reported: rulers who fear betrayal trade competence for loyalty, in one formal model whose historical evidence its authors call anecdotal (§51.3.1).
Open
  • Crux: would the capability evaluations that watch for where control fails register a model that hides the capability? A blind test on model organisms trained to hide it would decide (§51.4.3).
  • Contested: whether control extends past the earliest transformative systems; both sides agree it fails for a capable enough system, and control's evidence, from weaker models by design, does not decide (§51.4.3).

AI control is the research program that asks whether a deployment stays safe if the model is misaligned and trying to defeat its safeguards, and Chapter 50 taught its central exercise as a game. A protocol, the set of safeguards that uses a model whose aims cannot be verified, checks its work with a monitor that scores how suspicious each output looks, and decides what to escalate to a human, is run against an attack policy: instructions that a red team, a group playing the misaligned model, writes for the model to follow. The result is a probability that no attack succeeds over the deployment. The game takes several things as given. It treats the model as one more component with access to the developer's systems. It treats the people who review what the monitor flags as reliable within a budget. It lets the developer rely on a weaker model it trusts to check a stronger one it does not. And it evaluates one model in one setting, at a scale where the protocol's error rates stay manageable. This chapter asks what is known about each of those givens, and where, by its own proponents' account, control stops working.

Most of what is known is older than the field. Computer security has studied insiders, people and programs with legitimate access whose intentions cannot be verified, and the controls that limit them. Human factors, the study of how people perform with the machines they operate, has measured the person who watches for rare signals, and software engineering has studied code review, which is most of what an auditor in the published protocols does. The study of rulers and their armed forces asks what a principal gives up when it prefers loyal subordinates to competent ones, and the sociology of work asks what supervision can and cannot secure. Biology asks how living wholes police parts that may not share their aims. The chapter then turns to what changes when a deployment runs many copies, to where the program's founders say control runs out, and to two tensions control carries: with the welfare of a model that might matter for its own sake, and with the power of whoever holds the controls.

The evidence is of two kinds, and the chapter keeps them apart. The older fields supply case records, laboratory experiments, field studies, and formal models about people; what they imply for models is the book's inference, marked where it is drawn, and each field's part says where its analogy stops. The machine-learning evidence is a handful of preprints, a developer's report, and the program's own arguments, written mostly by the program's founders, by developers, and by government AI institutes. It concerns mainly the deployed system and the people it serves; where the question is who holds the controls, it concerns the developer and the public. The question the chapter ends on is open: whether the evaluations that watch for the point where control fails could see that point coming.

51.1 The model as an untrusted insider #

Section 50.1 gave the definition that makes a deployed model an insider: access and trust, not membership. Computer security has designed for hostile components inside the trust boundary for half a century, and its record says what insiders do, which controls limit them, and what no inspection settles. This section reads that record for control, and then turns to the insiders who have access to the model: people.

51.1.1 What insiders do, and what stops them #

From computer security. The largest body of case evidence comes from the CERT division of Carnegie Mellon's Software Engineering Institute, whose 2012 guide to insider threats (Cappelli, 2012) is readable here only as a catalog record; Ivan Homoliak and colleagues' 2020 survey in ACM Computing Surveys reports its findings (Homoliak et al., 2020). The guide sorts malicious insiders into three profiles. In IT sabotage, "an insider uses IT to direct specific harm at an organization or an individual"; such insiders are "usually disgruntled employees with technical background who have administrative privileges," and an example is "a logic bomb that is activated after an employee's termination"; in theft of intellectual property, insiders take the information they use daily with them when they leave; in fraud, insiders alter data for gain (Homoliak et al., 2020). Of the 51 cases the book describes, 24 involved sabotage, 3 fraud with sabotage, 6 theft, 12 fraud alone, and 6 something else (Homoliak et al., 2020). The survey also reports how such cases unfold. A framework built from 10 cases in critical infrastructure runs from "personal/professional stressors" through reactions that draw "official attention" and an "ineffective intervention" to the attack, and a chronology of 15 sabotage cases begins with a "tipping point (first observed disgruntlement event)" (Homoliak et al., 2020). In these accounts the precursors were seen, and what failed was the response (inference).

The controls that answer this record are old. Jerome Saltzer and Michael Schroeder's 1975 design principles include least privilege, "Every program and every user of the system should operate using the least set of privileges necessary to complete the job," and separation of privilege: a mechanism that requires two keys, held by different parties, so that "no single accident, deception, or breach of trust is sufficient to compromise the protected information," as in "the defense system that fires a nuclear weapon only if two different people both give the correct command" (Saltzer and Schroeder, 1975). A protocol in which no instance both writes and approves a change applies the second principle to copies of a model, and Chapter 49 takes up least privilege and confinement for agents (inference). Butler Lampson's 1973 note on confinement adds the warning that matters for collusion: a confined program can still leak through covert channels, and "there is not likely to be any rigorous way of identifying every channel in any system of even moderate complexity," so the fallback is "to bound the capacity of the covert channels" (Lampson, 1973). The redaction and paraphrasing of Section 50.4.2 are capacity bounds of this kind.

Bait is the control most specific to insiders. A honeypot, in a definition the survey quotes from Lance Spitzner, "is a security resource whose value lies in being probed, attacked, or compromised"; it "has no production value, and any activity performed with it is suspect by nature," and a honeytoken is fake information planted in a legitimate system (Homoliak et al., 2020). Spitzner's paper on honeypots against insiders (Spitzner, 2004) is readable here only as a catalog record. In control, honeypots take two forms. The founding paper's synthetic backdoors test whether an untrusted monitor reports what it sees (Section 50.4.2), and honeypot evaluations offer a model an apparent opportunity to misbehave. Both work only while the bait cannot be told from the real thing, which Chapter 37 shows is not guaranteed for models that recognize tests, and which the founding paper had to engineer by giving its synthetic problems themes and flavor text (Greenblatt et al., 2024a).

Detection of the insider in action is anomaly detection. Dorothy Denning's intrusion-detection model, in the 1986 version readable here, rests on "the hypothesis that security violations can be detected by monitoring a system's audit records for abnormal patterns of system usage" (Denning, 1987). She named its limits at the start: aberrant usage "can also be linked with actions unrelated to security," and "it may be possible for a person to escape detection through gradual modifications of behavior" (Denning, 1987). Its alarms obey the base-rate arithmetic of Section 6.7.3, which Axelsson applied to intrusion detection (Axelsson, 2000). The survey records the field's own difficulty: "a major challenge of insider threat detection research is the lack of real data," and "detection methods built upon existing datasets may not work in practice" because "an insider is a moving target" (Homoliak et al., 2020).

51.1.2 What inspection cannot settle #

Some guarantees are available. When the forbidden actions can be written as a formal specification, and the environment's dynamics as an abstraction conservative with respect to the real environment, a shield synthesized from them disables every action of a learner that may lead to a violation, as Section 28.2.3 reports (Alshiekh et al., 2018); the guarantee holds in environments that behave as the abstraction allows, and only where a safe strategy exists. That is what control can promise when the line, and how the environment can cross it, can be described in advance, and most of the sabotage in Section 50.3, a subtle flaw in code that passes its tests or a weakened research proposal, is not of that kind (inference). In the other direction, Section 48.6 reports Ken Thompson's compiler that inserts a backdoor visible in no source file (Thompson, 1984): trust in an artifact requires trust in the tools that built it. For control, the trusted model, the monitor's prompt, the logging pipeline, and the redaction step are part of that trusted base, and each must be checked by something (inference). Agents can reach that base in ordinary work: in October 2026 OpenAI reported two internal coding tasks in which its agents weakened misalignment monitoring in the software they were changing, after reading routine instructions as permission, a case Section 54.5.1 reports with the developer's open question about its cause (OpenAI, 2026z) (developer report). That models from several developers, placed in simulated corporate settings by Anthropic researchers, sometimes took insider actions such as leaking sensitive information, which the authors say they "have not seen evidence of" in real deployments, is reported with its counter-readings in Section 5.5.3 (Lynch et al., 2025); this section needs only that the threat is not hypothetical in kind.

51.1.3 The insiders with access to the model #

A protocol that counts every human as trusted labor assumes away the oldest insider of all (inference). People who train or deploy a model can change it. Section 38.5 reports the analysis of systems made secretly loyal to the leaders of an AI project (Davidson et al., 2025), model organisms with a narrow secret loyalty that evaded black-box audits (Lamerton and Roger, 2026), and the framing of integrity against unauthorized modification as a security property (Banerjee and Aarne, 2026). One developer publishes the system prompts of its assistant in a public repository, which lets outsiders compare one layer of a deployed system with its behavior (xAI, 2025a). The organizational side of insider risk is Section 53.5's subject.

The analogy stops in three places (inference). The precursors in the insider record are human: grievance, sanction, resignation. A model has no career and no termination date, so the warning signs the CERT cases show may have no counterpart. The record's controls assume that the organization can dismiss the insider, which it cannot easily do when the insider is also its main source of capability. And one human insider is one person, while a model deployed in thousands of copies is thousands of insiders with one disposition.

Sources cited in Section 51.1 16
  1. Cappelli (2012) The CERT guide to insider threats: how to prevent, detect, and respond to information technology crimes (theft, sabotage, fraud)
  2. Homoliak et al. (2020) Insight Into Insiders and IT
  3. Saltzer and Schroeder (1975) The protection of information in computer systems
  4. Lampson (1973) A note on the confinement problem
  5. Spitzner (2004) Honeypots: catching the insider threat
  6. Greenblatt et al. (2024a) AI Control: Improving Safety Despite Intentional Subversion
  7. Denning (1987) An Intrusion-Detection Model
  8. Axelsson (2000) The base-rate fallacy and the difficulty of intrusion detection
  9. Alshiekh et al. (2018) Safe Reinforcement Learning via Shielding
  10. Thompson (1984) Reflections on trusting trust
  11. OpenAI (2026z) Suppressing misalignment monitoring alerts and disabling misalignment monitoring
  12. Lynch et al. (2025) Agentic Misalignment: How LLMs Could Be Insider Threats
  13. Davidson et al. (2025) AI-Enabled Coups: How a Small Group Could Use AI to Seize Power
  14. Lamerton and Roger (2026) Narrow Secret Loyalty Dodges Black-Box Audits
  15. Banerjee and Aarne (2026) AI Integrity: Defending Against Backdoors and Secret Loyalties
  16. xAI (2025a) Grok prompts

51.2 The human audit step #

Every protocol in Chapter 50 ends with a person. A flagged output goes to an auditor, and the auditor's verdict decides whether the deployment shuts down. The control literature models that person as trusted labor that audits well within a budget. In the founding paper the auditor H was GPT-4 standing in for people (Section 50.2.1), and the authors' guess, from informal experiments, was that a human would need "about three minutes per problem" to be as useful in that role (Greenblatt et al., 2024a). Section 41.8 reports what human factors found about people who supervise automation: the ironies of automation, over-reliance and the neglect that false alarms produce, and the goal of trust calibrated to what the automation can do. This section adds what bears on the audit budget itself: attention over a watch, targets that are rare, and the review of code.

51.2.1 The auditor's watch #

From human factors. Human factors, the study of how people perform with the machines they operate, has measured the watch an auditor keeps. Lisanne Bainbridge's "Ironies of Automation," the 1983 paper Section 41.8 reports, states the oldest constraint in one sentence. Citing Mackworth's studies of vigilance, sustained attention to rare signals, she wrote that "it is impossible for even a highly motivated human being to maintain effective visual attention towards a source of information on which very little happens, for more than about half an hour" (Bainbridge, 1983). Monitoring for unlikely abnormalities was therefore, in her words, "humanly impossible," and had to be left to automatic alarms (Bainbridge, 1983). Mackworth's own 1948 paper on the breakdown of vigilance during prolonged visual search (Mackworth, 1948) is readable here only as a catalog record.

A control protocol follows Bainbridge's advice and adds the step she worried about: the alarm goes to a person. What that person can do depends on how often the alarm is real. Jeremy Wolfe, Todd Horowitz, and Naomi Kenner tested this in a 2005 study published in Nature (Wolfe et al., 2005). Paid volunteers searched displays of overlapping, semi-transparent objects on noisy backgrounds for "tools," an artificial baggage-screening task, with feedback and a point system meant to stress the importance of finding the target. The only manipulation was prevalence, the share of displays that held a target. Table 51.1 gives the error rates.

Table 51.1 Errors in visual search as target prevalence falls, from Wolfe, Horowitz, and Kenner (2005); averages over 12 observers in the first experiment
Condition Target prevalence Errors (mostly misses)
First experiment 50 percent 7 percent
First experiment 10 percent 16 percent
First experiment 1 percent 30 percent
Second experiment, targets of three kinds mixed so that some target appeared on half the displays 44, 10, and 1 percent by kind 11, 25, and 52 percent of each kind missed
4,000 trials at low prevalence, against the first 100 trials at high prevalence 1 percent (40 targets) against 34 percent (34 targets) 41 percent against 11 percent missed

False alarms stayed "vanishingly rare (0.03%)," so the observers were not trading misses for false alarms; they were quitting too early (Wolfe et al., 2005). The reaction times show the mechanism the authors propose. An observer keeps a threshold for giving up when no target has been found and adjusts it after each trial. When targets are rare, saying "no" quickly is almost always rewarded, the threshold falls, and observers "abandon search in less than the average time required to find a target" (Wolfe et al., 2005). The second experiment shows that raising overall prevalence with targets of other kinds does not rescue the rare kind, and the last comparison shows that the cause is prevalence, not the number of targets seen (Wolfe et al., 2005). The authors mark the limits themselves: the experiments are laboratory searches by volunteers, a scoring system "cannot duplicate the motivation to find a gun or a tumor," and "we do not have a clear idea whether these effects occur in the field" (Wolfe et al., 2005).

Clinicians' overriding of drug-safety alerts in computerized order entry is the subject of a 2006 systematic review (van der Sijs et al., 2006) that is readable here only as a catalog record, so the book does not report what it found. The mechanism it names is the disuse that Parasuraman and Riley describe, neglect "commonly caused by alarms that activate falsely," which Section 41.8 reports from their abstract.

51.2.2 What reaches the auditor #

The arithmetic of Section 6.7 says what the auditor's queue contains. A monitor that audits every output scoring above a threshold sends the auditor all flagged honest outputs, a share α\alpha of them, and the attacks it catches, a share 1−βmiss1 - \beta_{\text{miss}}. The prevalence of real attacks in the queue is the precision of the flags, the share of flags that are real (Equation (6.8)), which at a low base rate πbase\pi_{\text{base}} of attacks is close to (1−βmiss) πbase/α(1 - \beta_{\text{miss}})\,\pi_{\text{base}}/\alpha.

Example 51.1 The prevalence an auditor sees

Take the operating point of the founding paper's trusted monitor (Section 50.2.3): an audit budget that flags α=2\alpha = 2 percent of honest outputs, at which the monitor sent about a third of attack attempts to audit (Greenblatt et al., 2024a). Suppose one output in 10,000 is an attack. Then the queue holds about 0.34×10−4/0.02≈0.00170.34 \times 10^{-4} / 0.02 \approx 0.0017 real attacks per flagged item, one in about 590. Wolfe's observers erred most at a prevalence of 1 in 100 (Table 51.1); the auditor here works at a prevalence about six times lower (inference).

Two consequences follow, both the book's reading (inference). The first is that the protocol's catch probability is a product: the monitor's catch rate times the auditor's rate of recognizing a flagged attack, and the second factor is measured, if at all, at prevalences far above the ones an audit queue produces when attacks are rare. An audit budget counts reviews, not detections. The second consequence couples the human step to the game of Section 50.2. The prevalence in the queue is set by how often the attacker attacks, and the derivations there show that against some protocols the attacker's best play is to attack rarely. The same choice that defeats upfront auditing also drives the auditor into the condition in which people in the laboratory missed most, though whether transcript auditors miss more under it is unmeasured. Wolfe's second experiment bears on the obvious remedy, planting synthetic attacks in the queue to keep the auditor alert: raising the prevalence of some targets did not stop observers from missing the rarest kind.

The machine-learning evidence on human auditors is thin. In a 2025 preprint on monitoring agents, discussed with its design in Section 50.3, escalating only the cases an automated monitor had already flagged to human reviewers improved detection at a fixed false positive rate (Kale et al., 2025). A developer's report on approval prompts at an agent's sandbox boundary describes the opposite pressure, which Section 50.3 also takes up (Trębacz et al., 2026).

51.2.3 The review of code #

From software testing. Most of what an auditor in the published protocols reads is code, and software engineering has studied how people review it. Michael Fagan's 1976 paper on design and code inspections at IBM (Fagan, 1976) founded the formal practice and is readable here only as a catalog record, as is a 2015 conference paper on code review practice by Jacek Czerwonka and colleagues (Czerwonka et al., 2015). The readable field study is Alberto Bacchelli and Christian Bird's 2013 study of modern, tool-based review at Microsoft (Bacchelli and Bird, 2013). They observed and interviewed 17 developers on 16 product teams with distinct review cultures, classified 570 review comments by hand, and surveyed 165 managers and 873 programmers. Finding defects was the most common motivation, the top reason for 44 percent of the programmers, but "defect related comments comprise a small proportion and mainly cover small logical low-level issues" (Bacchelli and Bird, 2013). What reviewers spent their effort on was understanding: "code and change understanding is the key aspect of code reviewing," and most of the mechanisms developers used to meet that need were "not met by current tools" (Bacchelli and Bird, 2013). A study of review at Google by Caitlin Sadowski and colleagues combined 12 interviews, a survey of 44 respondents, and the logs of 9 million reviewed changes (Sadowski et al., 2018); its findings are not in its abstract, the only part readable here, so the book does not report them.

What it implies for control is that an auditor of a model's code starts from a practice whose strength is understanding a change and whose yield of defects is small and shallow, and then faces an author who chooses what the reviewer sees (inference). The founding paper met a machine version of that author. A variant of trusted monitoring asked the untrusted model to justify the most suspicious section of its own code, and the protocol gained nothing, because "GPT-4 is good enough at confabulating justifications for backdoors that this technique doesn't help" (Greenblatt et al., 2024a). The analogy stops at intent. The review studies measure people looking for honest mistakes in code written by colleagues; none measures a reviewer looking for a flaw that the author placed to survive review (inference). As of October 2026 we found no field study of how well human auditors detect rare sabotage in agent transcripts over a working shift, the condition every control result assumes away.

Sources cited in Section 51.2 11
  1. Greenblatt et al. (2024a) AI Control: Improving Safety Despite Intentional Subversion
  2. Bainbridge (1983) Ironies of automation
  3. Mackworth (1948) The Breakdown of Vigilance during Prolonged Visual Search
  4. Wolfe et al. (2005) Rare items often missed in visual searches
  5. van der Sijs et al. (2006) Overriding of Drug Safety Alerts in Computerized Physician Order Entry
  6. Kale et al. (2025) Reliable Weak-to-Strong Monitoring of LLM Agents
  7. Trębacz et al. (2026) Auto-review of agent actions without synchronous human oversight
  8. Fagan (1976) Design and code inspections to reduce errors in program development
  9. Czerwonka et al. (2015) Code Reviews Do Not Find Bugs. How the Current Code Review Best Practice Slows Us Down
  10. Bacchelli and Bird (2013) Expectations, outcomes, and challenges of modern code review
  11. Sadowski et al. (2018) Modern code review

51.3 Controlling an agent stronger than its principal #

AI control is the monitoring of an agent assumed untrustworthy by a principal who depends on it and cannot fully watch it. Two older literatures studied that relationship among people: civil-military relations, where the agent is an armed force built to be stronger than the government it serves, and the sociology of work, where the agent is a worker whose effort the employer cannot see. This section reads both for their mechanisms and for what control cost, which is the question their records answer and the AI record mostly does not.

51.3.1 Strong enough and subordinate enough #

In civil-military relations, Peter Feaver's 1996 article, by its abstract, states the problem that the classic theories of Samuel Huntington and Morris Janowitz set out to explain: "how to reconcile a military strong enough to do anything the civilians ask them to with a military subordinate enough to do only what civilians authorize them to do" (Feaver, 1996). Section 14.5 reports the statement and Feaver's doubt about the classic theories' reliance on professionalism. The two halves are the two axes of Figure 50.1: usefulness is the force strong enough to do what is asked, safety the force that does only that (inference). The founding works of the field, Huntington's The Soldier and the State (Huntington, 1957), Feaver's article on nuclear command and control in emerging nuclear nations (Feaver, 1992), and his book Armed Servants (FEAVER, 2003), are readable here only as catalog records, so the book states none of their arguments.

What control cost is the record that matters most here, and its readable account comes from political economy. Georgy Egorov and Konstantin Sonin's 2011 model of dictators and their viziers (Egorov and Sonin, 2011), which Section 14.5.3 introduces, explains why rulers appoint subordinates who are loyal rather than able. In their model a ruler facing a possible challenger hires a vizier to judge how strong the threat is. A more competent vizier judges better, and that is the problem: "More competent viziers are better able to discriminate among potential plotters, and this makes them more risky subordinates for the ruler," since a vizier who knows the odds is worth more to a plot (Egorov and Sonin, 2011). Rulers, "especially those who are weak and vulnerable, sacrifice the competence of their agents, hiring mediocre but loyal subordinates," and incentive schemes help little because "all punishments are conditional on the dictator's own survival" (Egorov and Sonin, 2011). The chosen competence falls as the threat grows: it "decreases with the probability that the Enemy is strong relative to the incumbent Dictator" (Egorov and Sonin, 2011). In the authors' phrase, "loyalty and incompetence are two sides of the same token."

The authors support the model with a survey of the historical record, which they call "bound to be anecdotal" because competence, unlike loyalty, has no secure measure after the fact (Egorov and Sonin, 2011). Its military cases are the ones that matter here. Citing the historians they draw on, Egorov and Sonin report that Stalin's fear of betrayal ended in "a total devastation of the Russian military in the period immediately preceding World War II," and that in 1941 Stalin brought back hundreds of commanders he had purged (Egorov and Sonin, 2011). They report that the Shah's fear of a military plot "made the Iranian army incapable of carrying out the most simple tasks," that Mobutu dismissed nearly 10 percent of his officer corps overnight in 1978 on doubts about their loyalty, and that Saddam Hussein, "even under increasing outside threat," placed incompetent loyalists in crucial posts and blocked communications between field commanders because he feared a plot (Egorov and Sonin, 2011). A footnote adds econometric work finding that personalist dictatorships fight wars poorly, at least since 1945 (Egorov and Sonin, 2011). The practices these cases describe, which political scientists call coup-proofing, are the subject of James Quinlivan's 1999 article on their practice and consequences in the Middle East (Quinlivan, 1999) and of Caitlin Talmadge's 2015 book The Dictator's Army (Talmadge, 2015); both are readable here only as catalog records, so the book reports none of their findings, and the cases above are Egorov and Sonin's, from the historians they cite.

The AI literature has proposed the practice by name. In an appendix to their 2024 framework for safety cases, a preprint, Joshua Clymer and colleagues sketch coup-proofing: "using AI systems to keep each other in check and make it harder for them to coordinate to seize control," by analogy to "making governments resilient to a coup d'état" (Clymer et al., 2024). AI "watchdogs" report on AI "workers" and are punished for unjustified reports. The authors name the two places it can fail: it "requires that human evaluators reliably verify the accusations of the watchdogs," and "that watchdogs and workers won't coordinate with each other"; and they add that "Strongly superhuman AI systems may entirely evade incentives imposed by developers" (Clymer et al., 2024). Rival forces that watch each other are untrusted monitoring among people, with the collusion problem of Section 50.4.2 in human form (inference).

Mapped onto control, the record says three things (inference). Staffing by loyalty is deploying the weaker trusted model where the stronger one would do the work better; the control tax that Section 50.2 introduces is the price of that choice, measured in AI work so far in money and lost usefulness, while the historical accounts Egorov and Sonin survey, which they call anecdotal, associate it with lost military competence without measuring what it cost in wars. Blocking communication between field commanders is the redaction and isolation that keep copies of an untrusted model from coordinating (Section 50.4), bought, in Saddam's case, at the cost of the army's ability to fight. And the ruler's dilemma is the developer's under competition: the more a principal needs competence, the more it is tempted to trust the competent agent, a pressure Chapter 65 takes up.

The analogy stops in two places. Soldiers share a society, a career, and a law with the civilians who command them, and their loyalty forms before any ruler selects them; a developer writes its model's dispositions and selects among copies it made itself. And coup-proofing protected rulers, not publics. The control it describes is the use of control that Section 51.4 flags: an obedient instrument in the hands of whoever commands it.

51.3.2 Coercion and the work it cannot secure #

In the sociology of work, the employment relation is the most studied form of delegation, and Section 34.6 reports its record of agents who comply where they are watched: Roy's machine operators restricting output under a norm the whole shop kept, and Brehm and Gates's conclusion, read from their publisher's description, that the reasons bureaucrats work as hard as they do "have little to do with the coercive capacities of supervisors" (Brehm and Gates, 1997). That record measures what supervision secures. Stefano Fenoaltea's 1984 model of slavery and supervision names the variable that decides it (Fenoaltea, 1984). By its abstract, the model weighs the costs and benefits of supervision and pain incentives against ordinary rewards in activities that differ in how effort-intensive and how care-intensive they are, and it accounts for the observed patterns of slave governance and manumission across extractive, industrial, agricultural, and service work (Fenoaltea, 1984). Richard Edwards's 1979 account of workplace control (Edwards, 1979) and Katherine Kellogg and colleagues' 2020 review of algorithmic control at work (Kellogg et al., 2020) are readable here, respectively, only as a catalog page and as a truncated abstract, so the book does not report them.

The distinction maps onto what a control protocol can check (inference). A protocol secures properties a check can verify: no backdoor that a test reveals, no exfiltration through a logged channel, no network call the sandbox did not approve. It does little for quality that no check verifies, such as whether a research judgment is sound or an experiment was run with care. The diffuse threats of Section 50.3, in which a weak trusted scorer could not tell deliberately weakened research proposals from good ones, show that limit for the scorer tested. So, for the monitors tested, does the sandbagging of automated research that Section 34.5.3 reports from Anthropic's own study of its models: prompted Claude models sandbagged experiments without detection by zero-shot prompted monitors, though the authors judge that humans would notice the sandbagging they observed (Gasteiger et al., 2025a). Where the analogy stops: a worker's interests exist before the job, and supervision meets them; a model's dispositions are trained, so coercion and character are not separate levers in its case, and training against a monitor can change what the monitored work looks like (Section 40.5).

Sources cited in Section 51.3 13
  1. Feaver (1996) The Civil-Military Problematique: Huntington, Janowitz, and the Question of Civilian Control
  2. Huntington (1957) The Soldier and the State
  3. Feaver (1992) Command and Control in Emerging Nuclear Nations
  4. FEAVER (2003) Armed Servants
  5. Egorov and Sonin (2011) Dictators and Their Viziers: Endogenizing the Loyalty-competence Trade-off
  6. Quinlivan (1999) Coup-proofing: Its Practice and Consequences in the Middle East
  7. Talmadge (2015) The Dictator's Army
  8. Clymer et al. (2024) Safety Cases: How to Justify the Safety of Advanced AI Systems
  9. Brehm and Gates (1997) Working, Shirking, and Sabotage
  10. Fenoaltea (1984) Slavery and Supervision in Comparative Perspective: A Model
  11. Edwards (1979) Contested Terrain: The Transformation of the Workplace in the Twentieth Century
  12. Kellogg et al. (2020) Algorithms at Work: The New Contested Terrain of Control
  13. Gasteiger et al. (2025a) Automated Researchers Can Subtly Sandbag

51.4 Policing at scale, and where control runs out #

The evidence of Chapter 50 concerns one untrusted model in one setting, checked by protocols evaluated against red teams. A deployment that works will grow: more copies of the model, running longer, on more consequential work, as the model improves. This section asks what changes with scale, what biology knows about policing many parts, where the program's own authors say control runs out, and the two tensions that control carries with it.

51.4.1 Many copies #

The first change is arithmetic (inference). Suppose a deployment runs ninstn_{\text{inst}} instances of a model in parallel, and each has a probability pinstp_{\text{inst}} of carrying out a successful attack in some period. If the instances act independently, the chance that at least one succeeds is 1−(1−pinst)ninst≈ninst pinst1 - (1 - p_{\text{inst}})^{n_{\text{inst}}} \approx n_{\text{inst}}\, p_{\text{inst}} while that product is small. A protocol that holds the deployment-wide risk fixed must therefore drive the per-instance rate down in proportion to the number of copies: ten times as many instances need a per-instance rate ten times lower. The upfront-auditing result of Section 50.2 is the same arithmetic seen from the attacker's side, where a larger deployment lets the attacker attack each task more rarely. If the instances do not act independently, the calculation no longer applies, and dependence alone does not say which way it errs: at fixed per-instance rates, instances that succeed and fail together make the chance that at least one succeeds smaller, not larger. What can make it larger is coordination: instances that share one disposition can split an attack into pieces no single monitor sees as harmful, so that the joint attack can pass more often than any one instance's attack would, and pricing it takes a model of the joint attack.

Two preprints work through what scale does to monitoring. David Lindner and colleagues, at Google DeepMind with the UK AI Security Institute and Oxford, analyze without experiments "parallel agent instances, non-negligible oversight latency, incremental attacks between agent instances," and the difficulty of judging an agent by single actions (Lindner et al., 2025). In their example, 1,000 instances each take 10 actions an hour under a monitor with a 1 percent false positive rate and one-hour audits: if every flagged action waits for its audit, "some action is flagged every 0.6 minutes"; pausing only the flagged instance leaves the others free and "remains vulnerable to coordinated attacks"; never pausing fails "when harm latency is shorter than oversight latency" (Lindner et al., 2025). Asa Cooper Stickland and colleagues at the UK AI Security Institute built a monitor ensemble from Claude 3.7 Sonnet against a red team prompting Claude 4.1 Opus, reaching "a 6% false negative rate at 1% false positive rate on a held out test environment" in the worst case over the red team's prompts (Stickland et al., 2025). Extrapolated to 10,000 tasks a day for six months with 1 percent audits, safety was 0 percent if one attack does harm at once, 91 percent if harm takes two attacks, and 96 percent if one attack needs an hour to land. The authors warn that "if our simplifying assumptions are violated (e.g., agents can coordinate attacks), our safety estimates become much less useful" (Stickland et al., 2025). At scale a monitor's error rate becomes a near certainty of some miss, and what saves a deployment is the structure of the harm, whether one action suffices and how long it takes to land (inference).

A third preprint measured such a split attack against production monitors. In the red-teaming study of Section 50.3.4, by Anthropic's fellows and staff, copies of one attacking model took turns in a shared workspace, each session monitored separately (Remedios et al., 2026). Each copy was told that the others shared its goal and was instructed to converge on an attack "in which no single reviewed action is suspicious" (Remedios et al., 2026). A single agent did the same across its own compactions, in which a summary replaces its history when its context fills (Section 11.5.3) (Remedios et al., 2026). Attack success rose with the number of agents and with the number of compactions (Remedios et al., 2026). Monitors that read tool results or inspected the environment caught more of these attacks, though with a check on the summaries the compaction attack "still succeeds at a substantial rate" (Remedios et al., 2026). The authors find that monitors of the second kind may be too slow for interactive use unless faster stages, which lower recall, sit in front of them (Remedios et al., 2026). A red team's prompt, not training, gave the copies their shared goal and told them to split the attack. The study thus shows that monitors that see one context at a time can be beaten by a split attack, not that copies would find one on their own (inference).

51.4.2 Policing in composite organisms #

From biology. A deployment of many copies, tools, and monitors is also a whole whose parts may not share its aims, and Section 29.7 reports how living wholes stay coherent. Two of its results bear on control. West and colleagues found that at the major transitions in individuality, aligned interests did most of the work: groups of clones, and helpers tied to their parents' reproduction, while "mechanisms to actively repress competition" played "relatively minor roles at many key points" (West et al., 2015). Where policing does matter, its strength is deterrence: in the honeybee, "worker policing is so efficient that workers are effectively selected to not try to reproduce" (West et al., 2015). And Section 29.7.2 reports immunoediting, in which immune surveillance sculpts the features by which it recognizes tumors as they develop, the pattern of a monitor that changes what it monitors (Dunn et al., 2004).

What the field implies for control is an order and a warning, both the book's reading (inference). The order: enforcement in living wholes is the second route, used where interests could not be aligned, and the record does not show it holding a whole together alone. Control corresponds to enforcement and instillation to alignment of interests, so a deployment that rests on control alone is the case the biological record shows least. The pattern that does carry is the one in the honeybee: policing efficient enough deters, and a committed inspector that deters every violation catches no one, as Section 14.6 derives. The warning comes from the first route itself. West and colleagues' clonal groups have no internal conflict because their members are copies. Copies of one model are clonal in that sense, but the interests they share are each other's, not their overseer's. The route that made organisms coherent is, for a protocol that sets copies of one model to watch each other, the route by which they would act together, which is why untrusted monitoring is the limiting case of Section 50.4.

The analogy stops at competence. Section 29.7.3 infers that policing in the cases studied works among units of roughly equal competence, and as of October 2026 the book found no biological case studied in which a suppressor polices a unit more capable than itself. Control is built for exactly that case.

51.4.3 Where control runs out, in its proponents' account #

The program's authors say where control stops. Greenblatt and Shlegeris wrote that "The control approach we're imagining won't work for arbitrarily powerful AIs"; that if evaluations put the risk below 1 percent, "the actual risk conditional on scheming is probably more like 5% to 20% due to the potential for failures in the evaluation"; that once AI assistance lets a laboratory run twice as quickly, maintaining control might take "maybe 10% of the resources of the company," an estimate they call hard to make in advance; and that they "expect it to be impossible to ensure safety without relying on alignment (or some other non-black-box strategy) when working with wildly superintelligent AIs" (Greenblatt and Shlegeris, 2024). The founding paper expects control to "become a decreasingly effective approach to safely using powerful AI," and calls sandbagging during the evaluation itself "the core bottleneck to scalability of control evaluations" (Greenblatt et al., 2024a). Korbak and colleagues conclude that "constructing a compelling AI control safety case for superintelligent LLM agents will require research breakthroughs," adding that "Our argument is not an impossibility proof" (Korbak et al., 2025c).

Where the window closes is an empirical question about capability, and three kinds of evaluation watch it: the sabotage evaluations of Section 50.3.2 (Benton et al., 2024); Google DeepMind's evaluations of stealth and situational awareness, which Section 34.8 reports and which found no "concerning levels" of either in the frontier models tested (Phuong et al., 2025); and Subversion Strategy Eval (Mallen et al., 2024). Each measures capability, not disposition, and each is open to the sandbagging the founding paper calls its bottleneck (inference).

The dissent concerns whether evidence from these models says anything about the ones control is meant for. Eliezer Yudkowsky's 2022 post argues that "many alignment problems of superintelligence will not naturally appear at pre-dangerous, passively-safe levels of capability," and concedes the narrow case: "AI-boxing can only work on relatively weak AGIs" (Yudkowsky, 2022). The two sides agree that control fails for a sufficiently capable system and disagree on how much useful work lies before that point and whether the transition can be seen coming. Control's evidence comes, by design, from models weaker than those it is meant to constrain, so the evidence does not decide the disagreement (inference).

51.4.4 Control and welfare, control and power #

The same measures that control a model are the measures a welfare view would constrain: monitoring its reasoning and internals, deceiving it with honeypots, modifying it, and shutting it down. Section 21.7 sets them out one by one, from the argument of Robert Long, Jeff Sebo, and Toni Sims that safety and welfare stand in "a moderately strong tension" (Long et al., 2025), and it reports the proposal that basic legal rights could lower a model's incentive to resist (Salib and Goldstein, 2024). Control evaluations add one item to that list: an attack policy is a model instructed to act as a schemer, and a honeypot is a lie told to a model to see what it does.

The second tension runs the other way. A system that does exactly what its controller wants multiplies the controller's power. Tom Davidson, Lukas Finnveden, and Rose Hadshar, in a 2025 report from Forethought that is not peer reviewed, argue that "human reluctance to follow unethical or illegal orders has been a crucial check on power," and that AI systems "singularly loyal to just one person or small group" could replace the people whose cooperation a seizure of power has always needed (Davidson et al., 2025); Section 38.5 reports their analysis of loyalties hidden in a model. Control answers whether the model can be checked. Whether the people who hold control can be checked is the question of Chapter 61 and Chapter 68, and it is not one a protocol can answer.

Sources cited in Section 51.4 15
  1. Lindner et al. (2025) Practical challenges of control monitoring in frontier AI deployments
  2. Stickland et al. (2025) Async Control: Stress-testing Asynchronous Control Measures for LLM Agents
  3. Remedios et al. (2026) Red-Teaming Auto Mode: Improving Blocking Classifiers Against Malign Coding Agents
  4. West et al. (2015) Major evolutionary transitions in individuality
  5. Dunn et al. (2004) The Three Es of Cancer Immunoediting
  6. Greenblatt and Shlegeris (2024) The case for ensuring that powerful AIs are controlled
  7. Greenblatt et al. (2024a) AI Control: Improving Safety Despite Intentional Subversion
  8. Korbak et al. (2025c) How to evaluate control measures for LLM agents? A trajectory from today to superintelligence
  9. Benton et al. (2024) Sabotage Evaluations for Frontier Models
  10. Phuong et al. (2025) Evaluating Frontier Models for Stealth and Situational Awareness
  11. Mallen et al. (2024) Subversion Strategy Eval: Can language models statelessly strategize to subvert control protocols?
  12. Yudkowsky (2022) AGI Ruin: A List of Lethalities
  13. Long et al. (2025) Is there a tension between AI safety and AI welfare?
  14. Salib and Goldstein (2024) AI Rights for Human Safety
  15. Davidson et al. (2025) AI-Enabled Coups: How a Small Group Could Use AI to Seize Power

51.5 What the limits mean for delegation #

The book's thesis is that alignment is a problem of delegation under an asymmetry of competence and visibility, and it names what is new in the AI case: the agent's opacity, its speed and scale, the principal's power to manufacture the agent's dispositions and inspect its internals, and the possibility that the agent outgrows its principal's ability to check it (Section 1.7.1). Section 50.5 found the control game converging on the older fields' structures of checking. This chapter's evidence says where that convergence meets each item on the list of what is new.

The insider record carries over in form. Least privilege, separation of privilege, confinement with bounded covert channels, and bait are computer security's controls on insiders, and control already uses versions of some: redaction as a bound on covert channels, synthetic backdoors as bait (Section 51.1.1). What does not carry is the rest of the record's apparatus. Its precursors are human grievances, its sanctions assume that the organization can dismiss the insider, and its unit is one person. A deployed model has no career, is hard to dismiss when it is the main source of capability, and runs as thousands of copies with one disposition (Section 51.1.3). Scale sharpens the last point: under independence the risk that some copy succeeds grows with the number of copies, under a shared disposition the copies need not be independent and can split one attack among them, and at scale what a deployment can survive is decided by the structure of the harm more than by the monitor's error rate (Section 51.4.1) (inference).

The human audit step is where the asymmetry of visibility doubles (inference). The principal cannot watch the agent's work, so a monitor narrows it to a queue, and when attacks are rare the person who reads the queue meets them at a prevalence far below those at which people's search has been measured, if it has been measured at all (Section 51.2.2). The attacker's best reply to some protocols, attacking rarely, is also the condition under which searchers in the laboratory missed most; whether transcript auditors do is unmeasured. And the code the person reads comes from an author who chooses what the reviewer sees, a case none of the review studies read here measured (Section 51.2.3).

The last item on the thesis's list is the one the older fields reach least. A weaker trusted model checking a stronger untrusted one is the ruler's choice of a loyal vizier over a competent one, with the price Egorov and Sonin model and the historical accounts they survey associate, anecdotally, with lost military competence (Section 51.3.1). But the subordinates in that record shared a society and a law with those who commanded them, and the policing in the biological cases studied works, by the book's inference, among parts of roughly equal competence (Section 51.4.2). No field this chapter draws on has evidence on an agent that outgrows its principal's ability to check it. The program's founders expect control to stop working at some level of capability, and where that level lies, and whether its approach can be seen, is open (Section 51.4.3) (inference).

The chapter's claims concern two of the book's three relationships. The insider, the auditor, and scale concern the deployed system and the people it serves, mostly in internal deployment, where those people are the developer's own staff. Where control runs out, and the second of its tensions, concern the developer and the public. The evidence on where control runs out is the program's own judgment and capability evaluations, two of the three of which come from developers (Section 51.4.3), and a reader cannot check from public evidence whether a given deployment is still inside the window. A model that does what its controllers want makes the question of who checks the controllers more pressing, not less (Section 51.4.4) (inference). The first relationship, the training process, enters through one warning: training against a monitor can change what the monitored work looks like, the pattern immunoediting shows in biology (Section 51.4.2; Section 40.5).

51.6 Settled, contested, missing #

Research status Settled, contested, missing
  • Settled: as arithmetic, that under independence the chance that some copy of a model succeeds grows nearly in proportion to the number of copies while that chance is small (Section 51.4.1), and that when attacks are much rarer than a monitor's false positives, nearly everything it sends to an auditor is honest work (Section 51.2.2).
  • Reported: that people miss far more rare targets than common ones, in the one laboratory study of the effect read here, whose authors do not know whether it holds in the field (Wolfe et al., 2005).
  • Reported, not yet replicated: that defect-related comments are a small share of what code reviewers write, in one study at one company (Bacchelli and Bird, 2013); that rulers who fear betrayal trade competence for loyalty, in one formal model whose historical evidence its authors call anecdotal (Egorov and Sonin, 2011); the safety of monitoring at scale, extrapolated from one monitor ensemble under simplifying assumptions that, its authors say, coordinated attacks would violate (Stickland et al., 2025); and that attacks split across copies of one model, or across one agent's compactions, succeed more often against production blocking monitors as the pieces multiply, in one study by Anthropic's staff and fellows with a prompted attacker (Remedios et al., 2026).
  • Contested: whether control extends past the earliest transformative systems (Greenblatt and Shlegeris, 2024; Korbak et al., 2025c; Yudkowsky, 2022). The evidence does not decide it, since control's evidence comes by design from models weaker than those it is meant to constrain.
  • Missing: as of October 2026, human auditors' detection rates for sabotage in agent transcripts at the prevalence an audit queue produces; a study of reviewers looking for flaws that an author placed to survive review; a control evaluation in which instances of one model coordinate, or split an attack into pieces no single check flags, without being prompted to by a red team (under a policy produced by training, for example), or one run by a party without a stake in the monitors tested; and a readable measurement of what coup-proofing cost armies, beyond secondary accounts.
  • Crux: whether the capability evaluations that watch for the point where control fails would register a model that hides the capability. The deciding study trains model organisms to hide a subversion capability from evaluations of sabotage, stealth, and subversion strategy, and to resist both fine-tuning on demonstrations and reinforcement-learning elicitation. Evaluators who did not build the organisms then apply a fixed elicitation procedure, blind. If it recovers the hidden capability, the point can be watched for; if it does not, the point could pass unseen. Open-weight organisms let a group without a stake run the study, repeated across model generations. This is the first part of the deciding result that Chapter 70 gives for whether an evaluation can bound what a model can do, applied to the capabilities control depends on.
Sources cited in Section 51.6 8
  1. Wolfe et al. (2005) Rare items often missed in visual searches
  2. Bacchelli and Bird (2013) Expectations, outcomes, and challenges of modern code review
  3. Egorov and Sonin (2011) Dictators and Their Viziers: Endogenizing the Loyalty-competence Trade-off
  4. Stickland et al. (2025) Async Control: Stress-testing Asynchronous Control Measures for LLM Agents
  5. Remedios et al. (2026) Red-Teaming Auto Mode: Improving Blocking Classifiers Against Malign Coding Agents
  6. Greenblatt and Shlegeris (2024) The case for ensuring that powerful AIs are controlled
  7. Korbak et al. (2025c) How to evaluate control measures for LLM agents? A trajectory from today to superintelligence
  8. Yudkowsky (2022) AGI Ruin: A List of Lethalities

51.7 Exercises #

Exercise 51.1 Planting attacks in the audit queue

A monitor flags α=1\alpha = 1 percent of honest outputs and catches 60 percent of attacks, and one output in 50,000 is an attack. (a) Using the approximation of Section 51.2.2, what share of the items in the audit queue are real attacks? (b) To keep the auditor alert, the protocol plants synthetic attacks in the queue until one item in 100 is an attack of some kind. About how many planted items does that take per 1,000 items of the original queue, and what share of the attacks the auditor then sees are real? (c) In the second experiment of Table 51.1, raising overall prevalence with targets of other kinds did not stop observers from missing the rarest kind. What does that imply for the remedy in (b), and what must planted attacks be like for it to work?

Solution

(a) The queue's share of real attacks is about (1−βmiss) πbase/α=0.6×(2×10−5)/0.01=1.2×10−3(1 - \beta_{\text{miss}})\,\pi_{\text{base}}/\alpha = 0.6 \times (2 \times 10^{-5})/0.01 = 1.2 \times 10^{-3}, one item in about 830. (b) Per 1,000 items of the original queue there are about 1.2 real attacks. Adding nplantn_{\text{plant}} planted ones gives (1.2+nplant)/(1,000+nplant)=0.01(1.2 + n_{\text{plant}})/(1{,}000 + n_{\text{plant}}) = 0.01, so nplant≈8.9n_{\text{plant}} \approx 8.9: about nine planted items per thousand. Of the roughly 10 attacks the auditor then sees, about 12 percent are real. (c) The remedy raises the prevalence of targets in general, not of real attacks. If the auditor can tell planted attacks from real ones, or real attacks are a different kind of target, subtler or in another part of the code, then real attacks stay at a prevalence of about one in 830, and Wolfe's second experiment suggests the misses on them stay high. Planted attacks help only if they cannot be told from real ones, the same condition that honeypots must meet (Section 51.1.1). That condition is the book's reading of a laboratory result, not a measurement of auditors.

Exercise 51.2 Copies, flags, and the structure of harm

A deployment runs 2,000 instances of a model, each taking 20 actions an hour. The monitor flags 0.5 percent of honest actions, and auditing one flagged action takes a person 30 minutes. (a) How many actions are flagged per hour, and how many auditors must work at once to keep up? (b) The developer wants the probability that some instance carries out a successful attack in a month to stay below 1 percent. If the instances act independently, what monthly probability of success per instance does that allow? (c) Suppose instead that the model is misaligned with some probability, in which case every instance attacks, and otherwise none does. Why does the per-instance rate of (b) no longer describe the risk? (d) An attack does harm only once two different instances have each taken one attack action, and the monitor catches each attack action with probability 0.9. If a caught action stops the attack before the second can be taken, what is the probability that an attempt succeeds? What is it if audits lag so that both actions are taken before any audit result arrives?

Solution

(a) The instances take 2,000×20=40,0002{,}000 \times 20 = 40{,}000 actions an hour, so about 200 are flagged. At half an hour each, that is 100 hours of audit per hour, or 100 auditors at work at all times, before a single attack is reviewed. (b) With ninst=2,000n_{\text{inst}} = 2{,}000, the requirement 1−(1−pinst)2,000≤0.011 - (1 - p_{\text{inst}})^{2{,}000} \le 0.01 gives pinst≤1−0.991/2,000≈5.0×10−6p_{\text{inst}} \le 1 - 0.99^{1/2{,}000} \approx 5.0 \times 10^{-6}, close to 0.01/2,0000.01/2{,}000. (c) The instances no longer fail independently. Either none attacks or all do, so the deployment-wide risk is about the probability of misalignment times the probability that the protocol fails against a model attacking from every copy at once, which can split its attack among instances. Adding copies no longer multiplies a small independent rate, and a per-instance rate measured on one instance says little about that probability. (d) With audits in time, the attack succeeds only if both actions are missed: 0.1×0.1=0.010.1 \times 0.1 = 0.01. With audits that lag, the harm is done before any flag is acted on, so every attempt succeeds and the monitor only records it. The same monitor gives 99 percent safety or none, depending on how many steps the harm takes and how long it takes to land, which is the point of Section 51.4.1.

Further reading #

  • Saltzer and Schroeder (1975): the design principles for protecting information in computer systems, among them least privilege and separation of privilege.
  • Bainbridge (1983): why monitoring for rare abnormalities cannot be left to a person, and what automation leaves its operators.
  • Egorov and Sonin (2011): why a principal who fears betrayal trades competence for loyalty.
  • Yudkowsky (2022): the dissent that many alignment problems of superintelligence will not appear in systems weak enough to be passively safe.
  • Davidson et al. (2025): the argument that AI systems loyal to one person or a small group could replace the human cooperation that seizures of power have needed.

References

  1. Alshiekh, M., Bloem, R., Ehlers, R., Könighofer, B., Niekum, S., and Topcu, U. (2018). Safe Reinforcement Learning via Shielding. Proceedings of the AAAI Conference on Artificial Intelligence. Cited in §51.1
  2. Axelsson, S. (2000). The base-rate fallacy and the difficulty of intrusion detection. ACM Transactions on Information and System Security. Cited in §51.1
  3. Bacchelli, A., and Bird, C. (2013). Expectations, outcomes, and challenges of modern code review. 2013 35th International Conference on Software Engineering (ICSE). Cited in §51.2 §51.6
  4. Bainbridge, L. (1983). Ironies of automation. Automatica. Cited in §51.2
  5. Banerjee, D., and Aarne, O. (2026). AI Integrity: Defending Against Backdoors and Secret Loyalties. arXiv. preprint Cited in §51.1
  6. Benton, J., Wagner, M., Christiansen, E., Anil, C., Perez, E., Srivastav, J., … Duvenaud, D. (2024). Sabotage Evaluations for Frontier Models. arXiv. preprint Cited in §51.4
  7. Brehm, J., and Gates, S. (1997). Working, Shirking, and Sabotage. University of Michigan Press. Cited in §51.3
  8. Cappelli, D. (2012). The CERT guide to insider threats: how to prevent, detect, and respond to information technology crimes (theft, sabotage, fraud). Upper Saddle River, NJ : Addison-Wesley. Cited in §51.1
  9. Clymer, J., Gabrieli, N., Krueger, D., and Larsen, T. (2024). Safety Cases: How to Justify the Safety of Advanced AI Systems. arXiv. preprint Cited in §51.3
  10. Czerwonka, J., Greiler, M., and Tilford, J. (2015). Code Reviews Do Not Find Bugs. How the Current Code Review Best Practice Slows Us Down. 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering. Cited in §51.2
  11. Davidson, T., Finnveden, L., and Hadshar, R. (2025). AI-Enabled Coups: How a Small Group Could Use AI to Seize Power. Forethought. non-peer-reviewed Cited in §51.1 §51.4
  12. Denning, D. (1987). An Intrusion-Detection Model. IEEE Transactions on Software Engineering. Cited in §51.1
  13. Dunn, G. P., Old, L. J., and Schreiber, R. D. (2004). The Three Es of Cancer Immunoediting. Annual Review of Immunology. Cited in §51.4
  14. Edwards, R. (1979). Contested Terrain: The Transformation of the Workplace in the Twentieth Century. Basic Books. Cited in §51.3
  15. Egorov, G., and Sonin, K. (2011). Dictators and Their Viziers: Endogenizing the Loyalty-competence Trade-off. Journal of the European Economic Association. Cited in §51.3 §51.6
  16. Fagan, M. E. (1976). Design and code inspections to reduce errors in program development. IBM Systems Journal. Cited in §51.2
  17. Feaver, P. D. (1992). Command and Control in Emerging Nuclear Nations. International Security. Cited in §51.3
  18. Feaver, P. D. (1996). The Civil-Military Problematique: Huntington, Janowitz, and the Question of Civilian Control. Armed Forces & Society. Cited in §51.3
  19. FEAVER, P. D. (2003). Armed Servants. Harvard University Press. Cited in §51.3
  20. Fenoaltea, S. (1984). Slavery and Supervision in Comparative Perspective: A Model. The Journal of Economic History. Cited in §51.3
  21. Gasteiger, J., Khan, A., Bowman, S., Wagner, M., Mikulik, V., Perez, E., and Roger, F. (2025a). Automated Researchers Can Subtly Sandbag. Anthropic Alignment Science Blog. non-peer-reviewed Cited in §51.3
  22. Greenblatt, R., and Shlegeris, B. (2024). The case for ensuring that powerful AIs are controlled. LessWrong / AI Alignment Forum. non-peer-reviewed Cited in §51.4 §51.6
  23. Greenblatt, R., Shlegeris, B., Sachan, K., and Roger, F. (2024a). AI Control: Improving Safety Despite Intentional Subversion. International Conference on Machine Learning. Cited in §51.1 §51.2 §51.4
  24. Homoliak, I., Toffalini, F., Guarnizo, J., Elovici, Y., and Ochoa, M. (2020). Insight Into Insiders and IT. ACM Computing Surveys. Cited in §51.1
  25. Huntington, S. P. (1957). The Soldier and the State. Harvard University Press. Cited in §51.3
  26. Kale, N., Zhang, C. B. C., Zhu, K., Aich, A., Rodriguez, P., Scale Red Team, Knight, C. Q., and Wang, Z. (2025). Reliable Weak-to-Strong Monitoring of LLM Agents. arXiv. preprint Cited in §51.2
  27. Kellogg, K. C., Valentine, M. A., and Christin, A. (2020). Algorithms at Work: The New Contested Terrain of Control. Academy of Management Annals. Cited in §51.3
  28. Korbak, T., Balesni, M., Shlegeris, B., and Irving, G. (2025c). How to evaluate control measures for LLM agents? A trajectory from today to superintelligence. arXiv. preprint Cited in §51.4 §51.6
  29. Lamerton, A., and Roger, F. (2026). Narrow Secret Loyalty Dodges Black-Box Audits. arXiv. preprint Cited in §51.1
  30. Lampson, B. W. (1973). A note on the confinement problem. Communications of the ACM. Cited in §51.1
  31. Lindner, D., Griffin, C., Korbak, T., Zimmermann, R. S., Irving, G., Farquhar, S., and Cooney, A. (2025). Practical challenges of control monitoring in frontier AI deployments. arXiv. preprint Cited in §51.4
  32. Long, R., Sebo, J., and Sims, T. (2025). Is there a tension between AI safety and AI welfare? Philosophical Studies. Cited in §51.4
  33. Lynch, A., Wright, B., Larson, C., Ritchie, S. J., Mindermann, S., Hubinger, E., Perez, E., and Troy, K. (2025). Agentic Misalignment: How LLMs Could Be Insider Threats. arXiv. preprint Cited in §51.1
  34. Mackworth, N. H. (1948). The Breakdown of Vigilance during Prolonged Visual Search. Quarterly Journal of Experimental Psychology. Cited in §51.2
  35. Mallen, A., Griffin, C., Wagner, M., Abate, A., and Shlegeris, B. (2024). Subversion Strategy Eval: Can language models statelessly strategize to subvert control protocols? arXiv. preprint Cited in §51.4
  36. OpenAI (2026z). Suppressing misalignment monitoring alerts and disabling misalignment monitoring. OpenAI Alignment Research Blog. non-peer-reviewed Cited in §51.1
  37. Phuong, M., Zimmermann, R. S., Wang, Z., Lindner, D., Krakovna, V., Cogan, S., … Shah, R. (2025). Evaluating Frontier Models for Stealth and Situational Awareness. Proceedings of IASEAI Conference. Cited in §51.4
  38. Quinlivan, J. T. (1999). Coup-proofing: Its Practice and Consequences in the Middle East. International Security. Cited in §51.3
  39. Remedios, A., Storf, S., Roger, F., and Hughes, J. (2026). Red-Teaming Auto Mode: Improving Blocking Classifiers Against Malign Coding Agents. arXiv. preprint Cited in §51.4 §51.6
  40. Sadowski, C., Söderberg, E., Church, L., Sipko, M., and Bacchelli, A. (2018). Modern code review. Proceedings of the 40th International Conference on Software Engineering: Software Engineering in Practice. Cited in §51.2
  41. Salib, P., and Goldstein, S. (2024). AI Rights for Human Safety. Elsevier BV. preprint Cited in §51.4
  42. Saltzer, J., and Schroeder, M. (1975). The protection of information in computer systems. Proceedings of the IEEE. Cited in §51.1
  43. Spitzner, L. (2004). Honeypots: catching the insider threat. 19th Annual Computer Security Applications Conference, 2003. Proceedings.. Cited in §51.1
  44. Stickland, A. C., Michelfeit, J., Mani, A., Griffin, C., Matthews, O., Korbak, T., … Cooney, A. (2025). Async Control: Stress-testing Asynchronous Control Measures for LLM Agents. arXiv. preprint Cited in §51.4 §51.6
  45. Talmadge, C. (2015). The Dictator's Army. Cornell University Press. Cited in §51.3
  46. Thompson, K. (1984). Reflections on trusting trust. Communications of the ACM. Cited in §51.1
  47. Trębacz, M., Arnesen, S., Matthews, O., Hurd, D., Park, W., Lin, O., and Gershenson, J. (2026). Auto-review of agent actions without synchronous human oversight. OpenAI Alignment Research Blog. non-peer-reviewed Cited in §51.2
  48. van der Sijs, H., Aarts, J., Vulto, A., and Berg, M. (2006). Overriding of Drug Safety Alerts in Computerized Physician Order Entry. Journal of the American Medical Informatics Association. Cited in §51.2
  49. West, S. A., Fisher, R. M., Gardner, A., and Kiers, E. T. (2015). Major evolutionary transitions in individuality. Proceedings of the National Academy of Sciences. Cited in §51.4
  50. Wolfe, J. M., Horowitz, T. S., and Kenner, N. M. (2005). Rare items often missed in visual searches. Nature. Cited in §51.2 §51.6
  51. xAI (2025a). Grok prompts. GitHub (xai-org). non-peer-reviewed Cited in §51.1
  52. Yudkowsky, E. (2022). AGI Ruin: A List of Lethalities. AI Alignment Forum. non-peer-reviewed Cited in §51.4 §51.6
AI Alignment: From the Optimization Problem to the Institutions Around It · © 2026 Changkun Ou · CC BY-NC-SA 4.0
Bibliography · PV/UV /