Richard J. Lipton's blog was where the action was last year when Deolalikar announced he had a proof of arguably the most important problem -- Is P equal to NP? -- in theoretical computer science. Lipton has an update of sorts on the status of Deolalikar's work: nothing new on the paper itself (at least in the public domain), but plenty of lessons from those heady days of Public Science. Here's one:
... there may be substantial contributions, perhaps new conditional results, that can possibly come from [Deolalikar's] work. This may be where the worry most applies. If there is something in Vinay Deolalikar’s long paper, then this is worth attending to, and the first onus is on the author.