Block #2,096,029

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2017, 5:30:10 PM · Difficulty 10.8718 · 4,729,071 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90a4b11b46747b66d772be4dcd23a75ff65925535bc580bdc7b7fd788627fc08

Height

#2,096,029

Difficulty

10.871761

Transactions

36

Size

9.24 KB

Version

2

Bits

0adf2bb5

Nonce

922,619,457

Timestamp

5/1/2017, 5:30:10 PM

Confirmations

4,729,071

Merkle Root

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

6.770 × 10⁹⁵(96-digit number)
67706329653968230157…85566086841393235201
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
6.770 × 10⁹⁵(96-digit number)
67706329653968230157…85566086841393235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.354 × 10⁹⁶(97-digit number)
13541265930793646031…71132173682786470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.708 × 10⁹⁶(97-digit number)
27082531861587292062…42264347365572940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.416 × 10⁹⁶(97-digit number)
54165063723174584125…84528694731145881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.083 × 10⁹⁷(98-digit number)
10833012744634916825…69057389462291763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.166 × 10⁹⁷(98-digit number)
21666025489269833650…38114778924583526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.333 × 10⁹⁷(98-digit number)
43332050978539667300…76229557849167052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.666 × 10⁹⁷(98-digit number)
86664101957079334600…52459115698334105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.733 × 10⁹⁸(99-digit number)
17332820391415866920…04918231396668211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.466 × 10⁹⁸(99-digit number)
34665640782831733840…09836462793336422401
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,844,882 XPM·at block #6,825,099 · 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