Block #3,429,220

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/11/2019, 10:01:17 PM · Difficulty 10.9805 · 3,397,028 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b429ea97e482afd1e33851e928a1fbe6226ee18bd2534ba9a780060cafb4dd47

Height

#3,429,220

Difficulty

10.980550

Transactions

3

Size

882 B

Version

2

Bits

0afb0552

Nonce

287,955,133

Timestamp

11/11/2019, 10:01:17 PM

Confirmations

3,397,028

Merkle Root

0bbbe31134184187fef8bf0f6c4a3fa97aeca8fc12e4333e9c621193908c37ee
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.768 × 10⁹⁴(95-digit number)
27683168747096837367…53983714369383510971
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.768 × 10⁹⁴(95-digit number)
27683168747096837367…53983714369383510971
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.536 × 10⁹⁴(95-digit number)
55366337494193674735…07967428738767021941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.107 × 10⁹⁵(96-digit number)
11073267498838734947…15934857477534043881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.214 × 10⁹⁵(96-digit number)
22146534997677469894…31869714955068087761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.429 × 10⁹⁵(96-digit number)
44293069995354939788…63739429910136175521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.858 × 10⁹⁵(96-digit number)
88586139990709879577…27478859820272351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.771 × 10⁹⁶(97-digit number)
17717227998141975915…54957719640544702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.543 × 10⁹⁶(97-digit number)
35434455996283951830…09915439281089404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.086 × 10⁹⁶(97-digit number)
70868911992567903661…19830878562178808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.417 × 10⁹⁷(98-digit number)
14173782398513580732…39661757124357616641
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,854,116 XPM·at block #6,826,247 · 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