Block #210,340

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2013, 1:56:02 AM · Difficulty 9.9131 · 6,616,218 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1451fe1c851d20f974b649ecabc43a97daa3d6bc91de7da9487433549018e335

Height

#210,340

Difficulty

9.913082

Transactions

4

Size

20.34 KB

Version

2

Bits

09e9bfb6

Nonce

50,604

Timestamp

10/15/2013, 1:56:02 AM

Confirmations

6,616,218

Merkle Root

05daed9554f7eca1a37aec9b283b5c97c35f12efd47f957aae3bce1620be1838
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.

3.414 × 10⁹⁰(91-digit number)
34142966372226041113…66370030143772743839
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
3.414 × 10⁹⁰(91-digit number)
34142966372226041113…66370030143772743839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.828 × 10⁹⁰(91-digit number)
68285932744452082226…32740060287545487679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.365 × 10⁹¹(92-digit number)
13657186548890416445…65480120575090975359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.731 × 10⁹¹(92-digit number)
27314373097780832890…30960241150181950719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.462 × 10⁹¹(92-digit number)
54628746195561665781…61920482300363901439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.092 × 10⁹²(93-digit number)
10925749239112333156…23840964600727802879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.185 × 10⁹²(93-digit number)
21851498478224666312…47681929201455605759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.370 × 10⁹²(93-digit number)
43702996956449332625…95363858402911211519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.740 × 10⁹²(93-digit number)
87405993912898665250…90727716805822423039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.748 × 10⁹³(94-digit number)
17481198782579733050…81455433611644846079
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,856,615 XPM·at block #6,826,557 · 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