Block #876,893

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2014, 5:45:58 PM · Difficulty 10.9644 · 5,939,607 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
25f01f26f97fcdba330a4c5d19834bb744c59a41b03641e3618e3d414575c3cc

Height

#876,893

Difficulty

10.964365

Transactions

3

Size

800 B

Version

2

Bits

0af6e09d

Nonce

1,458,458,479

Timestamp

12/31/2014, 5:45:58 PM

Confirmations

5,939,607

Merkle Root

cce480edd46d421c9face26d1d7714c6fb5ebb34d0de2c2d770fc492b765bb90
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.

6.852 × 10⁹⁵(96-digit number)
68528948286182959109…16684201159990370559
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
6.852 × 10⁹⁵(96-digit number)
68528948286182959109…16684201159990370559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.370 × 10⁹⁶(97-digit number)
13705789657236591821…33368402319980741119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.741 × 10⁹⁶(97-digit number)
27411579314473183643…66736804639961482239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.482 × 10⁹⁶(97-digit number)
54823158628946367287…33473609279922964479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.096 × 10⁹⁷(98-digit number)
10964631725789273457…66947218559845928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.192 × 10⁹⁷(98-digit number)
21929263451578546915…33894437119691857919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.385 × 10⁹⁷(98-digit number)
43858526903157093830…67788874239383715839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.771 × 10⁹⁷(98-digit number)
87717053806314187660…35577748478767431679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.754 × 10⁹⁸(99-digit number)
17543410761262837532…71155496957534863359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.508 × 10⁹⁸(99-digit number)
35086821522525675064…42310993915069726719
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,776,129 XPM·at block #6,816,499 · 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