AlgoScan

Currently, neither Algorand Python nor puya-ts emit non-boolean operands for these ops.

The intrinsic simplifier uses Python's `and`/`or` to fold AVM `&&`/`||`, which returns operand values instead of 0/1 for non-boolean constants. For example, `int(5 and 3)` returns 3, but AVM `&&` returns 1.

This is only reachable from AWST (not Algorand Python source), so the test uses a hand-crafted AWST JSON test case.

Updates the requirements on [eslint](https://github.com/eslint/eslint) to permit the latest version.
- [Release notes](https://github.com/eslint/eslint/releases)
- [Commits](https://github.com/eslint/eslint/compare/v10.2.0...v10.2.1)

---
updated-dependencies:
- dependency-name: eslint
  dependency-version: 10.2.1
  dependency-type: direct:development
...

Signed-off-by: dependabot[bot] <support@github.com>

Three related fixes:

1. Extract folding now checks len(source) < S+L before slicing,
   preventing Python's silent truncation from masking the AVM panic.

2. Substring folding now checks S <= E <= len(source) using a chained
   comparison, adding the missing upper bound check.

3. _get_bytes_length_safe now inductively verifies the source length
   before trusting an extract instruction's immediate length. Without
   this, a secondary optimization path could fold using an incorrect
   length even after the direct fold guard fires.

The intrinsic simplifier folds extract and substring even when the indices are out of bounds, silently truncating the result. The AVM panics in these cases.

Three separate contracts (ExtractLengthOOB, ExtractStartOOB, SubstringEndOOB) allow the on-chain tests to verify each error message independently.

Three related fixes:

1. Extract folding now checks len(source) < S+L before slicing,
   preventing Python's silent truncation from masking the AVM panic.

2. Substring folding now checks S <= E <= len(source) using a chained
   comparison, adding the missing upper bound check.

3. _get_bytes_length_safe now inductively verifies the source length
   before trusting an extract instruction's immediate length. Without
   this, a secondary optimization path could fold using an incorrect
   length even after the direct fold guard fires.

The intrinsic simplifier folds extract and substring even when the indices are out of bounds, silently truncating the result. The AVM panics in these cases.

Three separate contracts (ExtractLengthOOB, ExtractStartOOB, SubstringEndOOB) allow the on-chain tests to verify each error message independently.

The intrinsic simplifier folds uint64 add/mul/exp even when the result exceeds 2^64-1. The AVM panics on overflow, but the optimizer produces oversized constants that propagate through subsequent folds.

Three separate contracts (add, mul, exp) allow the on-chain tests to verify each overflow error message independently.

The uint64 binary op folding only guarded against negative results
but not overflow beyond MAX_UINT64. Operations like (2^64-1) + 1
produced oversized constants that propagated through subsequent folds.

Now checks 0 <= c <= MAX_UINT64 before folding, preserving the AVM
overflow panic.

The uint64 binary op folding only guarded against negative results
but not overflow beyond MAX_UINT64. Operations like (2^64-1) + 1
produced oversized constants that propagated through subsequent folds.

Now checks 0 <= c <= MAX_UINT64 before folding, preserving the AVM
overflow panic.

The intrinsic simplifier folds uint64 add/mul/exp even when the result exceeds 2^64-1. The AVM panics on overflow, but the optimizer produces oversized constants that propagate through subsequent folds.

Three separate contracts (add, mul, exp) allow the on-chain tests to verify each overflow error message independently.