Block #1,222,539

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2015, 1:37:50 AM · Difficulty 10.7430 · 5,604,261 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc5d03dbab8380269a3238c48caf77c1f86a229ebb9db0586e03cb3fdae3c2e8

Height

#1,222,539

Difficulty

10.742959

Transactions

7

Size

3.25 KB

Version

2

Bits

0abe3295

Nonce

541,785,878

Timestamp

9/5/2015, 1:37:50 AM

Confirmations

5,604,261

Merkle Root

a18527f902c72f644903162d36d1706cf44f55f91735d372d1dc4eed98445d4f
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.

6.758 × 10⁹³(94-digit number)
67584909031201852377…94097459994931082759
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
6.758 × 10⁹³(94-digit number)
67584909031201852377…94097459994931082759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.351 × 10⁹⁴(95-digit number)
13516981806240370475…88194919989862165519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.703 × 10⁹⁴(95-digit number)
27033963612480740950…76389839979724331039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.406 × 10⁹⁴(95-digit number)
54067927224961481901…52779679959448662079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.081 × 10⁹⁵(96-digit number)
10813585444992296380…05559359918897324159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.162 × 10⁹⁵(96-digit number)
21627170889984592760…11118719837794648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.325 × 10⁹⁵(96-digit number)
43254341779969185521…22237439675589296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.650 × 10⁹⁵(96-digit number)
86508683559938371042…44474879351178593279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.730 × 10⁹⁶(97-digit number)
17301736711987674208…88949758702357186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.460 × 10⁹⁶(97-digit number)
34603473423975348417…77899517404714373119
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,858,563 XPM·at block #6,826,799 · 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