Block #2,267,311

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/25/2017, 12:41:29 PM · Difficulty 10.9517 · 4,564,509 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b3a40da67b3ee50cddc96fd0594423450585059174112d9d0514e2be1f52a07b

Height

#2,267,311

Difficulty

10.951706

Transactions

4

Size

1.15 KB

Version

2

Bits

0af3a309

Nonce

1,102,150,175

Timestamp

8/25/2017, 12:41:29 PM

Confirmations

4,564,509

Merkle Root

77acee12df65c6c51800c31ee00c25879cf91afb53add2efcf6622f199387104
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.963 × 10⁹⁴(95-digit number)
89630809670744472170…09767210299173119199
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.963 × 10⁹⁴(95-digit number)
89630809670744472170…09767210299173119199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.792 × 10⁹⁵(96-digit number)
17926161934148894434…19534420598346238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.585 × 10⁹⁵(96-digit number)
35852323868297788868…39068841196692476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.170 × 10⁹⁵(96-digit number)
71704647736595577736…78137682393384953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.434 × 10⁹⁶(97-digit number)
14340929547319115547…56275364786769907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.868 × 10⁹⁶(97-digit number)
28681859094638231094…12550729573539814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.736 × 10⁹⁶(97-digit number)
57363718189276462188…25101459147079628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.147 × 10⁹⁷(98-digit number)
11472743637855292437…50202918294159257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.294 × 10⁹⁷(98-digit number)
22945487275710584875…00405836588318515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.589 × 10⁹⁷(98-digit number)
45890974551421169751…00811673176637030399
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,898,677 XPM·at block #6,831,819 · 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