Non-Falsifiable

Status	Statement	Tags
	Dream DPT for a moderately hard function Open: whether there exists a function family, and a standard fine-grained hardness hypothesis (the paper suggests NSETH as an example), for which solving t independent instances requires resources within a subexponentially small factor of solving them one at a time, with no loss in the exponent. The source reduces its permissionless consensus protocol to exactly this statement and leaves it unconstructed. 5 open	Direct Product Theorems Fine Grained CryptographyassumptionIOG
	Subexponential-query PCF from sparse LPN Open in both directions, and the source paper poses it as a question rather than conjecturing an answer; the affirmative direction is this page’s reading. The one follow-up construction from sparse LPN inherits the same superpolynomial ceiling and says so. 6 open	Learning Parity With Noise Pseudorandom Correlation Functions Random Oracle Modelromassumption
	Standard-model weak PCF from sparse LPN Open, posed by the source as its second open question with an obstruction it names explicitly; the affirmative direction is this page’s reading. An independent follow-up construction reports the same random oracle as inherent to the same recursion. 6 open	Learning Parity With Noise Pseudorandom Correlation Functions Random Oracle Modelassumption