This paper addresses the limitations of BPTT by proposing a new method (C-RBP) with O(1) memory-complexity. The proposed approach is evaluated on Pathfinder, showing reasonably good results. Reviewers were unanimously positive, though there were some minor concerns about clarity and the baselines used. I found the authors' response compelling in response to both points, as did the reviewers, though I would strongly encourage the authors to take the clarity suggestions seriously, as I feel they will significantly improve the paper. I recommend this paper should be accepted as a spotlight.