Skip to content

Block tools indentation #19957

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 18, 2025
Merged

Block tools indentation #19957

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
80 changes: 42 additions & 38 deletions chia/simulator/block_tools.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1505,46 +1505,50 @@ def get_pospaces_for_challenge(
if force_plot_id is not None and plot_id != force_plot_id:
continue
prefix_bits = calculate_prefix_bits(constants, height, plot_info.prover.get_size())
if passes_plot_filter(prefix_bits, plot_id, challenge_hash, signage_point):
new_challenge: bytes32 = calculate_pos_challenge(plot_id, challenge_hash, signage_point)
qualities = plot_info.prover.get_qualities_for_challenge(new_challenge)
if not passes_plot_filter(prefix_bits, plot_id, challenge_hash, signage_point):
continue

for proof_index, quality_str in enumerate(qualities):
required_iters = calculate_iterations_quality(
constants,
quality_str,
plot_info.prover.get_size(),
difficulty,
signage_point,
sub_slot_iters,
prev_transaction_b_height,
)
if required_iters < calculate_sp_interval_iters(constants, sub_slot_iters):
proof_xs: bytes = plot_info.prover.get_full_proof(new_challenge, proof_index)
new_challenge: bytes32 = calculate_pos_challenge(plot_id, challenge_hash, signage_point)
qualities = plot_info.prover.get_qualities_for_challenge(new_challenge)

# Look up local_sk from plot to save locked memory
(
pool_public_key_or_puzzle_hash,
farmer_public_key,
local_master_sk,
) = parse_plot_info(plot_info.prover.get_memo())
local_sk = master_sk_to_local_sk(local_master_sk)

if isinstance(pool_public_key_or_puzzle_hash, G1Element):
include_taproot = False
else:
assert isinstance(pool_public_key_or_puzzle_hash, bytes32)
include_taproot = True
plot_pk = generate_plot_public_key(local_sk.get_g1(), farmer_public_key, include_taproot)
proof_of_space: ProofOfSpace = make_pos(
new_challenge,
plot_info.pool_public_key,
plot_info.pool_contract_puzzle_hash,
plot_pk,
plot_info.prover.get_size(),
proof_xs,
)
found_proofs.append((required_iters, proof_of_space))
for proof_index, quality_str in enumerate(qualities):
required_iters = calculate_iterations_quality(
constants,
quality_str,
plot_info.prover.get_size(),
difficulty,
signage_point,
sub_slot_iters,
prev_transaction_b_height,
)
if required_iters >= calculate_sp_interval_iters(constants, sub_slot_iters):
continue

proof_xs: bytes = plot_info.prover.get_full_proof(new_challenge, proof_index)

# Look up local_sk from plot to save locked memory
(
pool_public_key_or_puzzle_hash,
farmer_public_key,
local_master_sk,
) = parse_plot_info(plot_info.prover.get_memo())
local_sk = master_sk_to_local_sk(local_master_sk)

if isinstance(pool_public_key_or_puzzle_hash, G1Element):
include_taproot = False
else:
assert isinstance(pool_public_key_or_puzzle_hash, bytes32)
include_taproot = True
plot_pk = generate_plot_public_key(local_sk.get_g1(), farmer_public_key, include_taproot)
proof_of_space: ProofOfSpace = make_pos(
new_challenge,
plot_info.pool_public_key,
plot_info.pool_contract_puzzle_hash,
plot_pk,
plot_info.prover.get_size(),
proof_xs,
)
found_proofs.append((required_iters, proof_of_space))
random_sample = found_proofs
if len(found_proofs) >= 1:
if rng.random() < 0.1:
Expand Down
Loading