Block #393,922

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/7/2014, 12:18:27 PM · Difficulty 10.4372 · 6,422,624 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb3241b011eae9532054101586714c62066a6dfe50b221d2a926a816e3c29f11

Height

#393,922

Difficulty

10.437174

Transactions

7

Size

3.95 KB

Version

2

Bits

0a6fea9d

Nonce

89,924

Timestamp

2/7/2014, 12:18:27 PM

Confirmations

6,422,624

Merkle Root

eb60aa56ea862f11444c066d5572c76a122e0d6a6922f49f1a1cf1c85c455f5d
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.184 × 10¹⁰²(103-digit number)
21841897965758793409…12195665182263782401
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.184 × 10¹⁰²(103-digit number)
21841897965758793409…12195665182263782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.368 × 10¹⁰²(103-digit number)
43683795931517586818…24391330364527564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.736 × 10¹⁰²(103-digit number)
87367591863035173636…48782660729055129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.747 × 10¹⁰³(104-digit number)
17473518372607034727…97565321458110259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.494 × 10¹⁰³(104-digit number)
34947036745214069454…95130642916220518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.989 × 10¹⁰³(104-digit number)
69894073490428138909…90261285832441036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.397 × 10¹⁰⁴(105-digit number)
13978814698085627781…80522571664882073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.795 × 10¹⁰⁴(105-digit number)
27957629396171255563…61045143329764147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.591 × 10¹⁰⁴(105-digit number)
55915258792342511127…22090286659528294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.118 × 10¹⁰⁵(106-digit number)
11183051758468502225…44180573319056588801
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,776,497 XPM·at block #6,816,545 · 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