Block #854,685

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2014, 7:38:57 PM · Difficulty 10.9685 · 5,961,146 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0f5474549c966c791593422f1c989d7dda3aab4a851f95405cadc1c7dbb070b2

Height

#854,685

Difficulty

10.968499

Transactions

6

Size

1.31 KB

Version

2

Bits

0af7ef95

Nonce

2,294,450,013

Timestamp

12/15/2014, 7:38:57 PM

Confirmations

5,961,146

Merkle Root

b32bba16be9614e54d0a458b8b48d82ad4634cfcba8a914f4a1149ee04607d24
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.364 × 10⁹⁷(98-digit number)
43640571492349739861…62556981944921047039
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.364 × 10⁹⁷(98-digit number)
43640571492349739861…62556981944921047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.728 × 10⁹⁷(98-digit number)
87281142984699479722…25113963889842094079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.745 × 10⁹⁸(99-digit number)
17456228596939895944…50227927779684188159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.491 × 10⁹⁸(99-digit number)
34912457193879791888…00455855559368376319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.982 × 10⁹⁸(99-digit number)
69824914387759583777…00911711118736752639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.396 × 10⁹⁹(100-digit number)
13964982877551916755…01823422237473505279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.792 × 10⁹⁹(100-digit number)
27929965755103833511…03646844474947010559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.585 × 10⁹⁹(100-digit number)
55859931510207667022…07293688949894021119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.117 × 10¹⁰⁰(101-digit number)
11171986302041533404…14587377899788042239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.234 × 10¹⁰⁰(101-digit number)
22343972604083066808…29174755799576084479
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,770,758 XPM·at block #6,815,830 · 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