You may be interested in this paper: https://eprint.iacr.org/2021/1379 https://eprint.iacr.org/2021/1379 It provides a Proof-of-Useful-Work algorithm that is

You may be interested in this paper: https://eprint.iacr.org/2021/1379 https://eprint.iacr.org/2021/1379 It provides a Proof-of-Useful-Work algorithm that is resistant to pre-computation and most other weaknesses that would otherwise prevent useful work from being done while achieving Nakamoto Consensus while at the same time managing to convert ~50% of the computation spent into useful work. Additionally the work being done is pretty generally useful and is applicable to a lot of different problems. I think the space is starting to reach a point of academic maturity and formalisation of the tech stack such that we can start meaningfully trying to solve these types of problems.