Block #847,051

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 1:57:36 AM · Difficulty 10.9720 · 5,970,360 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2c7a074747943167cf072e7e274e11a80cf3ce3707fd3b87b8341cfe2c9ea76c

Height

#847,051

Difficulty

10.971968

Transactions

17

Size

3.73 KB

Version

2

Bits

0af8d2e9

Nonce

420,391,704

Timestamp

12/10/2014, 1:57:36 AM

Confirmations

5,970,360

Merkle Root

407fc6a4100bdba7a7254820358e22363e4d9732b36688fbbc58ea4e7ff781a4
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.021 × 10⁹⁸(99-digit number)
10210823232337884745…69560468125510695279
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.021 × 10⁹⁸(99-digit number)
10210823232337884745…69560468125510695279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.042 × 10⁹⁸(99-digit number)
20421646464675769491…39120936251021390559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.084 × 10⁹⁸(99-digit number)
40843292929351538983…78241872502042781119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.168 × 10⁹⁸(99-digit number)
81686585858703077967…56483745004085562239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.633 × 10⁹⁹(100-digit number)
16337317171740615593…12967490008171124479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.267 × 10⁹⁹(100-digit number)
32674634343481231187…25934980016342248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.534 × 10⁹⁹(100-digit number)
65349268686962462374…51869960032684497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.306 × 10¹⁰⁰(101-digit number)
13069853737392492474…03739920065368995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.613 × 10¹⁰⁰(101-digit number)
26139707474784984949…07479840130737991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.227 × 10¹⁰⁰(101-digit number)
52279414949569969899…14959680261475983359
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,783,331 XPM·at block #6,817,410 · 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