Block #851,095

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2014, 1:13:17 AM · Difficulty 10.9708 · 5,990,392 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ad120f8d98977d5540d7eed34c927f66836546639cd8f30ed944c007b795018a

Height

#851,095

Difficulty

10.970766

Transactions

13

Size

3.08 KB

Version

2

Bits

0af88424

Nonce

515,741,941

Timestamp

12/13/2014, 1:13:17 AM

Confirmations

5,990,392

Merkle Root

2db570bde7b1912da3cd7ac03a385f8c55ff283555d3b3663693e1e3f16fa0b1
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.225 × 10⁹⁴(95-digit number)
12254306274970629859…08582429975296044999
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.225 × 10⁹⁴(95-digit number)
12254306274970629859…08582429975296044999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.450 × 10⁹⁴(95-digit number)
24508612549941259718…17164859950592089999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.901 × 10⁹⁴(95-digit number)
49017225099882519436…34329719901184179999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.803 × 10⁹⁴(95-digit number)
98034450199765038872…68659439802368359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.960 × 10⁹⁵(96-digit number)
19606890039953007774…37318879604736719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.921 × 10⁹⁵(96-digit number)
39213780079906015548…74637759209473439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.842 × 10⁹⁵(96-digit number)
78427560159812031097…49275518418946879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.568 × 10⁹⁶(97-digit number)
15685512031962406219…98551036837893759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.137 × 10⁹⁶(97-digit number)
31371024063924812439…97102073675787519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.274 × 10⁹⁶(97-digit number)
62742048127849624878…94204147351575039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.254 × 10⁹⁷(98-digit number)
12548409625569924975…88408294703150079999
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,976,272 XPM·at block #6,841,486 · 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