PHANTOM posed the hard problem; GHOSTDAG made it runnable
Yonatan Sompolinsky, Shai Wyborski and Aviv Zohar framed PHANTOM as a generalization of Nakamoto consensus. Instead of forcing every accepted block into one chain, a blockDAG records references among concurrently produced blocks. The ordering objective is computationally hard, so the paper also introduced GHOSTDAG, a greedy algorithm designed to approximate that structure efficiently.
The paper proves properties inside an explicit model; it does not establish perfect security under every network condition. Kaspa's practical wager is narrower and testable: less honest work must be thrown away when blocks arrive in parallel, allowing a higher block rate while nodes still derive a common order.