@Gelly
Always good to see a decent criticism.. well then, let's be clear upon that AMAP
Quote:
You claimed to "have a milestone" in integer factorization and continue claiming that you will "crack rsa,

First & foremost, we need to look into canonical definition of «MILESTONE»..
it doesn't mean «final point» & definitely it doesn't mean something magic. It just means that project has had some positive/promising results to proceed further. 2nd moment, Polynomial time doesn't mean you can crack everything in no time. For example, O(N*lgN) & O(N²) are both polynomial time, but (w/ growing N) gap between those speeds becomes Abyss.
Quote:
You then refuse to demonstrate (or even explain!) your method in a significant way

actually, there ain't been questions ontopic.. some guys struggled w/ their deep fears of malware & others just have wanted a magic out of the Blue
Quote:
but I'm pretty sure you need the exact sum, and not just an approximation,

from the POV of Practice, we need approximation a way down to the point, where it's possible to use brute force for getting exact sum.
Well, this link will answer your questions, if you really want them...
https://alg0z.blogspot.com/2020/12/majorupdatefpc15rev3.html
MODERATOR NOTE: Link disabled pending evaluation of software downloads thereat