Block #2,094,789

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2017, 8:39:27 PM · Difficulty 10.8720 · 4,747,540 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8ae7b29771af2919c71a61bc9d1a4a67ce4d295649ee9376e825ea1a864487b6

Height

#2,094,789

Difficulty

10.871992

Transactions

2

Size

1.68 KB

Version

2

Bits

0adf3ad8

Nonce

804,783,937

Timestamp

4/30/2017, 8:39:27 PM

Confirmations

4,747,540

Merkle Root

f9841b7c27299ad07e9a7fcaa855902ae7737c700ccd3589c50cce583cc11291
Transactions (2)
1 in → 1 out8.4800 XPM110 B
10 in → 1 out8408.4569 XPM1.49 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.

6.168 × 10⁹⁴(95-digit number)
61686275828089242109…44009572927488924159
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
6.168 × 10⁹⁴(95-digit number)
61686275828089242109…44009572927488924159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.233 × 10⁹⁵(96-digit number)
12337255165617848421…88019145854977848319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.467 × 10⁹⁵(96-digit number)
24674510331235696843…76038291709955696639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.934 × 10⁹⁵(96-digit number)
49349020662471393687…52076583419911393279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.869 × 10⁹⁵(96-digit number)
98698041324942787375…04153166839822786559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.973 × 10⁹⁶(97-digit number)
19739608264988557475…08306333679645573119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.947 × 10⁹⁶(97-digit number)
39479216529977114950…16612667359291146239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.895 × 10⁹⁶(97-digit number)
78958433059954229900…33225334718582292479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.579 × 10⁹⁷(98-digit number)
15791686611990845980…66450669437164584959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.158 × 10⁹⁷(98-digit number)
31583373223981691960…32901338874329169919
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,983,040 XPM·at block #6,842,328 · 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