Block #840,424

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2014, 3:37:43 AM · Difficulty 10.9743 · 6,001,902 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
640b26e444998a5d3204f5ebcf93b8c5fa8878b202a0b281b253b336a166c532

Height

#840,424

Difficulty

10.974284

Transactions

6

Size

1.27 KB

Version

2

Bits

0af96aad

Nonce

276,869,581

Timestamp

12/5/2014, 3:37:43 AM

Confirmations

6,001,902

Merkle Root

631c9aa4db5b93d4c17529ef6409f97634a14b90ed87af9519343bfcfafc9015
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.766 × 10⁹⁷(98-digit number)
17666815481197388277…33701308432993103359
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.766 × 10⁹⁷(98-digit number)
17666815481197388277…33701308432993103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.533 × 10⁹⁷(98-digit number)
35333630962394776554…67402616865986206719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.066 × 10⁹⁷(98-digit number)
70667261924789553109…34805233731972413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.413 × 10⁹⁸(99-digit number)
14133452384957910621…69610467463944826879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.826 × 10⁹⁸(99-digit number)
28266904769915821243…39220934927889653759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.653 × 10⁹⁸(99-digit number)
56533809539831642487…78441869855779307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.130 × 10⁹⁹(100-digit number)
11306761907966328497…56883739711558615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.261 × 10⁹⁹(100-digit number)
22613523815932656995…13767479423117230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.522 × 10⁹⁹(100-digit number)
45227047631865313990…27534958846234460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.045 × 10⁹⁹(100-digit number)
90454095263730627980…55069917692468920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.809 × 10¹⁰⁰(101-digit number)
18090819052746125596…10139835384937840639
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,983,015 XPM·at block #6,842,325 · 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