1. #6,809,7601CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #2,090,490

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2017, 7:27:22 PM · Difficulty 10.8742 · 4,719,271 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1dcf5c312a8650524a3a9523093e30400ef4bf28d23a4df701340a8a9ff365eb

Height

#2,090,490

Difficulty

10.874217

Transactions

2

Size

1.98 KB

Version

2

Bits

0adfccb1

Nonce

74,823,859

Timestamp

4/27/2017, 7:27:22 PM

Confirmations

4,719,271

Merkle Root

e19d35b6737f7f5d3e631ec2b9220c64d4ae867c9ef3cc3ccc4215883f87ec0c
Transactions (2)
1 in → 1 out8.4600 XPM110 B
12 in → 1 out3.0000 XPM1.78 KB
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.702 × 10⁹⁴(95-digit number)
87028883026794582745…67750058008074131839
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.702 × 10⁹⁴(95-digit number)
87028883026794582745…67750058008074131839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.740 × 10⁹⁵(96-digit number)
17405776605358916549…35500116016148263679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.481 × 10⁹⁵(96-digit number)
34811553210717833098…71000232032296527359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.962 × 10⁹⁵(96-digit number)
69623106421435666196…42000464064593054719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.392 × 10⁹⁶(97-digit number)
13924621284287133239…84000928129186109439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.784 × 10⁹⁶(97-digit number)
27849242568574266478…68001856258372218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.569 × 10⁹⁶(97-digit number)
55698485137148532956…36003712516744437759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.113 × 10⁹⁷(98-digit number)
11139697027429706591…72007425033488875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.227 × 10⁹⁷(98-digit number)
22279394054859413182…44014850066977751039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.455 × 10⁹⁷(98-digit number)
44558788109718826365…88029700133955502079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,722,174 XPM·at block #6,809,760 · 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