Block #358,707

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 7:14:25 AM · Difficulty 10.3849 · 6,447,887 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2e7d09c9003c8dcc8e20c5782edfec257d7ec0ba5c9a04960491407758365f60

Height

#358,707

Difficulty

10.384872

Transactions

7

Size

77.97 KB

Version

2

Bits

0a6286f8

Nonce

81,643

Timestamp

1/14/2014, 7:14:25 AM

Confirmations

6,447,887

Merkle Root

edf2ecbaf1fad0af32b1845e63dad1bd3e6de0bc53589ae5bb4991262035c361
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.362 × 10¹⁰¹(102-digit number)
13623611984476755570…92199520814237512179
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.362 × 10¹⁰¹(102-digit number)
13623611984476755570…92199520814237512179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.724 × 10¹⁰¹(102-digit number)
27247223968953511141…84399041628475024359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.449 × 10¹⁰¹(102-digit number)
54494447937907022283…68798083256950048719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.089 × 10¹⁰²(103-digit number)
10898889587581404456…37596166513900097439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.179 × 10¹⁰²(103-digit number)
21797779175162808913…75192333027800194879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.359 × 10¹⁰²(103-digit number)
43595558350325617826…50384666055600389759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.719 × 10¹⁰²(103-digit number)
87191116700651235653…00769332111200779519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.743 × 10¹⁰³(104-digit number)
17438223340130247130…01538664222401559039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.487 × 10¹⁰³(104-digit number)
34876446680260494261…03077328444803118079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.975 × 10¹⁰³(104-digit number)
69752893360520988522…06154656889606236159
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,696,850 XPM·at block #6,806,593 · 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.

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