Block #352,122

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 3:51:43 AM · Difficulty 10.3015 · 6,465,184 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a5e7388bbf4b72ac7fdd9f55260f474b03de4f178d4c1c55dba5a6287c39ad5a

Height

#352,122

Difficulty

10.301484

Transactions

11

Size

2.41 KB

Version

2

Bits

0a4d2e06

Nonce

3,188

Timestamp

1/10/2014, 3:51:43 AM

Confirmations

6,465,184

Merkle Root

f5b7071b45a6c3023e46d0c53aa12fa3fdd41e74e0656e365b914dc3b626ae21
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.

8.087 × 10⁹⁹(100-digit number)
80877025374167943708…11522657218011020801
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
8.087 × 10⁹⁹(100-digit number)
80877025374167943708…11522657218011020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.617 × 10¹⁰⁰(101-digit number)
16175405074833588741…23045314436022041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.235 × 10¹⁰⁰(101-digit number)
32350810149667177483…46090628872044083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.470 × 10¹⁰⁰(101-digit number)
64701620299334354966…92181257744088166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.294 × 10¹⁰¹(102-digit number)
12940324059866870993…84362515488176332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.588 × 10¹⁰¹(102-digit number)
25880648119733741986…68725030976352665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.176 × 10¹⁰¹(102-digit number)
51761296239467483973…37450061952705331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.035 × 10¹⁰²(103-digit number)
10352259247893496794…74900123905410662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.070 × 10¹⁰²(103-digit number)
20704518495786993589…49800247810821324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.140 × 10¹⁰²(103-digit number)
41409036991573987178…99600495621642649601
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,782,491 XPM·at block #6,817,305 · 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