Block #1,921,540

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2017, 12:14:31 AM · Difficulty 10.7317 · 4,920,887 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
abebe40a0588ceae1d76b902a27a805a9678752bf26ab7b6389135d27c02e28d

Height

#1,921,540

Difficulty

10.731693

Transactions

2

Size

426 B

Version

2

Bits

0abb5039

Nonce

1,232,757,133

Timestamp

1/3/2017, 12:14:31 AM

Confirmations

4,920,887

Merkle Root

914fdc35341f5c2ccca3687036b6aba98e1a7650e7638eede9785950696afc2f
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.

4.696 × 10⁹⁵(96-digit number)
46966835470141531185…10739580876367686401
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
4.696 × 10⁹⁵(96-digit number)
46966835470141531185…10739580876367686401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.393 × 10⁹⁵(96-digit number)
93933670940283062370…21479161752735372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.878 × 10⁹⁶(97-digit number)
18786734188056612474…42958323505470745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.757 × 10⁹⁶(97-digit number)
37573468376113224948…85916647010941491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.514 × 10⁹⁶(97-digit number)
75146936752226449896…71833294021882982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.502 × 10⁹⁷(98-digit number)
15029387350445289979…43666588043765964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.005 × 10⁹⁷(98-digit number)
30058774700890579958…87333176087531929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.011 × 10⁹⁷(98-digit number)
60117549401781159917…74666352175063859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.202 × 10⁹⁸(99-digit number)
12023509880356231983…49332704350127718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.404 × 10⁹⁸(99-digit number)
24047019760712463966…98665408700255436801
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,983,830 XPM·at block #6,842,426 · 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