Block #392,083

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 6:13:43 AM · Difficulty 10.4324 · 6,415,804 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b9fae6dda1c641a733acb2d76c5680fe45c181344821e517e33e951a50f8ac05

Height

#392,083

Difficulty

10.432374

Transactions

10

Size

6.01 KB

Version

2

Bits

0a6eb016

Nonce

451,344

Timestamp

2/6/2014, 6:13:43 AM

Confirmations

6,415,804

Merkle Root

c792fa38136d07581e27d206587c597792889cfc24ddd81b62c0feeff33c86fd
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.034 × 10⁹⁸(99-digit number)
10342558173362943140…51041157466581868001
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.034 × 10⁹⁸(99-digit number)
10342558173362943140…51041157466581868001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.068 × 10⁹⁸(99-digit number)
20685116346725886281…02082314933163736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.137 × 10⁹⁸(99-digit number)
41370232693451772562…04164629866327472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.274 × 10⁹⁸(99-digit number)
82740465386903545124…08329259732654944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.654 × 10⁹⁹(100-digit number)
16548093077380709024…16658519465309888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.309 × 10⁹⁹(100-digit number)
33096186154761418049…33317038930619776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.619 × 10⁹⁹(100-digit number)
66192372309522836099…66634077861239552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.323 × 10¹⁰⁰(101-digit number)
13238474461904567219…33268155722479104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.647 × 10¹⁰⁰(101-digit number)
26476948923809134439…66536311444958208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.295 × 10¹⁰⁰(101-digit number)
52953897847618268879…33072622889916416001
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,707,131 XPM·at block #6,807,886 · 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