We initiate the study of verification power Affine finite automata (AfA) as a part Arthur-Merlin (AM) proof systems. show that every unary language is verified by real-valued AfA verifier. Then, we focus on verifiers restricted to have only integer-valued or rational-valued transitions. observe can be simulated verifiers, and their protocols in nondeterministic polynomial time. this upper bound...