Matrix multiplication is useful in various scientific fields and comes up in computation relatively frequently. Calculating matrices is a computationally intensive task however, and when errors occur, calculating the corrected product is a costly undertaking. This project aims to implement a recent algorithm to correct matrix products more efficiently than simply recalculating the entire product.