I had a similar idea as a child: generate all short strings of text, attempting to interpret them as proofs. If it's not a proof, discard it; if it is, then it's automatically trustworthy.
The problem is that I had no grasp of how many short strings there were, let alone how many moving images. A 100 x 100 pixel display (very, very poor...) at 16 colors showing a 1 minute clip (at 10 fps, also poor) has 100 x 100 x 60 x 10 = 6,000,000 pixels in total. Cycling through each possibility (1 minute for each, naturally) would take 2^6000000 minutes.
The galaxy should decay into Hawking radiation or a photon/lepton soup in around 2^350 minutes, so as long as your program runs for at least 2^5999650 times longer than the galaxy, you should see the coronation as desired.
But even if you're that patient, how will you know which coronation is real and which many are clever 'forgeries'?...