Block #2,603,946

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/7/2018, 11:27:45 AM · Difficulty 11.2962 · 4,238,883 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecfb96ff61ffbb4c78c01485d6a44b9ebe1aaa30ed42af476141e893bf85f723

Height

#2,603,946

Difficulty

11.296203

Transactions

16

Size

4.09 KB

Version

2

Bits

0b4bd3f1

Nonce

102,363,737

Timestamp

4/7/2018, 11:27:45 AM

Confirmations

4,238,883

Merkle Root

57c9d8173bcfe951c63c100a9d5bfcffc1cabefa8a892dd57b2934132e1639da
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.882 × 10⁹³(94-digit number)
58824359982222771084…11691052848836070721
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.882 × 10⁹³(94-digit number)
58824359982222771084…11691052848836070721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.176 × 10⁹⁴(95-digit number)
11764871996444554216…23382105697672141441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.352 × 10⁹⁴(95-digit number)
23529743992889108433…46764211395344282881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.705 × 10⁹⁴(95-digit number)
47059487985778216867…93528422790688565761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.411 × 10⁹⁴(95-digit number)
94118975971556433735…87056845581377131521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.882 × 10⁹⁵(96-digit number)
18823795194311286747…74113691162754263041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.764 × 10⁹⁵(96-digit number)
37647590388622573494…48227382325508526081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.529 × 10⁹⁵(96-digit number)
75295180777245146988…96454764651017052161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.505 × 10⁹⁶(97-digit number)
15059036155449029397…92909529302034104321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.011 × 10⁹⁶(97-digit number)
30118072310898058795…85819058604068208641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.023 × 10⁹⁶(97-digit number)
60236144621796117590…71638117208136417281
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,986,975 XPM·at block #6,842,828 · 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