Block #352,751

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 1:10:32 PM · Difficulty 10.3115 · 6,461,289 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
06bd465eaca22a928d2465c9ba7804aac94757faa0c7b1407765d0cfa72fa516

Height

#352,751

Difficulty

10.311492

Transactions

4

Size

1.61 KB

Version

2

Bits

0a4fbdeb

Nonce

1,104,015

Timestamp

1/10/2014, 1:10:32 PM

Confirmations

6,461,289

Merkle Root

2cf781ea712808532a72da3d70478dd371dd779492a476e6138a5da8809f3e96
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.782 × 10¹⁰⁰(101-digit number)
17820137977252492935…34592841115821731601
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.782 × 10¹⁰⁰(101-digit number)
17820137977252492935…34592841115821731601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.564 × 10¹⁰⁰(101-digit number)
35640275954504985870…69185682231643463201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.128 × 10¹⁰⁰(101-digit number)
71280551909009971740…38371364463286926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.425 × 10¹⁰¹(102-digit number)
14256110381801994348…76742728926573852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.851 × 10¹⁰¹(102-digit number)
28512220763603988696…53485457853147705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.702 × 10¹⁰¹(102-digit number)
57024441527207977392…06970915706295411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.140 × 10¹⁰²(103-digit number)
11404888305441595478…13941831412590822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.280 × 10¹⁰²(103-digit number)
22809776610883190956…27883662825181644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.561 × 10¹⁰²(103-digit number)
45619553221766381913…55767325650363289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.123 × 10¹⁰²(103-digit number)
91239106443532763827…11534651300726579201
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,756,395 XPM·at block #6,814,039 · 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