Block #393,079

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 9:14:13 PM · Difficulty 10.4440 · 6,414,944 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a2e0cd10b067b02f93bea132358fae406adbf485504e3eb9006abbaeddc4bdf

Height

#393,079

Difficulty

10.443958

Transactions

7

Size

5.54 KB

Version

2

Bits

0a71a73d

Nonce

408,337

Timestamp

2/6/2014, 9:14:13 PM

Confirmations

6,414,944

Merkle Root

c48fa5434d38ac02877a82cdd1957f95c1e8b70280190ced099e0e965e1e2cb5
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.

3.681 × 10¹⁰²(103-digit number)
36818962204536930375…36491496042913914881
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
3.681 × 10¹⁰²(103-digit number)
36818962204536930375…36491496042913914881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.363 × 10¹⁰²(103-digit number)
73637924409073860751…72982992085827829761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.472 × 10¹⁰³(104-digit number)
14727584881814772150…45965984171655659521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.945 × 10¹⁰³(104-digit number)
29455169763629544300…91931968343311319041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.891 × 10¹⁰³(104-digit number)
58910339527259088601…83863936686622638081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.178 × 10¹⁰⁴(105-digit number)
11782067905451817720…67727873373245276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.356 × 10¹⁰⁴(105-digit number)
23564135810903635440…35455746746490552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.712 × 10¹⁰⁴(105-digit number)
47128271621807270880…70911493492981104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.425 × 10¹⁰⁴(105-digit number)
94256543243614541761…41822986985962209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.885 × 10¹⁰⁵(106-digit number)
18851308648722908352…83645973971924418561
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,708,227 XPM·at block #6,808,022 · 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