Block #2,097,467

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2017, 5:52:18 PM · Difficulty 10.8712 · 4,729,008 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
636ab58931d044d85708e6151ebd2bb4ad363e240c457394a44fb2a2cadb4ccc

Height

#2,097,467

Difficulty

10.871176

Transactions

2

Size

425 B

Version

2

Bits

0adf056b

Nonce

914,206,260

Timestamp

5/2/2017, 5:52:18 PM

Confirmations

4,729,008

Merkle Root

2aeba1f055de2cff2cf90748bd387d6cff00e2dd340eece986c49a691ca870d3
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.

1.114 × 10⁹⁷(98-digit number)
11142819919313646463…92237431857909145601
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.114 × 10⁹⁷(98-digit number)
11142819919313646463…92237431857909145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.228 × 10⁹⁷(98-digit number)
22285639838627292927…84474863715818291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.457 × 10⁹⁷(98-digit number)
44571279677254585855…68949727431636582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.914 × 10⁹⁷(98-digit number)
89142559354509171710…37899454863273164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.782 × 10⁹⁸(99-digit number)
17828511870901834342…75798909726546329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.565 × 10⁹⁸(99-digit number)
35657023741803668684…51597819453092659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.131 × 10⁹⁸(99-digit number)
71314047483607337368…03195638906185318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.426 × 10⁹⁹(100-digit number)
14262809496721467473…06391277812370636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.852 × 10⁹⁹(100-digit number)
28525618993442934947…12782555624741273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.705 × 10⁹⁹(100-digit number)
57051237986885869894…25565111249482547201
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,855,938 XPM·at block #6,826,474 · 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