[ P(t) = 2^{-t/T} ]
Consider a master key used to derive subkeys for microservices. In version 1.0, you might rotate that master key every 90 days. In 1.1, you realize: after 1000 derivations, the key’s effective strength has halved. Not because the math broke, but because side channels, memory scraping, and log leaks chip away at the secret bit by bit. key half life 1.1
This is the quiet revolution of 1.1: moving from static security to kinetic security . The half-life is not a warning. It is a design parameter. [ P(t) = 2^{-t/T} ] Consider a master
Key Half-Life 1.1 introduces a crucial refinement: The half-life is not just a function of time, but of access, re-use, and entropy decay. Every time the key unlocks a door—every session, every API call, every wrapped secret—the half-life shortens. Not linearly. Not predictably. But inexorably. Not because the math broke, but because side
So when you generate that new RSA-4096 or Ed25519 key, do not ask "How long will this last?" Ask: "What is its half-life under load?" And if the answer is less than the life of your session, you are finally building for the world as it is—not as 1.0 wished it to be.
The formula is no longer:
Version 1.0 of key half-life was simple. It said: After time T, a cryptographic key has a 50% chance of being compromised. That was the era of Moore’s Law as a gentle slope, where attack surfaces were smaller and trust was implicit. But threats don't stand still.