To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.Whereas quantum computers could exponentially outperform classical computers for certain computational tasks, inaccessibility due to implementation complexity would hinder widespread adoption of quantum computing. Thus, quantum computation is increasingly being performed 'in the cloud', such as IBM's 5-qubit quantum cloud service [1]. In this approach, quantum computing is outsourced from a client with classical hardware to a server who possesses expensive quantum hardware. Considering the types of applications to which quantum computing is likely to be applied, imformation security is important as clients may wish to keep the computation perfectly secret from untrusted servers implementing the quantum computation.A solution to this issue is offered by blind quantum computing (BQC) [2], which is a quantum cryptographic protocol that enables a classical client with limited quantum technology to delegate a computation to the quantum server(s) without leaking any information about her computation to the server(s). Thus far various BQC protocols have been proposed [2][3][4][5][6][7][8][9][10][11][12][13][14][15] , and some proof-ofprinciple experiments have been performed with photonic qubits [16][17][18][19][20]. However, all these experimental demonstrations only support quasi-classical clients. That is, the clients require the ability to prepare or measure singlequbit states, but wide use of quantum computing on the cloud would be much more attractive if clients did not require the ability to perform quantum tasks. Although using only classical communication between a classical client and a single quantum server may be infeasible for secure BQC [21], classical communication between a classical client and multi-quantum servers can work [14].Besides security, verifiability is another important concern for BQC, i.e. the ability of a client to test whether or not the servers perform the task correctly and honestly. As the complexity of quantum many-body systems scales up, verifiability becomes a major experimental challenge, not only in BQC, but also in quantum chemistry [22], quantum simulation [23], BosonSampling [24], and other quantum algorithms. Thus, a verification protocol for BQC is significant not only as a cryptographic protocol but also for exploring the relation between quantum physics and computer science.Here we demonstrate a proof-of-principle implementation of BQC for completely...