{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihrbzhqa5gnshbhx5wa7yifvfk5dqf3wj4j4odg55alvq2dwneinq",
    "uri": "at://did:plc:haakkg7y3xdghcdmprxeexso/app.bsky.feed.post/3mj63n2lkd6y2"
  },
  "path": "/t/a-cryptography-engineer-s-perspective-on-quantum-computing-timelines/37010#post_12",
  "publishedAt": "2026-04-10T18:13:29.000Z",
  "site": "https://discuss.privacyguides.net",
  "tags": [
    "https://x.com/FiloSottile/status/1544680637638008833"
  ],
  "textContent": "The same author talked about there being a practical limit to circuit depth https://x.com/FiloSottile/status/1544680637638008833\n\nDirect quote being\n\n> This MAXDEPTH is realistically around 2⁴⁰, which makes a quantum attack against a 128-bit cipher take more than 2¹²⁸ anyway.\n\nI’m unsure if they meant 256-bit ciphers take more than 2¹²⁸. But still, from what I gather, O(sqrt(n)) is an ideal runtime, not what’s possible in practice.",
  "title": "A Cryptography Engineer’s Perspective on Quantum Computing Timelines"
}