0a3a18744f
This change prevents zero-cost computation of hash functions on unbound number of zero-length slices of data. The cost for each slice is at least equal to the base cost of a memory operation, but could be more for longer slices. |
||
---|---|---|
.. | ||
address-lookup-table | ||
address-lookup-table-tests | ||
bpf | ||
bpf_loader | ||
compute-budget | ||
config | ||
ed25519-tests | ||
stake | ||
vote | ||
zk-token-proof |