I think there are a few candidate computational problem domains that fit the (useful work / fast verification) conundrum. My idea for solving some of the proble

I think there are a few candidate computational problem domains that fit the (useful work / fast verification) conundrum. My idea for solving some of the problems of a useful work approach: 1) To make it distributed Have a set of institutional (eg. Ivy League University Labs) generators that publically post their "Work Units" on their websites and miners attack these problems in round robin fashion. 2) To prevent pre-computation attacks Have a problem space that is so vast it would be worse than lottery ticket level foolish to try to precompute a solution. Then use a secure hash algorithm seeded with data from the last block to randomly select the "Work Unit" on a particular lab website to work on. 3) Uneven work cost / solution convergence Have a set of objective pseudo metrics for distributing rewards. I'm trying not to be too coy but there are definitely computational problem domains where you could 'bernoulli' control reward frequency and still make useful work progress.