At this point, I am not capable with addressing the thing you pointed out - the way to block fake results in open network.
From the very beginning, I don't want to make the system closed-network nor login required as I want people to join the calculation instantly. Technically, I think it is impossible to prevent reporting fake result as long as it is open network system - which means my design doesn't fit to seeking rigor.
If someone starts another project that handles calculations in better way, I would like to learn from it.
Your project is not bad. It's the way you've worded this post and your article that comes across as misleading and deceptive.
There's no definitive proof that a world record has been set. Nor that every individual block has been processed and reported honestly. What is known is that the system provides a mechanism for volunteers to submit counterexamples if they choose to. That's something.
It's possible for clients to act dishonestly and withhold counterexamples. There's an incentive to claim independent credit. So the clients have incentive to lie.
So your project doesn't ensure that every block has been verified, it allows honest participants to report findings. That's the reality and you should frame it that way in the post and article.
Thank you for sharing your experience. It's quite moving to know that someone in another country was going through the same thing I was. I implemented Goldbach in C++, C#, Java, and Go.
I did... let me think, it's been a while... C, Python, C++, Java, Common Lisp, Ada, Erlang. Also OCaml, Ruby, Haskell, Emacs Lisp, Lua, Rust, but I don't think any of those ever reached a working state.
My knowledge of most of these is superficial or seriously outdated. Particularly OCaml, Haskell, and Rust (AND C++!!!) are not languages I would claim to really "know". When I was younger, I tried to get to know as many languages as possible, at least in passing, but I have not used many of these in a professional context.
I know there haven't been any scientific progress yet, and I must admit that I gave it an easy-to-understand title to attract visitors to the site. I originally started this project out of curiosity to see what discoveries might lie ahead. For instance, my system is collecting `p` - least primes of a Goldbach partition. I am curious if there is any p larger than 9781.
https://sweet.ua.pt/tos/goldbach.html
Thank you for your comment. I will keep going to make this meaningful in some extent. The website message itself could be overstatement, but to be honest I am not trying to compete the predecessor. I am now trying to contact the predecessor to have feedback from him.
