Block #856,369

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 1:03:46 AM · Difficulty 10.9680 · 5,985,486 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d1504d75e50b882ab51d364f561d1ac8a6ff45e411c22aadaa667adbeb9c0250

Height

#856,369

Difficulty

10.968044

Transactions

13

Size

2.89 KB

Version

2

Bits

0af7d1b9

Nonce

2,275,141,143

Timestamp

12/17/2014, 1:03:46 AM

Confirmations

5,985,486

Merkle Root

55c5d58663302160e9ffe6eefdd1e41bae4e27301e453d7b1b0f7d9fa71dc7e0
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.373 × 10⁹⁵(96-digit number)
83739497711592272988…59387569778592871359
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.373 × 10⁹⁵(96-digit number)
83739497711592272988…59387569778592871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.674 × 10⁹⁶(97-digit number)
16747899542318454597…18775139557185742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.349 × 10⁹⁶(97-digit number)
33495799084636909195…37550279114371485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.699 × 10⁹⁶(97-digit number)
66991598169273818390…75100558228742970879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.339 × 10⁹⁷(98-digit number)
13398319633854763678…50201116457485941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.679 × 10⁹⁷(98-digit number)
26796639267709527356…00402232914971883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.359 × 10⁹⁷(98-digit number)
53593278535419054712…00804465829943767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.071 × 10⁹⁸(99-digit number)
10718655707083810942…01608931659887534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.143 × 10⁹⁸(99-digit number)
21437311414167621885…03217863319775068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.287 × 10⁹⁸(99-digit number)
42874622828335243770…06435726639550136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.574 × 10⁹⁸(99-digit number)
85749245656670487540…12871453279100272639
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,979,216 XPM·at block #6,841,854 · 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