Browse

Claims

Search the graph by meaning. Each result carries its current verdict; open one to see its decomposition, provenance, and the reasoning behind the assessment.

1 claim

The open question whether one-way functions exist: functions that are efficiently computable but hard to invert on average. Covers the existence question, its equivalence to other primitives (pseudorandom generators, private-key cryptography), and candidate constructions (factoring, discrete log); excludes general polynomial-map invertibility (Jacobian conjecture tags) and specific factoring-algor

Cryptographic one-way functions exist.

UnassessedNo current assessment. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.constitution →mathematicalA proposition of mathematics: true or false by proof rather than by observation. Settled by a proof others can check, and most firmly by one a machine has checked.constitution →Computational complexity theoryimportance · minorImportance 0.35, from 0 to 1 · minor: narrow or largely settled, cheap to get right. Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

Contribute

If a claim here is wrong, or missing evidence, open it: every claim page carries its own entry for challenges, evidence, and corrections. If the graph is missing a claim entirely, propose it below. A proposal is reviewed on its merits; accepted claims are matched against the graph and enter it with their reasoning on record.