Block #380,654

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/29/2014, 9:59:32 AM · Difficulty 10.4132 · 6,428,485 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
48aa0276eeac509dc5b3c286745cc6d80a39e705e06c4a738cc15d862652d789

Height

#380,654

Difficulty

10.413173

Transactions

9

Size

1.97 KB

Version

2

Bits

0a69c5b0

Nonce

7,756

Timestamp

1/29/2014, 9:59:32 AM

Confirmations

6,428,485

Merkle Root

9211deeb0f4165f9fa31b5ff6da1e8319415a38eb7663bbd4bdd37099c04da0b
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.

6.324 × 10⁹⁷(98-digit number)
63248081237904981109…91472031988916668161
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
6.324 × 10⁹⁷(98-digit number)
63248081237904981109…91472031988916668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.264 × 10⁹⁸(99-digit number)
12649616247580996221…82944063977833336321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.529 × 10⁹⁸(99-digit number)
25299232495161992443…65888127955666672641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.059 × 10⁹⁸(99-digit number)
50598464990323984887…31776255911333345281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.011 × 10⁹⁹(100-digit number)
10119692998064796977…63552511822666690561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.023 × 10⁹⁹(100-digit number)
20239385996129593955…27105023645333381121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.047 × 10⁹⁹(100-digit number)
40478771992259187910…54210047290666762241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.095 × 10⁹⁹(100-digit number)
80957543984518375820…08420094581333524481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.619 × 10¹⁰⁰(101-digit number)
16191508796903675164…16840189162667048961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.238 × 10¹⁰⁰(101-digit number)
32383017593807350328…33680378325334097921
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,717,173 XPM·at block #6,809,138 · 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