Block #2,647,322

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 9:01:56 PM · Difficulty 11.7577 · 4,193,785 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5cff3e762cb52bf9dac9fb7964db153c8ce8d6d5dd14fbb0629b67b9bf84bfa4

Height

#2,647,322

Difficulty

11.757705

Transactions

2

Size

541 B

Version

2

Bits

0bc1f8f2

Nonce

723,348,280

Timestamp

5/3/2018, 9:01:56 PM

Confirmations

4,193,785

Merkle Root

17a84ce403e2ad658fa7010993b72451e1d8988d457eedc33af47cf3d695529b
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.

3.896 × 10⁹⁴(95-digit number)
38968951460596073455…55348329561343026771
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.896 × 10⁹⁴(95-digit number)
38968951460596073455…55348329561343026771
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.793 × 10⁹⁴(95-digit number)
77937902921192146910…10696659122686053541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.558 × 10⁹⁵(96-digit number)
15587580584238429382…21393318245372107081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.117 × 10⁹⁵(96-digit number)
31175161168476858764…42786636490744214161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.235 × 10⁹⁵(96-digit number)
62350322336953717528…85573272981488428321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.247 × 10⁹⁶(97-digit number)
12470064467390743505…71146545962976856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.494 × 10⁹⁶(97-digit number)
24940128934781487011…42293091925953713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.988 × 10⁹⁶(97-digit number)
49880257869562974022…84586183851907426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.976 × 10⁹⁶(97-digit number)
99760515739125948045…69172367703814853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.995 × 10⁹⁷(98-digit number)
19952103147825189609…38344735407629706241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.990 × 10⁹⁷(98-digit number)
39904206295650379218…76689470815259412481
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,973,222 XPM·at block #6,841,106 · 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