Blockchain & Distributed Consensus

Status	Problem	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
	Optimal martingale gap finders Open for small \(\mu\). Settled when \(\mu\) is bounded away from zero, where the Cleve-Impagliazzo gap finder already gives the conjectured product; for general \(\mu\) the known bound is a factor \(\mu\) short and the paper states it does not know the answer. 5 open	Coin Tossinglower-bound
	Partial-PKI consensus up to one-half resilience Open: whether consensus is achievable at every resilience \(\gamma<1/2\) in the paper’s permissionless common-random-string setting, by some protocol using any means of bootstrapping party identities. The source proves resilience up to \(\tfrac14(1-3\epsilon)\) via a specific protocol and proves \(1/4\) is tight only for the restricted class of protocols that sign everything they send and verify everything they receive; the gap to the classical \(1/2\) ceiling is open for arbitrary protocols. 5 open	Byzantine Agreementtight-boundIOG