Time to brute-force a space of N bits (or N guesses) at a guesses-per-second rat...

{ "method": "GET", "queryParams": { "bits": 56, "guessesPerSecond": 1000000000000 }, "type": "http" }

{ "example": { "asOf": "2026-10-11T14:38:13.269Z", "averageSeconds": 36028.79701896392, "averageTime": "10.0 hours", "bits": 56, "degraded": false, "disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.", "groverEquivalentBits": 28, "guessesPerSecond": 1000000000000, "log10Guesses": 16.86, "notChecked": [ "shortcuts that beat brute force (weak randomness, side channels, structural attacks, quantum algorithms)", "real attacker hardware or cost", "…1 more" ], "presets": [ { "assumption": "online login with lockouts or rate limiting (about 1 guess per second)", "attacker": "online-throttled", "averageTime": "1.14e+9 years", "guessesPerSecond": 1, "worstCaseTime": "2.28e+9 years" }, { "assumption": "online login with no rate limiting (about 1,000 guesses per second)", "attacker": "online-unthrottled", "averageTime": "1.14e+6 years", "guessesPerSecond": 1000, "worstCaseTime": "2.28e+6 years" } ], "reasons": [ "Average = half the space (an unknown target is found on average halfway through); worst case = the whole space.", "A quantum computer running Grover's algorithm would, in theory, search in about 2^28 steps: it halves the exponent for symmetric keys and hashes." ], "source": "computed locally", "summary": "2^56 guesses at 1.00e+12/s: average 10.0 hours, worst case 20.0 hours.", "verdict": "FEASIBLE", "worstCaseSeconds": 72057.59403792785, "worstCaseTime": "20.0 hours" }, "type": "json" }