AI Pause Model

Open it side by side with the explanations.

Hover over a symbol to see its description. Red symbols are our estimates.

Full Trust

Effective Compute

dEdt=Ctrain(t) S(t)(1)\frac{dE}{dt} = C_{train}(t)\, S(t) \tag{1}
E(t)≡Ep(2)E(t) \equiv E_p \tag{2}

Merged Labs

C(t)=mC CAIFM(t)LH=mL LHAIFM(tp)(3)\begin{aligned} C(t) &= m_C\, C^{\mathrm{AIFM}}(t) \\ L_H &= m_L\, L_H^{\mathrm{AIFM}}(t_p) \end{aligned} \tag{3}

Compute Shares

C=Ctrain+Cxpm+Caut+Cext(4)\begin{gathered} C = C_{train} + C_{xpm} + C_{aut} + C_{ext} \end{gathered} \tag{4} Ctrain(t)=0Caut(t)=saut C(t)Cext=sext C(tp)Cxpm(t)=C(t)−Cext−Caut(t)(5)\begin{aligned} C_{train}(t) &= 0 \\ C_{aut}(t) &= s_{aut}\, C(t) \\ C_{ext} &= s_{ext}\, C(t_p) \\ C_{xpm}(t) &= C(t) - C_{ext} - C_{aut}(t) \end{aligned} \tag{5}

Experiment Throughput

Coding Labor

Gi=LH,i+ηi Caut,iLC=max⁡(∫01GiρC di)1/ρC(6)\begin{gathered} G_i = L_{H,i} + \eta_i\, C_{aut,i} \\ L_C = \max \left(\int_0^1 G_i^{\rho_C}\, di\right)^{1/\rho_C} \end{gathered} \tag{6} ∫01LH,i di=LH,∫01Caut,i di=Caut(7)\int_0^1 L_{H,i}\, di = L_H, \qquad \int_0^1 C_{aut,i}\, di = C_{aut} \tag{7}

Automation

