Block #2,268,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/26/2017, 4:09:41 AM · Difficulty 10.9523 · 4,562,589 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cce936de53d8933d4f096d05c7b041af74bb55258fbb808a19954b46cbed406c

Height

#2,268,299

Difficulty

10.952281

Transactions

2

Size

425 B

Version

2

Bits

0af3c8af

Nonce

1,834,610,775

Timestamp

8/26/2017, 4:09:41 AM

Confirmations

4,562,589

Merkle Root

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

1.047 × 10⁹⁴(95-digit number)
10475573986340278959…00682326657547050669
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.047 × 10⁹⁴(95-digit number)
10475573986340278959…00682326657547050669
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.095 × 10⁹⁴(95-digit number)
20951147972680557918…01364653315094101339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.190 × 10⁹⁴(95-digit number)
41902295945361115836…02729306630188202679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.380 × 10⁹⁴(95-digit number)
83804591890722231673…05458613260376405359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.676 × 10⁹⁵(96-digit number)
16760918378144446334…10917226520752810719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.352 × 10⁹⁵(96-digit number)
33521836756288892669…21834453041505621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.704 × 10⁹⁵(96-digit number)
67043673512577785339…43668906083011242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.340 × 10⁹⁶(97-digit number)
13408734702515557067…87337812166022485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.681 × 10⁹⁶(97-digit number)
26817469405031114135…74675624332044971519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.363 × 10⁹⁶(97-digit number)
53634938810062228271…49351248664089943039
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,891,241 XPM·at block #6,830,887 · 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