He is now reporting a second Proth find for k=11, so reports both 11*2^8103463 + 1 and 11*2^9381365 + 1 in short succession.
The latter is reported to divide a GF(-, 6).
One gets the expression that he has exhausted Proth k=11 from some point near PrimeGrid's leading edge, to over n=9.3M. However, we cannot be sure he did not skip candidates or make mistakes or have bad residues.
I wonder if he did other low k Proth as well, k≠11.