Block #3,006,168

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2019, 9:39:43 AM · Difficulty 11.1933 · 3,832,975 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b2664623cf9d32ce9196ebbe07d6deec44e58e4fadcaaae331acf4b8267e42c0

Height

#3,006,168

Difficulty

11.193307

Transactions

17

Size

4.44 KB

Version

2

Bits

0b317c97

Nonce

1,099,858,540

Timestamp

1/12/2019, 9:39:43 AM

Confirmations

3,832,975

Merkle Root

1a099d235b41ceb83cf3c8054c00e96acab22e154d4cbf34417c6986ce26f8b9
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.798 × 10⁹⁵(96-digit number)
27988750364668409449…94697354142462996479
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.798 × 10⁹⁵(96-digit number)
27988750364668409449…94697354142462996479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.597 × 10⁹⁵(96-digit number)
55977500729336818899…89394708284925992959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.119 × 10⁹⁶(97-digit number)
11195500145867363779…78789416569851985919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.239 × 10⁹⁶(97-digit number)
22391000291734727559…57578833139703971839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.478 × 10⁹⁶(97-digit number)
44782000583469455119…15157666279407943679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.956 × 10⁹⁶(97-digit number)
89564001166938910238…30315332558815887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.791 × 10⁹⁷(98-digit number)
17912800233387782047…60630665117631774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.582 × 10⁹⁷(98-digit number)
35825600466775564095…21261330235263549439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.165 × 10⁹⁷(98-digit number)
71651200933551128190…42522660470527098879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.433 × 10⁹⁸(99-digit number)
14330240186710225638…85045320941054197759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.866 × 10⁹⁸(99-digit number)
28660480373420451276…70090641882108395519
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,957,424 XPM·at block #6,839,142 · 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