Quote:
Originally Posted by Mark Rose
As I understand it, the problem at hand is knowing how many unassigned exponents have no P1, and what TF bitlevel those exponents are at...

Do you guys need a list of suboptimally TF'd stuff that hasn't had any P1 work (and is available)? Is that the main thing needed? I can't really help much with the rate at which things are being processed, but I can generate lists like this (just the top 50 here):
Code:
exponent TFBits
80010001 73
80012903 71
80012917 71
80012923 71
80012957 71
80013163 72
80013253 72
80013257 72
80013347 71
80013397 72
80013749 71
80013827 71
80013877 71
80013979 71
80014027 71
80014537 71
80014601 71
80014663 71
80014673 71
80014703 72
80016107 71
80016121 71
80016199 71
80016281 71
80016359 71
80016613 71
80016623 71
80016647 71
80016667 71
80017087 71
80017097 71
80017099 71
80017187 71
80017243 71
80017627 71
80017649 71
80017739 71
80017837 71
80017871 71
80018023 72
80018041 72
80018327 72
80018333 72
80018377 72
80018381 72
80018767 71
80018857 72
80018933 72
80018963 72
80019227 72
PS  That's using this little bit of clause for TF bit levels... I didn't know what the 80M+ stuff would be, ideally, thus the 75 bit for everything 80M+
Code:
((exponent between 0 and 40e6 and no_factor_to_bits<71)
OR (exponent between 40e6 and 50e6 and no_factor_to_bits<72)
OR (exponent between 50e6 and 65e6 and no_factor_to_bits<73)
OR (exponent between 65e6 and 80e6 and no_factor_to_bits<74)
OR (exponent between 80e6 and 999e6 and no_factor_to_bits<75))