Block #351,384

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2014, 4:16:10 PM · Difficulty 10.2951 · 6,465,783 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
43753184134ff20b0cb936557c6e25372d42fabd55bd472ec6fcfcbdbcc990fe

Height

#351,384

Difficulty

10.295087

Transactions

12

Size

3.03 KB

Version

2

Bits

0a4b8ad2

Nonce

207,747

Timestamp

1/9/2014, 4:16:10 PM

Confirmations

6,465,783

Merkle Root

6cbbde15d77c0f6881f588a0d5a8c9823c1b19ae8673b37cbfe47f6610bac234
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.

8.412 × 10¹⁰⁰(101-digit number)
84128251280193005870…81705175809499351041
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
8.412 × 10¹⁰⁰(101-digit number)
84128251280193005870…81705175809499351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.682 × 10¹⁰¹(102-digit number)
16825650256038601174…63410351618998702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.365 × 10¹⁰¹(102-digit number)
33651300512077202348…26820703237997404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.730 × 10¹⁰¹(102-digit number)
67302601024154404696…53641406475994808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.346 × 10¹⁰²(103-digit number)
13460520204830880939…07282812951989616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.692 × 10¹⁰²(103-digit number)
26921040409661761878…14565625903979233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.384 × 10¹⁰²(103-digit number)
53842080819323523756…29131251807958466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.076 × 10¹⁰³(104-digit number)
10768416163864704751…58262503615916933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.153 × 10¹⁰³(104-digit number)
21536832327729409502…16525007231833866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.307 × 10¹⁰³(104-digit number)
43073664655458819005…33050014463667732481
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,781,370 XPM·at block #6,817,166 · 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