hash-circuits

KO | EN

gitlite — search

#python #ai #android #linux #docker #macos #java #windows #kubernetes #vue #security #ios #mcp #openai

(★ 29)

Hashing circuits implemented in circom

hash-circuits 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

hash-circuits
=============

copyright: (c) 2023-2025 Faulhorn Labs  
author: Balazs Komuves  
license: MIT  
disclaimer: Experimental software, use at your own risk!

What's this about?
------------------

This repository contains [`circom`](https://docs.circom.io/) implementations 
of some popular hash functions:

- SHA2: SHA224 / SHA256 / SHA384 / SHA512
- Keccak / SHA3: Keccak-224, Keccak-256, Keccak-384, Keccak-512 + the SHA3 versions
- SHA3 XOFs: SHAKE128, SHAKE256
- Blake2: BLAKE2s-256 and BLAKE2b-256
- Poseidon2 (Merkle tree and sponge construction for the bn254 scalar field and t=3)
- Griffin (permutation only; for the bn254 scalar field and t=3)
- MiMC: MiMC and MiMC-Feistel block ciphers and hashes (Merkle-Damgard for MiMC and sponge for MiMC-Feistel; bn128 scalar field)

Circom is a programming language describing arithmetic circuits and/or R1CS 
constraints. These are used in some constructions of zero-knowledge proofs
and related technologies.

Circuit sizes
-------------

The author believes that the R1CS / arithmetic circuit format allows very limited
opportunities for optimizing hash function circuits, nevertheless some effort 
was put into optimization (in particular for SHA256).

Approximate counts of nonlinear R1CS constraints:

- Permutation:
    - Keccak-f[1600]: 146000  (1600 bits)
    - Poseidon2:      240     (3 field elements; approx 760 bits)
    - Griffin:        96      (3 field elements; approx 760 bits)
    - MiMC:           330     (1 field element;  approx 254 bits)
    - MiMC-Feistel:   660     (2 field elements; approx 507 bits)
- Compression (two-to-one):
    - SHA256:         26170
    - Keccak256:      144830
    - Poseidon2:      240
    - Griffin:        96
    - MiMC:           330
- Hashing (per native chunk):
    - SHA256:         26200   (about 13% less than the one in `circomlib`)
    - BLAKE2s:        32600
    - Keccak256:      147000
    - Poseidon2:      250
    - MiMC-MD:        330
    - MiMC-Feistel:   660 
- Hashing (per byte):
    - SHA256:         410
    - BLAKE2s:        509
    - Keccak256:      1100
    - Poseidon2:      8
    - MiMC-MD:        10.5
    - MiMC-Feistel    21

Tests and reference implementation
----------------------------------

Reference implementations and tests are written in [Haskell](https://www.haskell.org/). 
The tests are using the [`r1cs-solver`](https://github.com/faulhornlabs/r1cs-solver/) 
testing framework (though we mostly only use to trivial part of that, automating the 
`circom` workflow).

We also use the [`zikkurat-algebra`](https://github.com/faulhornlabs/zikkurat-algebra) 
algebra backend library for finite field computations.

TODO
----

- more detailed tests for the individual components (permutation, compression, etc)
- more comprehensive testing (using the reference implementations)
- implement reference Poseidon2 for general parameter settings 
- implement the original Poseidon
- test the R1CS equations (if possible in practice)
- Haskell reference implementation for Keccak sponge
- implement other hash functions

hash-circuits

hash-circuits 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

hash-circuits

hash-circuits 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README