Block #856,180

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 9:32:34 PM · Difficulty 10.9682 · 5,987,359 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
caefade98352de22ac5a1c6f4f935a934a896bda67960eba99f298d2293b2db7

Height

#856,180

Difficulty

10.968172

Transactions

3

Size

659 B

Version

2

Bits

0af7da1d

Nonce

312,398,170

Timestamp

12/16/2014, 9:32:34 PM

Confirmations

5,987,359

Merkle Root

da23607ad08f6b5324b12de89097e86824d92f5f54004234c547f9b657d4a51e
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.225 × 10⁹⁶(97-digit number)
22259329157982593524…38316340301007978719
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.225 × 10⁹⁶(97-digit number)
22259329157982593524…38316340301007978719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.451 × 10⁹⁶(97-digit number)
44518658315965187048…76632680602015957439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.903 × 10⁹⁶(97-digit number)
89037316631930374096…53265361204031914879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.780 × 10⁹⁷(98-digit number)
17807463326386074819…06530722408063829759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.561 × 10⁹⁷(98-digit number)
35614926652772149638…13061444816127659519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.122 × 10⁹⁷(98-digit number)
71229853305544299277…26122889632255319039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.424 × 10⁹⁸(99-digit number)
14245970661108859855…52245779264510638079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.849 × 10⁹⁸(99-digit number)
28491941322217719710…04491558529021276159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.698 × 10⁹⁸(99-digit number)
56983882644435439421…08983117058042552319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.139 × 10⁹⁹(100-digit number)
11396776528887087884…17966234116085104639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.279 × 10⁹⁹(100-digit number)
22793553057774175768…35932468232170209279
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,992,687 XPM·at block #6,843,538 · 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