Block #844,283

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/8/2014, 12:37:48 AM · Difficulty 10.9729 · 5,997,743 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3f9be94c923cd1feedb6e4b15b1dcaec9bbf8e0fec35d921cb34e531a6d62ee5

Height

#844,283

Difficulty

10.972930

Transactions

8

Size

2.33 KB

Version

2

Bits

0af911f0

Nonce

817,531,380

Timestamp

12/8/2014, 12:37:48 AM

Confirmations

5,997,743

Merkle Root

a87c963cc070f1a2adf30b2ebcb3cf01dd87f0df42181258c3e0cd5625315801
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.

3.235 × 10⁹⁷(98-digit number)
32359373862857093045…77003251647262878719
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
3.235 × 10⁹⁷(98-digit number)
32359373862857093045…77003251647262878719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.471 × 10⁹⁷(98-digit number)
64718747725714186091…54006503294525757439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.294 × 10⁹⁸(99-digit number)
12943749545142837218…08013006589051514879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.588 × 10⁹⁸(99-digit number)
25887499090285674436…16026013178103029759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.177 × 10⁹⁸(99-digit number)
51774998180571348873…32052026356206059519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.035 × 10⁹⁹(100-digit number)
10354999636114269774…64104052712412119039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.070 × 10⁹⁹(100-digit number)
20709999272228539549…28208105424824238079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.141 × 10⁹⁹(100-digit number)
41419998544457079098…56416210849648476159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.283 × 10⁹⁹(100-digit number)
82839997088914158196…12832421699296952319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.656 × 10¹⁰⁰(101-digit number)
16567999417782831639…25664843398593904639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.313 × 10¹⁰⁰(101-digit number)
33135998835565663278…51329686797187809279
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,980,594 XPM·at block #6,842,025 · 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