Block #2,693,247

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/5/2018, 6:40:48 PM · Difficulty 11.6783 · 4,150,197 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb1d6a3e98046c834515c5bb75621cdf0c3cbec9c062edbae0f2ec6dd1676159

Height

#2,693,247

Difficulty

11.678343

Transactions

3

Size

1.08 KB

Version

2

Bits

0bada7e0

Nonce

38,124,256

Timestamp

6/5/2018, 6:40:48 PM

Confirmations

4,150,197

Merkle Root

62cbf4f2570f3def82ed6c5f9bc1011fb8c3582429056ba74d045746fde584eb
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.

3.662 × 10⁹³(94-digit number)
36627512246713686437…03746957714569009251
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
3.662 × 10⁹³(94-digit number)
36627512246713686437…03746957714569009251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.325 × 10⁹³(94-digit number)
73255024493427372874…07493915429138018501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.465 × 10⁹⁴(95-digit number)
14651004898685474574…14987830858276037001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.930 × 10⁹⁴(95-digit number)
29302009797370949149…29975661716552074001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.860 × 10⁹⁴(95-digit number)
58604019594741898299…59951323433104148001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.172 × 10⁹⁵(96-digit number)
11720803918948379659…19902646866208296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.344 × 10⁹⁵(96-digit number)
23441607837896759319…39805293732416592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.688 × 10⁹⁵(96-digit number)
46883215675793518639…79610587464833184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.376 × 10⁹⁵(96-digit number)
93766431351587037279…59221174929666368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.875 × 10⁹⁶(97-digit number)
18753286270317407455…18442349859332736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.750 × 10⁹⁶(97-digit number)
37506572540634814911…36884699718665472001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,991,924 XPM·at block #6,843,443 · 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