Abstract: The certifiable quantum random number generation protocol based on cryptographic test proposed by Brakerski et al. can generate certifiable random numbers from the prover who holds a single quantum device. However, there is only one verifier in the protocol, thus there are certain limitations in application range. Based on the protocol of Brakerski et al., combined with the threshold secret sharing scheme, a multi-verifier certifiable quantum random number generation protocol is proposed. This protocol enabled n verifiers to obtain the same certifiable random number from one prover, thus broadening the scope of application of the original protocol. The security analysis shows that for a computationally unbounded quantum adversary with quantum side information of the prover and the information of at most t verifiers, the bit sequence generated by the N-round protocol has Ω(N) bits of min-entropy.