Block #3,222,946

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/13/2019, 1:35:02 AM · Difficulty 11.0324 · 3,615,378 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
15d2455fe735a2d68da131d12bebebd9fe0b150775fb586c468f8fe1fb0f0394

Height

#3,222,946

Difficulty

11.032433

Transactions

2

Size

1017 B

Version

2

Bits

0b084d8b

Nonce

310,261,920

Timestamp

6/13/2019, 1:35:02 AM

Confirmations

3,615,378

Merkle Root

6482c6f781a76b47b16f1e66a33b262a6a9e58a5d12a25c5d5c8415e282d5d11
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.

1.461 × 10⁹⁴(95-digit number)
14615137317984166633…07307006457005355041
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
1.461 × 10⁹⁴(95-digit number)
14615137317984166633…07307006457005355041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.923 × 10⁹⁴(95-digit number)
29230274635968333266…14614012914010710081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.846 × 10⁹⁴(95-digit number)
58460549271936666533…29228025828021420161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.169 × 10⁹⁵(96-digit number)
11692109854387333306…58456051656042840321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.338 × 10⁹⁵(96-digit number)
23384219708774666613…16912103312085680641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.676 × 10⁹⁵(96-digit number)
46768439417549333226…33824206624171361281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.353 × 10⁹⁵(96-digit number)
93536878835098666453…67648413248342722561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.870 × 10⁹⁶(97-digit number)
18707375767019733290…35296826496685445121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.741 × 10⁹⁶(97-digit number)
37414751534039466581…70593652993370890241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.482 × 10⁹⁶(97-digit number)
74829503068078933162…41187305986741780481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.496 × 10⁹⁷(98-digit number)
14965900613615786632…82374611973483560961
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,950,868 XPM·at block #6,838,323 · 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