Block #366,502

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.128 × 10⁹⁹(100-digit number)

31281193370751838180…18339417420258934081

Discovered Prime Numbers

p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

origin + 1

3.128 × 10⁹⁹(100-digit number)

31281193370751838180…18339417420258934081

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

6.256 × 10⁹⁹(100-digit number)

62562386741503676361…36678834840517868161

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

1.251 × 10¹⁰⁰(101-digit number)

12512477348300735272…73357669681035736321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

2.502 × 10¹⁰⁰(101-digit number)

25024954696601470544…46715339362071472641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

5.004 × 10¹⁰⁰(101-digit number)

50049909393202941089…93430678724142945281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

1.000 × 10¹⁰¹(102-digit number)

10009981878640588217…86861357448285890561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

2.001 × 10¹⁰¹(102-digit number)

20019963757281176435…73722714896571781121

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

4.003 × 10¹⁰¹(102-digit number)

40039927514562352871…47445429793143562241

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

8.007 × 10¹⁰¹(102-digit number)

80079855029124705742…94890859586287124481

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

1.601 × 10¹⁰²(103-digit number)

16015971005824941148…89781719172574248961

Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆

Rarity

UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)

Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …

Cross-reference on Chainz Explorer

Block #366,502

Cookie Preferences