Block #354,683

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 4:41:51 PM · Difficulty 10.3488 · 6,462,213 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d703a8bdaad4a9d516b609f41f2c4e7c0430a8ba0415be16465032c3e4996cc1

Height

#354,683

Difficulty

10.348825

Transactions

5

Size

1.08 KB

Version

2

Bits

0a594c96

Nonce

607,849

Timestamp

1/11/2014, 4:41:51 PM

Confirmations

6,462,213

Merkle Root

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

9.844 × 10⁹⁶(97-digit number)
98449009038961267845…12103349758024003699
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
9.844 × 10⁹⁶(97-digit number)
98449009038961267845…12103349758024003699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.968 × 10⁹⁷(98-digit number)
19689801807792253569…24206699516048007399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.937 × 10⁹⁷(98-digit number)
39379603615584507138…48413399032096014799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.875 × 10⁹⁷(98-digit number)
78759207231169014276…96826798064192029599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.575 × 10⁹⁸(99-digit number)
15751841446233802855…93653596128384059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.150 × 10⁹⁸(99-digit number)
31503682892467605710…87307192256768118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.300 × 10⁹⁸(99-digit number)
63007365784935211421…74614384513536236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.260 × 10⁹⁹(100-digit number)
12601473156987042284…49228769027072473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.520 × 10⁹⁹(100-digit number)
25202946313974084568…98457538054144947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.040 × 10⁹⁹(100-digit number)
50405892627948169136…96915076108289894399
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,779,210 XPM·at block #6,816,895 · 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