Block #358,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2014, 6:05:38 AM · Difficulty 10.3851 · 6,467,469 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb2ddf5fa32d8048d3061133e9106d7c85eec2f4c018aae936f65335ceb73c42

Height

#358,642

Difficulty

10.385065

Transactions

2

Size

491 B

Version

2

Bits

0a6293a2

Nonce

33,411

Timestamp

1/14/2014, 6:05:38 AM

Confirmations

6,467,469

Merkle Root

18934757e28dc6edb80ebf8cb5f61666644cd592dec8d8f99a8a5ffa36aeb51d
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.620 × 10¹⁰²(103-digit number)
86206596328982786508…42244025571600384641
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.620 × 10¹⁰²(103-digit number)
86206596328982786508…42244025571600384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.724 × 10¹⁰³(104-digit number)
17241319265796557301…84488051143200769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.448 × 10¹⁰³(104-digit number)
34482638531593114603…68976102286401538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.896 × 10¹⁰³(104-digit number)
68965277063186229206…37952204572803077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.379 × 10¹⁰⁴(105-digit number)
13793055412637245841…75904409145606154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.758 × 10¹⁰⁴(105-digit number)
27586110825274491682…51808818291212308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.517 × 10¹⁰⁴(105-digit number)
55172221650548983365…03617636582424616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.103 × 10¹⁰⁵(106-digit number)
11034444330109796673…07235273164849233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.206 × 10¹⁰⁵(106-digit number)
22068888660219593346…14470546329698467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.413 × 10¹⁰⁵(106-digit number)
44137777320439186692…28941092659396935681
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,853,012 XPM·at block #6,826,110 · 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