I was using flp as an abbreviation. And I’ll read Joe Carlsmith’s report and then let you know what I think.
edit: Oh yeah, and one thing to keep in mind is these are estimates for if we suddenly had a shockingly big jump in amount of compute (12 orders of magnitude) but no time to develop or improve existing algorithms. So my estimates for ‘what could a reasonably well engineered algorithm, that had been tested and iterated on at scale, do?’ would be much much lower. This is stupidly wasteful upper bound.
I was using flp as an abbreviation. And I’ll read Joe Carlsmith’s report and then let you know what I think.
edit: Oh yeah, and one thing to keep in mind is these are estimates for if we suddenly had a shockingly big jump in amount of compute (12 orders of magnitude) but no time to develop or improve existing algorithms. So my estimates for ‘what could a reasonably well engineered algorithm, that had been tested and iterated on at scale, do?’ would be much much lower. This is stupidly wasteful upper bound.