Block #2,292,646

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2017, 10:59:27 PM · Difficulty 10.9547 · 4,547,027 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba30a4a9992ec279c59bd960564e1b7d6c22a7755e529d851abd17483740d077

Height

#2,292,646

Difficulty

10.954711

Transactions

8

Size

1.88 KB

Version

2

Bits

0af467eb

Nonce

511,400,919

Timestamp

9/11/2017, 10:59:27 PM

Confirmations

4,547,027

Merkle Root

aecec7441bd79a6c8f398afe1e5714b3e5b89e601083b31f14966ce12e812859
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.265 × 10⁹⁵(96-digit number)
22652811139030563623…55405482748609808001
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.265 × 10⁹⁵(96-digit number)
22652811139030563623…55405482748609808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.530 × 10⁹⁵(96-digit number)
45305622278061127246…10810965497219616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.061 × 10⁹⁵(96-digit number)
90611244556122254492…21621930994439232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.812 × 10⁹⁶(97-digit number)
18122248911224450898…43243861988878464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.624 × 10⁹⁶(97-digit number)
36244497822448901797…86487723977756928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.248 × 10⁹⁶(97-digit number)
72488995644897803594…72975447955513856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.449 × 10⁹⁷(98-digit number)
14497799128979560718…45950895911027712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.899 × 10⁹⁷(98-digit number)
28995598257959121437…91901791822055424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.799 × 10⁹⁷(98-digit number)
57991196515918242875…83803583644110848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.159 × 10⁹⁸(99-digit number)
11598239303183648575…67607167288221696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.319 × 10⁹⁸(99-digit number)
23196478606367297150…35214334576443392001
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,961,673 XPM·at block #6,839,672 · 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