Class Args

zisk/host/src/main.rs:49–223

  EmbeddedClient, EmbeddedClientBuilder, EmbeddedExecuteOnlyClient,
  EmbeddedOpts, GuestProgram, ProverClient, VerboseMode,
  VerifyConstraintsExtension, ZiskStdin,
};

#[derive(Parser, Debug)]
#[command(author, version, about, long_about = None)]
struct Args {
  /// Run shards in the VM only — no proof or proving key required.
  #[arg(long, conflicts_with = "verify_constraints")]
  execute: bool,

  /// Run the constraint checker without generating a proof (single shard
  /// only).
  #[arg(long)]
  verify_constraints: bool,

  /// Enable GPU-accelerated proving.
  #[arg(long)]
  gpu: bool,

  /// Use the Emulator executor instead of the default Assembly executor.
  /// Assembly is the default: it is markedly faster at trace generation
  /// (measured ~4-6x on EXECUTE, ~11x on COMPUTE_MINIMAL_TRACE) and is the
  /// prerequisite for the hints stream. Pass `--emulator` to opt back into
  /// the Emulator (e.g. to debug, or on a box without the memlock rlimit the
  /// ASM executor's MAP_LOCKED mmaps require). See the multi-program
  /// setup-ordering note on `build_client`.
  #[arg(long)]
  emulator: bool,

  /// Path to a `.ixe` file. Repeatable: pass `--ixe` multiple times to
  /// prove a batch of inputs in one warm process and aggregate them all
  /// into a single proof. If omitted entirely, one empty `IxonEnv` is
  /// used.
  #[arg(long)]
  ixe: Vec<PathBuf>,

  /// Fixed-count partitioning: maximum work items per shard. `0`
  /// (default) puts the whole env in one shard. Mutually exclusive
  /// with `--shard-bytes`. Applied independently to each input. "Consts"
  /// here is the work-item unit returned by `build_anon_work` — one per
  /// Standalone constant or per Muts block; a single Muts block work
  /// item may cover many target constants in the kernel-check sense.
  #[arg(long, default_value_t = 0, conflicts_with = "shard_bytes")]
  shard_consts: u32,

  /// Cost-based partitioning: pack contiguous work items into shards
  /// until cumulative serialized-AST bytes exceed this budget, then
  /// open a new shard. Bytes are summed via
  /// `LazyConstant::raw_bytes().len()` over each item's `targets()` —
  /// for a Standalone item that's its own body; for a Muts block it's
  /// the sum across all member + ctor projections. Strong proxy for
  /// kernel work, computable without parsing or executing. Applied
  /// independently to each input.
  ///
  /// Doubles as the hard per-item ceiling: any single work item whose
  /// serialized cost exceeds this budget aborts at planning time, with
  /// an error naming the offending item. A would-be-oversized item gets
  /// caught before any prove runs (otherwise it'd silently produce an