Block #843,908

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 6:18:32 PM · Difficulty 10.9729 · 5,967,196 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f031be3979303131ad3cb6380cd4700da34665393f89b6fb881bea407a934ab8

Height

#843,908

Difficulty

10.972945

Transactions

9

Size

2.15 KB

Version

2

Bits

0af912ee

Nonce

1,654,163,747

Timestamp

12/7/2014, 6:18:32 PM

Confirmations

5,967,196

Merkle Root

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

2.840 × 10⁹⁷(98-digit number)
28405313815768876358…89043399800757288961
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
2.840 × 10⁹⁷(98-digit number)
28405313815768876358…89043399800757288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.681 × 10⁹⁷(98-digit number)
56810627631537752716…78086799601514577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.136 × 10⁹⁸(99-digit number)
11362125526307550543…56173599203029155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.272 × 10⁹⁸(99-digit number)
22724251052615101086…12347198406058311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.544 × 10⁹⁸(99-digit number)
45448502105230202173…24694396812116623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.089 × 10⁹⁸(99-digit number)
90897004210460404346…49388793624233246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.817 × 10⁹⁹(100-digit number)
18179400842092080869…98777587248466493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.635 × 10⁹⁹(100-digit number)
36358801684184161738…97555174496932986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.271 × 10⁹⁹(100-digit number)
72717603368368323477…95110348993865973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.454 × 10¹⁰⁰(101-digit number)
14543520673673664695…90220697987731947521
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,732,939 XPM·at block #6,811,103 · 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.

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