Hypergraph states are generalizations of graph states where controlled-Z gates on edges are replaced with generalized controlled-Z gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states with a constant L1-norm error unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential singlequbit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying hypergraph states with only sequential single-qubit Pauli measurements. As applications, we consider verified blind quantum computing with hypergraph states, and quantum supremacy demonstrations with hypergraph states.Many-point correlations in quantum many-body systems are one of the most essential ingredients in condensed-matter physics and statistical physics. Correlations of sequential single-qubit measurements on quantum states are also important drive forces for quantum information processing. For example, measurement-based quantum computing [1], which is nowadays one of the standard quantum computing models, enables universal quantum computing with only adaptive single-qubit measurements on certain quantum states, such as graph states [1] and other condensed-matter-physically motivated states including the AKLT state [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Furthermore, not only adaptive but also non-adaptive singlequbit measurements on graph states can demonstrate a quantumness which cannot be classically efficiently simulated: it is known that if probability distributions of nonadaptive sequential single-qubit measurements on graph states are classically efficiently sampled, then the polynomial hierarchy collapses to the third level [18][19][20] or the second level [21]. The polynomial hierarchy is a hierarchy of complexity classes generalizing P and NP, and it is not believed to collapse in computer science. It is an example of recently well studied "quantum supremacies" of sub-universal quantum computing models, which are expected to be easier to experimentally implement, but can outperform classical computing. (For details, see Refs. [18][19][20][21][22][23][24] and their supplementary materials.)For practical implementations of measurement-based quantum computing and experimental demonstrations of the quantum supremacy, verifying graph states is essential, since in reality a generated state cannot be the ideal graph state due to some experimental noises. The problem becomes more serious if we consider delegated secure quantum computing, so called blind quantum computing [25,26]. It is known that the...