Block #364,900

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 9:19:30 AM · Difficulty 10.4234 · 6,452,499 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
beec853f8a9ea06fc7492cd9335f56537ffc121ee468d66bc2a5b8447cb1f738

Height

#364,900

Difficulty

10.423435

Transactions

11

Size

2.41 KB

Version

2

Bits

0a6c6640

Nonce

285,607

Timestamp

1/18/2014, 9:19:30 AM

Confirmations

6,452,499

Merkle Root

b8a6cf0f0ecef48522445c5ef2a37ce7a6a611a35aa51c4ed6d9ebab1951e0cf
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.625 × 10⁹⁹(100-digit number)
26254029043807654552…48199081791871327201
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.625 × 10⁹⁹(100-digit number)
26254029043807654552…48199081791871327201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.250 × 10⁹⁹(100-digit number)
52508058087615309105…96398163583742654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.050 × 10¹⁰⁰(101-digit number)
10501611617523061821…92796327167485308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.100 × 10¹⁰⁰(101-digit number)
21003223235046123642…85592654334970617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.200 × 10¹⁰⁰(101-digit number)
42006446470092247284…71185308669941235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.401 × 10¹⁰⁰(101-digit number)
84012892940184494569…42370617339882470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.680 × 10¹⁰¹(102-digit number)
16802578588036898913…84741234679764940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.360 × 10¹⁰¹(102-digit number)
33605157176073797827…69482469359529881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.721 × 10¹⁰¹(102-digit number)
67210314352147595655…38964938719059763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.344 × 10¹⁰²(103-digit number)
13442062870429519131…77929877438119526401
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,783,235 XPM·at block #6,817,398 · 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