mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-02-26 07:37:20 +00:00
The #32816 was only using the keccak precompile for some minor task. This PR implements a keccak state, which is what is used for hashing the tree.
122 lines
3.3 KiB
Go
122 lines
3.3 KiB
Go
// Copyright 2025 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//go:build ziren
|
|
|
|
package crypto
|
|
|
|
import (
|
|
"github.com/ProjectZKM/Ziren/crates/go-runtime/zkvm_runtime"
|
|
"github.com/ethereum/go-ethereum/common"
|
|
)
|
|
|
|
// zirenKeccakState implements the KeccakState interface using the Ziren zkvm_runtime.
|
|
// It accumulates data written to it and uses the zkvm's Keccak256 system call for hashing.
|
|
type zirenKeccakState struct {
|
|
buf []byte // accumulated data
|
|
result []byte // cached result
|
|
dirty bool // whether new data has been written since last hash
|
|
}
|
|
|
|
func newZirenKeccakState() KeccakState {
|
|
return &zirenKeccakState{
|
|
buf: make([]byte, 0, 512), // pre-allocate reasonable capacity
|
|
}
|
|
}
|
|
|
|
func (s *zirenKeccakState) Write(p []byte) (n int, err error) {
|
|
s.buf = append(s.buf, p...)
|
|
s.dirty = true
|
|
return len(p), nil
|
|
}
|
|
|
|
func (s *zirenKeccakState) Sum(b []byte) []byte {
|
|
s.computeHashIfNeeded()
|
|
return append(b, s.result...)
|
|
}
|
|
|
|
func (s *zirenKeccakState) Reset() {
|
|
s.buf = s.buf[:0]
|
|
s.result = nil
|
|
s.dirty = false
|
|
}
|
|
|
|
func (s *zirenKeccakState) Size() int {
|
|
return 32
|
|
}
|
|
|
|
func (s *zirenKeccakState) BlockSize() int {
|
|
return 136 // Keccak256 rate
|
|
}
|
|
|
|
func (s *zirenKeccakState) Read(p []byte) (n int, err error) {
|
|
s.computeHashIfNeeded()
|
|
|
|
if len(p) == 0 {
|
|
return 0, nil
|
|
}
|
|
|
|
// After computeHashIfNeeded(), s.result is always a 32-byte slice
|
|
n = copy(p, s.result)
|
|
return n, nil
|
|
}
|
|
|
|
func (s *zirenKeccakState) computeHashIfNeeded() {
|
|
if s.dirty || s.result == nil {
|
|
// Use the zkvm_runtime Keccak256 which uses SyscallKeccakSponge
|
|
hashArray := zkvm_runtime.Keccak256(s.buf)
|
|
s.result = hashArray[:]
|
|
s.dirty = false
|
|
}
|
|
}
|
|
|
|
// NewKeccakState creates a new KeccakState
|
|
// This uses a Ziren-optimized implementation that leverages the zkvm_runtime.Keccak256 system call.
|
|
func NewKeccakState() KeccakState {
|
|
return newZirenKeccakState()
|
|
}
|
|
|
|
// Keccak256 calculates and returns the Keccak256 hash using the Ziren zkvm_runtime implementation.
|
|
func Keccak256(data ...[]byte) []byte {
|
|
// For multiple data chunks, concatenate them
|
|
if len(data) == 0 {
|
|
result := zkvm_runtime.Keccak256(nil)
|
|
return result[:]
|
|
}
|
|
if len(data) == 1 {
|
|
result := zkvm_runtime.Keccak256(data[0])
|
|
return result[:]
|
|
}
|
|
|
|
// Concatenate multiple data chunks
|
|
var totalLen int
|
|
for _, d := range data {
|
|
totalLen += len(d)
|
|
}
|
|
|
|
combined := make([]byte, 0, totalLen)
|
|
for _, d := range data {
|
|
combined = append(combined, d...)
|
|
}
|
|
|
|
result := zkvm_runtime.Keccak256(combined)
|
|
return result[:]
|
|
}
|
|
|
|
// Keccak256Hash calculates and returns the Keccak256 hash as a Hash using the Ziren zkvm_runtime implementation.
|
|
func Keccak256Hash(data ...[]byte) common.Hash {
|
|
return common.Hash(Keccak256(data...))
|
|
}
|