Block #855,620

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 11:49:40 AM · Difficulty 10.9683 · 5,985,730 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ff1cf5c54602d8356ae4990c377e1d93fba0f6dcca2bf29cc4489eb207d8d51a

Height

#855,620

Difficulty

10.968303

Transactions

6

Size

1.43 KB

Version

2

Bits

0af7e2b5

Nonce

284,002,312

Timestamp

12/16/2014, 11:49:40 AM

Confirmations

5,985,730

Merkle Root

1b0c6ca38065db7774d740fd19c8fc7a610a7776ffb2d774d74ce9533250a456
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.751 × 10⁹⁶(97-digit number)
17516987462947938100…76115509733227404799
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.751 × 10⁹⁶(97-digit number)
17516987462947938100…76115509733227404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.503 × 10⁹⁶(97-digit number)
35033974925895876200…52231019466454809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.006 × 10⁹⁶(97-digit number)
70067949851791752401…04462038932909619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.401 × 10⁹⁷(98-digit number)
14013589970358350480…08924077865819238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.802 × 10⁹⁷(98-digit number)
28027179940716700960…17848155731638476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.605 × 10⁹⁷(98-digit number)
56054359881433401921…35696311463276953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.121 × 10⁹⁸(99-digit number)
11210871976286680384…71392622926553907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.242 × 10⁹⁸(99-digit number)
22421743952573360768…42785245853107814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.484 × 10⁹⁸(99-digit number)
44843487905146721536…85570491706215628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.968 × 10⁹⁸(99-digit number)
89686975810293443073…71140983412431257599
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,975,167 XPM·at block #6,841,349 · 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