Block #842,390

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2014, 2:47:18 PM · Difficulty 10.9736 · 5,997,929 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2669dcdd6c72442eb2e959c51fdb278abef6feb9f6772bb7fb641d7fab3dc524

Height

#842,390

Difficulty

10.973598

Transactions

9

Size

2.40 KB

Version

2

Bits

0af93db4

Nonce

249,600,847

Timestamp

12/6/2014, 2:47:18 PM

Confirmations

5,997,929

Merkle Root

1b6066491750890e8ddfef73e323a85cc8251476c6538d1a9e92ee0393338d5b
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.356 × 10⁹⁶(97-digit number)
43569096154831603259…34602238467352741759
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.356 × 10⁹⁶(97-digit number)
43569096154831603259…34602238467352741759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.713 × 10⁹⁶(97-digit number)
87138192309663206518…69204476934705483519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.742 × 10⁹⁷(98-digit number)
17427638461932641303…38408953869410967039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.485 × 10⁹⁷(98-digit number)
34855276923865282607…76817907738821934079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.971 × 10⁹⁷(98-digit number)
69710553847730565214…53635815477643868159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.394 × 10⁹⁸(99-digit number)
13942110769546113042…07271630955287736319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.788 × 10⁹⁸(99-digit number)
27884221539092226085…14543261910575472639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.576 × 10⁹⁸(99-digit number)
55768443078184452171…29086523821150945279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.115 × 10⁹⁹(100-digit number)
11153688615636890434…58173047642301890559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.230 × 10⁹⁹(100-digit number)
22307377231273780868…16346095284603781119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.461 × 10⁹⁹(100-digit number)
44614754462547561737…32692190569207562239
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,966,872 XPM·at block #6,840,318 · 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