Block #3,502,983

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2020, 10:20:05 PM · Difficulty 10.9304 · 3,312,957 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e251c726ce7c047837f1570ec09d7f98f3db91f8381a561c0302ad8f0e241fa

Height

#3,502,983

Difficulty

10.930409

Transactions

25

Size

174.70 KB

Version

2

Bits

0aee2f51

Nonce

533,497,806

Timestamp

1/6/2020, 10:20:05 PM

Confirmations

3,312,957

Merkle Root

479471e982edfc99388b6075ceed021557f0941f886240a773bcc14f0b296cfc
Transactions (25)
1 in → 1 out10.2800 XPM110 B
50 in → 1 out1199.9200 XPM7.27 KB
50 in → 1 out1199.9200 XPM7.27 KB
50 in → 1 out1199.9200 XPM7.27 KB
50 in → 1 out1199.9200 XPM7.28 KB
50 in → 1 out1199.9200 XPM7.26 KB
50 in → 1 out1199.9200 XPM7.26 KB
50 in → 1 out1199.9200 XPM7.27 KB
50 in → 1 out1199.9200 XPM7.27 KB
50 in → 1 out1199.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.

2.480 × 10⁹⁷(98-digit number)
24808235174499531317…81066486015779143681
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
2.480 × 10⁹⁷(98-digit number)
24808235174499531317…81066486015779143681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.961 × 10⁹⁷(98-digit number)
49616470348999062634…62132972031558287361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.923 × 10⁹⁷(98-digit number)
99232940697998125269…24265944063116574721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.984 × 10⁹⁸(99-digit number)
19846588139599625053…48531888126233149441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.969 × 10⁹⁸(99-digit number)
39693176279199250107…97063776252466298881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.938 × 10⁹⁸(99-digit number)
79386352558398500215…94127552504932597761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.587 × 10⁹⁹(100-digit number)
15877270511679700043…88255105009865195521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.175 × 10⁹⁹(100-digit number)
31754541023359400086…76510210019730391041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.350 × 10⁹⁹(100-digit number)
63509082046718800172…53020420039460782081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.270 × 10¹⁰⁰(101-digit number)
12701816409343760034…06040840078921564161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.540 × 10¹⁰⁰(101-digit number)
25403632818687520068…12081680157843128321
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,771,633 XPM·at block #6,815,939 · 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