Block #856,758

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 8:01:11 AM · Difficulty 10.9679 · 5,984,554 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8dfa11d430a35382571a880a31dd33bceee4907076ce652f679679169e192fe2

Height

#856,758

Difficulty

10.967873

Transactions

6

Size

1.30 KB

Version

2

Bits

0af7c681

Nonce

317,169,738

Timestamp

12/17/2014, 8:01:11 AM

Confirmations

5,984,554

Merkle Root

9316dfc06afaa9d23c56302924788066f7e2c7f6e4fb392e495ce29439b8bea7
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.

5.561 × 10⁹⁴(95-digit number)
55613752158042530738…39486485398763732799
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
5.561 × 10⁹⁴(95-digit number)
55613752158042530738…39486485398763732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.112 × 10⁹⁵(96-digit number)
11122750431608506147…78972970797527465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.224 × 10⁹⁵(96-digit number)
22245500863217012295…57945941595054931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.449 × 10⁹⁵(96-digit number)
44491001726434024590…15891883190109862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.898 × 10⁹⁵(96-digit number)
88982003452868049181…31783766380219724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.779 × 10⁹⁶(97-digit number)
17796400690573609836…63567532760439449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.559 × 10⁹⁶(97-digit number)
35592801381147219672…27135065520878899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.118 × 10⁹⁶(97-digit number)
71185602762294439345…54270131041757798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.423 × 10⁹⁷(98-digit number)
14237120552458887869…08540262083515596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.847 × 10⁹⁷(98-digit number)
28474241104917775738…17080524167031193599
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,974,857 XPM·at block #6,841,311 · 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