Here’s a post and comment thread at Computational Complexity from way back in November that struck me as funny when I came across it. In the post itself, Lance complains about the scarcity of publicly-accessible proofs of Barrington’s Theorem. In the comments, the eponymous David Max Barrington appears, and gives the proof.