Block #2,627,625

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/24/2018, 8:22:17 AM · Difficulty 11.2058 · 4,217,722 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd18a9d8352bb8d8abe43cf07a384169efb6720fb8f214bd8fa229f134256cf7

Height

#2,627,625

Difficulty

11.205819

Transactions

19

Size

3.94 KB

Version

2

Bits

0b34b087

Nonce

640,406,699

Timestamp

4/24/2018, 8:22:17 AM

Confirmations

4,217,722

Merkle Root

5d85619c7b19dea662f3f3a2fabca7f23679fdbb0d49608d686364ae8b95979a
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.

5.786 × 10⁹⁵(96-digit number)
57862167752009184992…44403036699917472001
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
5.786 × 10⁹⁵(96-digit number)
57862167752009184992…44403036699917472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.157 × 10⁹⁶(97-digit number)
11572433550401836998…88806073399834944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.314 × 10⁹⁶(97-digit number)
23144867100803673997…77612146799669888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.628 × 10⁹⁶(97-digit number)
46289734201607347994…55224293599339776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.257 × 10⁹⁶(97-digit number)
92579468403214695988…10448587198679552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.851 × 10⁹⁷(98-digit number)
18515893680642939197…20897174397359104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.703 × 10⁹⁷(98-digit number)
37031787361285878395…41794348794718208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.406 × 10⁹⁷(98-digit number)
74063574722571756790…83588697589436416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.481 × 10⁹⁸(99-digit number)
14812714944514351358…67177395178872832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.962 × 10⁹⁸(99-digit number)
29625429889028702716…34354790357745664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.925 × 10⁹⁸(99-digit number)
59250859778057405432…68709580715491328001
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:58,007,218 XPM·at block #6,845,346 · 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