Block #1,970,876

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2017, 12:01:58 AM · Difficulty 10.7536 · 4,856,136 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54721daff8d30eac7798062947d71991ef2fd86d743d0c486a85172ee62cfb9a

Height

#1,970,876

Difficulty

10.753631

Transactions

2

Size

2.44 KB

Version

2

Bits

0ac0edfe

Nonce

1,313,326,016

Timestamp

2/6/2017, 12:01:58 AM

Confirmations

4,856,136

Merkle Root

43f21775650bb0279dbc06a20411915d222b6691e0f3d64df4781f84b4bc1cf2
Transactions (2)
1 in → 1 out8.6600 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.466 × 10⁹³(94-digit number)
14666436047926559955…50092876225850400001
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.466 × 10⁹³(94-digit number)
14666436047926559955…50092876225850400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.933 × 10⁹³(94-digit number)
29332872095853119911…00185752451700800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.866 × 10⁹³(94-digit number)
58665744191706239822…00371504903401600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.173 × 10⁹⁴(95-digit number)
11733148838341247964…00743009806803200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.346 × 10⁹⁴(95-digit number)
23466297676682495928…01486019613606400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.693 × 10⁹⁴(95-digit number)
46932595353364991857…02972039227212800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.386 × 10⁹⁴(95-digit number)
93865190706729983715…05944078454425600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.877 × 10⁹⁵(96-digit number)
18773038141345996743…11888156908851200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.754 × 10⁹⁵(96-digit number)
37546076282691993486…23776313817702400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.509 × 10⁹⁵(96-digit number)
75092152565383986972…47552627635404800001
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,860,273 XPM·at block #6,827,011 · 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