Block #2,094,778

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2017, 8:23:06 PM · Difficulty 10.8721 · 4,746,887 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
059c0c97dd856c5588cdeb6115d8515292c4d639ed2155f2fd7c2c1557291134

Height

#2,094,778

Difficulty

10.872115

Transactions

2

Size

1.43 KB

Version

2

Bits

0adf42eb

Nonce

1,075,070,937

Timestamp

4/30/2017, 8:23:06 PM

Confirmations

4,746,887

Merkle Root

3452647f1e7a7324308e918c8e036ae4d48f3799923666b6d43b40fa792547b0
Transactions (2)
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.400 × 10⁹⁵(96-digit number)
44003895999565325876…63318438196520570559
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.400 × 10⁹⁵(96-digit number)
44003895999565325876…63318438196520570559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.800 × 10⁹⁵(96-digit number)
88007791999130651753…26636876393041141119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.760 × 10⁹⁶(97-digit number)
17601558399826130350…53273752786082282239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.520 × 10⁹⁶(97-digit number)
35203116799652260701…06547505572164564479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.040 × 10⁹⁶(97-digit number)
70406233599304521402…13095011144329128959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.408 × 10⁹⁷(98-digit number)
14081246719860904280…26190022288658257919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.816 × 10⁹⁷(98-digit number)
28162493439721808561…52380044577316515839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.632 × 10⁹⁷(98-digit number)
56324986879443617122…04760089154633031679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.126 × 10⁹⁸(99-digit number)
11264997375888723424…09520178309266063359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.252 × 10⁹⁸(99-digit number)
22529994751777446848…19040356618532126719
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,977,709 XPM·at block #6,841,664 · 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