Function addr_u32

crates/kernel/src/shard.rs:2030–2034

A distinct address for each `n` (more than the 256 `addr(u8)` affords), for fixtures large enough to exercise the multilevel coarsening path. Big-endian so that address-sort order (which fixes block ids) matches numeric order, keeping cluster members id-contiguous in the fixtures below.

(n: u32)

    }
    shard_of[b as usize] = cur;
    if members.len() == 1 && predicted(member_cost, foreign_bytes) > max_cycles
    {
      infeasible = true; // this block alone overflows the cap
    }
    if i == order.len() - 1 {
      max_shard_steps =
        max_shard_steps.max(predicted(member_cost, foreign_bytes));
    }