Block #2,213,029

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/19/2017, 5:57:30 AM · Difficulty 10.9439 · 4,631,958 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
391a28dbc3f9cde67c4d11afa9795f8a9efbc3043101e540407bbb5344cc86a5

Height

#2,213,029

Difficulty

10.943857

Transactions

5

Size

1.37 KB

Version

2

Bits

0af1a0a3

Nonce

344,098,470

Timestamp

7/19/2017, 5:57:30 AM

Confirmations

4,631,958

Merkle Root

41e8f1d79b7d6f1877b4d7c8661bed351d112996f22fb3a7cdbf75b8edd5bb34
Prime Chain Origin

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.

8.970 × 10⁹³(94-digit number)
89704247081465536758…67895052671187099199
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.

1
origin − 1
8.970 × 10⁹³(94-digit number)
89704247081465536758…67895052671187099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.794 × 10⁹⁴(95-digit number)
17940849416293107351…35790105342374198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.588 × 10⁹⁴(95-digit number)
35881698832586214703…71580210684748396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.176 × 10⁹⁴(95-digit number)
71763397665172429406…43160421369496793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.435 × 10⁹⁵(96-digit number)
14352679533034485881…86320842738993587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.870 × 10⁹⁵(96-digit number)
28705359066068971762…72641685477987174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.741 × 10⁹⁵(96-digit number)
57410718132137943525…45283370955974348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.148 × 10⁹⁶(97-digit number)
11482143626427588705…90566741911948697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.296 × 10⁹⁶(97-digit number)
22964287252855177410…81133483823897395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.592 × 10⁹⁶(97-digit number)
45928574505710354820…62266967647794790399
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, …
Circulating Supply:58,004,315 XPM·at block #6,844,986 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy