Block #382,101

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/30/2014, 11:33:19 AM · Difficulty 10.4037 · 6,460,433 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a6387358f056d71fca55f93df458e04cd064ab0a497ac8764793148f86014722

Height

#382,101

Difficulty

10.403670

Transactions

8

Size

2.32 KB

Version

2

Bits

0a6756ec

Nonce

188,269

Timestamp

1/30/2014, 11:33:19 AM

Confirmations

6,460,433

Merkle Root

49fdf28a26ddeabed9dd858d6637e246ba31b20c013a73bb17bc4d1d2e0875f3
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.142 × 10⁹⁶(97-digit number)
21427110843018419124…49032497498331656001
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.142 × 10⁹⁶(97-digit number)
21427110843018419124…49032497498331656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.285 × 10⁹⁶(97-digit number)
42854221686036838248…98064994996663312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.570 × 10⁹⁶(97-digit number)
85708443372073676496…96129989993326624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.714 × 10⁹⁷(98-digit number)
17141688674414735299…92259979986653248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.428 × 10⁹⁷(98-digit number)
34283377348829470598…84519959973306496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.856 × 10⁹⁷(98-digit number)
68566754697658941197…69039919946612992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.371 × 10⁹⁸(99-digit number)
13713350939531788239…38079839893225984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.742 × 10⁹⁸(99-digit number)
27426701879063576478…76159679786451968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.485 × 10⁹⁸(99-digit number)
54853403758127152957…52319359572903936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.097 × 10⁹⁹(100-digit number)
10970680751625430591…04638719145807872001
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,984,694 XPM·at block #6,842,533 · 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