Block #850,143

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 7:41:23 AM · Difficulty 10.9713 · 5,991,610 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19cc83f74a81dca883048359e900980818f02b6ccc55a5dc1772cdbcacd31370

Height

#850,143

Difficulty

10.971319

Transactions

17

Size

4.23 KB

Version

2

Bits

0af8a85c

Nonce

3,157,562,791

Timestamp

12/12/2014, 7:41:23 AM

Confirmations

5,991,610

Merkle Root

533d02ba1b6a4a71e4d34bfa91f2cbea08c053ed7b92276aba5ce3653dce1134
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.

4.592 × 10⁹⁷(98-digit number)
45924972998815443634…06207774490205675519
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
4.592 × 10⁹⁷(98-digit number)
45924972998815443634…06207774490205675519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.184 × 10⁹⁷(98-digit number)
91849945997630887269…12415548980411351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.836 × 10⁹⁸(99-digit number)
18369989199526177453…24831097960822702079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.673 × 10⁹⁸(99-digit number)
36739978399052354907…49662195921645404159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.347 × 10⁹⁸(99-digit number)
73479956798104709815…99324391843290808319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.469 × 10⁹⁹(100-digit number)
14695991359620941963…98648783686581616639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.939 × 10⁹⁹(100-digit number)
29391982719241883926…97297567373163233279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.878 × 10⁹⁹(100-digit number)
58783965438483767852…94595134746326466559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.175 × 10¹⁰⁰(101-digit number)
11756793087696753570…89190269492652933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.351 × 10¹⁰⁰(101-digit number)
23513586175393507140…78380538985305866239
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,978,410 XPM·at block #6,841,752 · 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