Block #2,045,655

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2017, 9:02:20 PM · Difficulty 10.6820 · 4,767,214 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9fa65df6af528da2f15fe41c1e29d7159c4f66c6628279e345c6d85f732739ca

Height

#2,045,655

Difficulty

10.682049

Transactions

4

Size

11.10 KB

Version

2

Bits

0aae9ac3

Nonce

286,996,162

Timestamp

3/30/2017, 9:02:20 PM

Confirmations

4,767,214

Merkle Root

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

8.246 × 10⁹⁵(96-digit number)
82461076967728885201…88206959574746851839
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
8.246 × 10⁹⁵(96-digit number)
82461076967728885201…88206959574746851839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.649 × 10⁹⁶(97-digit number)
16492215393545777040…76413919149493703679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.298 × 10⁹⁶(97-digit number)
32984430787091554080…52827838298987407359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.596 × 10⁹⁶(97-digit number)
65968861574183108161…05655676597974814719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.319 × 10⁹⁷(98-digit number)
13193772314836621632…11311353195949629439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.638 × 10⁹⁷(98-digit number)
26387544629673243264…22622706391899258879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.277 × 10⁹⁷(98-digit number)
52775089259346486529…45245412783798517759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.055 × 10⁹⁸(99-digit number)
10555017851869297305…90490825567597035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.111 × 10⁹⁸(99-digit number)
21110035703738594611…80981651135194071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.222 × 10⁹⁸(99-digit number)
42220071407477189223…61963302270388142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.444 × 10⁹⁸(99-digit number)
84440142814954378446…23926604540776284159
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,746,982 XPM·at block #6,812,868 · 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.

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