AlgoScan

Instead of calling replaceBytes once per ref and then walking all stored
positions each time, collect all changes first, sort them, and apply them
in one left-to-right scan that builds the new program bytes and a cumDelta
array simultaneously. cumDelta[p] records the total size shift from all
replacements whose replaced region ends at or before p, so any stored
position can be adjusted with a single array lookup in any order.

Complexity goes from O(k*n + k*m) to O(n + k + m), where k = number of
refs, n = program size, m = total stored positions.

chore(deps): bump rust from 1.93-slim-bookworm to 1.94-slim-bookworm in the minor-and-patch group

Rewrite _refine_phi_congruence to run after build_replacements() and
resolve phi args through the replacement map, rather than using VN
lookups on the scoped _GVNTables.

This fixes a latent bug where set_register_vn in the SCC pass would
append registers to new equivalence sets without removing them from
old ones, potentially causing replacement chains in build_replacements
when an SCC register was also in a multi-member equivalence set from
the hash-based walk.

The new approach is also strictly more powerful: the old implementation
could only detect SCC congruence when external args were the same
register object (because _register_vn was scoped and the walk's VN
assignments were in discarded child scopes). Now it detects congruence
whenever external args resolve to the same representative.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

Implementation of Vault use case in Cairo

implementation of token_transfer use case in leo

Skip SCCs with multiple distinct external VNs instead of raising
InternalError. This can legitimately occur with irreducible CFGs
(e.g. TypeScript labeled loops compiled via puya-ts).

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>