[Ethereum Researcher Proposes Quantum-Resistant Privacy Pool Solution, Proof Generation Speed Improved to 28.6 ms] Ethereum researcher Pierre has proposed a quantum-resistant privacy pool solution based on the Flock system, utilizing SHA-256 and replacing large circuits with small single-compression circuits. When the Merkle tree depth is 32, the proof generation time is reduced from 0.81 seconds to 28.6 milliseconds. The solution supports recursive aggregation, with the size of the aggregated proof fixed at 343.9 KiB and verification time ranging from 46 to 64 milliseconds. Additionally, the solution uses seed-deterministic derivation of Note Secrets, enabling users to securely withdraw funds through post-quantum verifiers even after the pool is frozen.