Block #406,616

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 9:16:45 AM · Difficulty 10.4331 · 6,425,913 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bdfb2bfa07ea4558e01017776dc6c0745fddb69b85e4cdc9c4c238adba785a2f

Height

#406,616

Difficulty

10.433087

Transactions

3

Size

1.23 KB

Version

2

Bits

0a6edecb

Nonce

147,072

Timestamp

2/16/2014, 9:16:45 AM

Confirmations

6,425,913

Merkle Root

f1f8be776ade3b43f75098f91e82a2222e58a86a10572f006835b91f20fd57fe
Transactions (3)
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.866 × 10⁹⁶(97-digit number)
78661248886576975100…43334598934963285401
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.866 × 10⁹⁶(97-digit number)
78661248886576975100…43334598934963285401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.573 × 10⁹⁷(98-digit number)
15732249777315395020…86669197869926570801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.146 × 10⁹⁷(98-digit number)
31464499554630790040…73338395739853141601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.292 × 10⁹⁷(98-digit number)
62928999109261580080…46676791479706283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.258 × 10⁹⁸(99-digit number)
12585799821852316016…93353582959412566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.517 × 10⁹⁸(99-digit number)
25171599643704632032…86707165918825132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.034 × 10⁹⁸(99-digit number)
50343199287409264064…73414331837650265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.006 × 10⁹⁹(100-digit number)
10068639857481852812…46828663675300531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.013 × 10⁹⁹(100-digit number)
20137279714963705625…93657327350601062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.027 × 10⁹⁹(100-digit number)
40274559429927411251…87314654701202124801
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,904,392 XPM·at block #6,832,528 · 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