Block #2,267,451

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/25/2017, 2:57:14 PM · Difficulty 10.9517 · 4,577,164 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
be032ff094418b0147bebcdedb95eaa7118f1d306121989cde87ca8178dccf4f

Height

#2,267,451

Difficulty

10.951731

Transactions

2

Size

722 B

Version

2

Bits

0af3a4a0

Nonce

1,658,114,669

Timestamp

8/25/2017, 2:57:14 PM

Confirmations

4,577,164

Merkle Root

3f52a004b01f87b2d53b13b1d2f2615c73a03f7bf29090c4141fec971ec7989d
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.

6.373 × 10⁹³(94-digit number)
63734447456729571584…31941188680815259899
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.373 × 10⁹³(94-digit number)
63734447456729571584…31941188680815259899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.274 × 10⁹⁴(95-digit number)
12746889491345914316…63882377361630519799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.549 × 10⁹⁴(95-digit number)
25493778982691828633…27764754723261039599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.098 × 10⁹⁴(95-digit number)
50987557965383657267…55529509446522079199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.019 × 10⁹⁵(96-digit number)
10197511593076731453…11059018893044158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.039 × 10⁹⁵(96-digit number)
20395023186153462906…22118037786088316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.079 × 10⁹⁵(96-digit number)
40790046372306925813…44236075572176633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.158 × 10⁹⁵(96-digit number)
81580092744613851627…88472151144353267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.631 × 10⁹⁶(97-digit number)
16316018548922770325…76944302288706534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.263 × 10⁹⁶(97-digit number)
32632037097845540651…53888604577413068799
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:58,001,324 XPM·at block #6,844,614 · 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