Block #1,892,311

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2016, 3:41:00 PM · Difficulty 10.7350 · 4,951,403 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6caecb836e44c58c4d033b24c4544db3520b577f770bdcd06333dff3c408c79

Height

#1,892,311

Difficulty

10.735028

Transactions

2

Size

17.74 KB

Version

2

Bits

0abc2ad2

Nonce

2,083,770,731

Timestamp

12/13/2016, 3:41:00 PM

Confirmations

4,951,403

Merkle Root

4f1d508356835acc67e808a2690a6b0bf108e48f61b73b2fc6ab51dcc529cda8
Transactions (2)
1 in → 1 out8.8400 XPM109 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.879 × 10⁹⁶(97-digit number)
18798968414542175825…71414302566004409601
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.879 × 10⁹⁶(97-digit number)
18798968414542175825…71414302566004409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.759 × 10⁹⁶(97-digit number)
37597936829084351650…42828605132008819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.519 × 10⁹⁶(97-digit number)
75195873658168703300…85657210264017638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.503 × 10⁹⁷(98-digit number)
15039174731633740660…71314420528035276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.007 × 10⁹⁷(98-digit number)
30078349463267481320…42628841056070553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.015 × 10⁹⁷(98-digit number)
60156698926534962640…85257682112141107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.203 × 10⁹⁸(99-digit number)
12031339785306992528…70515364224282214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.406 × 10⁹⁸(99-digit number)
24062679570613985056…41030728448564428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.812 × 10⁹⁸(99-digit number)
48125359141227970112…82061456897128857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.625 × 10⁹⁸(99-digit number)
96250718282455940224…64122913794257715201
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,083 XPM·at block #6,843,713 · 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