Block #840,623

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2014, 7:04:04 AM · Difficulty 10.9742 · 5,990,889 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b7457b5f668312081af3adf7c6293d48da45955ca8d90cf15ea936621239a717

Height

#840,623

Difficulty

10.974248

Transactions

3

Size

650 B

Version

2

Bits

0af96857

Nonce

316,657,728

Timestamp

12/5/2014, 7:04:04 AM

Confirmations

5,990,889

Merkle Root

46070bec85e011b7a7bdcd0126da7c3881ad02783fb2e2d4f3e67c4c27ec022d
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.701 × 10⁹⁵(96-digit number)
27017658282321941882…41728027876290226081
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.701 × 10⁹⁵(96-digit number)
27017658282321941882…41728027876290226081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.403 × 10⁹⁵(96-digit number)
54035316564643883764…83456055752580452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.080 × 10⁹⁶(97-digit number)
10807063312928776752…66912111505160904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.161 × 10⁹⁶(97-digit number)
21614126625857553505…33824223010321808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.322 × 10⁹⁶(97-digit number)
43228253251715107011…67648446020643617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.645 × 10⁹⁶(97-digit number)
86456506503430214023…35296892041287234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.729 × 10⁹⁷(98-digit number)
17291301300686042804…70593784082574469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.458 × 10⁹⁷(98-digit number)
34582602601372085609…41187568165148938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.916 × 10⁹⁷(98-digit number)
69165205202744171218…82375136330297876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.383 × 10⁹⁸(99-digit number)
13833041040548834243…64750272660595752961
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,896,184 XPM·at block #6,831,511 · 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