Block #841,951

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2014, 6:24:41 AM · Difficulty 10.9739 · 5,999,911 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5b2b0f5c466504c565986164e1398a4c33ecd52c428210d9718917684997549a

Height

#841,951

Difficulty

10.973916

Transactions

3

Size

956 B

Version

2

Bits

0af95293

Nonce

513,951,937

Timestamp

12/6/2014, 6:24:41 AM

Confirmations

5,999,911

Merkle Root

a04efd31f88f17a802c5ec606111ff03f2858f0f924e82b394ef52a2460c4fb4
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.122 × 10⁹⁵(96-digit number)
11222180005668800829…76617211551889305119
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.122 × 10⁹⁵(96-digit number)
11222180005668800829…76617211551889305119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.244 × 10⁹⁵(96-digit number)
22444360011337601658…53234423103778610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.488 × 10⁹⁵(96-digit number)
44888720022675203317…06468846207557220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.977 × 10⁹⁵(96-digit number)
89777440045350406634…12937692415114440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.795 × 10⁹⁶(97-digit number)
17955488009070081326…25875384830228881919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.591 × 10⁹⁶(97-digit number)
35910976018140162653…51750769660457763839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.182 × 10⁹⁶(97-digit number)
71821952036280325307…03501539320915527679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.436 × 10⁹⁷(98-digit number)
14364390407256065061…07003078641831055359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.872 × 10⁹⁷(98-digit number)
28728780814512130123…14006157283662110719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.745 × 10⁹⁷(98-digit number)
57457561629024260246…28012314567324221439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.149 × 10⁹⁸(99-digit number)
11491512325804852049…56024629134648442879
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,273 XPM·at block #6,841,861 · 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