Block #378,979

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/28/2014, 6:04:53 AM · Difficulty 10.4130 · 6,447,563 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0261d9adf0cc8f09d0111bd7b5efb50a9bdbde939c2ae6800a343dd69e45c821

Height

#378,979

Difficulty

10.412955

Transactions

1

Size

869 B

Version

2

Bits

0a69b76e

Nonce

70,562

Timestamp

1/28/2014, 6:04:53 AM

Confirmations

6,447,563

Merkle Root

3fb50988c7244713db237023d2624db6381db6188955ab0c8fb02a181bc56227
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.

5.779 × 10⁹⁸(99-digit number)
57794907497992284783…46227844886003088641
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
5.779 × 10⁹⁸(99-digit number)
57794907497992284783…46227844886003088641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.155 × 10⁹⁹(100-digit number)
11558981499598456956…92455689772006177281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.311 × 10⁹⁹(100-digit number)
23117962999196913913…84911379544012354561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.623 × 10⁹⁹(100-digit number)
46235925998393827826…69822759088024709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.247 × 10⁹⁹(100-digit number)
92471851996787655653…39645518176049418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.849 × 10¹⁰⁰(101-digit number)
18494370399357531130…79291036352098836481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.698 × 10¹⁰⁰(101-digit number)
36988740798715062261…58582072704197672961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.397 × 10¹⁰⁰(101-digit number)
73977481597430124522…17164145408395345921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.479 × 10¹⁰¹(102-digit number)
14795496319486024904…34328290816790691841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.959 × 10¹⁰¹(102-digit number)
29590992638972049809…68656581633581383681
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,856,484 XPM·at block #6,826,541 · 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