Block #358,729

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2014, 7:41:01 AM · Difficulty 10.3843 · 6,455,793 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c0e619b25e93fa5c13243e9683cb0bd8d444e001072a9fad2f76bfb9a2e102c1

Height

#358,729

Difficulty

10.384314

Transactions

8

Size

3.99 KB

Version

2

Bits

0a626262

Nonce

25,254

Timestamp

1/14/2014, 7:41:01 AM

Confirmations

6,455,793

Merkle Root

0fba3a058b49ed7af30e5ebbba6c944290671ee6a54827f1cc7a1e29d3662c10
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.

7.903 × 10¹⁰⁶(107-digit number)
79036580206834283464…55854248755358702081
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
7.903 × 10¹⁰⁶(107-digit number)
79036580206834283464…55854248755358702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.580 × 10¹⁰⁷(108-digit number)
15807316041366856692…11708497510717404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.161 × 10¹⁰⁷(108-digit number)
31614632082733713385…23416995021434808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.322 × 10¹⁰⁷(108-digit number)
63229264165467426771…46833990042869616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.264 × 10¹⁰⁸(109-digit number)
12645852833093485354…93667980085739233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.529 × 10¹⁰⁸(109-digit number)
25291705666186970708…87335960171478466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.058 × 10¹⁰⁸(109-digit number)
50583411332373941417…74671920342956933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.011 × 10¹⁰⁹(110-digit number)
10116682266474788283…49343840685913866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.023 × 10¹⁰⁹(110-digit number)
20233364532949576566…98687681371827732481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.046 × 10¹⁰⁹(110-digit number)
40466729065899153133…97375362743655464961
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,760,244 XPM·at block #6,814,521 · 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