Block #393,103

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 9:39:51 PM · Difficulty 10.4439 · 6,423,818 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ceb55aca98e9ae13c8f60748a4686197755f809fd0e65cca08ff39539b5df45e

Height

#393,103

Difficulty

10.443943

Transactions

8

Size

2.16 KB

Version

2

Bits

0a71a63e

Nonce

439,307

Timestamp

2/6/2014, 9:39:51 PM

Confirmations

6,423,818

Merkle Root

43550ab585dce20353168bf7bbc0c9c5fd2104e0427d6fec649586a4505e0d2a
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.194 × 10¹⁰⁰(101-digit number)
11944072660647354504…70155114453043616001
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.194 × 10¹⁰⁰(101-digit number)
11944072660647354504…70155114453043616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.388 × 10¹⁰⁰(101-digit number)
23888145321294709008…40310228906087232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.777 × 10¹⁰⁰(101-digit number)
47776290642589418016…80620457812174464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.555 × 10¹⁰⁰(101-digit number)
95552581285178836032…61240915624348928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.911 × 10¹⁰¹(102-digit number)
19110516257035767206…22481831248697856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.822 × 10¹⁰¹(102-digit number)
38221032514071534412…44963662497395712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.644 × 10¹⁰¹(102-digit number)
76442065028143068825…89927324994791424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.528 × 10¹⁰²(103-digit number)
15288413005628613765…79854649989582848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.057 × 10¹⁰²(103-digit number)
30576826011257227530…59709299979165696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.115 × 10¹⁰²(103-digit number)
61153652022514455060…19418599958331392001
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,779,408 XPM·at block #6,816,920 · 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