I am not so sure censorship resistance mathematically requires open list of confirmation validators. I agree there are no current counter examples. But I can imagine a proof of stake system that nominates an extremely large and changing set of validators in a way that is quite resistant to censorship. I don’t mean to say this is easy or it is done, only that does not seem mathematically precluded.

you are making exactly this claim. Do you have a proof, or argument to support this? (not intended as a confrontational challenge, I am truly unclear on this point.)

— dan