In　BGP　networks,　traffic　migration　verification　ensures　the　scalability　and　reliability　of　the　network　during　configuration　changes.　However,　previous　approaches　suffer　from　low　scalability　and　high　computational　overhead.　In　this　poster,　we　propose　Polyx,　a　framework　for　accelerating　verification　of　traffic　migration　in　large-scale　BGP　networks.　Its　key　idea　is　to　leverage　hardware　parallelism　with　a　deterministic　serialization　algorithm　to　enhance　state　machine　techniques.　We　implement　the　Polyx　prototype　and　evaluate　it　on　our　built　testbed.　The　experimental　results　demonstrate　that　Polyx　achieves　up　to　46×　overall　speedup,　36×　in　state　machine　construction,　and　131×　in　equivalence　verification　with　minimal　FPGA　resource　usage.　©　2025　IEEE.