Cardano Updates

Signed-off-by: Jonathan Lim <[email protected]>

Signed-off-by: Jonathan Lim <[email protected]>

Signed-off-by: Jonathan Lim <[email protected]>

Recursive decode_term() overflows the default ~2MB test thread stack on deeply nested benchmark scripts.

Signed-off-by: Jonathan Lim <[email protected]>

Signed-off-by: Jonathan Lim <[email protected]>

Extract parse_plutus_version() to deduplicate the version string parsing that was duplicated between main() and replay(). Replace the debug-specific summarize_top() function, which was hardcoded to Case/Constant patterns left over from investigating a specific divergence, with a generic term_variant_name() that returns the top-level variant name for any term. Import Outcome at the top of replay() to remove six fully-qualified path references. Change &PathBuf parameters to &Path for idiomatic Rust. Exit with code 1 when replay detects a divergence so scripts and CI can detect failures programmatically.

Signed-off-by: Jonathan Lim <[email protected]>

The pretty-printer emits forms like ((B #..), (I 1)) inside maps, which the parser couldn't previously round-trip.

Signed-off-by: Jonathan Lim <[email protected]>

These three divergences caused budget mismatches vs the Haskell reference. Haskell uses element count for lists, maxBound sentinel for pairs.

Signed-off-by: Jonathan Lim <[email protected]>

The bytecode VM accepted branch counts that the CEK machine would reject, causing divergences on edge-case programs found by fuzzing.

Signed-off-by: Jonathan Lim <[email protected]>

The previous code used with_env which didn't have access to bytecode-specific lambda/delay info tables, causing incorrect term reconstruction for bytecode closures.

Signed-off-by: Jonathan Lim <[email protected]>

XorByteString was incorrectly charged using OrByteString's cost model, causing budget divergence from the Haskell reference implementation.

Signed-off-by: Jonathan Lim <[email protected]>

Tests for case expressions on list constants:
- case-list-empty-valid: empty list with 2 branches takes nil branch
- case-list-nonempty-valid: non-empty list takes cons branch with head/tail
- case-list-empty-too-many-branches: empty list with 4 branches errors

These tests currently fail due to incorrect branch count validation
in the case-on-constants implementation.

Signed-off-by: Jonathan Lim <[email protected]>

Implement proper flat serialization for BLS12-381 G1/G2 elements
(using compressed point format) and Data constants (via CBOR).
Previously these variants returned errors or were unimplemented.

Signed-off-by: Jonathan Lim <[email protected]>

Boolean: False accepts 1 or 2 branches, True requires exactly 2.
List: Cons accepts 1 or 2 branches, Nil requires exactly 2. Any other
branch count is an error. Previously the code was too permissive,
allowing arbitrary branch counts for lists.

Signed-off-by: Jonathan Lim <[email protected]>

Prevents integer overflow panics when cost model inputs are very large
(e.g. dropList with a huge index). All arithmetic in costing functions,
budget subtraction, and ExBudget::Sub now uses saturating operations
so overflow produces clamped values instead of panics, letting the
out-of-budget check fire normally.

Signed-off-by: Jonathan Lim <[email protected]>

- Expand builtin pre-wrap range from 0..92 to 0..101 for 9 new builtins
  (Value ops, MultiScalarMul)
- Add case_on_constant handler: Bool (with branch count validation),
  Unit, Integer, List (head/tail field pushing), Pair (fst/snd)
- Add VarBig opcode (0x16) with u32 index for De Bruijn indices > 255,
  fixing silent truncation that caused wrong variable lookups in large
  scripts (e.g. stablecoin contracts)
- Compiler emits Var (u8) for indices <= 255, VarBig (u32) otherwise;
  ApplyVar/ForceVar superinstructions restricted to u8 range

Signed-off-by: Jonathan Lim <[email protected]>

Three optimizations to the VM dispatch loop:

1. Replace unbudgeted_steps[9] total counter with a countdown that
   decrements to zero. Saves one array increment per step and turns
   the >= comparison into a free zero-check after decrement.

2. Restructure the run loop to drain return chains without going back
   through the outer compute loop. Eliminates Phase construction and
   matching on the hot Compute→Return transition.

3. Box the CasesFrame (rare, 0.3% of opcodes) to shrink Frame from
   32 to 16 bytes, halving memory bandwidth for every frame push/pop.

Signed-off-by: Jonathan Lim <[email protected]>

Signed-off-by: Jonathan Lim <[email protected]>

256 nested lambdas with a reference to the outermost variable,
exercising the VarBig opcode. Without VarBig, the u8 index silently
wraps and the VM looks up the wrong variable.

Signed-off-by: Jonathan Lim <[email protected]>

Specialized constant opcodes (ConstUnit, ConstTrue, ConstFalse) now
return pre-allocated values instead of arena-allocating on each use.
These values are created once per execute() call and shared across
all occurrences.

Signed-off-by: Jonathan Lim <[email protected]>

All 92 builtin values are pre-allocated once per execute() call.
The Builtin opcode now does a simple array lookup instead of
arena-allocating a Runtime struct + Value wrapper per occurrence.

Signed-off-by: Jonathan Lim <[email protected]>

The Constr variant contained 6 fields including a BumpVec, making the
Frame enum ~72 bytes. Boxing it puts only an 8-byte pointer in the
enum, reducing Frame to ~24 bytes. This halves the per-push/pop copy
cost for the common frame variants (AwaitArg, AwaitFunTerm, Force).

Small improvement on diverse workloads (escrow: 231→221µs, uniswap:
852→832µs). 818/818 conformance tests passing.

Signed-off-by: Jonathan Lim <[email protected]>