Block #363,071

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 3:58:58 AM · Difficulty 10.4144 · 6,461,695 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6efdfa36db162b4af2d35edac27dcaf2942bf93a194f0cdc0a3d688c1dca73a5

Height

#363,071

Difficulty

10.414352

Transactions

3

Size

663 B

Version

2

Bits

0a6a12fe

Nonce

42,124

Timestamp

1/17/2014, 3:58:58 AM

Confirmations

6,461,695

Merkle Root

4ebc76555b322310b27f569d6e4ddd2775019b1e0abf01b3c1b8edf494189029
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.175 × 10¹⁰⁸(109-digit number)
31752564093442295571…33891433009281303701
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.175 × 10¹⁰⁸(109-digit number)
31752564093442295571…33891433009281303701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.350 × 10¹⁰⁸(109-digit number)
63505128186884591143…67782866018562607401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.270 × 10¹⁰⁹(110-digit number)
12701025637376918228…35565732037125214801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.540 × 10¹⁰⁹(110-digit number)
25402051274753836457…71131464074250429601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.080 × 10¹⁰⁹(110-digit number)
50804102549507672914…42262928148500859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.016 × 10¹¹⁰(111-digit number)
10160820509901534582…84525856297001718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.032 × 10¹¹⁰(111-digit number)
20321641019803069165…69051712594003436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.064 × 10¹¹⁰(111-digit number)
40643282039606138331…38103425188006873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.128 × 10¹¹⁰(111-digit number)
81286564079212276663…76206850376013747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.625 × 10¹¹¹(112-digit number)
16257312815842455332…52413700752027494401
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,842,201 XPM·at block #6,824,765 · 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