Block #859,355

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2014, 9:36:04 AM · Difficulty 10.9655 · 5,950,390 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3091efac39d569e4f666c1fedb50b912f111a2b8ecaaf8aa19dc64a0e2da0bac

Height

#859,355

Difficulty

10.965451

Transactions

7

Size

1.35 KB

Version

2

Bits

0af727c4

Nonce

1,681,634,403

Timestamp

12/19/2014, 9:36:04 AM

Confirmations

5,950,390

Merkle Root

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

2.980 × 10⁹⁶(97-digit number)
29800310423316583559…46488296103500103679
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
2.980 × 10⁹⁶(97-digit number)
29800310423316583559…46488296103500103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.960 × 10⁹⁶(97-digit number)
59600620846633167119…92976592207000207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.192 × 10⁹⁷(98-digit number)
11920124169326633423…85953184414000414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.384 × 10⁹⁷(98-digit number)
23840248338653266847…71906368828000829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.768 × 10⁹⁷(98-digit number)
47680496677306533695…43812737656001658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.536 × 10⁹⁷(98-digit number)
95360993354613067391…87625475312003317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.907 × 10⁹⁸(99-digit number)
19072198670922613478…75250950624006635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.814 × 10⁹⁸(99-digit number)
38144397341845226956…50501901248013271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.628 × 10⁹⁸(99-digit number)
76288794683690453912…01003802496026542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.525 × 10⁹⁹(100-digit number)
15257758936738090782…02007604992053084159
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,722,044 XPM·at block #6,809,744 · 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.

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