Block #2,562,842

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/12/2018, 10:36:50 PM · Difficulty 10.9929 · 4,268,397 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
136b8483c7dd34b30c0c079d3fea7b841bd7cc489bd375374e36867a392708a0

Height

#2,562,842

Difficulty

10.992864

Transactions

2

Size

9.65 KB

Version

2

Bits

0afe2c59

Nonce

261,093,631

Timestamp

3/12/2018, 10:36:50 PM

Confirmations

4,268,397

Merkle Root

cf92d712bea9eaa7659e3600b3af68f5d94c7e66692cd0d4b72ae547fb03cac8
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.

1.102 × 10⁹⁶(97-digit number)
11021334477676020829…47198384955639398399
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
1.102 × 10⁹⁶(97-digit number)
11021334477676020829…47198384955639398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.204 × 10⁹⁶(97-digit number)
22042668955352041658…94396769911278796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.408 × 10⁹⁶(97-digit number)
44085337910704083316…88793539822557593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.817 × 10⁹⁶(97-digit number)
88170675821408166632…77587079645115187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.763 × 10⁹⁷(98-digit number)
17634135164281633326…55174159290230374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.526 × 10⁹⁷(98-digit number)
35268270328563266652…10348318580460748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.053 × 10⁹⁷(98-digit number)
70536540657126533305…20696637160921497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.410 × 10⁹⁸(99-digit number)
14107308131425306661…41393274321842995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.821 × 10⁹⁸(99-digit number)
28214616262850613322…82786548643685990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.642 × 10⁹⁸(99-digit number)
56429232525701226644…65573097287371980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.128 × 10⁹⁹(100-digit number)
11285846505140245328…31146194574743961599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,894,061 XPM·at block #6,831,238 · 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