fix(sim): cap crash point so extreme seeds cannot overflow or bankrupt

At u=1 the unsigned quotient exceeded int64 and wrapped negative, so the
rarest and most valuable outcome silently became an instant 1.00x loss.
At u=2 it produced a 2.1-billion-times payout the house could never
cover, which would have left settlement failing and the player unpaid.
The crash point is now capped at the largest multiplier the curve can
express, which is unreachable anyway since the round hits its tick
ceiling first.

FromInt now panics outside the Q32.32 integer range instead of wrapping
a positive input into a negative value.

Raises coverage to 88% overall; adds a Makefile with db-reset, since the
append-only ledger steadily consumes bridge headroom across test runs.

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

pkg/scratch/scratch.go

@@ -31,12 +31,12 @@ type Tier struct {
 
 // Ticket is a scratch game definition.
 type Ticket struct {
-	ID     string
-	Name   string
-	Blurb  string
+	ID    string
+	Name  string
+	Blurb string
 	// Cells is how many squares the player scratches, for presentation.
-	Cells  int
-	Tiers  []Tier
+	Cells int
+	Tiers []Tier
 }
 
 // Outcome is the result of one ticket.