mirror of
https://github.com/Chia-Network/chia-blockchain.git
synced 2026-08-29 02:24:35 -05:00
### Purpose: Bump the chia_rs dependency and adjust interactions according to changes to its API. Specifically, https://github.com/Chia-Network/chia_rs/pull/1213 . `validate_clvm_and_signature()` takes flags instead of height. `SpendConditions` has a `fingerprint` field.
184 lines
6.8 KiB
Python
184 lines
6.8 KiB
Python
from __future__ import annotations
|
|
|
|
from chia_puzzles_py.programs import CHIALISP_DESERIALISATION, ROM_BOOTSTRAP_GENERATOR
|
|
from chia_rs import SpendConditions
|
|
from chia_rs.sized_bytes import bytes32
|
|
from chia_rs.sized_ints import uint32
|
|
from clvm.CLVMObject import CLVMStorage
|
|
from clvm_tools import binutils
|
|
from clvm_tools.clvmc import compile_clvm_text
|
|
|
|
from chia._tests.util.get_name_puzzle_conditions import get_name_puzzle_conditions
|
|
from chia.consensus.condition_costs import ConditionCost
|
|
from chia.consensus.default_constants import DEFAULT_CONSTANTS
|
|
from chia.types.blockchain_format.program import Program, run_with_cost
|
|
from chia.types.blockchain_format.serialized_program import SerializedProgram
|
|
from chia.types.generator_types import BlockGenerator
|
|
|
|
DESERIALIZE_MOD = Program.from_bytes(CHIALISP_DESERIALISATION)
|
|
|
|
GENERATOR_MOD: SerializedProgram = SerializedProgram.from_bytes(ROM_BOOTSTRAP_GENERATOR)
|
|
|
|
MAX_COST = 10**15
|
|
COST_PER_BYTE = 12000
|
|
|
|
|
|
GENERATOR_CODE = """
|
|
(mod (deserialize-mod historical-generators)
|
|
(defun first-block (deserialize-mod historical-generators)
|
|
(a deserialize-mod (list (f historical-generators))))
|
|
|
|
(defun second-block (deserialize-mod historical-generators)
|
|
(a deserialize-mod (r historical-generators)))
|
|
|
|
(defun go (deserialize-mod historical-generators)
|
|
(c (first-block deserialize-mod historical-generators)
|
|
(second-block deserialize-mod historical-generators)
|
|
))
|
|
(go deserialize-mod historical-generators)
|
|
)
|
|
"""
|
|
|
|
|
|
COMPILED_GENERATOR_CODE = bytes(Program.to(compile_clvm_text(GENERATOR_CODE, []))) # type: ignore[no-untyped-call]
|
|
|
|
FIRST_GENERATOR = Program.to(
|
|
binutils.assemble(
|
|
"""
|
|
((0x0000000000000000000000000000000000000000000000000000000000000000 1 50000
|
|
((51 0x0000000000000000000000000000000000000000000000000000000000000001 500))
|
|
"extra" "data" "for" "coin" ))"""
|
|
)
|
|
).as_bin()
|
|
|
|
SECOND_GENERATOR = Program.to(binutils.assemble("(extra data for block)")).as_bin()
|
|
|
|
|
|
def to_sp(sexp: bytes) -> SerializedProgram:
|
|
return SerializedProgram.from_bytes(sexp)
|
|
|
|
|
|
def block_generator() -> BlockGenerator:
|
|
generator_list = [FIRST_GENERATOR, SECOND_GENERATOR]
|
|
return BlockGenerator(to_sp(COMPILED_GENERATOR_CODE), generator_list)
|
|
|
|
|
|
EXPECTED_ABBREVIATED_COST = 108379
|
|
EXPECTED_COST1 = 113415
|
|
EXPECTED_COST2 = 108423
|
|
EXPECTED_OUTPUT = (
|
|
"ffffffa00000000000000000000000000000000000000000000000000000000000000000"
|
|
"ff01ff8300c350ffffff33ffa00000000000000000000000000000000000000000000000"
|
|
"000000000000000001ff8201f48080ff856578747261ff8464617461ff83666f72ff8463"
|
|
"6f696e8080ff856578747261ff8464617461ff83666f72ff85626c6f636b80"
|
|
)
|
|
|
|
|
|
def run_generator(self: BlockGenerator) -> tuple[int, Program]:
|
|
"""This mode is meant for accepting possibly soft-forked transactions into the mempool"""
|
|
args = Program.to([self.generator_refs])
|
|
return run_with_cost(GENERATOR_MOD, MAX_COST, [self.program, args])
|
|
|
|
|
|
def as_atom_list(prg: CLVMStorage) -> list[bytes]:
|
|
"""
|
|
Pretend `prg` is a list of atoms. Return the corresponding
|
|
python list of atoms.
|
|
|
|
At each step, we always assume a node to be an atom or a pair.
|
|
If the assumption is wrong, we exit early. This way we never fail
|
|
and always return SOMETHING.
|
|
"""
|
|
items = []
|
|
obj = prg
|
|
while True:
|
|
pair = obj.pair
|
|
if pair is None:
|
|
break
|
|
atom = pair[0].atom
|
|
if atom is None:
|
|
break
|
|
items.append(atom)
|
|
obj = pair[1]
|
|
return items
|
|
|
|
|
|
class TestROM:
|
|
def test_rom_inputs(self) -> None:
|
|
# this test checks that the generator just works
|
|
# It's useful for debugging the generator prior to having the ROM invoke it.
|
|
|
|
args = Program.to([DESERIALIZE_MOD, [FIRST_GENERATOR, SECOND_GENERATOR]])
|
|
sp = to_sp(COMPILED_GENERATOR_CODE)
|
|
cost, r = run_with_cost(sp, MAX_COST, args)
|
|
assert cost == EXPECTED_ABBREVIATED_COST
|
|
assert r.as_bin().hex() == EXPECTED_OUTPUT
|
|
|
|
def test_get_name_puzzle_conditions(self, softfork_height: int) -> None:
|
|
# this tests that extra block or coin data doesn't confuse `get_name_puzzle_conditions`
|
|
|
|
gen = block_generator()
|
|
cost, r = run_generator(gen)
|
|
print(r)
|
|
|
|
npc_result = get_name_puzzle_conditions(
|
|
gen, max_cost=MAX_COST, mempool_mode=False, height=uint32(softfork_height), constants=DEFAULT_CONSTANTS
|
|
)
|
|
if softfork_height >= DEFAULT_CONSTANTS.HARD_FORK_HEIGHT:
|
|
cost = EXPECTED_COST2
|
|
else:
|
|
cost = EXPECTED_COST1
|
|
assert npc_result.error is None
|
|
assert npc_result.conds is not None
|
|
assert npc_result.conds.cost == cost + ConditionCost.CREATE_COIN.value + (
|
|
len(bytes(gen.program)) * COST_PER_BYTE
|
|
)
|
|
assert npc_result.conds is not None
|
|
|
|
spend = SpendConditions(
|
|
coin_id=bytes32.fromhex("e8538c2d14f2a7defae65c5c97f5d4fae7ee64acef7fec9d28ad847a0880fd03"),
|
|
parent_id=bytes32.fromhex("0000000000000000000000000000000000000000000000000000000000000000"),
|
|
puzzle_hash=bytes32.fromhex("9dcf97a184f32623d11a73124ceb99a5709b083721e878a16d78f596718ba7b2"),
|
|
coin_amount=50000,
|
|
height_relative=None,
|
|
seconds_relative=None,
|
|
before_height_relative=None,
|
|
before_seconds_relative=None,
|
|
birth_height=None,
|
|
birth_seconds=None,
|
|
create_coin=[(bytes32([0] * 31 + [1]), 500, None)],
|
|
agg_sig_me=[],
|
|
agg_sig_parent=[],
|
|
agg_sig_puzzle=[],
|
|
agg_sig_amount=[],
|
|
agg_sig_puzzle_amount=[],
|
|
agg_sig_parent_amount=[],
|
|
agg_sig_parent_puzzle=[],
|
|
flags=0,
|
|
# in run_block_generator() we don't have access to separate
|
|
# execution cost, just in run_block_generator2()
|
|
execution_cost=0 if softfork_height < DEFAULT_CONSTANTS.HARD_FORK_HEIGHT else 44,
|
|
condition_cost=1800000,
|
|
fingerprint=b"",
|
|
)
|
|
|
|
assert npc_result.conds.spends == [spend]
|
|
|
|
def test_coin_extras(self) -> None:
|
|
# the ROM supports extra data after a coin. This test checks that it actually gets passed through
|
|
|
|
gen = block_generator()
|
|
_cost, r = run_generator(gen)
|
|
coin_spends = r.first()
|
|
for coin_spend in coin_spends.as_iter():
|
|
extra_data = coin_spend.rest().rest().rest().rest()
|
|
assert as_atom_list(extra_data) == b"extra data for coin".split()
|
|
|
|
def test_block_extras(self) -> None:
|
|
# the ROM supports extra data after the coin spend list. This test checks that it actually gets passed through
|
|
|
|
gen = block_generator()
|
|
_cost, r = run_generator(gen)
|
|
extra_block_data = r.rest()
|
|
assert as_atom_list(extra_block_data) == b"extra data for block".split()
|