Block #2,263,393

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/22/2017, 6:58:03 PM · Difficulty 10.9518 · 4,569,482 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
701f731362f2e891c378b9aae3ea2d438b49282e3879d1ca2e17c98a5a76e49d

Height

#2,263,393

Difficulty

10.951820

Transactions

4

Size

992 B

Version

2

Bits

0af3aa77

Nonce

1,180,502,048

Timestamp

8/22/2017, 6:58:03 PM

Confirmations

4,569,482

Merkle Root

33bd581b1774e25925cb6ede57e78df69329e3529cdd76975d3b652823afbd71
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.

2.574 × 10⁹²(93-digit number)
25744497532440212937…67766009973776326159
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
2.574 × 10⁹²(93-digit number)
25744497532440212937…67766009973776326159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.148 × 10⁹²(93-digit number)
51488995064880425874…35532019947552652319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.029 × 10⁹³(94-digit number)
10297799012976085174…71064039895105304639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.059 × 10⁹³(94-digit number)
20595598025952170349…42128079790210609279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.119 × 10⁹³(94-digit number)
41191196051904340699…84256159580421218559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.238 × 10⁹³(94-digit number)
82382392103808681399…68512319160842437119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.647 × 10⁹⁴(95-digit number)
16476478420761736279…37024638321684874239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.295 × 10⁹⁴(95-digit number)
32952956841523472559…74049276643369748479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.590 × 10⁹⁴(95-digit number)
65905913683046945119…48098553286739496959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.318 × 10⁹⁵(96-digit number)
13181182736609389023…96197106573478993919
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,907,169 XPM·at block #6,832,874 · 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