Sobriety is a topological property asking that every irreducible closed set is the closure of a unique point. For dcpos equipped with the Scott topology, sobriety is deeply connected to the order-theoretic structure, but the exact relationship between meet-continuity, countability, and sobriety remains poorly understood. The question is whether there exists a computable or otherwise explicit criterion, read directly from the Scott topology of a countable meet-continuous dcpo, that serves as a necessary and sufficient witness to the failure of sobriety. This would mean identifying a concrete topological or order-theoretic gadget whose presence exactly marks the non-sober cases.