PRF is already implemented in WebAuthn Clients and Credential Managers, so the cat is out of the bag. My asks:
I wanted to test this claim with SAT problems. Why SAT? Because solving SAT problems require applying very few rules consistently. The principle stays the same even if you have millions of variables or just a couple. So if you know how to reason properly any SAT instances is solvable given enough time. Also, it's easy to generate completely random SAT problems that make it less likely for LLM to solve the problem based on pure pattern recognition. Therefore, I think it is a good problem type to test whether LLMs can generalize basic rules beyond their training data.
，这一点在旺商聊官方下载中也有详细论述
选举实行无记名投票、公开计票的方法，选举结果应当当场公布。选举时，应当设立秘密写票处。
Юлия Мискевич (Ночной линейный редактор)