Block #195,374

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/5/2013, 6:28:53 PM · Difficulty 9.8803 · 6,621,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa58fc0475ef308740c2082dae1445fc9e8e527564b8d175dfbe442ca4419874

Height

#195,374

Difficulty

9.880281

Transactions

3

Size

1.36 KB

Version

2

Bits

09e15a1c

Nonce

20,509

Timestamp

10/5/2013, 6:28:53 PM

Confirmations

6,621,153

Merkle Root

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

7.242 × 10⁹²(93-digit number)
72428921241899645758…78281679319005491201
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
7.242 × 10⁹²(93-digit number)
72428921241899645758…78281679319005491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.448 × 10⁹³(94-digit number)
14485784248379929151…56563358638010982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.897 × 10⁹³(94-digit number)
28971568496759858303…13126717276021964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.794 × 10⁹³(94-digit number)
57943136993519716606…26253434552043929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.158 × 10⁹⁴(95-digit number)
11588627398703943321…52506869104087859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.317 × 10⁹⁴(95-digit number)
23177254797407886642…05013738208175718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.635 × 10⁹⁴(95-digit number)
46354509594815773285…10027476416351436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.270 × 10⁹⁴(95-digit number)
92709019189631546570…20054952832702873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.854 × 10⁹⁵(96-digit number)
18541803837926309314…40109905665405747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.708 × 10⁹⁵(96-digit number)
37083607675852618628…80219811330811494401
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,776,342 XPM·at block #6,816,526 · 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