Block #2,283,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2017, 11:00:07 AM · Difficulty 10.9556 · 4,547,629 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
11c398f54a814cb3044274e78580c43f6b0028f4e89a33aee9f4ab58cbd2cd9d

Height

#2,283,419

Difficulty

10.955578

Transactions

23

Size

11.33 KB

Version

2

Bits

0af4a0ca

Nonce

1,436,989,754

Timestamp

9/5/2017, 11:00:07 AM

Confirmations

4,547,629

Merkle Root

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

1.808 × 10⁹⁵(96-digit number)
18083531433985470215…22631006367417580799
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
1.808 × 10⁹⁵(96-digit number)
18083531433985470215…22631006367417580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.616 × 10⁹⁵(96-digit number)
36167062867970940431…45262012734835161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.233 × 10⁹⁵(96-digit number)
72334125735941880862…90524025469670323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.446 × 10⁹⁶(97-digit number)
14466825147188376172…81048050939340646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.893 × 10⁹⁶(97-digit number)
28933650294376752345…62096101878681292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.786 × 10⁹⁶(97-digit number)
57867300588753504690…24192203757362585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.157 × 10⁹⁷(98-digit number)
11573460117750700938…48384407514725171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.314 × 10⁹⁷(98-digit number)
23146920235501401876…96768815029450342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.629 × 10⁹⁷(98-digit number)
46293840471002803752…93537630058900684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.258 × 10⁹⁷(98-digit number)
92587680942005607504…87075260117801369599
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,892,520 XPM·at block #6,831,047 · 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