Efficient HW/SW partitioning of Halo: FPGA-accelerated recursive proof composition in blockchain

【Author】 Akeela, Rami; Krawiec-Thayer, Mitchell P.

【Source】MICROSYSTEM TECHNOLOGIES-MICRO-AND NANOSYSTEMS-INFORMATION STORAGE AND PROCESSING SYSTEMS

【影响因子】2.012

【Abstract】The blockchain space has seen tremendous innovation and advancement, in the last few years with an explosion of functionality and use cases. However, several challenges naturally arise from the nature of these distributed systems-energy efficiency, privacy, and scalability challenges due to the computational resources required to generate, validate, and store the cryptographic proofs that provide immutable security. New applications of recursive proof composition offer paradigmatic improvements that effectively address these challenges. This paper addresses the practical implementation of these theoretical advances. We demonstrate how HW/SW co-design methods can be algorithmically applied to identify practical hardware optimizations for the cryptographic verification of these zero-knowledge proofs, using Halo as an example. We offer a partitioning methodology of blockchain operations and then discuss the use of the Binary Particle Swarm Optimization (BPSO) algorithm for systemic optimization. To demonstrate our methodology, we implement the Halo algorithm on the Xilinx Zynq-7000 System-on-Chip (SoC). We successfully achieve a considerable speedup of 2.2x, compared to a software-only implementation on a CPU.

【Keywords】

【发表时间】2021 SEP

【收录时间】2022-01-02

【文献类型】

【主题类别】

--