Block #2,856,637

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/27/2018, 4:06:56 AM · Difficulty 11.6903 · 3,982,787 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd71fd42905dd32e92adb0a84d055ffc0e10a7ef2ea8ddbea9db97d0e4bad3fe

Height

#2,856,637

Difficulty

11.690338

Transactions

2

Size

7.47 KB

Version

2

Bits

0bb0b9fc

Nonce

1,175,931,505

Timestamp

9/27/2018, 4:06:56 AM

Confirmations

3,982,787

Merkle Root

159e59fe96a948e34a22500780a49eb1c1139095ce57883ef4b8591afffb4e91
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.705 × 10⁹³(94-digit number)
27050439666434001617…22262046742759470081
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.705 × 10⁹³(94-digit number)
27050439666434001617…22262046742759470081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.410 × 10⁹³(94-digit number)
54100879332868003235…44524093485518940161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.082 × 10⁹⁴(95-digit number)
10820175866573600647…89048186971037880321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.164 × 10⁹⁴(95-digit number)
21640351733147201294…78096373942075760641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.328 × 10⁹⁴(95-digit number)
43280703466294402588…56192747884151521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.656 × 10⁹⁴(95-digit number)
86561406932588805177…12385495768303042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.731 × 10⁹⁵(96-digit number)
17312281386517761035…24770991536606085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.462 × 10⁹⁵(96-digit number)
34624562773035522070…49541983073212170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.924 × 10⁹⁵(96-digit number)
69249125546071044141…99083966146424340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.384 × 10⁹⁶(97-digit number)
13849825109214208828…98167932292848680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.769 × 10⁹⁶(97-digit number)
27699650218428417656…96335864585697361921
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,959,681 XPM·at block #6,839,423 · 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