Block #2,456,853

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2018, 6:40:35 AM · Difficulty 10.9537 · 4,388,105 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a9358cc67bdfa948a576a4be0c2f1f45563b52f268f891ba4f128e97669ba8e5

Height

#2,456,853

Difficulty

10.953675

Transactions

2

Size

1.72 KB

Version

2

Bits

0af4240f

Nonce

254,611,521

Timestamp

1/4/2018, 6:40:35 AM

Confirmations

4,388,105

Merkle Root

6a7d6d7fc7943fc3eafd7a6c4e2860a9582369c1004ad8ebdfc3e3bc823acc6e
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.545 × 10⁹⁶(97-digit number)
45454331557595456820…19196576474901176319
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.545 × 10⁹⁶(97-digit number)
45454331557595456820…19196576474901176319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.090 × 10⁹⁶(97-digit number)
90908663115190913640…38393152949802352639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.818 × 10⁹⁷(98-digit number)
18181732623038182728…76786305899604705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.636 × 10⁹⁷(98-digit number)
36363465246076365456…53572611799209410559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.272 × 10⁹⁷(98-digit number)
72726930492152730912…07145223598418821119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.454 × 10⁹⁸(99-digit number)
14545386098430546182…14290447196837642239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.909 × 10⁹⁸(99-digit number)
29090772196861092364…28580894393675284479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.818 × 10⁹⁸(99-digit number)
58181544393722184729…57161788787350568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.163 × 10⁹⁹(100-digit number)
11636308878744436945…14323577574701137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.327 × 10⁹⁹(100-digit number)
23272617757488873891…28647155149402275839
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,004,082 XPM·at block #6,844,957 · 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