Block #370,155

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/21/2014, 9:33:53 PM · Difficulty 10.4477 · 6,443,814 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
08922e878dca7fb0db7ef4d2e3e25e4aab03fd6a950a15a6df20bfb5d30a64fb

Height

#370,155

Difficulty

10.447749

Transactions

5

Size

2.96 KB

Version

2

Bits

0a729fb4

Nonce

293,731

Timestamp

1/21/2014, 9:33:53 PM

Confirmations

6,443,814

Merkle Root

68eb8a38c4595f40f2acc5f4795a6ca9770ae06c247a9b4c8882f94159701894
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.

6.354 × 10⁹⁸(99-digit number)
63548614963416618101…45253030232979712001
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
6.354 × 10⁹⁸(99-digit number)
63548614963416618101…45253030232979712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.270 × 10⁹⁹(100-digit number)
12709722992683323620…90506060465959424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.541 × 10⁹⁹(100-digit number)
25419445985366647240…81012120931918848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.083 × 10⁹⁹(100-digit number)
50838891970733294481…62024241863837696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.016 × 10¹⁰⁰(101-digit number)
10167778394146658896…24048483727675392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.033 × 10¹⁰⁰(101-digit number)
20335556788293317792…48096967455350784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.067 × 10¹⁰⁰(101-digit number)
40671113576586635585…96193934910701568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.134 × 10¹⁰⁰(101-digit number)
81342227153173271170…92387869821403136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.626 × 10¹⁰¹(102-digit number)
16268445430634654234…84775739642806272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.253 × 10¹⁰¹(102-digit number)
32536890861269308468…69551479285612544001
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,755,828 XPM·at block #6,813,968 · 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