sponge.hpp

Go to the documentation of this file.

// === AUDIT STATUS ===
// internal:    { status: not started, auditors: [], date: YYYY-MM-DD }
// external_1:  { status: not started, auditors: [], date: YYYY-MM-DD }
// external_2:  { status: not started, auditors: [], date: YYYY-MM-DD }
// =====================
 
#pragma once
 
#include <array>
#include <cstddef>
#include <cstdint>
#include <span>
 
#include "barretenberg/numeric/uint256/uint256.hpp"
 
namespace bb::crypto {
 
template <typename FF, size_t rate, size_t capacity, size_t t, typename Permutation> class FieldSponge {
  public:
    enum Mode {
        ABSORB,
        SQUEEZE,
    };
 
    // sponge state. t = rate + capacity. capacity = 1 field element (~256 bits)
    std::array<FF, t> state;
 
    // cached elements that have been absorbed.
    std::array<FF, rate> cache;
    size_t cache_size = 0;
    Mode mode = Mode::ABSORB;
 
    FieldSponge(FF domain_iv = 0)
    {
        for (size_t i = 0; i < rate; ++i) {
            state[i] = 0;
        }
        state[rate] = domain_iv;
    }
 
    std::array<FF, rate> perform_duplex()
    {
        // zero-pad the cache
        for (size_t i = cache_size; i < rate; ++i) {
            cache[i] = 0;
        }
        // add the cache into sponge state
        for (size_t i = 0; i < rate; ++i) {
            state[i] += cache[i];
        }
        state = Permutation::permutation(state);
        // return `rate` number of field elements from the sponge state.
        std::array<FF, rate> output;
        for (size_t i = 0; i < rate; ++i) {
            output[i] = state[i];
        }
        return output;
    }
 
    void absorb(const FF& input)
    {
        if (mode == Mode::ABSORB && cache_size == rate) {
            // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache
            perform_duplex();
            cache[0] = input;
            cache_size = 1;
        } else if (mode == Mode::ABSORB && cache_size < rate) {
            // If we're absorbing, and the cache is not full, add the input into the cache
            cache[cache_size] = input;
            cache_size += 1;
        } else if (mode == Mode::SQUEEZE) {
            // If we're in squeeze mode, switch to absorb mode and add the input into the cache.
            // N.B. I don't think this code path can be reached?!
            cache[0] = input;
            cache_size = 1;
            mode = Mode::ABSORB;
        }
    }
 
    FF squeeze()
    {
        if (mode == Mode::SQUEEZE && cache_size == 0) {
            // If we're in squeze mode and the cache is empty, there is nothing left to squeeze out of the sponge!
            // Switch to absorb mode.
            mode = Mode::ABSORB;
            cache_size = 0;
        }
        if (mode == Mode::ABSORB) {
            // If we're in absorb mode, apply sponge permutation to compress the cache, populate cache with compressed
            // state and switch to squeeze mode. Note: this code block will execute if the previous `if` condition was
            // matched
            auto new_output_elements = perform_duplex();
            mode = Mode::SQUEEZE;
            for (size_t i = 0; i < rate; ++i) {
                cache[i] = new_output_elements[i];
            }
            cache_size = rate;
        }
        // By this point, we should have a non-empty cache. Pop one item off the top of the cache and return it.
        FF result = cache[0];
        for (size_t i = 1; i < cache_size; ++i) {
            cache[i - 1] = cache[i];
        }
        cache_size -= 1;
        cache[cache_size] = 0;
        return result;
    }
 
    template <size_t out_len> static std::array<FF, out_len> hash_internal(std::span<const FF> input)
    {
        size_t in_len = input.size();
        const uint256_t iv = (static_cast<uint256_t>(in_len) << 64) + out_len - 1;
        return hash_internal<out_len>(input, iv);
    }
 
    template <size_t out_len> static std::array<FF, out_len> hash_internal(std::span<const FF> input, FF iv)
    {
        FieldSponge sponge(iv);
 
        size_t in_len = input.size();
        for (size_t i = 0; i < in_len; ++i) {
            sponge.absorb(input[i]);
        }
 
        std::array<FF, out_len> output;
        for (size_t i = 0; i < out_len; ++i) {
            output[i] = sponge.squeeze();
        }
        return output;
    }
 
    static FF hash_internal(std::span<const FF> input) { return hash_internal<1>(input)[0]; }
    static FF hash_internal(std::span<const FF> input, FF iv) { return hash_internal<1>(input, iv)[0]; }
};
} // namespace bb::crypto