Encryption method utilizing infinite grid for prime identification

A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform a set of actions including:

• searching a prime number by:
• generating a geometric shape of a predefined vicinity on a grid of a cartesian plane comprising a plurality of grid squares, concentric with a center of a grid square of the plurality of grid squares, wherein the vicinity corresponds to an area enclosed by the geometric shape;
• identifying a number of grid squares of the cartesian plane fully enclosed inside the geometric shape;
• and
• generating a sum by counting the identified number of grid squares;
• generating a prime number by determining whether the sum adds up to be a prime number, wherein the determination is based on a deterministic primality test or a classification model;
• outputting the generated prime number.

A system comprising:

• one or more processors;
• one or more non-transitory computer-readable media storing instructions, which, when executed by the system, cause the system to perform part a set of actions including:
• searching a prime number by:
• generating a geometric shape of a predefined vicinity on a grid of a cartesian plane comprising a plurality of grid squares, concentric with a center of a grid square of the plurality of grid squares, wherein the vicinity corresponds to an area enclosed by the geometric shape;
• identifying a number of grid squares of the cartesian plane fully enclosed inside the geometric shape;
• and
• generating a sum by counting the identified number of grid squares;
• generating a prime number by determining whether the sum adds up to be a prime number, wherein the determination is based on a deterministic primality test or a classification model;
• and
• outputting the generated prime number.