Block #369,740

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.

5.223 × 10⁹¹(92-digit number)

52232383716124406627…98121513813682893949

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

5.223 × 10⁹¹(92-digit number)

52232383716124406627…98121513813682893949

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

1.044 × 10⁹²(93-digit number)

10446476743224881325…96243027627365787899

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

2.089 × 10⁹²(93-digit number)

20892953486449762650…92486055254731575799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

4.178 × 10⁹²(93-digit number)

41785906972899525301…84972110509463151599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

8.357 × 10⁹²(93-digit number)

83571813945799050603…69944221018926303199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

1.671 × 10⁹³(94-digit number)

16714362789159810120…39888442037852606399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

3.342 × 10⁹³(94-digit number)

33428725578319620241…79776884075705212799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

6.685 × 10⁹³(94-digit number)

66857451156639240482…59553768151410425599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

1.337 × 10⁹⁴(95-digit number)

13371490231327848096…19107536302820851199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

2.674 × 10⁹⁴(95-digit number)

26742980462655696193…38215072605641702399

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

Block #369,740

Cookie Preferences