Block #3,574,537

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/26/2020, 6:59:52 PM · Difficulty 10.9057 · 3,269,175 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7edb8a016d255f25c66990775e2b2c23bdeed36733cb878976fbb02a0d4aaa94

Height

#3,574,537

Difficulty

10.905650

Transactions

7

Size

9.61 KB

Version

2

Bits

0ae7d8b4

Nonce

558,369,318

Timestamp

2/26/2020, 6:59:52 PM

Confirmations

3,269,175

Merkle Root

4c7d4d0b221fd0136078a75a7e27df60e5e7e2e9765ac6099adeaeacfea0034b
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.024 × 10⁹⁷(98-digit number)
10246324391244788194…25331205099518259201
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.024 × 10⁹⁷(98-digit number)
10246324391244788194…25331205099518259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.049 × 10⁹⁷(98-digit number)
20492648782489576388…50662410199036518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.098 × 10⁹⁷(98-digit number)
40985297564979152776…01324820398073036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.197 × 10⁹⁷(98-digit number)
81970595129958305552…02649640796146073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.639 × 10⁹⁸(99-digit number)
16394119025991661110…05299281592292147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.278 × 10⁹⁸(99-digit number)
32788238051983322220…10598563184584294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.557 × 10⁹⁸(99-digit number)
65576476103966644441…21197126369168588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.311 × 10⁹⁹(100-digit number)
13115295220793328888…42394252738337177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.623 × 10⁹⁹(100-digit number)
26230590441586657776…84788505476674355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.246 × 10⁹⁹(100-digit number)
52461180883173315553…69577010953348710401
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,994,066 XPM·at block #6,843,711 · 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