Block #2,880,653

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/14/2018, 11:04:05 AM · Difficulty 11.6323 · 3,961,373 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c7e508ff317df3e45ed81f4196348cdfabe7a267c808de008eb41fe7162d85aa

Height

#2,880,653

Difficulty

11.632343

Transactions

26

Size

8.00 KB

Version

2

Bits

0ba1e13f

Nonce

1,343,042,894

Timestamp

10/14/2018, 11:04:05 AM

Confirmations

3,961,373

Merkle Root

98c6c774d79bf0fb53d1638f539cb7904a75baf01ab927764008e7224381c1aa
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.160 × 10⁹⁵(96-digit number)
11604293534697656671…94820336898281717761
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.160 × 10⁹⁵(96-digit number)
11604293534697656671…94820336898281717761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.320 × 10⁹⁵(96-digit number)
23208587069395313342…89640673796563435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.641 × 10⁹⁵(96-digit number)
46417174138790626685…79281347593126871041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.283 × 10⁹⁵(96-digit number)
92834348277581253371…58562695186253742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.856 × 10⁹⁶(97-digit number)
18566869655516250674…17125390372507484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.713 × 10⁹⁶(97-digit number)
37133739311032501348…34250780745014968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.426 × 10⁹⁶(97-digit number)
74267478622065002696…68501561490029936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.485 × 10⁹⁷(98-digit number)
14853495724413000539…37003122980059873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.970 × 10⁹⁷(98-digit number)
29706991448826001078…74006245960119746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.941 × 10⁹⁷(98-digit number)
59413982897652002157…48012491920239493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.188 × 10⁹⁸(99-digit number)
11882796579530400431…96024983840478986241
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,980,594 XPM·at block #6,842,025 · 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