Branches [...] cost silicon space on ASIC chips [...]
Now that is one of the weirdest claims I read on this site.
You seem to be unaware of the existence of the whole areas of the
https://en.wikipedia.org/wiki/Automata_theory that study things different than the prevailing
https://en.wikipedia.org/wiki/Von_Neumann_architecture .
Are there any reputable schools granting Computer Science degrees without requiring the student to understand the fundamentals of digital logic design (e.g. a flip-flop)?
Whole message quoted again for posterity:
Branches are notoriously slow on GPU, and cost silicon space on ASIC chips, so if there was a PoW which required a lot of branches and which couldn't be simplified by using memory tables and precomputions, this would seem like a good alternative to memory-hard PoW.
Has there been any research into PoW algorithms which are branching-hard?