Tonelli-Shanks algorithm

Translation of the Wikipedia pseudocode, heavily influenced by Sidef and Python.

#  Legendre operator (𝑛│𝑝)
sub infix:<│> (Int \𝑛, Int \𝑝 where 𝑝.is-prime && (𝑝 != 2)) {
    given 𝑛.expmod( (𝑝-1) div 2, 𝑝 ) {
        when 0  {  0 }
        when 1  {  1 }
        default { -1 }
    }
}

sub tonelli-shanks ( \𝑛, \𝑝 where (𝑛│𝑝) > 0 ) {
    my $�� = 𝑝 - 1;
    my $�� = 0;
    $�� +>= 1 and $��++ while $�� %% 2;
    return 𝑛.expmod((𝑝+1) div 4, 𝑝) if $�� == 1;
    my $�� = ((2..𝑝).first: (*│𝑝) < 0).expmod($��, 𝑝);
    my $�� = 𝑛.expmod( ($��+1) +> 1, 𝑝 );
    my $�� = 𝑛.expmod( $��, 𝑝 );
    while ($��-1) % 𝑝 {
        my $b;
        my $��2 = $��² % 𝑝;
        for 1 .. $�� {
            if ($��2-1) %% 𝑝 {
                $b = $��.expmod(1 +< ($��-1-$_), 𝑝);
                $�� = $_;
                last;
            }
            $��2 = $��2² % 𝑝;
        }
        $�� = ($�� * $b) % 𝑝;
        $�� = $b² % 𝑝;
        $�� = ($�� * $��) % 𝑝;
    }
    $��;
}

my @tests = (
    (10, 13),
    (56, 101),
    (1030, 10009),
    (1032, 10009),
    (44402, 100049),
    (665820697, 1000000009),
    (881398088036, 1000000000039),
    (41660815127637347468140745042827704103445750172002,
      100000000000000000000000000000000000000000000000577)
);

 for @tests -> ($n, $p) {
    try my $t = tonelli-shanks($n, $p);
    say "No solution for ({$n}, {$p})." and next if !$t or ($t² - $n) % $p;
    say "Roots of $n are ($t, {$p-$t}) mod $p";
}

Output:

Roots of 10 are (7, 6) mod 13
Roots of 56 are (37, 64) mod 101
Roots of 1030 are (1632, 8377) mod 10009
No solution for (1032, 10009).
Roots of 44402 are (30468, 69581) mod 100049
Roots of 665820697 are (378633312, 621366697) mod 1000000009
Roots of 881398088036 are (791399408049, 208600591990) mod 1000000000039
Roots of 41660815127637347468140745042827704103445750172002 are (32102985369940620849741983987300038903725266634508, 67897014630059379150258016012699961096274733366069) mod 100000000000000000000000000000000000000000000000577