Block #2,202,481

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/11/2017, 1:52:47 PM · Difficulty 10.9488 · 4,615,388 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1e0822a3a52b1dd0544a9398776990c0342058c27964220a7c1129527a882a87

Height

#2,202,481

Difficulty

10.948810

Transactions

2

Size

1019 B

Version

2

Bits

0af2e538

Nonce

222,789

Timestamp

7/11/2017, 1:52:47 PM

Confirmations

4,615,388

Merkle Root

37bbfde1d6bd06370ce8ea9fe81d3284b04af7d804fed34916a9872a9ef43956
Transactions (2)
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.

2.554 × 10⁹⁵(96-digit number)
25548997444785307329…07417582806251749119
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
2.554 × 10⁹⁵(96-digit number)
25548997444785307329…07417582806251749119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.109 × 10⁹⁵(96-digit number)
51097994889570614659…14835165612503498239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.021 × 10⁹⁶(97-digit number)
10219598977914122931…29670331225006996479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.043 × 10⁹⁶(97-digit number)
20439197955828245863…59340662450013992959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.087 × 10⁹⁶(97-digit number)
40878395911656491727…18681324900027985919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.175 × 10⁹⁶(97-digit number)
81756791823312983455…37362649800055971839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.635 × 10⁹⁷(98-digit number)
16351358364662596691…74725299600111943679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.270 × 10⁹⁷(98-digit number)
32702716729325193382…49450599200223887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.540 × 10⁹⁷(98-digit number)
65405433458650386764…98901198400447774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.308 × 10⁹⁸(99-digit number)
13081086691730077352…97802396800895549439
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:57,787,019 XPM·at block #6,817,868 · 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