1. The P vs. NP survey is only 2 years old, so all the edits I'd make to it now would be rather minor ones: for example, including some more recent circuit lower bounds of Ryan Williams and others, some more no-go results for Geometric Complexity Theory, and Raz and Tal's BQP vs. PH breakthrough (which required a new circuit lower bound, though not of a kind that can evade the natural proofs barrier).

2. See here for my answer to someone who asked me for my thoughts on blockchain just a couple weeks ago: https://www.scottaaronson.com/blog/?p=3861#comment-1768247