A prime found for the generalized Riesel problem to base 70.
Generalized Riesel problem base b (b>=2): Finding and proving the smallest k>=1 such that (k*b^n-1)/gcd(k-1,b-1) is not prime for all integers n>=1.
Generalized Sierpinski problem base b (b>=2): Finding and proving the smallest k>=1 such that (k*b^n+1)/gcd(k+1,b-1) is not prime for all integers n>=1.
Status for the generalized Riesel problem bases 2~128 and 256, 512, 1024: https://docs.google.com/document/d/e/2PACX-1vTb4hZ3-V6K6usszow7_EfYULqeJerDObsY9EUrycbtewwHbuPRy40OaP1Gftc9Mzes_NAalbF8cNyG/pub
Status for the generalized Sierpinski problem bases 2~128 and 256, 512, 1024: https://docs.google.com/document/d/e/2PACX-1vQMhZGxAX7Yuzx2q1xyKudcbWLhKlyzEOqmjDBRgTjJdguhMTORkHIOEZbq2-BMVswY9IYDNnWsnwkN/pub
See mersenneform thread https://mersenneforum.org/showthread.php?t=21839&page=98 and GitHub page https://github.com/xayahrainie4793/Extended-Sierpinski-Riesel-conjectures for more information.

To be completed...