Block #375,313

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/25/2014, 3:22:19 PM · Difficulty 10.4235 · 6,439,155 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6bc2f194c7d5091b9065da3fc6ec04c22efa4536e7689e9eec2dba6e3d762e29

Height

#375,313

Difficulty

10.423514

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6c6b6d

Nonce

23,606

Timestamp

1/25/2014, 3:22:19 PM

Confirmations

6,439,155

Merkle Root

e32dfab970eecb9832ed5b9b7c62788d78e92b71e0efeeeca208cee1235aa671
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.357 × 10⁹⁹(100-digit number)
23570884758385225428…25741819709479563521
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.357 × 10⁹⁹(100-digit number)
23570884758385225428…25741819709479563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.714 × 10⁹⁹(100-digit number)
47141769516770450856…51483639418959127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.428 × 10⁹⁹(100-digit number)
94283539033540901712…02967278837918254081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.885 × 10¹⁰⁰(101-digit number)
18856707806708180342…05934557675836508161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.771 × 10¹⁰⁰(101-digit number)
37713415613416360684…11869115351673016321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.542 × 10¹⁰⁰(101-digit number)
75426831226832721369…23738230703346032641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.508 × 10¹⁰¹(102-digit number)
15085366245366544273…47476461406692065281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.017 × 10¹⁰¹(102-digit number)
30170732490733088547…94952922813384130561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.034 × 10¹⁰¹(102-digit number)
60341464981466177095…89905845626768261121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.206 × 10¹⁰²(103-digit number)
12068292996293235419…79811691253536522241
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,759,817 XPM·at block #6,814,467 · 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