From the link Floer complex of a link K , we extract a lower bound t q (K ) for the rational unknotting number of K (i.e. the minimum number of rational replacements required to unknot K ). Moreover, we show that the torsion obstruction t q (K ) = t(K ) from an earlier paper of Alishahi and the author is a lower bound for the proper rational unknotting number. Moreover, t q (K #K ) = max{t q (K ), t q (K )} and t q (K #K ) = max{t q (K ), t q (K )}. For the torus knot K = T p,pk+1 we compute t q (K ) = p/2 and t q (K ) = p − 1.