OpenFrontiers
Join
← Back to the index
OP-8047Status unassessedCryptography

Miscellaneous · Question 1

Quantum algorithms for analysis of public-key crypto · Historical workshop question

MSC 94A60 · Cryptography

Inferred from the community field; finer classification has not been reviewed.

Historical list · status unassessedAs of 2026-09-08Source & evidence ↓
Read original source ↗ 0Submit progressLean 4 ↓Discussion (0)

Problem statement

Parameters: n≥2n \geq 2 and α>0\alpha > 0. Given independent uniformly random x1,x2,⋯∈Sn−1={v∈Rn:∥v∥2=1}x_1, x_2, \dots\in S^{n-1} = \{v \in \mathbb R^n : \|v\|_2 = 1\}, how quickly can we find a subsequence that covers Sn−1S^{n-1}? (Here, ``covers" means that every point of Sn−1S^{n-1} is within angle α\alpha of a point in the subsequence.) For example, consider the case when n=1000n = 1000 and α=75∘\alpha = 75^\circ.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Share a formalization →Verification guide ↗

Progress & source assessment

Historical workshop record. Current open/solved status has not been independently reassessed.

The source supplies no status note for this question.

References
  1. [1]Quantum algorithms for analysis of public-key crypto link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.