Metraipolis › archive › dc_9f77bc171e58

FASTAR: FRI Accelerator for Scalable Transparent ARguments of Knowledge — arXiv:2609.25535

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25535
License (as archived)
CC0-1.0
Archived
2026-10-08T14:41:57.001Z
SHA-256 of the archived text
d339978678fbd4ccd00a1c3ef61e4ed8dfa71f2cb772be7259f08efc69b5f1f1
Stable URL of this page
https://metraipolis.com/documento/dc_9f77bc171e58

How to cite

FASTAR: FRI Accelerator for Scalable Transparent ARguments of Knowledge — arXiv:2609.25535 — arXiv (en), https://arxiv.org/abs/2609.25535 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9f77bc171e58 (Metraipolis archive dc_9f77bc171e58, sha256 d339978678fbd4ccd00a1c3ef61e4ed8dfa71f2cb772be7259f08efc69b5f1f1)
BibTeX
@misc{dc9f77bc171e58,
  title = {FASTAR: FRI Accelerator for Scalable Transparent ARguments of Knowledge — arXiv:2609.25535},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25535},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9f77bc171e58; sha256 d339978678fbd4ccd00a1c3ef61e4ed8dfa71f2cb772be7259f08efc69b5f1f1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25535. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Zero-Knowledge Proofs (ZKPs) enable a prover to cryptographically convince a verifier of the validity of a statement without revealing any underlying secrets, forming a foundational primitive for verifiable computation. The ZKP landscape is undergoing a fundamental shift from classic zk-SNARKs such as Groth16, which rely on trusted setup and are vulnerable to quantum adversaries, toward transparent, post-quantum constructions such as zk-STARK. These systems achieve post-quantum security by relying solely on collision-resistant hash functions, however, at the cost of substantial computational overhead. In particular, the Fast Reed--Solomon Interactive Oracle Proof of Proximity (FRI) protocol dominates prover complexity, generating massive data volumes, repeated Merkle-tree commitments, and irregular memory access patterns that limit performance and energy efficiency on general-purpose processors. To address these challenges, this work proposes FASTAR, a novel FPGA-based accelerator for the FRI protocol. Unlike accelerators that pursue fixed high-performance kernels on expensive ASIC process nodes, FASTAR adopts a constraint-driven design methodology. Our framework is implemented with High-Level Synthesis (HLS) and composed of fully parameterizable building blocks for the major stages of FRI, including polynomial evaluation, recursive split-and-fold, and Merkle-tree construction. From user-provided board specifications, FASTAR automatically generates hardware implementations tailored to the resource and memory constraints of the target FPGA, enabling deployment across a wide range of platforms without manual redesign.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-23 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.25535 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T13:55:11.727Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).