arXiv:2610.21680v1 Announce Type: new Abstract: Parareal is a parallel-in-time method for initial-value problems that has found extensive applications and given rise to many variants. Krylov-enhanced parareal is a variant of parareal that uses projection techniques to accelerate convergence substantially for linear problems. In this paper, we study a projection-based parareal algorithm for nonlinear initial-value problems with a modified iteration scheme and an arbitrary orthogonal projection. For a general nonlinear problem, we prove a convergence estimate for each iteration step on a fixed time grid. We analyze the errors of the modified scheme and the scheme of Krylov-enhanced parareal relative to the old error as the coarse grid is refined. For a coarse solver of order $p$ and step size $h$, we prove error bounds of $O(h^{p+1})$ for the modified scheme and $O(h)$ for that of Krylov-enhanced parareal at the first potentially inexact time point under mild assumptions. Numerical experiments on two nonlinear problems are consistent with the theoretical analysis.