mersenneforum.org > Math Fast and robust error checking on Proth/Pepin tests
 Register FAQ Search Today's Posts Mark Forums Read

 2017-08-11, 16:26 #1 R. Gerbicz     "Robert Gerbicz" Oct 2005 Hungary 7×229 Posts Fast and robust error checking on Proth/Pepin tests In the recent days an interesting new error checking for LL test appeared, using Jacobi test. I'll give another type of checking, that detects much more errors (we see later what this means), but works on Proth numbers. The conditions: we allow at most O(log(N)) more memory to solve this, and at most eps overhead in running time (say eps~1/1000 or even smaller). We are seeking a high performance error checking algorithm. Code: quick background:: N=k*2^n+1 is Proth number if k<2^n, the base=a proves the primality of N, if a^((N-1/2)==-1 mod N. In special case k=1 for Fermat number, and in this case we can choose a=3 (Pepin). (if we choose a=quadratic nonresidue modulo N, then a^((N-1)/2)!=-1 mod N proves that N is composite). the setup:: Code: Let L=2000 constant (could even depend on n), and L2=L^2. u(t)=(a^k)^(2^t) mod N [0] d(t)=u(0)*u(L)*u(2*L)*...*u(t*L) mod N [1] with this d(t+1)=d(t)*u((t+1)*L) mod N [2] but d(t+1)=u(0)*d(t)^(2^L) mod N [3] is also true. in the standard Proth test (usually for small k), first we compute u(0), then with n-1 iterative squaring we get u(n-1), with this u(n-1)==-1 mod N iff N is prime (for a=quadratic nonresidue). We store only the last term of the d sequence to use identity [2]. (when we compute the next term, then two terms are available, after a possible check we can delete the last but one term). and store u(0)=a^k mod N, the last d[z],u[z], where z is divisible by L2. At each L-th term of the d sequence we check the identity of [3], if this does not hold, then we roll back, notice that it is also possible a computation error of the d sequence, so if we would roll back too much (say 100 times to the same term) then we just restart completely the computation. At the last few squarings in u, we also force an error checking computation of [3] (in that i when i is divisible by L and i+L>=n, this means only one extra checking of [3].) This leaves all potential erros in the (at most) last L squarings in u, or very unlikely errors earlier in u or d. The overhead is n/L mulmods in [2] and n/L2*L=n/L squaremod in [3] and n/L2 mulmods in [3]. so over the n-1 mulmods of the Proth test there is approx. n/1000 mulmods, if we count in mulmods everything. So the overhead is 0.1% in time. And we see why we haven't checked all terms of d, we could do that, but in that case the overhead in the error checking would be n/L*(L+1)>n mulmods, and that is a lot, slightly more time what we spend on the Proth test squarings. using PARI-GP: Code: myrand(r,N) returns s randomly from [0,N) for that s!=0 and s!=r (the r,s are in Z_N). myrand(r,N)={local(tmp);while(1,tmp=random(N);if(tmp!=0&&lift(tmp+r)!=0,return(tmp+r)))} we test N=k*2^n+1 Proth number, we use L at error checking, making errors in the i-th squaring with 50% chance if errpos[i]!=0 (note that if we return to the same i multiple times, then we choose the making error independently from the previous choices already done) we use base=a, this is optional, if you don't give, we find one suitable, (here a=quadratic nonresidue) if printmsg!=0, then we print out some additional info, the return value is (1+a^((N-1)/2) mod N), note that for prime the return value is zero. [not forget the 1+ in the formula] If you would not give a Proth number or errpos's length is too small, then the return value is (-1). fncheck(N,n,L,errpos,a=0,printmsg=1)={ k=(N-1)/(2^n); if(k>=2^n||k<1||type(k)!="t_INT",if(printmsg,print("Not a Proth number"));return(-1)); if(length(errpos)=n), if(d!=u0*prev_d^(2^L), numerr+=1;if(printmsg,print("Found error at iteration=",i,", roll back to iteration=",saved_i)); i=saved_i;res=saved_u;prev_d=saved_d;set_d=1, saved_i=i;saved_u=res;saved_d=d)); if(!set_d,prev_d=d))); res+=1; if(printmsg,if(lift(res)==0,print("N is prime."),print("N is composite.")); print("Number of errors (corrected and) detected=",numerr)); return(lift(res))} Proof that this detects the error exactly if there is at most one error in each L*L squarings block: suppose that the first L*z squarings was good, and after that in one of the next L squarings there was an error, we got r0!=u0^(e^(z+1)) mod N. (for shortening here we write e=2^L) prev_d=u0*u0^e*u0^(e^2)*u0^(e^3)*...*u0^(e^z)*r0*r0^e*...*r0^(e^w) d =u0*u0^e*u0^(e^2)*u0^(e^3)*...*u0^(e^z)*r0*r0^e*...*r0^(e^w)*r0^(e^(w+1)) d/prev_d^e/u0=r0/u0^(e^(z+1))!=1 mod N, so d!=u0*prev_d^e mod N, so it will be detected. What about multiple errors in the same block, say we've chosen N=13*2^82+1 Proth number and we make errors at i=11,13,43 (at each position with 50% chance), used L=3, this means that i=11,13 are in the same L2=9 length block, so with 25% chance we have double errors. Make the test for 50 times: Code: N=13*2^82+1;n=82; errpos=vector(n-1,i,0);errpos[11]=1;errpos[13]=1;errpos[43]=1; cnt=0;for(h=1,50,cnt+=(fncheck(N,n,3,errpos,0,1)==0);print()); print("Found prime ",cnt," times."); Code: Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=7 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=1 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=6 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=3 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=1 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=10 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=5 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=1 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=5 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=4 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=10 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=7 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=4 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=4 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=3 N is prime. Number of errors (corrected and) detected=0 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=1 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=4 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=14 N is prime. Number of errors (corrected and) detected=0 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=14 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=2 N is prime. Number of errors (corrected and) detected=0 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=3 N is prime. Number of errors (corrected and) detected=0 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=1 N is prime. Number of errors (corrected and) detected=0 N is prime. Number of errors (corrected and) detected=0 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=1 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=10 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=5 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=4 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=4 N is prime. Number of errors (corrected and) detected=0 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=4 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=1 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=5 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 N is prime. Number of errors (corrected and) detected=2 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=3 Found error at iteration=18, roll back to iteration=9 Found error at iteration=18, roll back to iteration=9 Found error at iteration=45, roll back to iteration=36 N is prime. Number of errors (corrected and) detected=3 ? Found prime 50 times. ? Impressive, detected ALL errors, but this is still NOT the theory, though we are not that far from the truth, lets repeat it with a much smaller number and with more times to see the true error rate: test N=5*2^13+1 Proth number; 1 million times (takes less than a minute), using L=2. Code: N=5*2^13+1;n=13; errpos=vector(n-1,i,0);errpos[5]=1;errpos[7]=1; sum(h=1,1000000,fncheck(N,n,2,errpos,0,0)==0) %12 = 999947 so there were only 53 false results out of a million Proth test, that is an error rate 53/10^6 ~ 2/N, quite good. making (at most) two errors, but in different blocks: Code: N=5*2^13+1;n=13; errpos=vector(n-1,i,0);errpos[7]=1;errpos[10]=1; sum(h=1,1000000,fncheck(N,n,2,errpos,0,0)==0) %14 = 1000000 This is exactly the theory, all errors detected, because they were in different blocks. We can easily generalize this error checking to the computation of a^(k*b^t) mod N (for small k). So we can use not only b=2.
 2017-08-16, 00:15 #2 GP2     Sep 2003 13·199 Posts More discussion of this idea and its possible applicability to Mersenne numbers is in the thread from the GPU Computing subforum.
