Block #382,192

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/30/2014, 12:44:31 PM · Difficulty 10.4055 · 6,435,435 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e7190a80a6ad2b223455efeb0ee8089f3410a26faf2bd5cee2a40e6b80a6526

Height

#382,192

Difficulty

10.405476

Transactions

1

Size

900 B

Version

2

Bits

0a67cd3f

Nonce

51,461

Timestamp

1/30/2014, 12:44:31 PM

Confirmations

6,435,435

Merkle Root

3ecf2b4054ba51e528c814872c426f1d5c1c193bbaa1291c8db1076a155990c3
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.

4.327 × 10⁹²(93-digit number)
43274838656164274927…58218289149014473421
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
4.327 × 10⁹²(93-digit number)
43274838656164274927…58218289149014473421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.654 × 10⁹²(93-digit number)
86549677312328549855…16436578298028946841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.730 × 10⁹³(94-digit number)
17309935462465709971…32873156596057893681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.461 × 10⁹³(94-digit number)
34619870924931419942…65746313192115787361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.923 × 10⁹³(94-digit number)
69239741849862839884…31492626384231574721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.384 × 10⁹⁴(95-digit number)
13847948369972567976…62985252768463149441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.769 × 10⁹⁴(95-digit number)
27695896739945135953…25970505536926298881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.539 × 10⁹⁴(95-digit number)
55391793479890271907…51941011073852597761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.107 × 10⁹⁵(96-digit number)
11078358695978054381…03882022147705195521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.215 × 10⁹⁵(96-digit number)
22156717391956108763…07764044295410391041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.431 × 10⁹⁵(96-digit number)
44313434783912217526…15528088590820782081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,785,067 XPM·at block #6,817,626 · 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