{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihbdwtzcftd4csv4q24b4b7co72zsjrx66zljmq5bcioodoagbvyi",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3miei67dqxvd2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.27398v1",
  "publishedAt": "2026-03-31T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Daqing Wan"
  ],
  "textContent": "**Authors:** Daqing Wan\n\nvan Emde Boas (1981) conjectured that computing a shortest non-zero vector of a lattice in an Euclidean space is NP-hard. In this paper, we prove that this conjecture is true and hence de-randomize the classical randomness result of Ajtai (1998). Our proof builds on the construction of Bennet-Peifert (2023) on locally dense lattices via Reed-Solomon codes, and depends crucially on the work of Deligne on the Weil conjectures for higher dimensional varieties over finite fields.",
  "title": "NP-hardness of SVP in Euclidean Space"
}