Block #390,462

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 4:37:25 AM · Difficulty 10.4229 · 6,427,315 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3880f3889da7b81419941731da25af832c25155aac995b71fb08f8556040e79b

Height

#390,462

Difficulty

10.422929

Transactions

4

Size

1.66 KB

Version

2

Bits

0a6c4514

Nonce

115,727

Timestamp

2/5/2014, 4:37:25 AM

Confirmations

6,427,315

Merkle Root

5bd787061fb6b3f2f050a49fd056872ad29644d65d11a73f31dd63608a805a55
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.483 × 10⁹⁹(100-digit number)
14834347364134292776…31388936003829648001
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.483 × 10⁹⁹(100-digit number)
14834347364134292776…31388936003829648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.966 × 10⁹⁹(100-digit number)
29668694728268585552…62777872007659296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.933 × 10⁹⁹(100-digit number)
59337389456537171105…25555744015318592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.186 × 10¹⁰⁰(101-digit number)
11867477891307434221…51111488030637184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.373 × 10¹⁰⁰(101-digit number)
23734955782614868442…02222976061274368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.746 × 10¹⁰⁰(101-digit number)
47469911565229736884…04445952122548736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.493 × 10¹⁰⁰(101-digit number)
94939823130459473769…08891904245097472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.898 × 10¹⁰¹(102-digit number)
18987964626091894753…17783808490194944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.797 × 10¹⁰¹(102-digit number)
37975929252183789507…35567616980389888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.595 × 10¹⁰¹(102-digit number)
75951858504367579015…71135233960779776001
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,786,274 XPM·at block #6,817,776 · 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