Block #845,415

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/8/2014, 8:46:17 PM · Difficulty 10.9726 · 5,996,662 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8fb4ddbb7305a89756f914a2af0e00b414ab987bc680cbd33d3c6ecb61851533

Height

#845,415

Difficulty

10.972556

Transactions

8

Size

1.88 KB

Version

2

Bits

0af8f966

Nonce

343,911,884

Timestamp

12/8/2014, 8:46:17 PM

Confirmations

5,996,662

Merkle Root

279b2ed5a42317a25b1b5ac00b6a61de619b2d3abf796e2fa65894072d9edfee
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.639 × 10⁹⁶(97-digit number)
16395754385231704261…85138814555459846399
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.639 × 10⁹⁶(97-digit number)
16395754385231704261…85138814555459846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.279 × 10⁹⁶(97-digit number)
32791508770463408522…70277629110919692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.558 × 10⁹⁶(97-digit number)
65583017540926817044…40555258221839385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13116603508185363408…81110516443678771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.623 × 10⁹⁷(98-digit number)
26233207016370726817…62221032887357542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.246 × 10⁹⁷(98-digit number)
52466414032741453635…24442065774715084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.049 × 10⁹⁸(99-digit number)
10493282806548290727…48884131549430169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.098 × 10⁹⁸(99-digit number)
20986565613096581454…97768263098860339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.197 × 10⁹⁸(99-digit number)
41973131226193162908…95536526197720678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.394 × 10⁹⁸(99-digit number)
83946262452386325816…91073052395441356799
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,981,001 XPM·at block #6,842,076 · 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