Block #349,035

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 4:06:48 AM · Difficulty 10.2688 · 6,476,608 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9ad5e76d4aa5d49863ea502e4ce63653295d91e06c8aef7a8ee1413dbeb6e101

Height

#349,035

Difficulty

10.268806

Transactions

11

Size

2.96 KB

Version

2

Bits

0a44d07b

Nonce

63,001

Timestamp

1/8/2014, 4:06:48 AM

Confirmations

6,476,608

Merkle Root

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

2.857 × 10¹⁰¹(102-digit number)
28572621757846191028…10784182703564161089
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
2.857 × 10¹⁰¹(102-digit number)
28572621757846191028…10784182703564161089
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.714 × 10¹⁰¹(102-digit number)
57145243515692382057…21568365407128322179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.142 × 10¹⁰²(103-digit number)
11429048703138476411…43136730814256644359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.285 × 10¹⁰²(103-digit number)
22858097406276952822…86273461628513288719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.571 × 10¹⁰²(103-digit number)
45716194812553905645…72546923257026577439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.143 × 10¹⁰²(103-digit number)
91432389625107811291…45093846514053154879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.828 × 10¹⁰³(104-digit number)
18286477925021562258…90187693028106309759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.657 × 10¹⁰³(104-digit number)
36572955850043124516…80375386056212619519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.314 × 10¹⁰³(104-digit number)
73145911700086249033…60750772112425239039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.462 × 10¹⁰⁴(105-digit number)
14629182340017249806…21501544224850478079
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,849,249 XPM·at block #6,825,642 · 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