Block #849,491

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 8:36:51 PM · Difficulty 10.9714 · 5,991,445 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1db5f17043927e892ce9fbbb3ebcb9597e53c6b13e5d8bc2df177df1fc819a6

Height

#849,491

Difficulty

10.971368

Transactions

12

Size

3.73 KB

Version

2

Bits

0af8ab93

Nonce

237,761,736

Timestamp

12/11/2014, 8:36:51 PM

Confirmations

5,991,445

Merkle Root

cc6238a0de9c49b5bc42cea083f0ca948eeae59e0a54435a50ee2b2bc38dcd17
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.020 × 10⁹⁷(98-digit number)
10207666887337996028…67647048074728688639
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.020 × 10⁹⁷(98-digit number)
10207666887337996028…67647048074728688639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.041 × 10⁹⁷(98-digit number)
20415333774675992057…35294096149457377279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.083 × 10⁹⁷(98-digit number)
40830667549351984115…70588192298914754559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.166 × 10⁹⁷(98-digit number)
81661335098703968230…41176384597829509119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.633 × 10⁹⁸(99-digit number)
16332267019740793646…82352769195659018239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.266 × 10⁹⁸(99-digit number)
32664534039481587292…64705538391318036479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.532 × 10⁹⁸(99-digit number)
65329068078963174584…29411076782636072959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.306 × 10⁹⁹(100-digit number)
13065813615792634916…58822153565272145919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.613 × 10⁹⁹(100-digit number)
26131627231585269833…17644307130544291839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.226 × 10⁹⁹(100-digit number)
52263254463170539667…35288614261088583679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.045 × 10¹⁰⁰(101-digit number)
10452650892634107933…70577228522177167359
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,971,842 XPM·at block #6,840,935 · 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