This example checks a bounded version of Goldbach’s conjecture. The full conjecture says every even integer greater than 2 is the sum of two primes. This example only checks the finite range from 4 through 1000.
The program first builds a cache of prime numbers up to the configured maximum. Then, for each even number, it searches for a prime P no larger than half of that number such that the remainder is also prime.
When it finds such a pair, that pair is a witness for that even number.
The output says all 499 even integers in the range have witnesses and prints a few samples, such as 1000 = 3 + 997. This is a bounded computational result, not a proof of the infinite conjecture.
The trust gate verifies that the configured even numbers are covered, every witness sums to its even number, every witness consists of primes, and the sample witnesses are drawn from the computed witness table.
From the repository root:
node examples/goldbach_1000.js