Block #2,632,306

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2018, 5:53:07 PM · Difficulty 11.1724 · 4,212,196 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad1ea194eb42dbeda0edb841db25a6a404888f0bca123c5352c1ab2ac5b37ee3

Height

#2,632,306

Difficulty

11.172366

Transactions

2

Size

574 B

Version

2

Bits

0b2c202f

Nonce

1,032,177,662

Timestamp

4/27/2018, 5:53:07 PM

Confirmations

4,212,196

Merkle Root

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

8.823 × 10⁹³(94-digit number)
88235563733628017353…06924309795338525671
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
8.823 × 10⁹³(94-digit number)
88235563733628017353…06924309795338525671
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.764 × 10⁹⁴(95-digit number)
17647112746725603470…13848619590677051341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.529 × 10⁹⁴(95-digit number)
35294225493451206941…27697239181354102681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.058 × 10⁹⁴(95-digit number)
70588450986902413883…55394478362708205361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.411 × 10⁹⁵(96-digit number)
14117690197380482776…10788956725416410721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.823 × 10⁹⁵(96-digit number)
28235380394760965553…21577913450832821441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.647 × 10⁹⁵(96-digit number)
56470760789521931106…43155826901665642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.129 × 10⁹⁶(97-digit number)
11294152157904386221…86311653803331285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.258 × 10⁹⁶(97-digit number)
22588304315808772442…72623307606662571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.517 × 10⁹⁶(97-digit number)
45176608631617544885…45246615213325143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.035 × 10⁹⁶(97-digit number)
90353217263235089770…90493230426650286081
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:58,000,413 XPM·at block #6,844,501 · 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