Logo
TLCTC
ⓘ The bundled attack paths are AI-assisted analyses of public threat reporting; their Δt values are estimates from that reporting. They illustrate the practical application of the TLCTC framework.
Attack velocity vs. defender time

Δt Race

Pick an attack path and enter how long you take to detect and to contain each cluster at the 90th percentile. For every transition the Race computes DCS_d = TTD_P90 / Δt and DCS_c = TTC_P90 / Δt (core §7.2): below 1 you act before the attacker completes the step, above 1 the step completes first — and only containment stops it.

Attack path

Δt per transition

Corpus P10: the fast tail of that transition across all bundled attack paths (core §7.2 reads a Δt distribution at P10). Needs at least 3 measured values; otherwise the path's own Δt is used.

Your times (P90)

Time to detect and time to contain activity of each cluster, at the 90th percentile. 15m, 2h, 1d or ISO 8601 (PT15M). A mean (MTTD, MTTC) is the special case where no P90 exists.

DCS targets

Per velocity class, set from risk appetite. Defaults are the example values of application §10.3.

VC-4 (under a minute): no target — detection and response are structurally too slow; prevention only.

Where you stop the attacker

The race, transition by transition

Attacker Δt Your TTD (P90) Your TTC (P90) deadline

Log time scale. A defender bar that ends left of the dashed deadline beats the attacker to the next step. Each transition is measured against your times for the step the attacker is leaving.

Reading (core §7.2, application §10.2). DCS < 1: you act before the attacker completes the transition. DCS = 1: marginal, no buffer. DCS > 1: the step completes first. Only DCS_c < 1 stops a transition; DCS_d < 1 with DCS_c > 1 means the step was seen but completed anyway.

This tool's conventions. A transition X → Y is measured against your times for X. Velocity classes are binned at <60 s (VC-4), <60 min (VC-3), <24 h (VC-2), otherwise VC-1; the core defines the classes by scale only. A Δt recorded as an upper bound (<10m) makes every score a lower bound. Unresolved steps (?, …) form no transitions (R-UNRES-3).