Block #3,503,075

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2020, 11:34:28 PM · Difficulty 10.9306 · 3,323,768 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e520a261a9535697c089fb097f97d45a510a1002da0b045f30c82e2931402506

Height

#3,503,075

Difficulty

10.930620

Transactions

17

Size

74.37 KB

Version

2

Bits

0aee3d23

Nonce

1,034,396,323

Timestamp

1/6/2020, 11:34:28 PM

Confirmations

3,323,768

Merkle Root

1193539884ef582961e0c8dc93a1fc74b67a4ea84df1c1d8324d9599375b31db
Transactions (17)
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.

3.235 × 10⁹⁵(96-digit number)
32351530513997253223…71225421043832400001
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
3.235 × 10⁹⁵(96-digit number)
32351530513997253223…71225421043832400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.470 × 10⁹⁵(96-digit number)
64703061027994506447…42450842087664800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.294 × 10⁹⁶(97-digit number)
12940612205598901289…84901684175329600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.588 × 10⁹⁶(97-digit number)
25881224411197802579…69803368350659200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.176 × 10⁹⁶(97-digit number)
51762448822395605158…39606736701318400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.035 × 10⁹⁷(98-digit number)
10352489764479121031…79213473402636800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.070 × 10⁹⁷(98-digit number)
20704979528958242063…58426946805273600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.140 × 10⁹⁷(98-digit number)
41409959057916484126…16853893610547200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.281 × 10⁹⁷(98-digit number)
82819918115832968253…33707787221094400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.656 × 10⁹⁸(99-digit number)
16563983623166593650…67415574442188800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.312 × 10⁹⁸(99-digit number)
33127967246333187301…34831148884377600001
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,858,909 XPM·at block #6,826,842 · 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