OrbitalProof · Wi-Fi security · for a technical reader
A memory ceiling for post-quantum Wi-Fi, proved in a model: the lab’s exact wording
The lab’s own sentences and figures for this result, word for word, in its working terms, with its limits in plain words where the lab’s text cannot be reprinted. The plain account is on the result’s page; it says the same things in plain words.
The lab’s plain-English sentence
A computer-checked proof of a simple reservation rule — each half-finished sign-in reserves a full 16-kilobyte slot up front and a fifth is refused — showing that a Wi-Fi access point running the lab's admission-control module never holds more than 64 kilobytes of half-received sign-in messages from devices it has not yet verified, no matter how many devices an attacker makes connect at once
- though as built an attacker who starts four sign-ins and never finishes them locks every other device out
[Plain gloss of the sentence above: the bound is proved for a hand-written Lean model of the admission-control module, not its code or a real access point. In the model the access point reserves four 16 KiB slots and refuses a fifth; the lab’s account is that four unfinished sign-ins therefore block other devices.]
Proved for any number of sessions
never exceeds 64 KiB, with at most 4 live contexts
The limit to read first, in the lab’s words
Measured on the Python reference path; no 802.11 frame crosses a radio.
Claim
Under an adversary-chosen schedule over an unbounded number of concurrent sessions, the AP's total pre-authentication reassembly residency never exceeds 64 KiB, with at most 4 live contexts.
Limits
[The lab’s limits name program files this site does not serve, so they are not reprinted word for word. In plain words: the proof covers a hand-written model of the admission-control module alone, not the lab’s full set of repairs as shipped, which do not yet use the module; the Python reference path was exercised separately, with no radio, and no over-the-air figure is published; it bounds how many sign-ins are held at once, not the size of one flood; and the cap depends on two deployment settings, so other settings give another cap.]
More
- The plain account of this result: the problem, what was shown, what it means for a buyer, who we expect would buy, why now, why you can trust the check, and what it does not show yet.
- This result’s file, the source of every sentence above.
- The formal statement of this result, set as a formula, with the other formal statements.