Block #3,505,818

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2020, 9:39:05 PM · Difficulty 10.9304 · 3,335,533 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c97d3c04f035d2a9d8feda95ac20c77c2bfaf9fcb74d6285e8dc562ca4ce3e58

Height

#3,505,818

Difficulty

10.930414

Transactions

18

Size

74.25 KB

Version

2

Bits

0aee2f9c

Nonce

1,297,420,525

Timestamp

1/8/2020, 9:39:05 PM

Confirmations

3,335,533

Merkle Root

34e86627e5acbf4c64e0f62bffb704169a4dcb865deb34c994220d99ec027d8b
Transactions (18)
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.122 × 10⁹³(94-digit number)
31229580747171362015…76449633701417431041
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.122 × 10⁹³(94-digit number)
31229580747171362015…76449633701417431041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.245 × 10⁹³(94-digit number)
62459161494342724031…52899267402834862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.249 × 10⁹⁴(95-digit number)
12491832298868544806…05798534805669724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.498 × 10⁹⁴(95-digit number)
24983664597737089612…11597069611339448321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.996 × 10⁹⁴(95-digit number)
49967329195474179225…23194139222678896641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.993 × 10⁹⁴(95-digit number)
99934658390948358450…46388278445357793281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.998 × 10⁹⁵(96-digit number)
19986931678189671690…92776556890715586561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.997 × 10⁹⁵(96-digit number)
39973863356379343380…85553113781431173121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.994 × 10⁹⁵(96-digit number)
79947726712758686760…71106227562862346241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.598 × 10⁹⁶(97-digit number)
15989545342551737352…42212455125724692481
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,975,175 XPM·at block #6,841,350 · 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