Block #850,543

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 2:20:51 PM · Difficulty 10.9714 · 5,980,922 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0ed34fb92683ece8707c95401b7ab9c7e08251972f79ffd3c26aa0cd764e6757

Height

#850,543

Difficulty

10.971352

Transactions

15

Size

3.69 KB

Version

2

Bits

0af8aa8a

Nonce

2,789,393,106

Timestamp

12/12/2014, 2:20:51 PM

Confirmations

5,980,922

Merkle Root

7e2dc3e94103390d34047e5c13f8fc4493710d14aa9acdcd486652865a4f7b4e
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.026 × 10⁹⁷(98-digit number)
10265415514851495802…12925533654778408959
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.026 × 10⁹⁷(98-digit number)
10265415514851495802…12925533654778408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.053 × 10⁹⁷(98-digit number)
20530831029702991604…25851067309556817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.106 × 10⁹⁷(98-digit number)
41061662059405983209…51702134619113635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.212 × 10⁹⁷(98-digit number)
82123324118811966418…03404269238227271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.642 × 10⁹⁸(99-digit number)
16424664823762393283…06808538476454543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.284 × 10⁹⁸(99-digit number)
32849329647524786567…13617076952909086719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.569 × 10⁹⁸(99-digit number)
65698659295049573135…27234153905818173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.313 × 10⁹⁹(100-digit number)
13139731859009914627…54468307811636346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.627 × 10⁹⁹(100-digit number)
26279463718019829254…08936615623272693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.255 × 10⁹⁹(100-digit number)
52558927436039658508…17873231246545387519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.051 × 10¹⁰⁰(101-digit number)
10511785487207931701…35746462493090775039
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,895,812 XPM·at block #6,831,464 · 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