Block #377,273

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/27/2014, 12:12:39 AM · Difficulty 10.4231 · 6,435,076 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6dc8ac090389cd43815f967f476da12fcdb3a77ac1a20bb6743b9e40315aaacd

Height

#377,273

Difficulty

10.423150

Transactions

14

Size

5.02 KB

Version

2

Bits

0a6c5388

Nonce

46,738

Timestamp

1/27/2014, 12:12:39 AM

Confirmations

6,435,076

Merkle Root

c1c16d9a61c09cc5b9d5dff18a5af4b8c2bbbb1ce903d340d1e62dcd9d0b31e3
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.

8.700 × 10⁹⁸(99-digit number)
87006422454558212730…89657104486311454721
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
8.700 × 10⁹⁸(99-digit number)
87006422454558212730…89657104486311454721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.740 × 10⁹⁹(100-digit number)
17401284490911642546…79314208972622909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.480 × 10⁹⁹(100-digit number)
34802568981823285092…58628417945245818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.960 × 10⁹⁹(100-digit number)
69605137963646570184…17256835890491637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.392 × 10¹⁰⁰(101-digit number)
13921027592729314036…34513671780983275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.784 × 10¹⁰⁰(101-digit number)
27842055185458628073…69027343561966551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.568 × 10¹⁰⁰(101-digit number)
55684110370917256147…38054687123933102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.113 × 10¹⁰¹(102-digit number)
11136822074183451229…76109374247866204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.227 × 10¹⁰¹(102-digit number)
22273644148366902458…52218748495732408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.454 × 10¹⁰¹(102-digit number)
44547288296733804917…04437496991464816641
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,742,812 XPM·at block #6,812,348 · 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