Block #439,177

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 12:22:05 PM · Difficulty 10.3598 · 6,378,753 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4e38c73fb9b737a8b8ef3eaa8c8ce5ff0360ff5aac7203c409b2af6a9e8f3142

Height

#439,177

Difficulty

10.359800

Transactions

9

Size

21.77 KB

Version

2

Bits

0a5c1bda

Nonce

357,113

Timestamp

3/11/2014, 12:22:05 PM

Confirmations

6,378,753

Merkle Root

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

3.350 × 10⁹⁵(96-digit number)
33500070931874828390…73330708891505974721
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
3.350 × 10⁹⁵(96-digit number)
33500070931874828390…73330708891505974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.700 × 10⁹⁵(96-digit number)
67000141863749656780…46661417783011949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.340 × 10⁹⁶(97-digit number)
13400028372749931356…93322835566023898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.680 × 10⁹⁶(97-digit number)
26800056745499862712…86645671132047797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.360 × 10⁹⁶(97-digit number)
53600113490999725424…73291342264095595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.072 × 10⁹⁷(98-digit number)
10720022698199945084…46582684528191191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.144 × 10⁹⁷(98-digit number)
21440045396399890169…93165369056382382081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.288 × 10⁹⁷(98-digit number)
42880090792799780339…86330738112764764161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.576 × 10⁹⁷(98-digit number)
85760181585599560679…72661476225529528321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.715 × 10⁹⁸(99-digit number)
17152036317119912135…45322952451059056641
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,787,507 XPM·at block #6,817,929 · 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