Block #2,635,147

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 3:46:39 AM · Difficulty 11.2947 · 4,206,715 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
46ebd2c642dc4443adb4efd0cfbd519d501190d0240d2eaa8f77e726fe430ea9

Height

#2,635,147

Difficulty

11.294697

Transactions

10

Size

3.81 KB

Version

2

Bits

0b4b714a

Nonce

108,941,038

Timestamp

4/29/2018, 3:46:39 AM

Confirmations

4,206,715

Merkle Root

2f177d31c95bb856550719a69fba54d17a7edbc1bf1cf60fad830c4133798ccd
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.

3.113 × 10⁹⁵(96-digit number)
31139911877947208477…47718514454253502921
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
3.113 × 10⁹⁵(96-digit number)
31139911877947208477…47718514454253502921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.227 × 10⁹⁵(96-digit number)
62279823755894416955…95437028908507005841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.245 × 10⁹⁶(97-digit number)
12455964751178883391…90874057817014011681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.491 × 10⁹⁶(97-digit number)
24911929502357766782…81748115634028023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.982 × 10⁹⁶(97-digit number)
49823859004715533564…63496231268056046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.964 × 10⁹⁶(97-digit number)
99647718009431067129…26992462536112093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.992 × 10⁹⁷(98-digit number)
19929543601886213425…53984925072224186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.985 × 10⁹⁷(98-digit number)
39859087203772426851…07969850144448373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.971 × 10⁹⁷(98-digit number)
79718174407544853703…15939700288896747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.594 × 10⁹⁸(99-digit number)
15943634881508970740…31879400577793495041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.188 × 10⁹⁸(99-digit number)
31887269763017941481…63758801155586990081
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,979,273 XPM·at block #6,841,861 · 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