Snitch

[I-Omnibus]

@marghidanu @Kinematics

readonly int[] steps = new int[8] { 6, 4, 2, 4, 2, 4, 6, 2 };

In PrimeSieveArrayPool8of30M.cs the steps array presupposes unmerited knowledge of prime values, as in the following equivalent:

const int P7 = 7, P11 = 11, P13 = 13, P17 = 17, P19 = 19, P23 = 23, P29 = 29, P31 = 31, Unused = 6;
readonly int[] steps = new int[8] {
	Unused,
	P11-P7,
	P13-P11,
	P17-P13,
	P19-P17,
	P23-P19,
	P29-P23,
	P31-P29,
};

There maybe a few microseconds to shave off with squareroot approximation:

		public static int SquareRootish(int product)
			=> product switch {
				1000000 => 1000,
				100000 => 317,
				10000 => 100,
				1000 => 32,
				100 => 10,
				10 => 4,
				> 1000000 => (int)MathF.Sqrt(product),
				> 1 => ((Func<int, int>)(value => {
					int result = value >> 1;
					int quotient = value / result;
					for (byte index = 0; (index < 12) && (result != quotient); index++) {
						quotient = value / result;
						result = (result + quotient) >> 1;
					}
					return result;
				}))(product),
				_ => product,
			};

[rbergen]

In PrimeSieveArrayPool8of30M.cs the steps array presupposes unmerited knowledge of prime values, as in the following equivalent

That's why it's marked as a wheel algorithm.