feat(types): BigInt + Decimal exact economy numbers (#52)

Types phase 2 — the "money problem". A splice-on-demand bignum engine
(runtime/native/bignum.ludic, self-contained, only intrinsics) exposed as
two namespaces:

- BigInt.* — arbitrary-precision integer (sign-magnitude, base-1e9 limbs):
  from/parse, add/sub/mul/pow, div/mod (by int), cmp/eq/is_zero, to_int, str.
  For idle counters and exact huge currencies that overflow a 32/64-bit int.
- Decimal.* — exact base-10 fixed point (BigInt mantissa + decimal scale):
  from/parse, exact add/sub/mul, cmp/eq, scale/rescale (truncate), str.
  So 0.10 + 0.20 is exactly 0.30 — no binary rounding.

Both exact => deterministic; no f32/f64. Wired: parser splice trigger
(g_uses_bignum), emit_call dispatch, reseeded seed, a self-asserting example
(examples/library/bignum.ludic + feat_case), and per-symbol docs + inventory.
All suites green incl. golden renders byte-identical and the bootstrap fixpoint.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>

docs/language/bigint/bigint-mod.md

@@ -0,0 +1,22 @@
+---
+id: bigint-mod
+name: BigInt.mod
+category: bigint
+kind: namespace-method
+tokens: BigInt.mod
+sig: BigInt.mod(a, d) -> int
+tip: Remainder of a big integer divided by an int.
+order: 8
+ns: BigInt
+member: mod
+---
+
+Returns the remainder of <code>a</code> divided by an <code>int</code> divisor, carrying the sign of <code>a</code>. Pairs with <code>BigInt.div</code>.
+
+```ludic
+program Demo {
+  handler Step phase Update {
+    let leftover = BigInt.mod(pot, players)
+  }
+}
+```