Objects are placed randomly, one at a time, and rejected if they overlap an existing object. The process jams when no more objects fit. For 1D intervals of length 1 on [0, L], the jamming coverage converges to the Rényi parking constant M ≈ 0.7476847... (not close-packing!). For 2D disks, jamming ≈ 54.7%.