This paper introduces the Ripple Protocol Consensus Algorithm (RPCA), a novel method for achieving agreement in distributed payment systems. The algorithm aims to solve the Byzantine Generals Problem with low latency by utilizing subnetworks of collectively trusted nodes. It details the RPCA's components, formalization, and how it achieves correctness, agreement, and utility, even in the presence of a certain number of faulty nodes. The paper also discusses the heuristics and procedures used within the Ripple Protocol to ensure convergence and prevent network forks, concluding with a discussion of the algorithm's benefits for global payments.