Block #364,652

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 5:28:36 AM · Difficulty 10.4213 · 6,443,975 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7d62dbd0a06705280865be8e568a4c3a4033d898b157fb466e5f02fb3cc7285a

Height

#364,652

Difficulty

10.421350

Transactions

12

Size

4.24 KB

Version

2

Bits

0a6bdd95

Nonce

49,603

Timestamp

1/18/2014, 5:28:36 AM

Confirmations

6,443,975

Merkle Root

fa20f6abdff80120384ce38e458086220a054ec653a7ee34107bd9f701aeb048
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.670 × 10¹⁰¹(102-digit number)
86705262946247643575…06552797858346222081
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.670 × 10¹⁰¹(102-digit number)
86705262946247643575…06552797858346222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.734 × 10¹⁰²(103-digit number)
17341052589249528715…13105595716692444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.468 × 10¹⁰²(103-digit number)
34682105178499057430…26211191433384888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.936 × 10¹⁰²(103-digit number)
69364210356998114860…52422382866769776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.387 × 10¹⁰³(104-digit number)
13872842071399622972…04844765733539553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.774 × 10¹⁰³(104-digit number)
27745684142799245944…09689531467079106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.549 × 10¹⁰³(104-digit number)
55491368285598491888…19379062934158213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.109 × 10¹⁰⁴(105-digit number)
11098273657119698377…38758125868316426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.219 × 10¹⁰⁴(105-digit number)
22196547314239396755…77516251736632852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.439 × 10¹⁰⁴(105-digit number)
44393094628478793510…55032503473265704961
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,713,066 XPM·at block #6,808,626 · 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