The Cunningham numbers in https://escatter11.fullerton.edu/nfs/numbers.html are not completely sorted by difficulty, e.g. 2,1115+ has only SNFS 269, but it is after 3,667- (which has SNFS 318), can you sorted all Cunningham numbers by difficulty? Maybe there is some other numbers not current in list, such as 10,323-, have difficulty less than some number currently in list (e.g. 6,451-, 6^451-1 is larger than 10^323-1, and Phi(451,6) is also larger than Phi(323,10)).

(1) Give it a rest. This so-called "complaint" has come up before. I think that I know who you
are from the tone of your post. You have been admonished before.

(2) Why does it matter if they are not sorted by difficulty? EXPLAIN.

(3) It is extremely difficult to compare (say) a C318 done by sextic with a C259 done by a quartic since
a quartic is very sub-optimal for a number this size. 2,1115+ would be out of NFS@Home reach if done
by sextic. Toss in the occasional reciprocal quintic and comparisons become really problematic.

(4) Your comment "6,451-, 6^451-1 is larger than 10^323-1, and Phi(451,6) is also larger than Phi(323,10))."
shows that you do not understand what makes one number more difficult than another. The phi function is
relevant ONLY when comparing numbers done with the same degree polynomial. You've been told this
before but somehow you don't seem to listen. 6,451- has 6,41- as an algebraic factor.