Block #375,763

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/25/2014, 10:52:31 PM · Difficulty 10.4238 · 6,432,521 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff254ab154f7faae24bfa498bf60cafe2c0c5ea34ff10102f865addf901d022f

Height

#375,763

Difficulty

10.423831

Transactions

8

Size

3.04 KB

Version

2

Bits

0a6c8030

Nonce

81,223

Timestamp

1/25/2014, 10:52:31 PM

Confirmations

6,432,521

Merkle Root

88cf7a51c475f7db1ceb029e7a13b943e8b40160901c8be2132875b5c3465a66
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.989 × 10⁹⁷(98-digit number)
19890094685730096316…98966291299547984961
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.989 × 10⁹⁷(98-digit number)
19890094685730096316…98966291299547984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.978 × 10⁹⁷(98-digit number)
39780189371460192633…97932582599095969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.956 × 10⁹⁷(98-digit number)
79560378742920385267…95865165198191939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.591 × 10⁹⁸(99-digit number)
15912075748584077053…91730330396383879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.182 × 10⁹⁸(99-digit number)
31824151497168154107…83460660792767759361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.364 × 10⁹⁸(99-digit number)
63648302994336308214…66921321585535518721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.272 × 10⁹⁹(100-digit number)
12729660598867261642…33842643171071037441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.545 × 10⁹⁹(100-digit number)
25459321197734523285…67685286342142074881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.091 × 10⁹⁹(100-digit number)
50918642395469046571…35370572684284149761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.018 × 10¹⁰⁰(101-digit number)
10183728479093809314…70741145368568299521
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,710,323 XPM·at block #6,808,283 · 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