Block #2,821,319

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2018, 11:54:48 AM · Difficulty 11.7020 · 4,019,475 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7325f697f67d93a6b985afe211592792efda40a18d6bdba9280e2ecd05274330

Height

#2,821,319

Difficulty

11.701999

Transactions

2

Size

1015 B

Version

2

Bits

0bb3b63d

Nonce

112,074,920

Timestamp

9/2/2018, 11:54:48 AM

Confirmations

4,019,475

Merkle Root

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

4.974 × 10⁹⁵(96-digit number)
49744345151283712399…27611826832301919841
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
4.974 × 10⁹⁵(96-digit number)
49744345151283712399…27611826832301919841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.948 × 10⁹⁵(96-digit number)
99488690302567424799…55223653664603839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.989 × 10⁹⁶(97-digit number)
19897738060513484959…10447307329207679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.979 × 10⁹⁶(97-digit number)
39795476121026969919…20894614658415358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.959 × 10⁹⁶(97-digit number)
79590952242053939839…41789229316830717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.591 × 10⁹⁷(98-digit number)
15918190448410787967…83578458633661434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.183 × 10⁹⁷(98-digit number)
31836380896821575935…67156917267322869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.367 × 10⁹⁷(98-digit number)
63672761793643151871…34313834534645739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.273 × 10⁹⁸(99-digit number)
12734552358728630374…68627669069291479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.546 × 10⁹⁸(99-digit number)
25469104717457260748…37255338138582958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.093 × 10⁹⁸(99-digit number)
50938209434914521497…74510676277165916161
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,970,699 XPM·at block #6,840,793 · 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