AlgoScan

- Fixed issue with unkeying joint account. Now JA unkey transaction will be sign with correct owner accounts.

- Added support for ledger devices for joint accounts.

- Added support for ledger devices for joint accounts.

- fix network change flow
- account name fixed
- The joint account pending screen will now show failure reason.
- Navigation bar on the SuccessResultScreen will now be hidden.
- fix overload issue. fix asset favorite and price alert status updates

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

Implementation of Bet use case in Leo(Aleo) language

Remove unused `logger` and `Mock` imports flagged by eslint.

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

Add AlgoVoi as a named wallet provider so dApps using use-wallet
can display it in their connect modals alongside Pera, Defly, etc.

AlgoVoi is an Algorand + Voi browser extension wallet that exposes
an ARC-0027 compliant provider at window.algorand. The implementation
calls the injected provider directly (no external SDK dependency).

Changes:
- Add ALGOVOI to WalletId enum
- Create AlgoVoiWallet extending BaseWallet
- Register in createWalletMap and exports
- Add unit tests (connect, disconnect, resumeSession, metadata)

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

Recognize that !(a < b) has the same value as (a >= b) by tracking
which VNs were produced by comparison ops.  When GVN processes a !
intrinsic whose operand was a comparison, it returns the inverse
comparison's expression key instead, so the normal hash lookup
naturally matches any existing computation of the inverse.

Inverse pairs: < ↔ >=, > ↔ <=, == ↔ != (and b-prefixed variants).

Double negation (!(!x)) works automatically since !(comparison)
produces an inverse comparison key which is itself tracked.

negated_comparisons test case: 107 → 65 bytes (-39%), 71 → 41 ops (-42%)

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

Test contract with inline=False subroutines that assert a comparison
and the negation of its inverse (e.g. assert a < b, assert not (a >= b))
for all 6 inverse pairs, for both uint64 and BigUInt types.  The
negated assertions should be eliminated once GVN learns to recognise
!(comparison) as the inverse comparison.

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

Test contract with inline=False subroutines that assert both directions
of each ordering comparison (a<b then b>a, a<=b then b>=a) for both
uint64 and BigUInt types. The redundant converse comparisons should be
eliminated once GVN learns to canonicalize swapped predicates.

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

Recognize that a<b and b>a (and <=/>= variants, including bytes
comparisons) are equivalent by canonicalizing operand VNs in the
expression key. When the first operand VN is larger, swap operands
and mirror the predicate (< ↔ >, <= ↔ >=).

This follows the same approach as LLVM GVN and GCC's SCC-VN: sort
operand VNs and adjust the comparison predicate to match.

comparison_swaps test case: 78 → 54 bytes (-31%), 45 → 29 ops (-36%)

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

Replace _resolve_transitive chain resolution with a validation assert.
Both the hash-based pass and SCC pass always replace with VN
representatives, which are never themselves replacement targets, so
chains cannot form. Asserting this invariant (via InternalError) is
safer than silently resolving — a chain would indicate a bug in the
replacement logic.

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

- Fix phi_congruence test to exercise GVN redundant phi path (lines
  279-288) by using commutative operand order (a|b vs b|a) so the
  frontend keeps them as separate registers but GVN canonicalises them
  to the same VN
- Convert unreachable defensive guards to raise InternalError (arity
  mismatch, replacement cycle, multi-external-VN SCC, missing VN
  representative) — these are excluded from coverage via .coveragerc

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

After hash-based numbering, build a phi dependency graph and find SCCs.
Within each non-trivial SCC, check if all phis have the same set of
external (non-SCC) argument VNs. If so, they're all congruent and can
be merged.

Catches patterns like phi(a,y)/phi(b,x) where a==b that hash-based
GVN misses due to back-edge conservatism.

Adds test_cases/phi_congruence with contracts exercising cross-assignment
loops (SCC size 2), triple rotation cycles (SCC size 3), and a
redundant phi pattern.

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