Block #571,827

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2014, 5:20:53 PM · Difficulty 10.9657 · 6,240,837 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
87dbc0ff4961751e8e30f0b690234d1dcbfe274bc9aad190f69acf4154c07968

Height

#571,827

Difficulty

10.965676

Transactions

2

Size

786 B

Version

2

Bits

0af73686

Nonce

141,764

Timestamp

6/1/2014, 5:20:53 PM

Confirmations

6,240,837

Merkle Root

5ee2c3e0822807edc4c13281f1bf38583d4e8973df82f4f633dd8ed7aa65bb11
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.318 × 10⁹⁵(96-digit number)
13186409032127583411…73086065419503350641
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.318 × 10⁹⁵(96-digit number)
13186409032127583411…73086065419503350641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.637 × 10⁹⁵(96-digit number)
26372818064255166823…46172130839006701281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.274 × 10⁹⁵(96-digit number)
52745636128510333647…92344261678013402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.054 × 10⁹⁶(97-digit number)
10549127225702066729…84688523356026805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.109 × 10⁹⁶(97-digit number)
21098254451404133458…69377046712053610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.219 × 10⁹⁶(97-digit number)
42196508902808266917…38754093424107220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.439 × 10⁹⁶(97-digit number)
84393017805616533835…77508186848214440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.687 × 10⁹⁷(98-digit number)
16878603561123306767…55016373696428881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.375 × 10⁹⁷(98-digit number)
33757207122246613534…10032747392857763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.751 × 10⁹⁷(98-digit number)
67514414244493227068…20065494785715527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.350 × 10⁹⁸(99-digit number)
13502882848898645413…40130989571431055361
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,745,343 XPM·at block #6,812,663 · 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.

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