mirror of
https://github.com/Chia-Network/chia-blockchain.git
synced 2026-09-25 16:50:30 -04:00
Matt Hauff
40db4635a8
* Enable PEP604 Ruff rules * Fix harcoded signature in test * Hack CLVMStreamable test with note to fast follow
91 lines
2.3 KiB
Python
91 lines
2.3 KiB
Python
from __future__ import annotations
|
|
|
|
from collections.abc import Callable, Sequence
|
|
from hashlib import sha256
|
|
|
|
from chia_rs.sized_bytes import bytes32
|
|
|
|
from chia.util.casts import int_to_bytes
|
|
|
|
CurryHashFunction = Callable[..., bytes32]
|
|
|
|
|
|
NULL = bytes.fromhex("")
|
|
ONE = bytes.fromhex("01")
|
|
TWO = bytes.fromhex("02")
|
|
Q_KW = bytes.fromhex("01")
|
|
A_KW = bytes.fromhex("02")
|
|
C_KW = bytes.fromhex("04")
|
|
|
|
|
|
def shatree_atom(atom: bytes) -> bytes32:
|
|
s = sha256()
|
|
s.update(ONE)
|
|
s.update(atom)
|
|
return bytes32(s.digest())
|
|
|
|
|
|
def shatree_pair(left_hash: bytes32, right_hash: bytes32) -> bytes32:
|
|
s = sha256()
|
|
s.update(TWO)
|
|
s.update(left_hash)
|
|
s.update(right_hash)
|
|
return bytes32(s.digest())
|
|
|
|
|
|
Q_KW_TREEHASH = shatree_atom(Q_KW)
|
|
A_KW_TREEHASH = shatree_atom(A_KW)
|
|
C_KW_TREEHASH = shatree_atom(C_KW)
|
|
ONE_TREEHASH = shatree_atom(ONE)
|
|
NIL_TREEHASH = shatree_atom(NULL)
|
|
|
|
|
|
def shatree_atom_list(li: Sequence[bytes]) -> bytes32:
|
|
ret = NIL_TREEHASH
|
|
for item in reversed(li):
|
|
ret = shatree_pair(shatree_atom(item), ret)
|
|
return ret
|
|
|
|
|
|
def shatree_int(val: int) -> bytes32:
|
|
return shatree_atom(int_to_bytes(val))
|
|
|
|
|
|
# The environment `E = (F . R)` recursively expands out to
|
|
# `(c . ((q . F) . EXPANSION(R)))` if R is not 0
|
|
# `1` if R is 0
|
|
|
|
|
|
def curried_values_tree_hash(arguments: list[bytes32]) -> bytes32:
|
|
if len(arguments) == 0:
|
|
return ONE_TREEHASH
|
|
|
|
return shatree_pair(
|
|
C_KW_TREEHASH,
|
|
shatree_pair(
|
|
shatree_pair(Q_KW_TREEHASH, arguments[0]),
|
|
shatree_pair(curried_values_tree_hash(arguments[1:]), NIL_TREEHASH),
|
|
),
|
|
)
|
|
|
|
|
|
# The curry pattern is `(a . ((q . F) . (E . 0)))` == `(a (q . F) E)
|
|
# where `F` is the `mod` and `E` is the curried environment
|
|
|
|
|
|
def curry_and_treehash(hash_of_quoted_mod_hash: bytes32, *hashed_arguments: bytes32) -> bytes32:
|
|
"""
|
|
`hash_of_quoted_mod_hash` : tree hash of `(q . MOD)` where `MOD` is template to be curried
|
|
`arguments` : tree hashes of arguments to be curried
|
|
"""
|
|
|
|
curried_values = curried_values_tree_hash(list(hashed_arguments))
|
|
return shatree_pair(
|
|
A_KW_TREEHASH,
|
|
shatree_pair(hash_of_quoted_mod_hash, shatree_pair(curried_values, NIL_TREEHASH)),
|
|
)
|
|
|
|
|
|
def calculate_hash_of_quoted_mod_hash(mod_hash: bytes32) -> bytes32:
|
|
return shatree_pair(Q_KW_TREEHASH, mod_hash)
|