Abstract: Au algorithm for proving the equivalence between booleans is presented here. In this algorithm, the boolean's vectorial statement, Space vector's simplification,space vector's change are introduced. The complexity of the algorithm is O(k×2), where N is the number of input variables and k is a constant. (When N increases, k decreases, and when N is large than 9, k is small than 0.5.)