Thanks for giving it a try. The Gridbach server only accepts computed result sent from my component.

Gehinnn 8 months ago | parent | next [-]

But how do you make sure the user actually runs your component without any modification?

All I can tell here is that I do certain level of valication on server side. As one of the goals of this project is to popularize the fun of mathematics among the general public, I think I would need to avoid a open network configuration to strictly conduct academic verification. The algorithm itself is publicly opened, so anyone can verify the computation step is correct or not. https://github.com/nakatahr/gridbach-core

▲

gus_massa 8 months ago | parent | next [-]

Never trust the client. You must do a full verification. IIUC from another comment, you only ask the client to return the interval they tested and some token to ensure the server send them that interval.

You must ask for each number in the interval the two primes and a Primality certificate for each prime. https://en.wikipedia.org/wiki/Primality_certificate

The idea is that it's very hard to find the two primes and it's very hard to prove that they are actually primes. But if the client send you both primes and send you each primality certificate, then the verification is very fast. Also, you can store that info so people can see it.

	▲	jay_gridbach 8 months ago \| parent [-]
		Thanks. Your advice is really helpful.

▲

comboy 8 months ago | parent | prev [-]

zk-SNARKS maybe?

▲

Sesse__ 8 months ago | parent [-]

For demonstrating verification of a conjecture, surely you can do much simpler things than a zero-knowledge proof: Send one of the primes.

▲

sebzim4500 8 months ago | parent | next [-]

It would still take a nontrivial amount of computation to do all the verification afterwards. Back of the envelope calculations suggest it should less than 100x longer to find the two primes than to verify them.

	▲	yujzgzc 8 months ago \| parent [-]
		It'd be neat to do the verification in the same manner by redistributing one client's results to another, therefore obtaining a proof modulo client collusion.

▲

looofooo0 8 months ago | parent | prev | next [-]

Say smaller prime is less then 10,000. Then this one or two Byte per Nummer. E.g. 100 Mio number is already 100mb or

▲

johnisgood 8 months ago | parent | prev [-]

I am curious about alternatives or solutions in such a setting / context.

▲

montroser 8 months ago | parent | prev [-]

That sounds interesting. How does that verification work?