Block #385,660

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2014, 10:40:48 PM · Difficulty 10.4067 · 6,423,041 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
063f97a75a6fa7ea7c354fd50289c4eeeb901143b9880240fdd583ecf475d065

Height

#385,660

Difficulty

10.406729

Transactions

7

Size

4.09 KB

Version

2

Bits

0a681f67

Nonce

34,710,199

Timestamp

2/1/2014, 10:40:48 PM

Confirmations

6,423,041

Merkle Root

44cadc5a974d814ba5b0e37a000e953d6e931d9f09ab7e9d7cd1b26a9b868448
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.

2.416 × 10⁹⁴(95-digit number)
24162901323119982047…96661591746594323441
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
2.416 × 10⁹⁴(95-digit number)
24162901323119982047…96661591746594323441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.832 × 10⁹⁴(95-digit number)
48325802646239964095…93323183493188646881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.665 × 10⁹⁴(95-digit number)
96651605292479928190…86646366986377293761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.933 × 10⁹⁵(96-digit number)
19330321058495985638…73292733972754587521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.866 × 10⁹⁵(96-digit number)
38660642116991971276…46585467945509175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.732 × 10⁹⁵(96-digit number)
77321284233983942552…93170935891018350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.546 × 10⁹⁶(97-digit number)
15464256846796788510…86341871782036700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.092 × 10⁹⁶(97-digit number)
30928513693593577021…72683743564073400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.185 × 10⁹⁶(97-digit number)
61857027387187154042…45367487128146800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.237 × 10⁹⁷(98-digit number)
12371405477437430808…90734974256293601281
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,713,658 XPM·at block #6,808,700 · 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