Block #2,093,446

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2017, 10:58:06 PM · Difficulty 10.8709 · 4,750,288 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f22f6c8b47f8f57cae6e744183abb598045e5b708664a09f96927fddb9dd0b7

Height

#2,093,446

Difficulty

10.870934

Transactions

3

Size

11.44 KB

Version

2

Bits

0adef585

Nonce

180,557,300

Timestamp

4/29/2017, 10:58:06 PM

Confirmations

4,750,288

Merkle Root

77384c5156686e48badd6ff31cc11a36fbf0f782fcdc3e582314b113fef72516
Transactions (3)
1 in → 1 out8.5800 XPM109 B
71 in → 1 out1183.1426 XPM10.30 KB
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.046 × 10⁹⁴(95-digit number)
10463563521059129421…87723883650693304321
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.046 × 10⁹⁴(95-digit number)
10463563521059129421…87723883650693304321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.092 × 10⁹⁴(95-digit number)
20927127042118258842…75447767301386608641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.185 × 10⁹⁴(95-digit number)
41854254084236517685…50895534602773217281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.370 × 10⁹⁴(95-digit number)
83708508168473035370…01791069205546434561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.674 × 10⁹⁵(96-digit number)
16741701633694607074…03582138411092869121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.348 × 10⁹⁵(96-digit number)
33483403267389214148…07164276822185738241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.696 × 10⁹⁵(96-digit number)
66966806534778428296…14328553644371476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.339 × 10⁹⁶(97-digit number)
13393361306955685659…28657107288742952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.678 × 10⁹⁶(97-digit number)
26786722613911371318…57314214577485905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.357 × 10⁹⁶(97-digit number)
53573445227822742637…14628429154971811841
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,994,239 XPM·at block #6,843,733 · 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