Block #384,168

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2014, 10:07:55 PM · Difficulty 10.4038 · 6,426,383 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9de392fe49f7f6493aa5a53db655c90d7d092f8cb12f7e890c82b3d1778d1f0

Height

#384,168

Difficulty

10.403826

Transactions

6

Size

1.83 KB

Version

2

Bits

0a676125

Nonce

482,856

Timestamp

1/31/2014, 10:07:55 PM

Confirmations

6,426,383

Merkle Root

ad5595a7edd19ba2ad60d1ea8401b5a211e23c7b670618ac407114f4235b4250
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.100 × 10⁹⁹(100-digit number)
11007178763525979393…13002390549542064801
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.100 × 10⁹⁹(100-digit number)
11007178763525979393…13002390549542064801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.201 × 10⁹⁹(100-digit number)
22014357527051958786…26004781099084129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.402 × 10⁹⁹(100-digit number)
44028715054103917573…52009562198168259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.805 × 10⁹⁹(100-digit number)
88057430108207835147…04019124396336518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.761 × 10¹⁰⁰(101-digit number)
17611486021641567029…08038248792673036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.522 × 10¹⁰⁰(101-digit number)
35222972043283134059…16076497585346073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.044 × 10¹⁰⁰(101-digit number)
70445944086566268118…32152995170692147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.408 × 10¹⁰¹(102-digit number)
14089188817313253623…64305990341384294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.817 × 10¹⁰¹(102-digit number)
28178377634626507247…28611980682768588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.635 × 10¹⁰¹(102-digit number)
56356755269253014494…57223961365537177601
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,728,497 XPM·at block #6,810,550 · 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