Block #369,024

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/21/2014, 3:04:43 AM · Difficulty 10.4448 · 6,439,103 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b799c9020db5f6c20b9bdaaeed3982fc35013d8f73e531dad05a8672318dec1

Height

#369,024

Difficulty

10.444833

Transactions

4

Size

1.72 KB

Version

2

Bits

0a71e08b

Nonce

41,783

Timestamp

1/21/2014, 3:04:43 AM

Confirmations

6,439,103

Merkle Root

e213b19e256d04f37f92beec7e3a3a2a6c154e150275f5b7ea6232e566886331
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.625 × 10⁹⁹(100-digit number)
56254677594135359015…82040078225155276801
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.625 × 10⁹⁹(100-digit number)
56254677594135359015…82040078225155276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.125 × 10¹⁰⁰(101-digit number)
11250935518827071803…64080156450310553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.250 × 10¹⁰⁰(101-digit number)
22501871037654143606…28160312900621107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.500 × 10¹⁰⁰(101-digit number)
45003742075308287212…56320625801242214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.000 × 10¹⁰⁰(101-digit number)
90007484150616574424…12641251602484428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.800 × 10¹⁰¹(102-digit number)
18001496830123314884…25282503204968857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.600 × 10¹⁰¹(102-digit number)
36002993660246629769…50565006409937715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.200 × 10¹⁰¹(102-digit number)
72005987320493259539…01130012819875430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.440 × 10¹⁰²(103-digit number)
14401197464098651907…02260025639750860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.880 × 10¹⁰²(103-digit number)
28802394928197303815…04520051279501721601
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,709,057 XPM·at block #6,808,126 · 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