Block #2,646,874

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 2:17:52 PM · Difficulty 11.7556 · 4,193,461 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ba37aea8f061cfdf41a230de0435dab1efed4eb1f4c39e7218c8f5b50ba55a9

Height

#2,646,874

Difficulty

11.755636

Transactions

2

Size

1019 B

Version

2

Bits

0bc17163

Nonce

9,749,046

Timestamp

5/3/2018, 2:17:52 PM

Confirmations

4,193,461

Merkle Root

44fd5c78a38e7f3629b759eb9dfd6598d2a96b64c49ea0a9f9ca10aa882d6492
Transactions (2)
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.

5.379 × 10⁹⁶(97-digit number)
53798328172842578835…39229669097776046081
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
5.379 × 10⁹⁶(97-digit number)
53798328172842578835…39229669097776046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.075 × 10⁹⁷(98-digit number)
10759665634568515767…78459338195552092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.151 × 10⁹⁷(98-digit number)
21519331269137031534…56918676391104184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.303 × 10⁹⁷(98-digit number)
43038662538274063068…13837352782208368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.607 × 10⁹⁷(98-digit number)
86077325076548126136…27674705564416737281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.721 × 10⁹⁸(99-digit number)
17215465015309625227…55349411128833474561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.443 × 10⁹⁸(99-digit number)
34430930030619250454…10698822257666949121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.886 × 10⁹⁸(99-digit number)
68861860061238500909…21397644515333898241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.377 × 10⁹⁹(100-digit number)
13772372012247700181…42795289030667796481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.754 × 10⁹⁹(100-digit number)
27544744024495400363…85590578061335592961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.508 × 10⁹⁹(100-digit number)
55089488048990800727…71181156122671185921
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,967,001 XPM·at block #6,840,334 · 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