Block #2,266,011

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/24/2017, 3:18:57 PM · Difficulty 10.9515 · 4,573,368 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
242a94845d7c9e3c3b098aa3284cbf5f04f2678fa87f70e5822ca423aa2e1456

Height

#2,266,011

Difficulty

10.951520

Transactions

7

Size

2.97 KB

Version

2

Bits

0af396d7

Nonce

390,587,833

Timestamp

8/24/2017, 3:18:57 PM

Confirmations

4,573,368

Merkle Root

871dc9647d27d6fff3b3937dc550f9cf172e43fcb35b9de900dfb2508d8fd43a
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.

8.056 × 10⁹⁵(96-digit number)
80569299811446215742…75741105709141800959
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
8.056 × 10⁹⁵(96-digit number)
80569299811446215742…75741105709141800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.611 × 10⁹⁶(97-digit number)
16113859962289243148…51482211418283601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.222 × 10⁹⁶(97-digit number)
32227719924578486297…02964422836567203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.445 × 10⁹⁶(97-digit number)
64455439849156972594…05928845673134407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.289 × 10⁹⁷(98-digit number)
12891087969831394518…11857691346268815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.578 × 10⁹⁷(98-digit number)
25782175939662789037…23715382692537630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.156 × 10⁹⁷(98-digit number)
51564351879325578075…47430765385075261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.031 × 10⁹⁸(99-digit number)
10312870375865115615…94861530770150522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.062 × 10⁹⁸(99-digit number)
20625740751730231230…89723061540301045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.125 × 10⁹⁸(99-digit number)
41251481503460462460…79446123080602091519
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,959,315 XPM·at block #6,839,378 · 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