Block #2,183,547

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2017, 9:04:24 PM · Difficulty 10.9412 · 4,658,445 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ed71cec4b9564a42307acf522c1e9c960c39c6170f93052c2e6ec1d848abe2b

Height

#2,183,547

Difficulty

10.941162

Transactions

32

Size

14.26 KB

Version

2

Bits

0af0f004

Nonce

561,140,389

Timestamp

6/28/2017, 9:04:24 PM

Confirmations

4,658,445

Merkle Root

604bf5016c66c6fb110542f07b23a8533f4c6474957026d125a609162406ede3
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.

4.315 × 10⁹⁵(96-digit number)
43152577206561106879…73847949072572216641
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
4.315 × 10⁹⁵(96-digit number)
43152577206561106879…73847949072572216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.630 × 10⁹⁵(96-digit number)
86305154413122213758…47695898145144433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.726 × 10⁹⁶(97-digit number)
17261030882624442751…95391796290288866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.452 × 10⁹⁶(97-digit number)
34522061765248885503…90783592580577733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.904 × 10⁹⁶(97-digit number)
69044123530497771006…81567185161155466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.380 × 10⁹⁷(98-digit number)
13808824706099554201…63134370322310932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.761 × 10⁹⁷(98-digit number)
27617649412199108402…26268740644621864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.523 × 10⁹⁷(98-digit number)
55235298824398216805…52537481289243729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.104 × 10⁹⁸(99-digit number)
11047059764879643361…05074962578487459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.209 × 10⁹⁸(99-digit number)
22094119529759286722…10149925156974919681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.418 × 10⁹⁸(99-digit number)
44188239059518573444…20299850313949839361
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,980,323 XPM·at block #6,841,991 · 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