Block #3,504,960

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2020, 6:54:36 AM · Difficulty 10.9307 · 3,338,694 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
893d4f670302dcbde564ab1bb3296362927ad511d66bcac9aa9a1422bb9ee29f

Height

#3,504,960

Difficulty

10.930720

Transactions

4

Size

22.00 KB

Version

2

Bits

0aee43a9

Nonce

436,680,674

Timestamp

1/8/2020, 6:54:36 AM

Confirmations

3,338,694

Merkle Root

0982096915dd4195b665b3208f53f4ad4912bcf407e39e6e5d8176ff87ed96a9
Transactions (4)
1 in → 1 out8.6000 XPM110 B
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
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.

1.155 × 10⁹⁴(95-digit number)
11553743546534304211…58503621551663644001
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
1.155 × 10⁹⁴(95-digit number)
11553743546534304211…58503621551663644001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.310 × 10⁹⁴(95-digit number)
23107487093068608422…17007243103327288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.621 × 10⁹⁴(95-digit number)
46214974186137216844…34014486206654576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.242 × 10⁹⁴(95-digit number)
92429948372274433688…68028972413309152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.848 × 10⁹⁵(96-digit number)
18485989674454886737…36057944826618304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.697 × 10⁹⁵(96-digit number)
36971979348909773475…72115889653236608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.394 × 10⁹⁵(96-digit number)
73943958697819546950…44231779306473216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.478 × 10⁹⁶(97-digit number)
14788791739563909390…88463558612946432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.957 × 10⁹⁶(97-digit number)
29577583479127818780…76927117225892864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.915 × 10⁹⁶(97-digit number)
59155166958255637560…53854234451785728001
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,993,603 XPM·at block #6,843,653 · 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