ocaml: phase 5.1 euler4_small.ml baseline (largest 2-digit palindrome product = 9009)

Scaled-down Project Euler #4. Real version uses 3-digit numbers
yielding 906609 = 913 * 993; that's an 810k-iteration nested loop
that times out under our contended-host spec-level evaluator.

The 2-digit version (10..99) is fast enough and tests the same
algorithm:
  9009 = 91 * 99   (the only 2-digit-product palindrome > 9000)

Implementation:
  is_pal n     index-walk comparing s.[i] to s.[len-1-i]
  euler4 lo hi nested for with running max + early-skip via
                'p > !m && is_pal p' short-circuit

111 baseline programs total.

plans/ocaml-on-sx.md

@@ -407,6 +407,11 @@ _Newest first._
   binary search tree (`type 'a tree = Leaf | Node of 'a * 'a tree *
   'a tree`) with insert + in-order traversal. Tests parametric ADT,
   recursive match, List.append, List.fold_left.
+- 2026-05-09 Phase 5.1 — euler4_small.ml baseline (largest 2-digit
+  palindrome product = 9009 = 91 * 99). Scaled-down Project Euler
+  #4 (real version uses 3-digit numbers, 906609; that's 810k inner
+  iterations and would time out under contention). Tests palindrome
+  predicate via index-walk + nested for. 111 baseline programs total.
 - 2026-05-09 Phase 5.1 — euler10.ml baseline (sum of primes ≤ 100 =
   1060, scaled-down Project Euler #10). Sieve of Eratosthenes
   followed by a sum loop. Used 100 instead of 2 million to fit our