Block #855,241

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 5:07:56 AM · Difficulty 10.9684 · 5,987,305 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e512e3f0788573fcf3e7165e0f88bda8897884ffe55a0032515ec001f960ec29

Height

#855,241

Difficulty

10.968429

Transactions

7

Size

1.46 KB

Version

2

Bits

0af7eaf4

Nonce

2,672,219,626

Timestamp

12/16/2014, 5:07:56 AM

Confirmations

5,987,305

Merkle Root

3661c58f8c712ef12e0ba74994086d1ccdc4e2f4ed23e3f0e14ad871f28a1f8b
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.420 × 10⁹⁵(96-digit number)
14203646994158668913…21243158787763477759
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.420 × 10⁹⁵(96-digit number)
14203646994158668913…21243158787763477759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.840 × 10⁹⁵(96-digit number)
28407293988317337826…42486317575526955519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.681 × 10⁹⁵(96-digit number)
56814587976634675653…84972635151053911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.136 × 10⁹⁶(97-digit number)
11362917595326935130…69945270302107822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.272 × 10⁹⁶(97-digit number)
22725835190653870261…39890540604215644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.545 × 10⁹⁶(97-digit number)
45451670381307740522…79781081208431288319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.090 × 10⁹⁶(97-digit number)
90903340762615481045…59562162416862576639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.818 × 10⁹⁷(98-digit number)
18180668152523096209…19124324833725153279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.636 × 10⁹⁷(98-digit number)
36361336305046192418…38248649667450306559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.272 × 10⁹⁷(98-digit number)
72722672610092384836…76497299334900613119
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,984,792 XPM·at block #6,842,545 · 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