Efficient Verifiable Delay Function paper suggested that there is two way to construct the group. One of them requires trusted setup in the sense whoever constructs the RSA unknown group order needs to destroy the factors otherwise fake proof can be constructed.
Another way is using a class group of imaginary quadratic fields. However, the paper didn't give an example of how it can be used. Is everything else except this step the same, or it requires different proof verification?