Yves Gallot's Cyclo

A titan, as defined by Samuel Yates, is anyone who has found a titanic prime. This page provides data on those that have found these primes. The data below only reflects on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s):	L4026, p379, L4561, p437, A5
E-mail address:	(e-mail address unpublished)
Web page:	https://github.com/galloty/genefer22/tree/main/cyclo
Username	Cyclo	(entry created on 12/28/2014 22:13:08 UTC)
Database id:	4310	(entry last modified on 12/8/2023 12:48:02 UTC)
Program Does *:	special
Active primes:	on current list: 26, rank by number 22
Total primes:	number ever on any list: 57
Production score:	for current list 54 (normalized: 13216), total 54.3109, rank by score 11
Largest prime:	Phi(3, - 465859^1048576) ‏(‎11887192 digits) via code L4561 on 5/31/2023 19:32:31 UTC
Most recent:	Phi(3, 93606¹⁷⁷¹⁴⁷) ‏(‎1761304 digits) via code p437 on 11/29/2023 17:11:02 UTC
Entrance Rank:	mean 281.38 (minimum 7, maximum 477)
Unprocessed:	prime submissions still untested or inprocess: 1.

Descriptive Data: (report abuse)

Cyclo is a probable primality checker for numbers of the form Φ_3·2ⁿ (b) = Φ₆(b ^{2^n - 1}) = Φ₃(-b ^{2^n - 1}) = b ^2ⁿ - b ^{2^n - 1} + 1.
The test of this form is fast (compared to other programs) due to the use of a discrete transform built with the roots of the polynomial.
It is similar to genefer algorithm (GF_n (b) = Φ_2·2ⁿ (b)): Cyclo is a variant of this program.
The smallest base values yielding these primes are OEIS A246119.

Surname: Cyclo (used for alphabetizing and in codes).
Unverified primes are omitted from counts and lists until verification completed.

I administer Yves Gallot's Cyclo and I would like to