Block #340,569

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 9:00:40 PM · Difficulty 10.1346 · 6,484,492 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
efced3b9ae741b3af233d6a02b8e8aafc10edb2e1d6e76666cf4cf05b3ff05de

Height

#340,569

Difficulty

10.134560

Transactions

4

Size

1.58 KB

Version

2

Bits

0a227283

Nonce

234,517

Timestamp

1/2/2014, 9:00:40 PM

Confirmations

6,484,492

Merkle Root

8571622c5af7d780f97815aaad0a63154409ff0e6290a1dd787642fd40b52b84
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.305 × 10⁹⁵(96-digit number)
33052637722267180030…02729793232829523921
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.305 × 10⁹⁵(96-digit number)
33052637722267180030…02729793232829523921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.610 × 10⁹⁵(96-digit number)
66105275444534360061…05459586465659047841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.322 × 10⁹⁶(97-digit number)
13221055088906872012…10919172931318095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.644 × 10⁹⁶(97-digit number)
26442110177813744024…21838345862636191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.288 × 10⁹⁶(97-digit number)
52884220355627488049…43676691725272382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.057 × 10⁹⁷(98-digit number)
10576844071125497609…87353383450544765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.115 × 10⁹⁷(98-digit number)
21153688142250995219…74706766901089530881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.230 × 10⁹⁷(98-digit number)
42307376284501990439…49413533802179061761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.461 × 10⁹⁷(98-digit number)
84614752569003980879…98827067604358123521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.692 × 10⁹⁸(99-digit number)
16922950513800796175…97654135208716247041
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,844,574 XPM·at block #6,825,060 · 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