Block #345,844

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 4:57:41 AM · Difficulty 10.2136 · 6,469,105 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e1d47586115838c8a135901d8399587bf2642b13f61f6cb45b9a03d5e217d1c

Height

#345,844

Difficulty

10.213645

Transactions

8

Size

105.56 KB

Version

2

Bits

0a36b16f

Nonce

15,158

Timestamp

1/6/2014, 4:57:41 AM

Confirmations

6,469,105

Merkle Root

19f3746a6b1dd26966a87b7f2501d74740aea3139b0680855639a37c316a0bfb
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.

3.977 × 10⁹⁶(97-digit number)
39778038930144066413…89582327089454639681
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
3.977 × 10⁹⁶(97-digit number)
39778038930144066413…89582327089454639681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.955 × 10⁹⁶(97-digit number)
79556077860288132826…79164654178909279361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.591 × 10⁹⁷(98-digit number)
15911215572057626565…58329308357818558721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.182 × 10⁹⁷(98-digit number)
31822431144115253130…16658616715637117441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.364 × 10⁹⁷(98-digit number)
63644862288230506261…33317233431274234881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.272 × 10⁹⁸(99-digit number)
12728972457646101252…66634466862548469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.545 × 10⁹⁸(99-digit number)
25457944915292202504…33268933725096939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.091 × 10⁹⁸(99-digit number)
50915889830584405009…66537867450193879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.018 × 10⁹⁹(100-digit number)
10183177966116881001…33075734900387758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.036 × 10⁹⁹(100-digit number)
20366355932233762003…66151469800775516161
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,763,689 XPM·at block #6,814,948 · 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