{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":78639135,"defaultBranch":"master","name":"GNFS","ownerLogin":"AdamWhiteHat","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2017-01-11T12:56:54.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/3144777?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1680803656.0","currentOid":""},"activityList":{"items":[{"before":"314caa0fc8b89c29bf2746d78be6d5b9c69c1d54","after":"4743581a4b8828e2501ddb9382e02a822f164141","ref":"refs/heads/master","pushedAt":"2023-08-23T21:41:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AdamWhiteHat","name":"Adam White","path":"/AdamWhiteHat","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3144777?s=80&v=4"},"commit":{"message":"Issue #16: Square root not working.\n\nThis check-in fixes several bugs, improves logging during the square root step and improved the speed of the polynomial modulus a polynomial routine.\n\nThe square root method seems to succeed with a much higher probability than previously, but not with the probability of 1/2 as expected.\n\nHowever, this might just be an issue with small number factorizations, in that its not picking an inert prime that is large enough.\nThe formula for picking an inert prime starting value returns a proportionately sized inert prime. However, the algorithm seems to only succeed for small values of N when the inert prime is a significant fraction of the value of N.\n\nMore test values of a reasonably appropriate (larger) size are needed to avoid factoring by numerical coincidence and to avoid the inert prime too small issue mentioned above.\n\nMore testing needed.\n\nFull list of changes:\n- Changed target framework from 6.0 to 5.0 (until I can be bothered to upgrade my windows to version 10, )\n- Added static logging function delegate: GNFS.LogFunction\n- Added a bunch more logging around the square root step, as well as other places.\n- Legendre.SymbolSearch had a bug in it. I fixed the bug.\n- Polynomial.ModMod had a horrible runtime. I was able to write a version that ran in a fraction of the time by avoiding needless array allocations and diligently using modulus everywhere to avoid large numbers.\n- Normal.Algebraic now calculates things using the arbitrary precision arithmetic library BigRational. This is important for large polynomials such as used when factoring RSA-100, as the norm calculations using only decimals would begin to lose accuracy and then eventually throw an overflow exception.\n- There was a bug with SmoothRelations_TargetQuantity, in that it was often less than SmoothRelationsRequiredForMatrixStep, sometimes by 1, and so would needlessly run an extra round of sieving.\n- I added some safeguards around the RecursiveDelete function in TestGNFS, moved it to a reusable helper class and made each test class call that common helper class function.\n- Removed some dead code.","shortMessageHtmlLink":"Issue #16: Square root not working."}},{"before":"bd995d30ccc06c7538a194f778a80c0d0565684f","after":"314caa0fc8b89c29bf2746d78be6d5b9c69c1d54","ref":"refs/heads/master","pushedAt":"2023-07-18T08:52:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AdamWhiteHat","name":"Adam White","path":"/AdamWhiteHat","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3144777?s=80&v=4"},"commit":{"message":"Convert all projects over to new .NET Core Sdk style projects.","shortMessageHtmlLink":"Convert all projects over to new .NET Core Sdk style projects."}},{"before":"ccc70b4c40d2e72c5fb8346526c6596ce6cd6b2c","after":"bd995d30ccc06c7538a194f778a80c0d0565684f","ref":"refs/heads/master","pushedAt":"2023-07-18T08:03:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AdamWhiteHat","name":"Adam White","path":"/AdamWhiteHat","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3144777?s=80&v=4"},"commit":{"message":"Issue #15: Merge PR from alexhiggins732's fork:\n1) NullReferenceException when loading Relations from disk\n2) Allow create new/overwrite already existing factorization files. Added confirmation prompt. Added Relations files removal\n3) Comment out IsRationalIrreducible exception throw in SquareFinder (pretty sure it makes no sense to perform this check. The rational/algebraic norms necessarily should share some factors, because we are trying to form a square number).\n4) New/second integration test.\n5) DirectoryLocations now handles constructing and caching filenames.","shortMessageHtmlLink":"Issue #15: Merge PR from alexhiggins732's fork:"}},{"before":"505811ce6c1f7d7a27c85aea0b8c17a8e92956ec","after":null,"ref":"refs/heads/dependabot/nuget/GNFSCore/Newtonsoft.Json-13.0.2","pushedAt":"2023-04-06T17:54:16.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"dependabot[bot]","name":null,"path":"/apps/dependabot","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/29110?s=80&v=4"}},{"before":"03b94a49ad2df4e517666ac77ed7cfdd1a54a179","after":"ccc70b4c40d2e72c5fb8346526c6596ce6cd6b2c","ref":"refs/heads/master","pushedAt":"2023-04-06T17:50:02.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"AdamWhiteHat","name":"Adam White","path":"/AdamWhiteHat","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3144777?s=80&v=4"},"commit":{"message":"Updated Binaries","shortMessageHtmlLink":"Updated Binaries"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADcSqUHwA","startCursor":null,"endCursor":null}},"title":"Activity ยท AdamWhiteHat/GNFS"}