Quote from: gatra on October 10, 2016, 02:16:06 PM

Quote from: aamarket on October 10, 2016, 12:07:46 PM

Quote from: Ellieo on September 30, 2016, 03:21:10 AM

Hi Gatra and all great contributors,

Major arcs for Goldbach's problem - H. A. Helfgott
https://arxiv.org/abs/1305.2897

HardyLittlewood circle method
https://en.wikipedia.org/wiki/Hardy%E2%80%93Littlewood_circle_method

https://www.youtube.com/watch?v=qhS9L-jTVkM
The Ternary Goldbach Problem - Harald Helfgott

It's been awhile since my absent from mining Riecoin with limited resources than before. Found the above and hope them can shed some light to improve the algorithms used in Riecoin's superblock for larger world records, etc. The youtube explain the C algorithm on circle method to find prime, etc.

I did not get how "the sum of three primes" can help with the search for prime sextuplets ?
Also HardyLittlewood circle method is a technique used to prove asymptotic behavior of a series. AFAIK there is no generating function for prime numbers etc.
Video is from 2014 with bad sound (and no sound until 2:50), lost patience soon.

There may be ideas to use, only I may not see them.

I was referring to another work from the same author. The same man who worked on the "the sum of three primes" problem has recently been working on a method for making sieves that uses less RAM: that's the work that may (or may not) be helpful, but I still couldn't find any links to an actual paper.

From the published article he was inspired by the circle method in modifying his "sieve of Eratosthenes" and implemented it with a lesser physical memory space than conventional.

If I get inspiration how that was done I'll share it with you all.