Block #369,345

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.

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

41252700995842750616…16025634670903403519

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

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

41252700995842750616…16025634670903403519

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

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

82505401991685501233…32051269341806807039

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

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

16501080398337100246…64102538683613614079

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

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

33002160796674200493…28205077367227228159

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

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

66004321593348400987…56410154734454456319

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

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

13200864318669680197…12820309468908912639

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

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

26401728637339360394…25640618937817825279

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

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

52803457274678720789…51281237875635650559

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

1.056 × 10¹⁰³(104-digit number)

10560691454935744157…02562475751271301119

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

2.112 × 10¹⁰³(104-digit number)

21121382909871488315…05124951502542602239

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 First 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 1CC formula:

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

Cross-reference on Chainz Explorer