We define a simple and general condition (eventually detectable quiescence) under which consensus becomes solvable in asynchronous systems with crash failures. Unlike previous work that ties solvability to specific failure thresholds (e.g., contention levels), our approach isolates the essential property enabling agreement: the existence of an eventually quiescent period, i.e., a time where processes know that no more crash can occur. The key insight is that once quiescence is detected by a process, we can implement an Eventual Perfect failure detector, by monitoring processes activity, and execute the Lo & Hadzilacos consensus algorithm using this failure detector. Despite its simplicity, our algorithm improves the previous results that focused on contention-based failures.