Block #845,600

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 12:11:31 AM · Difficulty 10.9724 · 5,987,621 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
78b920e0e17298805c72ce7c0a6a027f65300666ff63d3dfec557d2975b7ca95

Height

#845,600

Difficulty

10.972437

Transactions

12

Size

3.69 KB

Version

2

Bits

0af8f19e

Nonce

771,375,235

Timestamp

12/9/2014, 12:11:31 AM

Confirmations

5,987,621

Merkle Root

0d5ef7e48ac04a1013d3cdaf31f8cf71f0ecd8b0551f6f1c8c9f917a19efaf07
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.

7.208 × 10⁹⁴(95-digit number)
72086189795160131799…59415035223628483589
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
7.208 × 10⁹⁴(95-digit number)
72086189795160131799…59415035223628483589
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.441 × 10⁹⁵(96-digit number)
14417237959032026359…18830070447256967179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.883 × 10⁹⁵(96-digit number)
28834475918064052719…37660140894513934359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.766 × 10⁹⁵(96-digit number)
57668951836128105439…75320281789027868719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.153 × 10⁹⁶(97-digit number)
11533790367225621087…50640563578055737439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.306 × 10⁹⁶(97-digit number)
23067580734451242175…01281127156111474879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.613 × 10⁹⁶(97-digit number)
46135161468902484351…02562254312222949759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.227 × 10⁹⁶(97-digit number)
92270322937804968703…05124508624445899519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.845 × 10⁹⁷(98-digit number)
18454064587560993740…10249017248891799039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.690 × 10⁹⁷(98-digit number)
36908129175121987481…20498034497783598079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.381 × 10⁹⁷(98-digit number)
73816258350243974962…40996068995567196159
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,909,955 XPM·at block #6,833,220 · 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