Take b = 2.

b^(n-1) mod n = 1.

863 is prime. b^((n-1)/863)-1 mod n = 26689, which is a unit, inverse 3839.

(863) divides n-1.

(863)^2 > n.

n is prime by Pocklington's theorem.