Block #357,650

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 1:27:59 PM · Difficulty 10.3859 · 6,457,299 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e517f3f0a31c0504c0741d1f3e3c9202dfabe83141a8f634c1e795ea7c0b099b

Height

#357,650

Difficulty

10.385893

Transactions

13

Size

3.88 KB

Version

2

Bits

0a62c9e9

Nonce

426,814

Timestamp

1/13/2014, 1:27:59 PM

Confirmations

6,457,299

Merkle Root

5434d0bb683c10a04cc11358b2c49f23f62a3d7b814f175894ae8624163bfbd4
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.283 × 10¹⁰²(103-digit number)
22838470907667915128…08472045280312657921
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.283 × 10¹⁰²(103-digit number)
22838470907667915128…08472045280312657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.567 × 10¹⁰²(103-digit number)
45676941815335830256…16944090560625315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.135 × 10¹⁰²(103-digit number)
91353883630671660512…33888181121250631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.827 × 10¹⁰³(104-digit number)
18270776726134332102…67776362242501263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.654 × 10¹⁰³(104-digit number)
36541553452268664205…35552724485002526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.308 × 10¹⁰³(104-digit number)
73083106904537328410…71105448970005053441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.461 × 10¹⁰⁴(105-digit number)
14616621380907465682…42210897940010106881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.923 × 10¹⁰⁴(105-digit number)
29233242761814931364…84421795880020213761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.846 × 10¹⁰⁴(105-digit number)
58466485523629862728…68843591760040427521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.169 × 10¹⁰⁵(106-digit number)
11693297104725972545…37687183520080855041
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,763,689 XPM·at block #6,814,948 · 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