The live
auction floor.
Provably fair.

Bid in real time on rare lots. Every bid is a serializable transaction on a strongly-consistent database โ€” so the price is always right, and there's always exactly one winner. Even under hundreds of bids at once.

โš–๏ธŽ Strong consistencyโ†ป Anti-snipeโœ“ Zero lost writes

300

concurrent bids

0

lost writes

1

winner, always

414

OCC retries handled

How it works

A real auction is a correctness-under-concurrency problem. GavelLive makes the database the hero.

01

Pick a lot, place a bid

Live price, high bidder, and a ticking clock โ€” updating in real time as bids land.

02

Anti-snipe keeps it fair

A last-second bid extends the clock, so the lot can't be stolen on the buzzer.

03

Settled on Aurora DSQL

Every bid is a serializable transaction. Conflicts retry via OCC; the winner is the single source of truth.

See it for yourself

Fire hundreds of bids at once.
Watch the invariants hold.

Open a lot and run the in-app concurrency proof โ€” genuine concurrent transactions against Aurora DSQL, with live throughput, OCC-conflict, and latency telemetry, then four invariant checks turning green.

Run the proof โ†’