Block #378,605

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/27/2014, 11:10:41 PM · Difficulty 10.4174 · 6,438,023 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7223fd669fde6d0f597207142be30f4bc57297edf441346e2581eabc3a646da9

Height

#378,605

Difficulty

10.417445

Transactions

2

Size

580 B

Version

2

Bits

0a6adda5

Nonce

4,041

Timestamp

1/27/2014, 11:10:41 PM

Confirmations

6,438,023

Merkle Root

0435b3620489c774240b66e071bec4117970474bf67d6dc3cc4430f8b11551f1
Transactions (2)
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.

2.436 × 10⁹⁶(97-digit number)
24364477292560624807…43819847570455919401
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
2.436 × 10⁹⁶(97-digit number)
24364477292560624807…43819847570455919401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.872 × 10⁹⁶(97-digit number)
48728954585121249615…87639695140911838801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.745 × 10⁹⁶(97-digit number)
97457909170242499231…75279390281823677601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.949 × 10⁹⁷(98-digit number)
19491581834048499846…50558780563647355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.898 × 10⁹⁷(98-digit number)
38983163668096999692…01117561127294710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.796 × 10⁹⁷(98-digit number)
77966327336193999385…02235122254589420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.559 × 10⁹⁸(99-digit number)
15593265467238799877…04470244509178841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.118 × 10⁹⁸(99-digit number)
31186530934477599754…08940489018357683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.237 × 10⁹⁸(99-digit number)
62373061868955199508…17880978036715366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.247 × 10⁹⁹(100-digit number)
12474612373791039901…35761956073430732801
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,777,145 XPM·at block #6,816,627 · 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