Block #840,339

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2014, 2:21:47 AM · Difficulty 10.9742 · 6,001,278 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f53505d7ec0b03b313583445d08577f37568fadb6aa763fa00b352e33a380f16

Height

#840,339

Difficulty

10.974236

Transactions

2

Size

433 B

Version

2

Bits

0af96786

Nonce

809,556,515

Timestamp

12/5/2014, 2:21:47 AM

Confirmations

6,001,278

Merkle Root

6b716d402129d7317985707729bd1d963bbf79572ff715b09ff869a39913cc4d
Transactions (2)
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.140 × 10⁹⁷(98-digit number)
91408660886750456669…74145026697136005119
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.140 × 10⁹⁷(98-digit number)
91408660886750456669…74145026697136005119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.828 × 10⁹⁸(99-digit number)
18281732177350091333…48290053394272010239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.656 × 10⁹⁸(99-digit number)
36563464354700182667…96580106788544020479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.312 × 10⁹⁸(99-digit number)
73126928709400365335…93160213577088040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.462 × 10⁹⁹(100-digit number)
14625385741880073067…86320427154176081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.925 × 10⁹⁹(100-digit number)
29250771483760146134…72640854308352163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.850 × 10⁹⁹(100-digit number)
58501542967520292268…45281708616704327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.170 × 10¹⁰⁰(101-digit number)
11700308593504058453…90563417233408655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.340 × 10¹⁰⁰(101-digit number)
23400617187008116907…81126834466817310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.680 × 10¹⁰⁰(101-digit number)
46801234374016233815…62253668933634621439
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,977,318 XPM·at block #6,841,616 · 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