Block #3,288,014

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/30/2019, 3:00:36 PM · Difficulty 10.9947 · 3,529,082 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f378aaa2f05b8f882a2a6cc4682d99618370f499c13faf152759a63259b39a79

Height

#3,288,014

Difficulty

10.994671

Transactions

5

Size

1.20 KB

Version

2

Bits

0afea2be

Nonce

763,243,042

Timestamp

7/30/2019, 3:00:36 PM

Confirmations

3,529,082

Merkle Root

be883618c75163d4b2c7796347bb66df6510a6bf3b8bb58125c05cdae90a42af
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.

4.486 × 10⁹²(93-digit number)
44867289210081853550…62255688255648858881
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
4.486 × 10⁹²(93-digit number)
44867289210081853550…62255688255648858881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.973 × 10⁹²(93-digit number)
89734578420163707101…24511376511297717761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.794 × 10⁹³(94-digit number)
17946915684032741420…49022753022595435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.589 × 10⁹³(94-digit number)
35893831368065482840…98045506045190871041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.178 × 10⁹³(94-digit number)
71787662736130965681…96091012090381742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.435 × 10⁹⁴(95-digit number)
14357532547226193136…92182024180763484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.871 × 10⁹⁴(95-digit number)
28715065094452386272…84364048361526968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.743 × 10⁹⁴(95-digit number)
57430130188904772544…68728096723053936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.148 × 10⁹⁵(96-digit number)
11486026037780954508…37456193446107873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.297 × 10⁹⁵(96-digit number)
22972052075561909017…74912386892215746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.594 × 10⁹⁵(96-digit number)
45944104151123818035…49824773784431493121
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,780,805 XPM·at block #6,817,095 · 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