2018-08-31, 11:41   #3
preda

"Mihai Preda"
Apr 2015

2×3×5×47 Posts

Quote:
 Originally Posted by R. Gerbicz I'll give another type of checking, that detects much more errors (we see later what this means), but works on Proth numbers.
Robert, do you have some idea about an error checking for stage 1 of P-1?

e.g. if the P-1 is done with left-to-right binary exponentiation.

Last fiddled with by preda on 2018-08-31 at 11:42

2018-08-31, 18:33   #4
kriesel

"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

710910 Posts

Quote:
 Originally Posted by preda Robert, do you have some idea about an error checking for stage 1 of P-1? e.g. if the P-1 is done with left-to-right binary exponentiation.
He referred to a P-1 check in http://mersenneforum.org/showpost.ph...&postcount=110

2018-08-31, 19:58   #5
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

7·229 Posts

Quote:
 Originally Posted by kriesel He referred to a P-1 check in See also http://mersenneforum.org/showpost.ph...&postcount=245
That is good.
Trivial extension and speedup: with Euler-Fermat theorem
a^e==a^(e mod eulerphi(d)) mod N, if gcd(a,N)=1, so if d|N is also true then
a^e==a^(e mod eulerphi(d)) mod d
should be also true, if it doesn't hold then we made an error.
Ofcourse here calculation of eulerphi(d) is easy, if you know the prime factorization of d.

