Block #856,452

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 2:25:49 AM · Difficulty 10.9680 · 5,950,159 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ce27767069e9a62fd7395514ed88e2ea63c7f6c1282ce7758ada0ef10eb0fc8

Height

#856,452

Difficulty

10.968050

Transactions

7

Size

1.96 KB

Version

2

Bits

0af7d219

Nonce

888,725,041

Timestamp

12/17/2014, 2:25:49 AM

Confirmations

5,950,159

Merkle Root

5a0a0e08e5c5455e63f4c3eaa0c23cb26b0f66798d66aaf12728e491f531e5bb
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.394 × 10⁹⁶(97-digit number)
13943141077293267150…91598404772985477979
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.394 × 10⁹⁶(97-digit number)
13943141077293267150…91598404772985477979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.788 × 10⁹⁶(97-digit number)
27886282154586534301…83196809545970955959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.577 × 10⁹⁶(97-digit number)
55772564309173068602…66393619091941911919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.115 × 10⁹⁷(98-digit number)
11154512861834613720…32787238183883823839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.230 × 10⁹⁷(98-digit number)
22309025723669227441…65574476367767647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.461 × 10⁹⁷(98-digit number)
44618051447338454882…31148952735535295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.923 × 10⁹⁷(98-digit number)
89236102894676909764…62297905471070590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.784 × 10⁹⁸(99-digit number)
17847220578935381952…24595810942141181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.569 × 10⁹⁸(99-digit number)
35694441157870763905…49191621884282362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.138 × 10⁹⁸(99-digit number)
71388882315741527811…98383243768564725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.427 × 10⁹⁹(100-digit number)
14277776463148305562…96766487537129451519
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,696,987 XPM·at block #6,806,610 · 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.

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