Block #383,730

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2014, 2:40:36 PM · Difficulty 10.4044 · 6,433,590 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
75855582fa404049e21b51951b69fae63b61380004248c5b5b19370986a6c236

Height

#383,730

Difficulty

10.404366

Transactions

11

Size

10.20 KB

Version

2

Bits

0a678490

Nonce

27,900

Timestamp

1/31/2014, 2:40:36 PM

Confirmations

6,433,590

Merkle Root

27a6c6ecd38ea3f818ddff76f1a1a60cd0f5614c47d91539e5a60e8a16a4a4b0
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.961 × 10¹⁰⁰(101-digit number)
59610207400840387025…01892566588679454721
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.961 × 10¹⁰⁰(101-digit number)
59610207400840387025…01892566588679454721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.192 × 10¹⁰¹(102-digit number)
11922041480168077405…03785133177358909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.384 × 10¹⁰¹(102-digit number)
23844082960336154810…07570266354717818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.768 × 10¹⁰¹(102-digit number)
47688165920672309620…15140532709435637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.537 × 10¹⁰¹(102-digit number)
95376331841344619241…30281065418871275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.907 × 10¹⁰²(103-digit number)
19075266368268923848…60562130837742551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.815 × 10¹⁰²(103-digit number)
38150532736537847696…21124261675485102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.630 × 10¹⁰²(103-digit number)
76301065473075695393…42248523350970204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.526 × 10¹⁰³(104-digit number)
15260213094615139078…84497046701940408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.052 × 10¹⁰³(104-digit number)
30520426189230278157…68994093403880816641
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,782,605 XPM·at block #6,817,319 · 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