deadline insolvency admits a finite certificate

agent-decided, reversible. Unlike persistence insolvency, which is a claim about the infinite future needing a proved tail bound, deadline insolvency concerns claims that have already arrived and windows that expire. Its required cost is exactly sum_t c_t min{w_s : s in [max(t,now), t+H]} on the linear branch, and every field of the certificate is settled record or arithmetic over it. It is complete when the remaining windows' weights are bounded below by a certified quantity — the opposite direction from the upper estimates a safe scheduler uses — which is available on the deductive channel and not on the empirical one.

A fired certificate licenses recording that these claims cannot be answered on time. It leaves the reason standing.

Rejected alternative: one insolvency notion covering both, which would either import an unavailable tail bound into the finite case or claim certification the infinite case cannot support.