PoSME enforces strict sequential memory execution via latency-bound pointer chasing and symbiotic causal hash binding, delivering time-memory trade-off resistance and DRAM-latency ASIC bounds.
Towards practical data-dependent memory- hard functions with optimal sustained space trade-offs in the parallel random oracle model
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
PoSME: Proof of Sequential Memory Execution via Latency-Bound Pointer Chasing with Causal Hash Binding
PoSME enforces strict sequential memory execution via latency-bound pointer chasing and symbiotic causal hash binding, delivering time-memory trade-off resistance and DRAM-latency ASIC bounds.