Block #2,635,149

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 3:48:09 AM · Difficulty 11.2949 · 4,203,264 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ac6782d202d363856697b3b074e8b33f2cf7292d35f4fadad3cc95735c548c0

Height

#2,635,149

Difficulty

11.294900

Transactions

3

Size

1.21 KB

Version

2

Bits

0b4b7e97

Nonce

160,379,316

Timestamp

4/29/2018, 3:48:09 AM

Confirmations

4,203,264

Merkle Root

ac1d6ed82f1318fbdda748effefe20a24f9dfb58e82d6c2cec7d477acb69a479
Transactions (3)
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.927 × 10⁹⁵(96-digit number)
29270425893573373101…30048157950259170401
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.927 × 10⁹⁵(96-digit number)
29270425893573373101…30048157950259170401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.854 × 10⁹⁵(96-digit number)
58540851787146746202…60096315900518340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.170 × 10⁹⁶(97-digit number)
11708170357429349240…20192631801036681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.341 × 10⁹⁶(97-digit number)
23416340714858698481…40385263602073363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.683 × 10⁹⁶(97-digit number)
46832681429717396962…80770527204146726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.366 × 10⁹⁶(97-digit number)
93665362859434793924…61541054408293452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.873 × 10⁹⁷(98-digit number)
18733072571886958784…23082108816586905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.746 × 10⁹⁷(98-digit number)
37466145143773917569…46164217633173811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.493 × 10⁹⁷(98-digit number)
74932290287547835139…92328435266347622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.498 × 10⁹⁸(99-digit number)
14986458057509567027…84656870532695244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.997 × 10⁹⁸(99-digit number)
29972916115019134055…69313741065390489601
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,951,577 XPM·at block #6,838,412 · 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