Documentation
    Preparing search index...
    • Budget mint cash need: ⌈(budget + 1) · (1 / p_min − 1)⌉ + 1, rounded as Move rounds it (one mul_div_up of (budget + 1) · (1e9 − p_min) / p_min). Exact-amount mints pass min(max_premium, budget). p_min = 0 throws, as the Move division aborts.

      Parameters

      • budget: bigint
      • minEntryProbability: bigint

      Returns bigint