Block #338,398

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 10:13:36 AM · Difficulty 10.1186 · 6,470,716 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a4b758d2baef365b33bf66cb88174eb0d262356132f3f022f174d55ddfc2689

Height

#338,398

Difficulty

10.118630

Transactions

5

Size

1.37 KB

Version

2

Bits

0a1e5e88

Nonce

34,163

Timestamp

1/1/2014, 10:13:36 AM

Confirmations

6,470,716

Merkle Root

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

1.337 × 10⁸⁹(90-digit number)
13370751907740448951…05581315136089661441
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
1.337 × 10⁸⁹(90-digit number)
13370751907740448951…05581315136089661441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.674 × 10⁸⁹(90-digit number)
26741503815480897902…11162630272179322881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.348 × 10⁸⁹(90-digit number)
53483007630961795805…22325260544358645761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.069 × 10⁹⁰(91-digit number)
10696601526192359161…44650521088717291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.139 × 10⁹⁰(91-digit number)
21393203052384718322…89301042177434583041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.278 × 10⁹⁰(91-digit number)
42786406104769436644…78602084354869166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.557 × 10⁹⁰(91-digit number)
85572812209538873288…57204168709738332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.711 × 10⁹¹(92-digit number)
17114562441907774657…14408337419476664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.422 × 10⁹¹(92-digit number)
34229124883815549315…28816674838953328641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.845 × 10⁹¹(92-digit number)
68458249767631098631…57633349677906657281
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,716,969 XPM·at block #6,809,113 · 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