X^(2^T) mod N

I know that both X and N are 1024 bits. X will be chosen at random at test time. How will N be chosen? Will it be chosen randomly at test time or the fixed value given in https://github.com/supranational/vdf-fpga/blob/master/modular_square/rtl/modular_square_simple.sv?

Is N prime?