{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":562273584,"defaultBranch":"master","name":"divrep","ownerLogin":"hvds","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-11-05T20:35:37.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/603041?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1708959457.0","currentOid":""},"activityList":{"items":[{"before":"280e7089407db94201bf91c54d9b2d833947e6e0","after":"c4bee0404fc9e91010e34f35d0d4b064d09f11ad","ref":"refs/heads/master","pushedAt":"2024-05-23T17:23:42.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: oops, close comment in header\n\nLuckily there was another comment immediately following.","shortMessageHtmlLink":"pc?ul: oops, close comment in header"}},{"before":"4564b6dd7166095899886693a44b68a2961047b0","after":"280e7089407db94201bf91c54d9b2d833947e6e0","ref":"refs/heads/master","pushedAt":"2024-05-23T15:01:37.000Z","pushType":"push","commitsCount":20,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: new strategy -j4 to allow allocation of 2^x'th powers\n\nThis is expected to be useful for cases where tau is divisible by\na high power of 2.\n\nNew strategy '-j4' acts like -j1 for powers with odd divisors, and aims\nto minimize the range of the next prime for 2^x'th powers. We order\nthings such that an allocation of p^{2^x} assumes what remains is not\ndivisible by any prime <= p.\n\nWhen this strategy is chosen, we set the 'highpow' flag'. When it is\nset, we maintain an additional mpz_t t_allocation.lim with every\nallocation as the maximum roughness of what remains; the strategy uses\nthis to prefer the target with the smallest range.\n\n'-p' and '-W' also apply limits to 2^x'th powers when highpow is set.\n\nTODO: consider whether there is something significant to be gained in\nwalk by taking advantage of \"we now assume v_i/q_i is divisible by no\nprime less than that of the last allocation\", either/both in early\nrejection (cf inv[]) or in factorization. A nice side-effect of early\nrejection would be to reduce duplicate candidates.","shortMessageHtmlLink":"pc?ul: new strategy -j4 to allow allocation of 2^x'th powers"}},{"before":"daf62f1941bec8dd69c2d1c72e575f72fd61f119","after":"4564b6dd7166095899886693a44b68a2961047b0","ref":"refs/heads/master","pushedAt":"2024-04-19T01:44:15.000Z","pushType":"push","commitsCount":6,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: -F<n> is buggy if n too low\n\nWe handle unforced primes with a \"tail\" entry which switches us from\nforced to unforced mode in the recursion; however there may still be\nhigher primes that should have forced patterns applied. Thus\n'pcoul -F3 160 6' will miss a pattern like \"5^4 2 . 2^4 . 2.5\"\ndue to the tail handling for 3^x.\n\nFor now we check for and disallow this case, until we can work out\nhow to handle it correctly.\n\nChecking logs, the only runs needing to be corrected were the two that\nalerted me to the issue.","shortMessageHtmlLink":"pc?ul: -F&lt;n&gt; is buggy if n too low"}},{"before":"cafba957c34ac7f9639a7f8e056c885a74bbecd4","after":"daf62f1941bec8dd69c2d1c72e575f72fd61f119","ref":"refs/heads/master","pushedAt":"2024-04-06T14:06:39.000Z","pushType":"push","commitsCount":6,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul bugfix: signed/unsigned mismatch with -P\n\nIn the presence of -P (introduced in cafba957c3) we could end up trying\nto compare an unsigned cost-of-walking against a negative cost-of-recursing,\nand do the wrong thing.","shortMessageHtmlLink":"pc?ul bugfix: signed/unsigned mismatch with -P"}},{"before":"8104901ab9518a4b98aea7ba9c9bff9c277c31d5","after":"cafba957c34ac7f9639a7f8e056c885a74bbecd4","ref":"refs/heads/master","pushedAt":"2024-03-17T13:22:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: new option -P<n> to control recurse/walk switch\n\nThis option specifies a cap on the effective maximum prime used in\nthe calculation that determines whether to recurse further or walk\nwhat we have. It is independent of gain (-g).\n\nThe intention is to allow, for example, a pair of runs with -p50 and\n-p50:100 to test all the same cases that a single -p100 run would test.\nIf both are run with -P50 and other options are kept the same through\nall runs, I *think* they should be guaranteed to do so.\n\nThe -P value for all runs should be no larger than the least -p value\nin any run, ie 50 in the example above.","shortMessageHtmlLink":"pc?ul: new option -P&lt;n&gt; to control recurse/walk switch"}},{"before":"4f12e495a7947a4aeefd4c7ede1de83bb60577e0","after":"8104901ab9518a4b98aea7ba9c9bff9c277c31d5","ref":"refs/heads/master","pushedAt":"2024-03-17T04:08:40.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: parallel testing of primes\n\nWhen we want to know whether all of a set of values are prime, do only\nminimal checks of each one initially, then do slower checks.\n\nCurrently this just crudely splits the primality testing into the\n\"primality pretest\" and the final BPSW step; consider further splitting\nup the pretest work.","shortMessageHtmlLink":"pc?ul: parallel testing of primes"}},{"before":"cc4fc91fd4ced6a8588a406f6b0b1392d891f5d3","after":"4f12e495a7947a4aeefd4c7ede1de83bb60577e0","ref":"refs/heads/master","pushedAt":"2024-03-17T03:50:14.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: parallel testing of primes\n\nWhen we want to know whether all of a set of values are prime, do only\nminimal checks of each one initially, then do slower checks.\n\nCurrently this just crudely splits the primality testing into the\n\"primality pretest\" and the final BPSW step; consider further splitting\nup the pretest work.","shortMessageHtmlLink":"pc?ul: parallel testing of primes"}},{"before":"1587b1859a56828ba3befcb1dd423a8439eaecb0","after":"cc4fc91fd4ced6a8588a406f6b0b1392d891f5d3","ref":"refs/heads/master","pushedAt":"2024-03-16T19:48:43.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: parallel testing of primes\n\nWhen we want to know whether all of a set of values are prime, do only\nminimal checks of each one initially, then do slower checks.\n\nCurrently this just crudely splits the primality testing into the\n\"primality pretest\" and the final BPSW step; consider further splitting\nup the pretest work.","shortMessageHtmlLink":"pc?ul: parallel testing of primes"}},{"before":"14c92a328727a884f5b9f49aae8f84f87f92d8d8","after":"1587b1859a56828ba3befcb1dd423a8439eaecb0","ref":"refs/heads/master","pushedAt":"2024-03-16T19:09:42.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: parallel testing of primes\n\nWhen we want to know whether all of a set of values are prime, do only\nminimal checks of each one initially, then do slower checks.\n\nCurrently this just crudely splits the primality testing into the\n\"primality pretest\" and the final BPSW step; consider further splitting\nup the pretest work.","shortMessageHtmlLink":"pc?ul: parallel testing of primes"}},{"before":"48a46f4eccf652b543f470eadd9d479fad9dd869","after":"14c92a328727a884f5b9f49aae8f84f87f92d8d8","ref":"refs/heads/master","pushedAt":"2024-03-16T17:13:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: parallel testing of primes\n\nWhen we want to know whether all of a set of values are prime, do only\nminimal checks of each one initially, then do slower checks.\n\nCurrently this just crudely splits the primality testing into the\n\"primality pretest\" and the final BPSW step; consider further splitting\nup the pretest work.","shortMessageHtmlLink":"pc?ul: parallel testing of primes"}},{"before":"7329a94dd39f3df35c421813555f4d82a359274d","after":"48a46f4eccf652b543f470eadd9d479fad9dd869","ref":"refs/heads/master","pushedAt":"2024-03-15T04:10:29.000Z","pushType":"push","commitsCount":6,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"TRACK_STATS: account for a full match in test_multi_append()\n\nIf tau_multi_prep() fully determines that some value gives the required\ntau, account for this when tracking stats.","shortMessageHtmlLink":"TRACK_STATS: account for a full match in test_multi_append()"}},{"before":"76e48f12fc62c095f301dff4255383330d028a37","after":"7329a94dd39f3df35c421813555f4d82a359274d","ref":"refs/heads/master","pushedAt":"2024-03-04T14:55:02.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: reduce calls to best_v()\n\nWhen best_v() returns failure after an unforced allocation (implying no\nfurther unforced allocations are needed), make that sticky - going to the\nnext prime on the last allocation won't change the answer.","shortMessageHtmlLink":"pc?ul: reduce calls to best_v()"}},{"before":"a90b0f0fa092b8d88ba3f52071639080da4c0626","after":"76e48f12fc62c095f301dff4255383330d028a37","ref":"refs/heads/master","pushedAt":"2024-03-04T01:43:46.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: hint to gcc's optimizer that k > 0\n\nInspecting disassembly of best_v0() shows that gcc has unrolled the loop,\nbut puts a mandatory check for k == 0 at the front even after we've added\nthe \"check or die\".\n\nAdding assume(k > 0) is enough to stop it doing this.","shortMessageHtmlLink":"pc?ul: hint to gcc's optimizer that k &gt; 0"}},{"before":"afa1f77d0c7354514264a54e0f795aba245f0102","after":"a90b0f0fa092b8d88ba3f52071639080da4c0626","ref":"refs/heads/master","pushedAt":"2024-03-01T23:35:19.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"c?ul: track statistics with -DTRACK_STATS\n\nWhen built with this option, we track the number of times that checking\ntau(v) = n fails on the first value checked, on the second value, etc,\nand show the counts in 305 progress lines and in the 367 final stats.","shortMessageHtmlLink":"c?ul: track statistics with -DTRACK_STATS"}},{"before":"89c46519c134800a0b2d5d0e9baf816ac308a0be","after":"afa1f77d0c7354514264a54e0f795aba245f0102","ref":"refs/heads/master","pushedAt":"2024-02-26T17:36:48.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"coulvec: TYPE_OFFSET needs a context\n\n'n' is statically available in coul.c, but only via the context in\ncoulvec.c","shortMessageHtmlLink":"coulvec: TYPE_OFFSET needs a context"}},{"before":"15945bef8c7a6088405f2be478ddcc85abb67501","after":"74081191220b3526a3e44acfdd509e1061cf669d","ref":"refs/heads/track_c","pushedAt":"2024-02-26T17:28:31.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"coulvec: partial support for base/post-batch split of checks\n\nNot quite sure what this was aiming to do, but there are some\ntroublesome FIXMEs that probably have to be addressed.","shortMessageHtmlLink":"coulvec: partial support for base/post-batch split of checks"}},{"before":"183d150be0beeec7bffe77c13d6e34599e2bcd33","after":"89c46519c134800a0b2d5d0e9baf816ac308a0be","ref":"refs/heads/master","pushedAt":"2024-02-26T17:28:20.000Z","pushType":"push","commitsCount":72,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"wip: temporary tweaks\n\nThis work is currently hacked in for -yr, but needs to be generalized:\n- don't treat primes as special for bisect-fp, bisect-g, report -c,\n  and test-order runs;\n- separate constants for SLOW runs and BISECT_RATE;\n- modify constants to shorten SLOW runs and delay TS runs;\n- increase optc faster;\n- bisect earlier, and more aggressively;","shortMessageHtmlLink":"wip: temporary tweaks"}},{"before":null,"after":"15945bef8c7a6088405f2be478ddcc85abb67501","ref":"refs/heads/track_c","pushedAt":"2024-02-26T14:57:37.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"report: option -z to sort by value checked to","shortMessageHtmlLink":"report: option -z to sort by value checked to"}},{"before":"b11289b1cc25a21996966048b92fbfd3c9ec157d","after":"183d150be0beeec7bffe77c13d6e34599e2bcd33","ref":"refs/heads/master","pushedAt":"2023-05-15T17:10:10.237Z","pushType":"push","commitsCount":6,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"c?ul: update Makefile for MPUGMP changes\n\nAfter latest MPUG commits we need to bring in two new files.","shortMessageHtmlLink":"c?ul: update Makefile for MPUGMP changes"}},{"before":null,"after":"77978b2501d6611192ece5829941371315a06b9f","ref":"refs/heads/fixvt","pushedAt":"2023-04-17T12:11:32.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: window title should be able to see all allocations\n\nThis probably became off-by-one due to d498dc4c1b.","shortMessageHtmlLink":"pc?ul: window title should be able to see all allocations"}},{"before":"fa82d7f02ca509bd88ffd9a90f94b24742ac0c9e","after":"b11289b1cc25a21996966048b92fbfd3c9ec157d","ref":"refs/heads/master","pushedAt":"2023-04-13T13:30:00.000Z","pushType":"push","commitsCount":12,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"pc?ul: copy/paste bug in walk_1_set\n\nValues fixed to be squares were tested as primes instead.\n\nThis may require some calculations to be redone; however few if any\ncases are expected, since in most cases if any values are fixed to be\nsquare we don't do the further allocations that could cause this path\nto be reached.","shortMessageHtmlLink":"pc?ul: copy/paste bug in walk_1_set"}},{"before":"410b982e46056a307aa76843de45a3859958e702","after":"fa82d7f02ca509bd88ffd9a90f94b24742ac0c9e","ref":"refs/heads/master","pushedAt":"2023-04-09T00:03:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"new target \"track\" (-yr)\n\nf(n, k) is the least d such that tau(d+i) = tau(n+i) for all 0 <= i < k,\nas in A309981.","shortMessageHtmlLink":"new target \"track\" (-yr)"}},{"before":"608b227d2dcee0045353f07fb161c1fe4fbb51d9","after":"410b982e46056a307aa76843de45a3859958e702","ref":"refs/heads/master","pushedAt":"2023-03-08T17:38:29.823Z","pushType":"push","commitsCount":2,"pusher":{"login":"hvds","name":"Hugo van der Sanden","path":"/hvds","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/603041?s=80&v=4"},"commit":{"message":"c?ul: detect the impossible\n\nIf no arrangement of powers of a fixed prime is valid, raise a fatal error.","shortMessageHtmlLink":"c?ul: detect the impossible"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEUkjzCgA","startCursor":null,"endCursor":null}},"title":"Activity · hvds/divrep"}