3 ms·
Not much better i guess? You'd have to model in the SAT-solver what is already more or less efficiently done here. My best guess would be that the SAT-solver w
by metafex 11y ago
Not much better i guess? You'd have to model in the SAT-solver what is already more or less efficiently done here.
My best guess would be that the SAT-solver would be a lot slower, as this PoW system is mostly based on memory latency. From the paper: "Runtime is linear in graph size
and dominated by random access latency"
- DanWaterworth 11y agoI think it's worth trying. I'm not confident that it would be faster, but perhaps a SAT-solver would be able to more efficiently prune the search space meaning fewer random accesses.
- tromp 11y agoThat seems backwards. The random memory accesses are used to prune the search space.