Author

Jiaxin Guan

h-index 7 View on Semantic Scholar

We have 1 of 22 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Aug 2026

A Complexity-Theoretic Approach to Proofs of Space

It is shown that non-trivial PoS follow from (a) $\mathsf{E}=\mathsf{DTIME[2^{O(n)}]}$ is hard for exponential-size nondeterministic circuits, and (b) collision-resistant hash functions, and (c) SNARGs for $\mathsf{P}$.

Marshall Ball, Jiaxin Guan · IACR Cryptology ePrint Archi... · 0 citations