Block #3,504,657

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2020, 1:52:15 AM · Difficulty 10.9307 · 3,337,700 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a1ab48e1c0e55139e3cb37f9453c0b941ea6b8807bccc36d58174d8b52faf4c8

Height

#3,504,657

Difficulty

10.930702

Transactions

2

Size

7.46 KB

Version

2

Bits

0aee4283

Nonce

149,520,400

Timestamp

1/8/2020, 1:52:15 AM

Confirmations

3,337,700

Merkle Root

544f4c7b75e2b2f640c51d53107ee296ac9733a7ad3762921d0d809ca7e76208
Transactions (2)
1 in → 1 out8.4400 XPM110 B
50 in → 1 out199.9200 XPM7.27 KB
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.759 × 10⁹⁵(96-digit number)
57591125040849882351…67547094413054947121
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.759 × 10⁹⁵(96-digit number)
57591125040849882351…67547094413054947121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.151 × 10⁹⁶(97-digit number)
11518225008169976470…35094188826109894241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.303 × 10⁹⁶(97-digit number)
23036450016339952940…70188377652219788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.607 × 10⁹⁶(97-digit number)
46072900032679905881…40376755304439576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.214 × 10⁹⁶(97-digit number)
92145800065359811762…80753510608879153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.842 × 10⁹⁷(98-digit number)
18429160013071962352…61507021217758307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.685 × 10⁹⁷(98-digit number)
36858320026143924705…23014042435516615681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.371 × 10⁹⁷(98-digit number)
73716640052287849410…46028084871033231361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.474 × 10⁹⁸(99-digit number)
14743328010457569882…92056169742066462721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.948 × 10⁹⁸(99-digit number)
29486656020915139764…84112339484132925441
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,983,263 XPM·at block #6,842,356 · 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