Block #856,831

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 9:36:54 AM · Difficulty 10.9677 · 5,985,695 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1ea7a6114d5f750afb1f09618677c876a2c4e27f7fb8123e5f7bbc237d2d8099

Height

#856,831

Difficulty

10.967724

Transactions

4

Size

988 B

Version

2

Bits

0af7bcc8

Nonce

112,413,791

Timestamp

12/17/2014, 9:36:54 AM

Confirmations

5,985,695

Merkle Root

dc856e3ad5c0b19ae50177017e4a663a10ebbb0a4c509aacc0d535b0f55f761a
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.069 × 10⁹⁴(95-digit number)
10699570211132011660…16588790344210325339
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.069 × 10⁹⁴(95-digit number)
10699570211132011660…16588790344210325339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.139 × 10⁹⁴(95-digit number)
21399140422264023321…33177580688420650679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.279 × 10⁹⁴(95-digit number)
42798280844528046643…66355161376841301359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.559 × 10⁹⁴(95-digit number)
85596561689056093287…32710322753682602719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.711 × 10⁹⁵(96-digit number)
17119312337811218657…65420645507365205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.423 × 10⁹⁵(96-digit number)
34238624675622437315…30841291014730410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.847 × 10⁹⁵(96-digit number)
68477249351244874630…61682582029460821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.369 × 10⁹⁶(97-digit number)
13695449870248974926…23365164058921643519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.739 × 10⁹⁶(97-digit number)
27390899740497949852…46730328117843287039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.478 × 10⁹⁶(97-digit number)
54781799480995899704…93460656235686574079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.095 × 10⁹⁷(98-digit number)
10956359896199179940…86921312471373148159
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,984,629 XPM·at block #6,842,525 · 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