Block #380,103

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/29/2014, 12:25:31 AM · Difficulty 10.4158 · 6,445,304 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
092949323f4a9910044e7a79aea923b4ccc02f5de1dfccb5b573c6dac93768fa

Height

#380,103

Difficulty

10.415823

Transactions

10

Size

3.59 KB

Version

2

Bits

0a6a7367

Nonce

12,730

Timestamp

1/29/2014, 12:25:31 AM

Confirmations

6,445,304

Merkle Root

8d8b4852aeba2e0503c8a7a2b2076fb306c1a0282cf58c4fdcb7ba14fb4e35e5
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.949 × 10⁹⁶(97-digit number)
19494296742540586789…36716102451417878721
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.949 × 10⁹⁶(97-digit number)
19494296742540586789…36716102451417878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.898 × 10⁹⁶(97-digit number)
38988593485081173579…73432204902835757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.797 × 10⁹⁶(97-digit number)
77977186970162347158…46864409805671514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.559 × 10⁹⁷(98-digit number)
15595437394032469431…93728819611343029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.119 × 10⁹⁷(98-digit number)
31190874788064938863…87457639222686059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.238 × 10⁹⁷(98-digit number)
62381749576129877726…74915278445372119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.247 × 10⁹⁸(99-digit number)
12476349915225975545…49830556890744238081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.495 × 10⁹⁸(99-digit number)
24952699830451951090…99661113781488476161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.990 × 10⁹⁸(99-digit number)
49905399660903902181…99322227562976952321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.981 × 10⁹⁸(99-digit number)
99810799321807804362…98644455125953904641
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,847,356 XPM·at block #6,825,406 · 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