Block #371,742

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/23/2014, 3:04:41 AM · Difficulty 10.4279 · 6,443,380 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f83312187c35258496de5495205c79e2933a17f35b457379b6d6ec7ad293041

Height

#371,742

Difficulty

10.427899

Transactions

5

Size

1.17 KB

Version

2

Bits

0a6d8acd

Nonce

7,577

Timestamp

1/23/2014, 3:04:41 AM

Confirmations

6,443,380

Merkle Root

0aa12264fca3f19d8901b6a39c22f94a838d64ee5ec7ac236b7bde48d47fd7fc
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.

6.870 × 10¹⁰³(104-digit number)
68707217469897314552…44257207611655454721
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
6.870 × 10¹⁰³(104-digit number)
68707217469897314552…44257207611655454721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.374 × 10¹⁰⁴(105-digit number)
13741443493979462910…88514415223310909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.748 × 10¹⁰⁴(105-digit number)
27482886987958925821…77028830446621818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.496 × 10¹⁰⁴(105-digit number)
54965773975917851642…54057660893243637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.099 × 10¹⁰⁵(106-digit number)
10993154795183570328…08115321786487275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.198 × 10¹⁰⁵(106-digit number)
21986309590367140656…16230643572974551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.397 × 10¹⁰⁵(106-digit number)
43972619180734281313…32461287145949102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.794 × 10¹⁰⁵(106-digit number)
87945238361468562627…64922574291898204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.758 × 10¹⁰⁶(107-digit number)
17589047672293712525…29845148583796408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.517 × 10¹⁰⁶(107-digit number)
35178095344587425051…59690297167592816641
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,765,069 XPM·at block #6,815,121 · 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