Block #2,281,826

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2017, 8:30:16 AM · Difficulty 10.9555 · 4,557,907 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e19ec45013d2b81392530f80ee2afde0ece3092b386077deb324936e5b9d946d

Height

#2,281,826

Difficulty

10.955500

Transactions

6

Size

1.64 KB

Version

2

Bits

0af49b9e

Nonce

538,885,409

Timestamp

9/4/2017, 8:30:16 AM

Confirmations

4,557,907

Merkle Root

5cc5fab234ededb8a805252a3cf4d9c7a0a96a0b78f5cb1774d206b4b89c0d45
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.

3.357 × 10⁹⁵(96-digit number)
33579287098488054662…88728072891169775999
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
3.357 × 10⁹⁵(96-digit number)
33579287098488054662…88728072891169775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.715 × 10⁹⁵(96-digit number)
67158574196976109324…77456145782339551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.343 × 10⁹⁶(97-digit number)
13431714839395221864…54912291564679103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.686 × 10⁹⁶(97-digit number)
26863429678790443729…09824583129358207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.372 × 10⁹⁶(97-digit number)
53726859357580887459…19649166258716415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.074 × 10⁹⁷(98-digit number)
10745371871516177491…39298332517432831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.149 × 10⁹⁷(98-digit number)
21490743743032354983…78596665034865663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.298 × 10⁹⁷(98-digit number)
42981487486064709967…57193330069731327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.596 × 10⁹⁷(98-digit number)
85962974972129419935…14386660139462655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.719 × 10⁹⁸(99-digit number)
17192594994425883987…28773320278925311999
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,962,150 XPM·at block #6,839,732 · 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