Original research · Prime number theory

A geometric sieve
that goes beyond 64-bit

GC-60 is an original prime generation framework based on passive geometric projection. Unlike probabilistic methods, it operates deterministically across ranges unreachable by standard 64-bit sieves — up to 10²¹ and beyond.

Explore the framework View benchmarks
Programs

Two implementations, one framework

This site documents the GC-60 framework and its two main programs, including benchmark data, source code, and prime analysis.

MicroPrime_suffix

Deterministic prime search beyond 64-bit using __int128. Benchmarked at ranges 10²¹–10²⁷.

GC60_M30x3_suffix

Fast prime counting via three parallel binaries, cache-optimised and multi-core, up to 10¹¹.

GC-60 framework

16 residue offsets mod 30. Passive projection via fixed stamps. No active marking of composites.

Prime analysis

Gap distributions, density curves, and statistical analysis across explored ranges.

At a glance

Key results

10²⁷
Max exploration range
__int128
Arithmetic precision
16
Residue offsets mod 30
3 cores
Parallel execution (M30x3)
v1.0.0
Current release on Zenodo
About

GC-60 is developed by Claudio Govi as an independent research project. The framework explores a structural property of prime numbers through passive geometric projection — a method that differs fundamentally from classical sieves. All source code and documentation are published openly on GitHub and archived with a DOI on Zenodo.