Block #2,468,538

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2018, 9:32:21 PM · Difficulty 10.9601 · 4,374,386 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ea1fdbc28fab5a7fc53f69f1576db95e8da298032cfa852c1f05335fa0a39fb

Height

#2,468,538

Difficulty

10.960102

Transactions

20

Size

10.83 KB

Version

2

Bits

0af5c93d

Nonce

615,371,331

Timestamp

1/11/2018, 9:32:21 PM

Confirmations

4,374,386

Merkle Root

fdc3acc244289e44d730431ca383db3db9d82e859e49d93537b42f392efe2425
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.388 × 10⁹⁴(95-digit number)
23887969889510475306…38615058150277051721
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.388 × 10⁹⁴(95-digit number)
23887969889510475306…38615058150277051721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.777 × 10⁹⁴(95-digit number)
47775939779020950613…77230116300554103441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.555 × 10⁹⁴(95-digit number)
95551879558041901227…54460232601108206881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.911 × 10⁹⁵(96-digit number)
19110375911608380245…08920465202216413761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.822 × 10⁹⁵(96-digit number)
38220751823216760491…17840930404432827521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.644 × 10⁹⁵(96-digit number)
76441503646433520982…35681860808865655041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.528 × 10⁹⁶(97-digit number)
15288300729286704196…71363721617731310081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.057 × 10⁹⁶(97-digit number)
30576601458573408392…42727443235462620161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.115 × 10⁹⁶(97-digit number)
61153202917146816785…85454886470925240321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.223 × 10⁹⁷(98-digit number)
12230640583429363357…70909772941850480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.446 × 10⁹⁷(98-digit number)
24461281166858726714…41819545883700961281
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,987,740 XPM·at block #6,842,923 · 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