Block #3,160,166

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2019, 6:38:18 AM · Difficulty 11.3100 · 3,679,338 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c2071fd273f3f9152ea5d5e4a1b63b780f49c4314828ba0e6254796bcfa5a6a

Height

#3,160,166

Difficulty

11.309998

Transactions

4

Size

1.11 KB

Version

2

Bits

0b4f5c0c

Nonce

226,419,331

Timestamp

4/29/2019, 6:38:18 AM

Confirmations

3,679,338

Merkle Root

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

7.093 × 10⁹⁵(96-digit number)
70935650991550178163…58798502048490618879
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
7.093 × 10⁹⁵(96-digit number)
70935650991550178163…58798502048490618879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.418 × 10⁹⁶(97-digit number)
14187130198310035632…17597004096981237759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.837 × 10⁹⁶(97-digit number)
28374260396620071265…35194008193962475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.674 × 10⁹⁶(97-digit number)
56748520793240142531…70388016387924951039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.134 × 10⁹⁷(98-digit number)
11349704158648028506…40776032775849902079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.269 × 10⁹⁷(98-digit number)
22699408317296057012…81552065551699804159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.539 × 10⁹⁷(98-digit number)
45398816634592114024…63104131103399608319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.079 × 10⁹⁷(98-digit number)
90797633269184228049…26208262206799216639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.815 × 10⁹⁸(99-digit number)
18159526653836845609…52416524413598433279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.631 × 10⁹⁸(99-digit number)
36319053307673691219…04833048827196866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.263 × 10⁹⁸(99-digit number)
72638106615347382439…09666097654393733119
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,960,330 XPM·at block #6,839,503 · 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