Block #2,100,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2017, 5:05:16 AM · Difficulty 10.8551 · 4,716,870 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e9ad630804fefd6cb0be51eeedf4e7af8be26a7aadb00812d9eb22558654d7a

Height

#2,100,419

Difficulty

10.855064

Transactions

3

Size

3.21 KB

Version

2

Bits

0adae578

Nonce

293,735,149

Timestamp

5/5/2017, 5:05:16 AM

Confirmations

4,716,870

Merkle Root

4bf367d9224c03175dd417e8bb51ff139deff2f8f9afa41624f7c36020310394
Transactions (3)
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.

1.412 × 10⁹⁴(95-digit number)
14127222795664971361…56162444787441018579
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
1.412 × 10⁹⁴(95-digit number)
14127222795664971361…56162444787441018579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.825 × 10⁹⁴(95-digit number)
28254445591329942722…12324889574882037159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.650 × 10⁹⁴(95-digit number)
56508891182659885445…24649779149764074319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.130 × 10⁹⁵(96-digit number)
11301778236531977089…49299558299528148639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.260 × 10⁹⁵(96-digit number)
22603556473063954178…98599116599056297279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.520 × 10⁹⁵(96-digit number)
45207112946127908356…97198233198112594559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.041 × 10⁹⁵(96-digit number)
90414225892255816712…94396466396225189119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.808 × 10⁹⁶(97-digit number)
18082845178451163342…88792932792450378239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.616 × 10⁹⁶(97-digit number)
36165690356902326685…77585865584900756479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.233 × 10⁹⁶(97-digit number)
72331380713804653370…55171731169801512959
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,782,353 XPM·at block #6,817,288 · 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