Block #2,110,351

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2017, 5:24:52 PM · Difficulty 10.9026 · 4,726,777 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f941610a75017d4883095c33cf661da28faceb5fdc83e8b4a222d2b2cf876081

Height

#2,110,351

Difficulty

10.902575

Transactions

2

Size

573 B

Version

2

Bits

0ae70f30

Nonce

839,279,002

Timestamp

5/10/2017, 5:24:52 PM

Confirmations

4,726,777

Merkle Root

5a90b61e60aa30ea3af8f79f5b98e037999ca7b3e41028577ebea24dbc0e3bd8
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.

2.005 × 10⁹⁴(95-digit number)
20052587612442337144…21298956734681573699
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.005 × 10⁹⁴(95-digit number)
20052587612442337144…21298956734681573699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.010 × 10⁹⁴(95-digit number)
40105175224884674288…42597913469363147399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.021 × 10⁹⁴(95-digit number)
80210350449769348576…85195826938726294799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.604 × 10⁹⁵(96-digit number)
16042070089953869715…70391653877452589599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.208 × 10⁹⁵(96-digit number)
32084140179907739430…40783307754905179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.416 × 10⁹⁵(96-digit number)
64168280359815478861…81566615509810358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.283 × 10⁹⁶(97-digit number)
12833656071963095772…63133231019620716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.566 × 10⁹⁶(97-digit number)
25667312143926191544…26266462039241433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.133 × 10⁹⁶(97-digit number)
51334624287852383089…52532924078482867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.026 × 10⁹⁷(98-digit number)
10266924857570476617…05065848156965734399
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,941,333 XPM·at block #6,837,127 · 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