A(E)=min⁡(1,A∞1+e−k(log⁡E−x0))(8)A(E) = \min\left(1, \frac{A_\infty}{1 + e^{-k (\log E - x_0)}}\right) \tag{8} A(Ei)=i,A(EAC)=1(9)A(E_i) = i, \qquad A(E_{AC}) = 1 \tag{9} ηi(E)={ηinit(E/Ei)ηslope,i≤A(E)0,i>A(E)(10)\eta_i(E) = \begin{cases} \eta_{init} \left(E / E_i\right)^{\eta_{slope}}, & i \le A(E) \\ 0, & i > A(E) \end{cases} \tag{10}

Experiment Throughput

X=[αX C~xpm ρX+(1−αX) L~C ρX]1/ρXC~xpm=Cxpmζ,L~C=LCλ(11)\begin{gathered} X = \Big[\alpha_X\, \tilde C_{xpm}^{\,\rho_X} + (1 - \alpha_X)\, \tilde L_C^{\,\rho_X}\Big]^{1/\rho_X} \\ \tilde C_{xpm} = C_{xpm}^{\zeta}, \qquad \tilde L_C = L_C^{\lambda} \end{gathered} \tag{11}

Research Taste

TAISD(E)=TACSD+sT(log⁡E−log⁡EAC)TAI(E)=TH(TAISD(E))T(E)=EZ[max⁡(TH(Z),TAI(E))]Z∼N(0,1)(12)\begin{gathered} T_{AI}^{SD}(E) = T_{AC}^{SD} + s_T \left(\log E - \log E_{AC}\right) \\ T_{AI}(E) = T_H\big(T_{AI}^{SD}(E)\big) \\ T(E) = \mathbb{E}_Z\Big[\max\big(T_H(Z), T_{AI}(E)\big)\Big] \\ Z \sim \mathcal{N}(0, 1) \end{gathered} \tag{12}

Research Effort

RE=TX(13)RE = T X \tag{13}

Research Stock

RS(t)=∫−∞tRE dt′(14)RS(t) = \int_{-\infty}^{t} RE\, dt' \tag{14}
S=(RSRS0)1/β(15)S = \left(\frac{RS}{RS_0}\right)^{1/\beta} \tag{15}

Results

RSs=X(Cs,LC(Ns,Caut,s,E2025))(16)RS_s = X\big(C_s, L_C(N_s, C_{aut,s}, E_{2025})\big) \tag{16} cell=RS(tp+D)−RS(tp)RSs=1RSs∫tptp+DRE dt(17)\text{cell} = \frac{RS(t_p + D) - RS(t_p)}{RS_s} = \frac{1}{RS_s} \int_{t_p}^{t_p + D} RE\, dt \tag{17}
AI capability at the startPause duration
3 months9 months1.5 years3 years9 years
Jun 20279.1132.882.02271,490
May 202841.01513751,07010,100
Feb 20293721,2903,1408,84085,400
Oct 20295,64019,40046,900131,0001,280,000

AI safety work produced in a Full Trust pause, in years of the whole 2025 AI safety field's work.

Results Verification

Staff (18)LH=Ne+NvL_H = N_e + N_v
Compute (18)Cxpm=Ce+CrC_{xpm} = C_e + C_r
Research (19), (20)XeX_e, with taste T(Ep,Ne)T(E_p, N_e)
All papers∑i=1n\sum_{i=1}^{n}
Paper (22)i=1,…,ni = 1, \dots, n
Count11
Compute (24)cic_i
Research (24)ri=rs l∞(ci/cˉs)ζpr_i = r_s\, l_\infty (c_i / \bar c_s)^{\zeta_p}
Idea quality (30)viv_i
Research effort (30)REi=TviriRE_i = T v_i r_i
Review time (25)mhτm_h \tau
Checked papers (31)∑i=1nχi\sum_{i=1}^{n} \chi_i
Papers (29)nn
Checked (30)q nq\, n
Exploration (22)Ce/MC_e / M
Re-runs (34)Cr=κcψ Ce/MC_r = \kappa_c \psi\, C_e / M
Research (22)XeX_e
Research effort (30)REe=TXeRE_e = T X_e
Verified (21)REv=φhREeRE^v = \varphi_h RE_e
Review work (26)W=mhnτW = m_h n \tau
Verifiers (30)q W≤Nvq\, W \le N_v
The labs pick the NeN_e with the most REvRE^v (35). With unlimited hiring (36)–(37), every paper is checked.

Splits

Cxpm=Ce+CrLH=Ne+Nv(18)\begin{gathered} C_{xpm} = C_e + C_r \\ L_H = N_e + N_v \end{gathered} \tag{18}

Research

Xe=X(Ce,LC(Ne,Caut,Ep))(19)X_e = X\big(C_e, L_C(N_e, C_{aut}, E_p)\big) \tag{19}

Taste

T(E,Ne)=TAI(E)+∫z^∞max⁡(TH(z)−TAI(E),0) dΦ(z)z^=Φ−1(1−NeLH),T(E,LH)=T(E)(20)\begin{gathered} T(E, N_e) = T_{AI}(E) + \int_{\hat z}^{\infty} \max\big(T_H(z) - T_{AI}(E), 0\big)\, d\Phi(z) \\ \hat z = \Phi^{-1}\left(1 - \frac{N_e}{L_H}\right), \qquad T(E, L_H) = T(E) \end{gathered} \tag{20}

Verified Research

REe=T(Ep,Ne) XeREv=φh REe(21)\begin{gathered} RE_e = T(E_p, N_e)\, X_e \\ RE^v = \varphi_h\, RE_e \end{gathered} \tag{21}

Papers

Xe=∑i=1nri,Ce=M∑i=1nci=Mncˉ(22)X_e = \sum_{i=1}^{n} r_i, \qquad C_e = M \sum_{i=1}^{n} c_i = M n \bar c \tag{22}
ri=rs[l∞ρp(cicˉs)ζpρp+c∞ρp(lilˉs)λρp]1/ρpl∞ρp+c∞ρp=1ρp<0,li→∞:ri→rs[l∞ρp(cicˉs)ζpρp]1/ρp(23)\begin{gathered} r_i = r_s \left[l_\infty^{\rho_p} \left(\frac{c_i}{\bar c_s}\right)^{\zeta_p \rho_p} + c_\infty^{\rho_p} \left(\frac{l_i}{\bar l_s}\right)^{\lambda \rho_p}\right]^{1/\rho_p} \\ l_\infty^{\rho_p} + c_\infty^{\rho_p} = 1 \\ \rho_p < 0, \quad l_i \to \infty: \qquad r_i \to r_s \left[l_\infty^{\rho_p} \left(\frac{c_i}{\bar c_s}\right)^{\zeta_p \rho_p}\right]^{1/\rho_p} \end{gathered} \tag{23}
ri=rs l∞(cicˉs)ζpln⁡ci∼N(ln⁡cˉ−σc22,σc2)(24)\begin{gathered} r_i = r_s\, l_\infty \left(\frac{c_i}{\bar c_s}\right)^{\zeta_p} \\ \ln c_i \sim \mathcal{N}\left(\ln \bar c - \frac{\sigma_c^2}{2}, \sigma_c^2\right) \end{gathered} \tag{24}

Review Work

ts=Nsnsτ=κhts+phlog⁡10nns(25)\begin{gathered} t_s = \frac{N_s}{n_s} \\ \tau = \kappa_h t_s + p_h \log_{10} \frac{n}{n_s} \end{gathered} \tag{25} W=mh n τ=mhNs nns(κh+phtslog⁡10nns)(26)W = m_h\, n\, \tau = m_h N_s\, \frac{n}{n_s} \left(\kappa_h + \frac{p_h}{t_s} \log_{10} \frac{n}{n_s}\right) \tag{26}

Paper Count

kX=XeXs=nns⏟paper countvs 2025⋅l∞(cˉcˉs)ζp⏟research per papervs 2025(27)k_X = \frac{X_e}{X_s} = \underbrace{\frac{n}{n_s}}_{\substack{\text{paper count} \\ \text{vs 2025}}} \cdot \underbrace{l_\infty \left(\frac{\bar c}{\bar c_s}\right)^{\zeta_p}}_{\substack{\text{research per paper} \\ \text{vs 2025}}} \tag{27}
DerivationXe=rs l∞∑i=1n(cˉcˉs⋅cicˉ)ζp=n rs l∞(cˉcˉs)ζpEe[(cicˉ)ζp]Xs=rs∑i=1ns(cicˉs)ζp=ns rs Es[(cicˉs)ζp]Ee[(cicˉ)ζp]=Es[(cicˉs)ζp]=e−ζp(1−ζp)σc2/2\begin{gather*} X_e = r_s\, l_\infty \sum_{i=1}^{n} \left(\frac{\bar c}{\bar c_s} \cdot \frac{c_i}{\bar c}\right)^{\zeta_p} \\ = n\, r_s\, l_\infty \left(\frac{\bar c}{\bar c_s}\right)^{\zeta_p} \mathbb{E}_e\left[\left(\frac{c_i}{\bar c}\right)^{\zeta_p}\right] \tag{27a} \\ X_s = r_s \sum_{i=1}^{n_s} \left(\frac{c_i}{\bar c_s}\right)^{\zeta_p} = n_s\, r_s\, \mathbb{E}_s\left[\left(\frac{c_i}{\bar c_s}\right)^{\zeta_p}\right] \tag{27b} \\ \mathbb{E}_e\left[\left(\frac{c_i}{\bar c}\right)^{\zeta_p}\right] = \mathbb{E}_s\left[\left(\frac{c_i}{\bar c_s}\right)^{\zeta_p}\right] = e^{-\zeta_p (1 - \zeta_p) \sigma_c^2 / 2} \tag{27c} \end{gather*}
cˉcˉs=Ce/(Mn)Cs/(Mns)=kCn/ns,kC=CeCs(28)\frac{\bar c}{\bar c_s} = \frac{C_e / (M n)}{C_s / (M n_s)} = \frac{k_C}{n / n_s}, \qquad k_C = \frac{C_e}{C_s} \tag{28} nns=(kXl∞kCζp)1/(1−ζp)(29)\frac{n}{n_s} = \left(\frac{k_X}{l_\infty k_C^{\zeta_p}}\right)^{1/(1 - \zeta_p)} \tag{29}
DerivationkX=nns l∞(kCn/ns)ζp=l∞ kCζp(nns)1−ζp(nns)1−ζp=kXl∞kCζp\begin{gather*} k_X = \frac{n}{n_s}\, l_\infty \left(\frac{k_C}{n / n_s}\right)^{\zeta_p} = l_\infty\, k_C^{\zeta_p} \left(\frac{n}{n_s}\right)^{1 - \zeta_p} \tag{29a} \\ \left(\frac{n}{n_s}\right)^{1 - \zeta_p} = \frac{k_X}{l_\infty k_C^{\zeta_p}} \tag{29b} \end{gather*}
papers a year nn

Number of papers n(t)n(t) during the pause. Dots are the AI safety papers in our dataset.

Reviewer Budget

q=min⁡(1,NvW)vi∼Pareto(vm,αv),E[vi]=1REi=Tviri,∑i=1nREi=TXe=REe(30)\begin{gathered} q = \min\left(1, \frac{N_v}{W}\right) \\ v_i \sim \mathrm{Pareto}(v_m, \alpha_v), \qquad \mathbb{E}[v_i] = 1 \\ RE_i = T v_i r_i, \qquad \sum_{i=1}^{n} RE_i = T X_e = RE_e \end{gathered} \tag{30}
research effort φh\varphi_h65%
compute ψ\psi95%

Each dot is a simulated paper, lying on the surface of research effort over its idea quality and compute. The verifiers check the papers above the bar.

Top Papers

χi={1,REi among the top q of the papers0,otherwiseφh(q)=∑i=1nχi REi∑i=1nREiψ(q)=∑i=1nχi ci∑i=1nci(31)\begin{gathered} \chi_i = \begin{cases} 1, & RE_i \text{ among the top } q \text{ of the papers} \\ 0, & \text{otherwise} \end{cases} \\ \varphi_h(q) = \dfrac{\sum_{i=1}^{n} \chi_i\, RE_i}{\sum_{i=1}^{n} RE_i} \\[4pt] \psi(q) = \dfrac{\sum_{i=1}^{n} \chi_i\, c_i}{\sum_{i=1}^{n} c_i} \end{gathered} \tag{31} ln⁡REi=ln⁡K+εiαv+σyξiεi∼Exp(1),ξi∼N(0,1),σy=ζpσcK=Trs l∞ vm(c~cˉs)ζp,c~=cˉ e−σc2/2(32)\begin{gathered} \ln RE_i = \ln K + \frac{\varepsilon_i}{\alpha_v} + \sigma_y \xi_i \\ \varepsilon_i \sim \mathrm{Exp}(1), \qquad \xi_i \sim \mathcal{N}(0, 1), \qquad \sigma_y = \zeta_p \sigma_c \\ K = T r_s\, l_\infty\, v_m \left(\frac{\tilde c}{\bar c_s}\right)^{\zeta_p}, \qquad \tilde c = \bar c\, e^{-\sigma_c^2 / 2} \end{gathered} \tag{32}
DerivationP(vi≥v)=(vmv)αv=P(εi≥αvln⁡vvm)vi=vmeεi/αvci=c~ eσcξiREi=Tvirs l∞(cicˉs)ζp=Keεi/αveζpσcξi\begin{gather*} \mathbb{P}(v_i \ge v) = \left(\frac{v_m}{v}\right)^{\alpha_v} = \mathbb{P}\left(\varepsilon_i \ge \alpha_v \ln \frac{v}{v_m}\right) \\ v_i = v_m e^{\varepsilon_i / \alpha_v} \tag{32a} \\ c_i = \tilde c\, e^{\sigma_c \xi_i} \tag{32b} \\ RE_i = T v_i r_s\, l_\infty \left(\frac{c_i}{\bar c_s}\right)^{\zeta_p} \\ = K e^{\varepsilon_i / \alpha_v} e^{\zeta_p \sigma_c \xi_i} \tag{32c} \end{gather*}
χi=1  ⟺  εiαv+σyξi≥uG(x,a)=Φ(−xσy)+e−ax+a2σy2/2 Φ(xσy−aσy)q=G(u,αv)ψ=G(u−σyσc,αv)φh=G(u−σy2,αv−1)(33)\begin{aligned} \chi_i = 1 &\iff \frac{\varepsilon_i}{\alpha_v} + \sigma_y \xi_i \ge u \\ G(x, a) &= \Phi\left(-\frac{x}{\sigma_y}\right) \\ &\quad + e^{-a x + a^2 \sigma_y^2 / 2}\, \Phi\left(\frac{x}{\sigma_y} - a \sigma_y\right) \\ q &= G(u, \alpha_v) \\ \psi &= G(u - \sigma_y \sigma_c, \alpha_v) \\ \varphi_h &= G(u - \sigma_y^2, \alpha_v - 1) \end{aligned} \tag{33}
Derivationq=E[χi],ψ=E[χici]E[ci]φh=E[χiREi]E[REi]G(x,a)=P(εia+σyξi≥x)=E[min⁡(1,e−a(x−σyξi))]E[f(ξi) eδξi−δ2/2]=E[f(ξi+δ)]E[1[σyξi<x] eaσyξi]=ea2σy2/2 Φ(xσy−aσy)v αvvmαvvαv+1=(αv−1) vmαv−1vαv,vm=1−1αvciE[ci]=eσcξi−σc2/2REiE[REi]=vi eσyξi−σy2/2\begin{gather*} q = \mathbb{E}[\chi_i], \qquad \psi = \frac{\mathbb{E}[\chi_i c_i]}{\mathbb{E}[c_i]} \\ \varphi_h = \frac{\mathbb{E}[\chi_i RE_i]}{\mathbb{E}[RE_i]} \tag{33a} \\ G(x, a) = \mathbb{P}\left(\frac{\varepsilon_i}{a} + \sigma_y \xi_i \ge x\right) \\ = \mathbb{E}\left[\min\left(1, e^{-a (x - \sigma_y \xi_i)}\right)\right] \tag{33b} \\ \mathbb{E}\left[f(\xi_i)\, e^{\delta \xi_i - \delta^2 / 2}\right] = \mathbb{E}\left[f(\xi_i + \delta)\right] \tag{33c} \\ \mathbb{E}\left[\mathbf{1}[\sigma_y \xi_i < x]\, e^{a \sigma_y \xi_i}\right] \\ = e^{a^2 \sigma_y^2 / 2}\, \Phi\left(\frac{x}{\sigma_y} - a \sigma_y\right) \tag{33d} \\ v\, \frac{\alpha_v v_m^{\alpha_v}}{v^{\alpha_v + 1}} = \frac{(\alpha_v - 1)\, v_m^{\alpha_v - 1}}{v^{\alpha_v}}, \qquad v_m = 1 - \frac{1}{\alpha_v} \tag{33e} \\ \frac{c_i}{\mathbb{E}[c_i]} = e^{\sigma_c \xi_i - \sigma_c^2 / 2} \\ \frac{RE_i}{\mathbb{E}[RE_i]} = v_i\, e^{\sigma_y \xi_i - \sigma_y^2 / 2} \tag{33f} \end{gather*}

Compute Budget

Cr=κc∑i=1nχici=κcMψCeCe(1+κcMψ)=Cxpm(34)\begin{gathered} C_r = \kappa_c \sum_{i=1}^{n} \chi_i c_i = \frac{\kappa_c}{M} \psi C_e \\ C_e \left(1 + \frac{\kappa_c}{M} \psi\right) = C_{xpm} \end{gathered} \tag{34}

Best Split

max⁡NeREv(35)\max_{N_e} RE^v \tag{35}

Unlimited Hiring

Nh=max⁡(0,Ne+W−LH)Nv=min⁡(W,LH−Ne)(36)\begin{gathered} N_h = \max\big(0, N_e + W - L_H\big) \\ N_v = \min\big(W, L_H - N_e\big) \end{gathered} \tag{36} φh=ψ=1Ce=Cxpm1+κc/M,REv=REe(37)\begin{gathered} \varphi_h = \psi = 1 \\ C_e = \frac{C_{xpm}}{1 + \kappa_c / M}, \qquad RE^v = RE_e \end{gathered} \tag{37}

Table

cell={full trust (17),Ep<EAC1RSs∫tptp+DREv dt,Ep≥EAC(38)\text{cell} = \begin{cases} \text{full trust (17)}, & E_p < E_{AC} \\[4pt] \dfrac{1}{RS_s} \displaystyle\int_{t_p}^{t_p + D} RE^v\, dt, & E_p \ge E_{AC} \end{cases} \tag{38}
AI capability at the startPause duration
3 months9 months1.5 years3 years9 years
Jun 20279.1132.882.02271,490
May 202839.21443601,0208,040
Feb 20293481,1802,7707,21050,800
Oct 20293,98013,20030,30077,300529,000

Only research that humans reviewed and reproduced counts. Gray numbers are Full Trust's: before AC there is nothing to verify.

Compartmentalization

Staff (39)Np+Nv≤LHN_p + N_v \le L_H
Compute (39)Cxpm=Ce+CrC_{xpm} = C_e + C_r
Research (40), (41)XeX_e at EACE_{AC}, with taste TwT_w
Planned papers (45)a random qpq_p
Paper (22)i=1,…,ni = 1, \dots, n
Count11
Compute (24)cic_i
Research (24)ri=rs l∞(ci/cˉs)ζpr_i = r_s\, l_\infty (c_i / \bar c_s)^{\zeta_p}
Idea quality (30)viv_i
Research effort (43)REi=TwviriRE_i = T_w v_i r_i
Planning time (42)mpτpm_p \tau_p
Review time (42)mhτm_h \tau
Checked papers (45)the top q/qpq / q_p
Planned (45)F=qpnF = q_p n
Checked (45)V=q nV = q\, n
Exploration (47)qpCe/Mq_p C_e / M
Re-runs (47)Cr=κcqpψ Ce/MC_r = \kappa_c q_p \psi\, C_e / M
Research (43)qpXeq_p X_e
Research effort (46)qpTwXeq_p T_w X_e
Verified (46)REv=qpφhTwXeRE^v = q_p \varphi_h T_w X_e
Planners (42)Np=FmpτpN_p = F m_p \tau_p
Review work (42)FmhτF m_h \tau
Verifiers (42)Vmhτ≤NvV m_h \tau \le N_v
Verifiers check the top q/qpq / q_p of the planned papers, so φh\varphi_h and ψ\psi are taken at q/qpq / q_p. The labs split the staff by (48). With unlimited hiring (49)–(50), every paper is planned and checked.

Splits

Ne→0Np+Nv≤LHCxpm=Ce+Cr(39)\begin{gathered} N_e \to 0 \\ N_p + N_v \le L_H \\ C_{xpm} = C_e + C_r \end{gathered} \tag{39}

Research

Xe=X(Ce,LC(0,Caut,EAC))(40)X_e = X\big(C_e, L_C(0, C_{aut}, E_{AC})\big) \tag{40}

Taste

T(E,0)=TAI(E)Tw=(1−w) TAI(EAC)+w TAI(Ep)(41)\begin{gathered} T(E, 0) = T_{AI}(E) \\ T_w = (1 - w)\, T_{AI}(E_{AC}) + w\, T_{AI}(E_p) \end{gathered} \tag{41}

Plans and Checks

F=min⁡(n,Npmpτp),V=min⁡(F,Nvmhτ)mpτp=κpts+pplog⁡10Fns,τ=κhts+phlog⁡10Fns(42)\begin{gathered} F = \min\left(n, \frac{N_p}{m_p \tau_p}\right), \qquad V = \min\left(F, \frac{N_v}{m_h \tau}\right) \\ m_p \tau_p = \kappa_p t_s + p_p \log_{10} \frac{F}{n_s}, \qquad \tau = \kappa_h t_s + p_h \log_{10} \frac{F}{n_s} \end{gathered} \tag{42}

Verified Research

REv=φh(VF)F Twrˉrˉ=Xen(43)\begin{gathered} RE^v = \varphi_h\left(\frac{V}{F}\right) F\, T_w \bar r \\ \bar r = \frac{X_e}{n} \end{gathered} \tag{43}

Planning Work

Wp=n mpτp∣F=n=Ns nns(κp+pptslog⁡10nns)(44)W_p = n\, m_p \tau_p \big|_{F = n} = N_s\, \frac{n}{n_s} \left(\kappa_p + \frac{p_p}{t_s} \log_{10} \frac{n}{n_s}\right) \tag{44} qp=Fn,qp=1  ⟺  Np≥Wpq=Vn=min⁡(qp,Nvn mhτ)(45)\begin{gathered} q_p = \frac{F}{n}, \qquad q_p = 1 \iff N_p \ge W_p \\ q = \frac{V}{n} = \min\left(q_p, \frac{N_v}{n\, m_h \tau}\right) \end{gathered} \tag{45} REv=qp φh(qqp)TwXeG(u,αv)=qqpφh=G(u−σy2,αv−1),ψ=G(u−σyσc,αv)(46)\begin{gathered} RE^v = q_p\, \varphi_h\left(\frac{q}{q_p}\right) T_w X_e \\ G(u, \alpha_v) = \frac{q}{q_p} \\ \varphi_h = G(u - \sigma_y^2, \alpha_v - 1), \qquad \psi = G(u - \sigma_y \sigma_c, \alpha_v) \end{gathered} \tag{46}

Compute Budget

Cr=κcM qp ψ(qqp)CeCe(1+κcM qp ψ(qqp))=Cxpm(47)\begin{gathered} C_r = \frac{\kappa_c}{M}\, q_p\, \psi\left(\frac{q}{q_p}\right) C_e \\ C_e \left(1 + \frac{\kappa_c}{M}\, q_p\, \psi\left(\frac{q}{q_p}\right)\right) = C_{xpm} \end{gathered} \tag{47}

Planning vs Verifying

max⁡NpREv(48)\max_{N_p} RE^v \tag{48}

Unlimited Hiring

Nh=max⁡(0,Wp+W−LH)(49)N_h = \max\big(0, W_p + W - L_H\big) \tag{49} qp=q=1Ce=Cxpm1+κc/M,REv=TwXeNp+Nv=min⁡(LH,Wp+W)(50)\begin{gathered} q_p = q = 1 \\ C_e = \frac{C_{xpm}}{1 + \kappa_c / M}, \qquad RE^v = T_w X_e \\ N_p + N_v = \min\big(L_H, W_p + W\big) \end{gathered} \tag{50}

Table

cell={results verification (38),Ep<ESAR1RSs∫tptp+DREv dt,Ep≥ESAR(51)\text{cell} = \begin{cases} \text{results verification (38)}, & E_p < E_{SAR} \\[4pt] \dfrac{1}{RS_s} \displaystyle\int_{t_p}^{t_p + D} RE^v\, dt, & E_p \ge E_{SAR} \end{cases} \tag{51}
AI capability at the startPause duration
3 months9 months1.5 years3 years9 years
Jun 20279.1132.882.02271,490
May 202839.21443601,0208,040
Feb 20291374711,1303,14024,100
Oct 20299393,1807,54020,500156,000

Only research that humans planned, reviewed and reproduced counts. Gray numbers are Results Verification's: before SAR there is nothing to compartmentalize. The main page shows this table.

Workload Approval

Engineer's coding labor (40)LC(0,Caut,EAC)L_C(0, C_{aut}, E_{AC})
Auditors (52)NaN_a, of the WaW_a needed
Approved coding labor (52)LCaL_C^a
Research (53)Xe=X(Ce,LCa)X_e = X(C_e, L_C^a)
Verified (46)REv=qp φh(q/qp) TwXeRE^v = q_p\, \varphi_h(q / q_p)\, T_w X_e
From the research on, everything is as in Compartmentalization (41)–(50).

Approval

Wa=κa LC(0,Caut,EAC)LCa=min⁡(LC(0,Caut,EAC),Naκa)(52)\begin{gathered} W_a = \kappa_a\, L_C(0, C_{aut}, E_{AC}) \\ L_C^a = \min\left(L_C(0, C_{aut}, E_{AC}), \frac{N_a}{\kappa_a}\right) \end{gathered} \tag{52}

Research

Xe=X(Ce,LCa)(53)X_e = X\big(C_e, L_C^a\big) \tag{53}

Table

cell={compartmentalization (51),Ep<ESAR1RSs∫tptp+DREv dt,Ep≥ESAR(54)\text{cell} = \begin{cases} \text{compartmentalization (51)}, & E_p < E_{SAR} \\[4pt] \dfrac{1}{RS_s} \displaystyle\int_{t_p}^{t_p + D} RE^v\, dt, & E_p \ge E_{SAR} \end{cases} \tag{54}
AI capability at the startPause duration
3 months9 months1.5 years3 years9 years
Jun 20279.1132.882.02271,490
May 202839.21443601,0208,040
Feb 202956.11864231,0506,150
Oct 20293541,1602,6006,35036,200

Only research that humans planned, approved, reviewed and reproduced counts. Gray numbers are Results Verification's: before SAR there is nothing to compartmentalize.

Number of Auditors

AI safety years
auditors NaN_a

AI safety years with NaN_a auditors. Dots are the table's 20,000.