Block #345,616

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 1:29:05 AM · Difficulty 10.2106 · 6,464,026 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
26e94ca522f733155d524d6b04b194ba73f108b9e074c7c7606a768c1cdacc30

Height

#345,616

Difficulty

10.210580

Transactions

1

Size

1.11 KB

Version

2

Bits

0a35e896

Nonce

24,170

Timestamp

1/6/2014, 1:29:05 AM

Confirmations

6,464,026

Merkle Root

0c76c44380fd8ce9d44a486d1bbefeee034508c7d516f35b4f176fb860611732
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.

7.944 × 10⁹⁷(98-digit number)
79440426838315401387…86697909025345044481
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
7.944 × 10⁹⁷(98-digit number)
79440426838315401387…86697909025345044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.588 × 10⁹⁸(99-digit number)
15888085367663080277…73395818050690088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.177 × 10⁹⁸(99-digit number)
31776170735326160554…46791636101380177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.355 × 10⁹⁸(99-digit number)
63552341470652321109…93583272202760355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.271 × 10⁹⁹(100-digit number)
12710468294130464221…87166544405520711681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.542 × 10⁹⁹(100-digit number)
25420936588260928443…74333088811041423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.084 × 10⁹⁹(100-digit number)
50841873176521856887…48666177622082846721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.016 × 10¹⁰⁰(101-digit number)
10168374635304371377…97332355244165693441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.033 × 10¹⁰⁰(101-digit number)
20336749270608742755…94664710488331386881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.067 × 10¹⁰⁰(101-digit number)
40673498541217485510…89329420976662773761
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,721,215 XPM·at block #6,809,641 · 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