Block #357,122

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 5:00:38 AM · Difficulty 10.3832 · 6,452,817 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
44656b8f540d779ef50aef236b539f6e60d1ae55047977e6646396955b32580d

Height

#357,122

Difficulty

10.383224

Transactions

3

Size

811 B

Version

2

Bits

0a621afd

Nonce

17,086

Timestamp

1/13/2014, 5:00:38 AM

Confirmations

6,452,817

Merkle Root

6fdd7bf1d8a473a96fc027806521973e225d6f0e7aedb3bfd8add51de0192732
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.843 × 10¹⁰¹(102-digit number)
38438257076351468542…56960780254436392961
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.843 × 10¹⁰¹(102-digit number)
38438257076351468542…56960780254436392961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.687 × 10¹⁰¹(102-digit number)
76876514152702937085…13921560508872785921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.537 × 10¹⁰²(103-digit number)
15375302830540587417…27843121017745571841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.075 × 10¹⁰²(103-digit number)
30750605661081174834…55686242035491143681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.150 × 10¹⁰²(103-digit number)
61501211322162349668…11372484070982287361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.230 × 10¹⁰³(104-digit number)
12300242264432469933…22744968141964574721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.460 × 10¹⁰³(104-digit number)
24600484528864939867…45489936283929149441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.920 × 10¹⁰³(104-digit number)
49200969057729879734…90979872567858298881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.840 × 10¹⁰³(104-digit number)
98401938115459759469…81959745135716597761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.968 × 10¹⁰⁴(105-digit number)
19680387623091951893…63919490271433195521
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,723,600 XPM·at block #6,809,938 · 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