Block #380,468

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/29/2014, 7:06:54 AM · Difficulty 10.4115 · 6,425,841 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
10be347050e4382134bbafed3c125ae2cc4d84beaeebb4f7ac831c51eff3aa5e

Height

#380,468

Difficulty

10.411548

Transactions

5

Size

1.08 KB

Version

2

Bits

0a695b33

Nonce

93,090

Timestamp

1/29/2014, 7:06:54 AM

Confirmations

6,425,841

Merkle Root

5fd2b7c954849420d37820290756a0b8a0daa3666b860f9f18a3a139d3fd25ae
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.501 × 10⁹⁵(96-digit number)
15016609851540653203…83338206847541319681
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.501 × 10⁹⁵(96-digit number)
15016609851540653203…83338206847541319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.003 × 10⁹⁵(96-digit number)
30033219703081306407…66676413695082639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.006 × 10⁹⁵(96-digit number)
60066439406162612815…33352827390165278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.201 × 10⁹⁶(97-digit number)
12013287881232522563…66705654780330557441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.402 × 10⁹⁶(97-digit number)
24026575762465045126…33411309560661114881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.805 × 10⁹⁶(97-digit number)
48053151524930090252…66822619121322229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.610 × 10⁹⁶(97-digit number)
96106303049860180505…33645238242644459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.922 × 10⁹⁷(98-digit number)
19221260609972036101…67290476485288919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.844 × 10⁹⁷(98-digit number)
38442521219944072202…34580952970577838081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.688 × 10⁹⁷(98-digit number)
76885042439888144404…69161905941155676161
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,694,560 XPM·at block #6,806,308 · 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