The record for the most mutual checks in a legal position is known. But what is the record for double checks? There is one rule-threefold repetition applies. Four criteria exist-promoted pieces allowed and not along with forced, Black defends, and unforced, Black helps. Below is my research.
[Title "No Promoted Pieces, Unforced-6"]
[FEN "4K3/8/8/3p4/k1p1N3/1p4N1/P5BB/RRQ5 w - - 0 1"]
1. axb3+ Kb5 2. bxc4+ Kc6 3. cxd5+ Kxd5 4. Nc3+ Kd6 5. Nf5+ Kc5 6. Na4#
[Title "No Promoted Pieces, Forced-5"]
[FEN "kb1r4/P1p5/1P2P3/6NB/7B/8/8/RRQ4K w - - 0 1"]
1. axb8=Q+ Kxb8 2. bxc7+ Kc8 3. cxd8=Q+ Kxd8 4. Nf7+ Ke8 5. Nd6+ Kf8
[Title "Promoted Pieces, Unforced-9"]
[FEN "K5b1/5p2/4p3/3pR3/k1p1N1N1/1pQ5/P1B5/RR1R1RRR w - - 0 1"]
1. axb3+ Kb5 2. bxc4+ Kc6 3. cxd5+ Kd7 4. dxe6+ Ke8 5. exf7+ Kf8 6. fxg8=Q+ Kxg8 7. Nh6+ Kh7 8. Nf6+ Kh8 9. Nf7#
[Title "Promoted Pieces, Forced-8"]
[FEN "K4Bb1/5p2/4p3/3p4/k1p3N1/1pR5/P1B5/RQ1RRRRR w - - 0 1"]
1. axb3+ Kb5 2. bxc4+ Kc6 3. cxd5+ Kd7 4. dxe6+ Ke8 5. exf7+ Kxf8 6. fxg8=Q+ Kxg8 7. Nh6+ Kh8 8. Nf7#
Addendum: @Hauke Reddmann commented a known double checking mechanism, but no origin is given. The likely origin of it is a century old problem as @Evargalo proposed a comment.
[Title "Alain Campbell White, Pittsburgh Gazette Times 4/1916, Mate In 12"]
[FEN "2q5/2pp4/3pr3/4pb2/K1p2pn1/2bn1kp1/3pr1R1/6BB w - - 0 1"]
1. Rf2+! Ke3 2. Rf3+ Ke4 3. Re3+ Kd4 4. Re4+ Kd55. Rd4+ Kc5 6. Rd5+ Kc6 7. Rc5+ Kb6 8. Rc6+ Kb7 9. Rb6+ Ka7 10. Rb7+ Ka8 11. Ra7+ Kb8 12. Ra8#
The record for the longest sequence in a checkmate problem is 13, but it cannot contend for the record since Black’s king can walk out of the double checking sequence.
[Title "Dragan Stojnic & Milomir Babic, The Problemist 2004-05, Mate In 13"]
[FEN "3q1nKB/R1P1kPRB/N3p3/1p1n2p1/2r2p2/1p2b3/P2pb2N/3r4 w - - 0 1"]
1. c8=N+! Kf6 2. Rg6+ Kf5 3. Rf6+ Ke5 4. Rf5+ Ke45. Re5+ Kd4 6. Re4+ Kd3 7. Rd4+ Kc3 8. Rd3+ Kc2 9. Rc3+ Kb2 10. Rc2+ Kb1 11. Rb2+ Ka1 12. Rb1+ Kxa2 13. Nb4#