Another small check: if e is even then (res / N) Jacobi symbol should be 1, where res=a^e mod N.
And if you make any multiplication error then you can discover it at any iteration with 50% chance.

Not counting these I don't know other checks. With a so general e, there is no such ladder trick, unfortunately.

ps. you could also post these to the longer error check's thread.

 2018-08-31, 20:37 #6 kriesel     "TF79LL86GIMPS96gpu17" Mar 2017 US midwest 11011110001012 Posts There was also the generic error checking and detection thread http://www.mersenneforum.org/showthread.php?t=23467 and a P-1 specific Jacobi check thread http://www.mersenneforum.org/showthread.php?t=23470
2018-08-31, 20:45   #7
kriesel

"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

7,109 Posts

Quote:
 Originally Posted by preda Robert, do you have some idea about an error checking for stage 1 of P-1? e.g. if the P-1 is done with left-to-right binary exponentiation.
Not sure what you mean by left to right binary exponentiation.
Are you contemplating implementing P-1 in OpenCL?
If so, that would fill a prominent vacancy in the available software versus algorithm and computing platform grid in part one of the attachment at http://www.mersenneforum.org/showpos...91&postcount=2

2018-08-31, 20:49   #8
science_man_88

"Forget I exist"
Jul 2009
Dartmouth NS

2·3·23·61 Posts

Quote:
 Originally Posted by kriesel Not sure what you mean by left to right binary exponentiation. Are you contemplating implementing P-1 in OpenCL? If so, that would fill a prominent vacancy in the available software versus algorithm and computing platform grid in part one of the attachment at http://www.mersenneforum.org/showpos...91&postcount=2
http://primes.utm.edu/glossary/xpage...entiation.html

 2018-08-31, 21:26 #9 preda     "Mihai Preda" Apr 2015 58216 Posts Thank you Robert and @kriesel! I'll think about these ideas. In my setup, I don't have a divisor d|N. Also the "up to 50%" of Jacobi seems weak IMO.
2018-08-31, 21:33   #10
preda

"Mihai Preda"
Apr 2015

58216 Posts

Quote:
 Originally Posted by kriesel Not sure what you mean by left to right binary exponentiation. Are you contemplating implementing P-1 in OpenCL?
AKA top-to-bottom, starting with the most significant bit and moving towards the least significant.

Yes, contemplating. P-1 is magically attractive.

2018-08-31, 22:07   #11
kriesel

"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

7,109 Posts

Quote:
 Originally Posted by preda ... the "up to 50%" of Jacobi seems weak IMO.
It is what it is, including better than nothing. Two things can make it better than it first seems.

1) It appears, from a test I wrote and ran, that for the early stage 1 powering computations, before the mod Mp kicks in, induced errors don't matter. I think that means they are equivalent to starting with a different base, which is allowed.
2) For tasks like computing the exponent (or partial computation) to which to raise the base, the Jacobi of the product and the product of the Jacobis of the terms can be computed and compared twice, with different denominators, going from ~50% to ~75% detection. I tried denominators M31 and M61 and confirmed that. That's extensible to 3 or more, with diminishing returns and increasing overhead.

Whether the checking overhead is worthwhile depends on the error rate. Making error checking optional and the default might be good. One of the challenges with P-1 is it's hard to tell from the results produced whether it's all working correctly. Starting by error checking a new installation is advisable.

 Similar Threads Thread Thread Starter Forum Replies Last Post T.Rex Math 12 2016-04-03 22:27 dragonbud20 Information & Answers 12 2015-09-26 21:40 Forceman Software 2 2013-01-30 17:32 Prime95 Software 68 2010-12-31 00:06 GP2 Data 13 2003-11-15 06:59

All times are UTC. The time now is 18:35.

Fri Dec 2 18:35:27 UTC 2022 up 106 days, 16:04, 0 users, load averages: 1.01, 0.98, 0.90

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