Block #3,296,640

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/5/2019, 7:34:50 AM · Difficulty 10.9954 · 3,536,129 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
06753809ba62cb9307f4928f23dd373ed291c4fb6187d4b932e4d3d95ac8b57d

Height

#3,296,640

Difficulty

10.995352

Transactions

13

Size

4.49 KB

Version

2

Bits

0afecf60

Nonce

376,842,102

Timestamp

8/5/2019, 7:34:50 AM

Confirmations

3,536,129

Merkle Root

aa00ee2ca837c45b03486454440b4fddad59cdca6569e8360e51afaeb1eb87e6
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.182 × 10⁹⁶(97-digit number)
21827766782028861403…20809176233919257601
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.182 × 10⁹⁶(97-digit number)
21827766782028861403…20809176233919257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.365 × 10⁹⁶(97-digit number)
43655533564057722807…41618352467838515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.731 × 10⁹⁶(97-digit number)
87311067128115445615…83236704935677030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.746 × 10⁹⁷(98-digit number)
17462213425623089123…66473409871354060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.492 × 10⁹⁷(98-digit number)
34924426851246178246…32946819742708121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.984 × 10⁹⁷(98-digit number)
69848853702492356492…65893639485416243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.396 × 10⁹⁸(99-digit number)
13969770740498471298…31787278970832486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.793 × 10⁹⁸(99-digit number)
27939541480996942596…63574557941664972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.587 × 10⁹⁸(99-digit number)
55879082961993885193…27149115883329945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.117 × 10⁹⁹(100-digit number)
11175816592398777038…54298231766659891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.235 × 10⁹⁹(100-digit number)
22351633184797554077…08596463533319782401
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,906,316 XPM·at block #6,832,768 · 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