Block #2,254,626

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/16/2017, 7:41:27 PM · Difficulty 10.9499 · 4,555,330 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3889bc06ffb168aba7c9d5770c0463cfe9533a0e99cdcfc3a252616f034ab015

Height

#2,254,626

Difficulty

10.949881

Transactions

2

Size

394 B

Version

2

Bits

0af32b6a

Nonce

833,057,523

Timestamp

8/16/2017, 7:41:27 PM

Confirmations

4,555,330

Merkle Root

9707398cb99e66efa22df96596687b47e1b28718771938bc7070e83707f0d2d6
Transactions (2)
1 in → 1 out8.3400 XPM110 B
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.713 × 10⁹⁷(98-digit number)
17130201251155148306…54037102266500817921
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.713 × 10⁹⁷(98-digit number)
17130201251155148306…54037102266500817921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.426 × 10⁹⁷(98-digit number)
34260402502310296613…08074204533001635841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.852 × 10⁹⁷(98-digit number)
68520805004620593226…16148409066003271681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.370 × 10⁹⁸(99-digit number)
13704161000924118645…32296818132006543361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.740 × 10⁹⁸(99-digit number)
27408322001848237290…64593636264013086721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.481 × 10⁹⁸(99-digit number)
54816644003696474581…29187272528026173441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.096 × 10⁹⁹(100-digit number)
10963328800739294916…58374545056052346881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.192 × 10⁹⁹(100-digit number)
21926657601478589832…16749090112104693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.385 × 10⁹⁹(100-digit number)
43853315202957179665…33498180224209387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.770 × 10⁹⁹(100-digit number)
87706630405914359330…66996360448418775041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,723,730 XPM·at block #6,809,955 · 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.

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