Block #2,165,806

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/18/2017, 10:45:09 AM · Difficulty 10.8983 · 4,675,982 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6b4e2d302393e78421176c694c03833d0317bebf122bea9deaf2388895f6459c

Height

#2,165,806

Difficulty

10.898337

Transactions

7

Size

2.24 KB

Version

2

Bits

0ae5f96b

Nonce

1,359,957,357

Timestamp

6/18/2017, 10:45:09 AM

Confirmations

4,675,982

Merkle Root

14692bd0fb97c78a8fab1857c9c534b42aa69d40a2f98c16ffc5525b2e6e5eb8
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.503 × 10⁹⁷(98-digit number)
15037720291173838586…97814207137210992639
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.503 × 10⁹⁷(98-digit number)
15037720291173838586…97814207137210992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.007 × 10⁹⁷(98-digit number)
30075440582347677173…95628414274421985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.015 × 10⁹⁷(98-digit number)
60150881164695354346…91256828548843970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.203 × 10⁹⁸(99-digit number)
12030176232939070869…82513657097687941119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.406 × 10⁹⁸(99-digit number)
24060352465878141738…65027314195375882239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.812 × 10⁹⁸(99-digit number)
48120704931756283477…30054628390751764479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.624 × 10⁹⁸(99-digit number)
96241409863512566955…60109256781503528959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.924 × 10⁹⁹(100-digit number)
19248281972702513391…20218513563007057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.849 × 10⁹⁹(100-digit number)
38496563945405026782…40437027126014115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.699 × 10⁹⁹(100-digit number)
76993127890810053564…80874054252028231679
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,978,682 XPM·at block #6,841,787 · 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