Block #415,565

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 7:16:01 PM · Difficulty 10.4035 · 6,392,402 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1b90a519d430d4613657d8d21d8e5c6832d086233a4572ce623b11a57b272edb

Height

#415,565

Difficulty

10.403495

Transactions

6

Size

1.44 KB

Version

2

Bits

0a674b6f

Nonce

63,346

Timestamp

2/22/2014, 7:16:01 PM

Confirmations

6,392,402

Merkle Root

8d344e0715ac864999a7bfe590080c1fbda8c96e2eb0cca968233da9453b1073
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.

1.962 × 10⁹³(94-digit number)
19625848480012086212…08480106898084096281
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
1.962 × 10⁹³(94-digit number)
19625848480012086212…08480106898084096281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.925 × 10⁹³(94-digit number)
39251696960024172424…16960213796168192561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.850 × 10⁹³(94-digit number)
78503393920048344849…33920427592336385121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.570 × 10⁹⁴(95-digit number)
15700678784009668969…67840855184672770241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.140 × 10⁹⁴(95-digit number)
31401357568019337939…35681710369345540481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.280 × 10⁹⁴(95-digit number)
62802715136038675879…71363420738691080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.256 × 10⁹⁵(96-digit number)
12560543027207735175…42726841477382161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.512 × 10⁹⁵(96-digit number)
25121086054415470351…85453682954764323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.024 × 10⁹⁵(96-digit number)
50242172108830940703…70907365909528647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.004 × 10⁹⁶(97-digit number)
10048434421766188140…41814731819057295361
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,707,779 XPM·at block #6,807,966 · 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