Block #370,254

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/21/2014, 11:53:32 PM · Difficulty 10.4437 · 6,446,553 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
94f901269dd4e2d67b6d9433b47d5dbd7f7ab4ce99faac993f5f282730df44cf

Height

#370,254

Difficulty

10.443660

Transactions

7

Size

2.39 KB

Version

2

Bits

0a7193bc

Nonce

24,178

Timestamp

1/21/2014, 11:53:32 PM

Confirmations

6,446,553

Merkle Root

c040793c0c9288d50de65b639b13a82993db46c53eceb5d919779b3d5626a3a7
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.966 × 10¹⁰²(103-digit number)
29664362855596873319…91666128284518310401
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.966 × 10¹⁰²(103-digit number)
29664362855596873319…91666128284518310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.932 × 10¹⁰²(103-digit number)
59328725711193746639…83332256569036620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.186 × 10¹⁰³(104-digit number)
11865745142238749327…66664513138073241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.373 × 10¹⁰³(104-digit number)
23731490284477498655…33329026276146483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.746 × 10¹⁰³(104-digit number)
47462980568954997311…66658052552292966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.492 × 10¹⁰³(104-digit number)
94925961137909994622…33316105104585932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.898 × 10¹⁰⁴(105-digit number)
18985192227581998924…66632210209171865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.797 × 10¹⁰⁴(105-digit number)
37970384455163997849…33264420418343731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.594 × 10¹⁰⁴(105-digit number)
75940768910327995698…66528840836687462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.518 × 10¹⁰⁵(106-digit number)
15188153782065599139…33057681673374924801
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,778,493 XPM·at block #6,816,806 · 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