Block #2,653,427

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2018, 9:34:22 AM · Difficulty 11.7376 · 4,189,693 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
67aa2bb132ddcd2e74b0a96f5af28226ee2f5c44076443ea3c610ad2e5557db4

Height

#2,653,427

Difficulty

11.737554

Transactions

4

Size

1.11 KB

Version

2

Bits

0bbcd057

Nonce

965,520,119

Timestamp

5/8/2018, 9:34:22 AM

Confirmations

4,189,693

Merkle Root

cb47c277fb687a5d04187ae0e62e92775ff54a2b5c9d40fde4a8ca7777373bc4
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.

9.032 × 10⁹⁴(95-digit number)
90329054264156118617…53909416987351265281
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
9.032 × 10⁹⁴(95-digit number)
90329054264156118617…53909416987351265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.806 × 10⁹⁵(96-digit number)
18065810852831223723…07818833974702530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.613 × 10⁹⁵(96-digit number)
36131621705662447447…15637667949405061121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.226 × 10⁹⁵(96-digit number)
72263243411324894894…31275335898810122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.445 × 10⁹⁶(97-digit number)
14452648682264978978…62550671797620244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.890 × 10⁹⁶(97-digit number)
28905297364529957957…25101343595240488961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.781 × 10⁹⁶(97-digit number)
57810594729059915915…50202687190480977921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.156 × 10⁹⁷(98-digit number)
11562118945811983183…00405374380961955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.312 × 10⁹⁷(98-digit number)
23124237891623966366…00810748761923911681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.624 × 10⁹⁷(98-digit number)
46248475783247932732…01621497523847823361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.249 × 10⁹⁷(98-digit number)
92496951566495865464…03242995047695646721
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,989,325 XPM·at block #6,843,119 · 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