Block #851,901

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2014, 3:52:52 PM · Difficulty 10.9704 · 5,984,669 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bec0308710003bea70350985ecb9f68da56db88d3d9e0347be842b88908c6e1b

Height

#851,901

Difficulty

10.970375

Transactions

5

Size

1.26 KB

Version

2

Bits

0af86a7c

Nonce

1,379,137,894

Timestamp

12/13/2014, 3:52:52 PM

Confirmations

5,984,669

Merkle Root

7808d73134971d592f33158dfdbaf2fece8f8f47359f5542eed7ad2b3be0c41a
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.948 × 10⁹⁵(96-digit number)
19487180114766967543…12639852654142061759
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.948 × 10⁹⁵(96-digit number)
19487180114766967543…12639852654142061759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.897 × 10⁹⁵(96-digit number)
38974360229533935086…25279705308284123519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.794 × 10⁹⁵(96-digit number)
77948720459067870173…50559410616568247039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.558 × 10⁹⁶(97-digit number)
15589744091813574034…01118821233136494079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.117 × 10⁹⁶(97-digit number)
31179488183627148069…02237642466272988159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.235 × 10⁹⁶(97-digit number)
62358976367254296138…04475284932545976319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.247 × 10⁹⁷(98-digit number)
12471795273450859227…08950569865091952639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.494 × 10⁹⁷(98-digit number)
24943590546901718455…17901139730183905279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.988 × 10⁹⁷(98-digit number)
49887181093803436910…35802279460367810559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.977 × 10⁹⁷(98-digit number)
99774362187606873821…71604558920735621119
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,936,825 XPM·at block #6,836,569 · 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