Block #840,635

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2014, 7:20:36 AM · Difficulty 10.9742 · 5,990,993 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f94a34ca6b3dd1dba6f27e40320fcc0223268590a2d45525293649b3123d4181

Height

#840,635

Difficulty

10.974223

Transactions

11

Size

2.52 KB

Version

2

Bits

0af966b3

Nonce

902,124,800

Timestamp

12/5/2014, 7:20:36 AM

Confirmations

5,990,993

Merkle Root

3a2eabe1a8c988be594a67fb6bf1188322fe1733eb2baccdf8468b94c7f5b88a
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.306 × 10⁹⁷(98-digit number)
13060598622357845538…68970110792604364159
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.306 × 10⁹⁷(98-digit number)
13060598622357845538…68970110792604364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.612 × 10⁹⁷(98-digit number)
26121197244715691076…37940221585208728319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.224 × 10⁹⁷(98-digit number)
52242394489431382152…75880443170417456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.044 × 10⁹⁸(99-digit number)
10448478897886276430…51760886340834913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.089 × 10⁹⁸(99-digit number)
20896957795772552861…03521772681669826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.179 × 10⁹⁸(99-digit number)
41793915591545105722…07043545363339653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.358 × 10⁹⁸(99-digit number)
83587831183090211444…14087090726679306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.671 × 10⁹⁹(100-digit number)
16717566236618042288…28174181453358612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.343 × 10⁹⁹(100-digit number)
33435132473236084577…56348362906717224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.687 × 10⁹⁹(100-digit number)
66870264946472169155…12696725813434449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.337 × 10¹⁰⁰(101-digit number)
13374052989294433831…25393451626868899839
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,897,126 XPM·at block #6,831,627 · 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