Block #3,506,347

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2020, 6:21:20 AM · Difficulty 10.9305 · 3,311,674 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7d0ffaf5859e26217116cdd7a868d0eeb50befd2a828ffb5d14689d1cae62ff

Height

#3,506,347

Difficulty

10.930497

Transactions

11

Size

72.88 KB

Version

2

Bits

0aee3513

Nonce

743,773,955

Timestamp

1/9/2020, 6:21:20 AM

Confirmations

3,311,674

Merkle Root

ba80dd67fb61ac93f26a37c10cbf1f4bd1067b0d38d432da8063899fcd644c1d
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out50.7688 XPM7.27 KB
50 in → 1 out50.7748 XPM7.26 KB
50 in → 1 out50.7622 XPM7.27 KB
50 in → 1 out50.7802 XPM7.27 KB
50 in → 1 out50.8075 XPM7.26 KB
50 in → 1 out50.7916 XPM7.27 KB
50 in → 1 out505.8495 XPM7.27 KB
50 in → 1 out50.7864 XPM7.27 KB
50 in → 1 out50.7960 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.699 × 10⁹⁴(95-digit number)
56995764897966885272…66976022044325718081
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.699 × 10⁹⁴(95-digit number)
56995764897966885272…66976022044325718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.139 × 10⁹⁵(96-digit number)
11399152979593377054…33952044088651436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.279 × 10⁹⁵(96-digit number)
22798305959186754109…67904088177302872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.559 × 10⁹⁵(96-digit number)
45596611918373508218…35808176354605744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.119 × 10⁹⁵(96-digit number)
91193223836747016436…71616352709211489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.823 × 10⁹⁶(97-digit number)
18238644767349403287…43232705418422978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.647 × 10⁹⁶(97-digit number)
36477289534698806574…86465410836845957121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.295 × 10⁹⁶(97-digit number)
72954579069397613149…72930821673691914241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.459 × 10⁹⁷(98-digit number)
14590915813879522629…45861643347383828481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.918 × 10⁹⁷(98-digit number)
29181831627759045259…91723286694767656961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.836 × 10⁹⁷(98-digit number)
58363663255518090519…83446573389535313921
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,788,235 XPM·at block #6,818,020 · 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