Block #1,145,735

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/9/2015, 12:10:37 AM · Difficulty 10.9316 · 5,680,986 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f66764d31d20ebe00465047a79ff38243ebb3ebe84c08e83b1ef4035a9b63ac0

Height

#1,145,735

Difficulty

10.931570

Transactions

2

Size

1.43 KB

Version

2

Bits

0aee7b5a

Nonce

357,899,527

Timestamp

7/9/2015, 12:10:37 AM

Confirmations

5,680,986

Merkle Root

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

7.631 × 10⁹³(94-digit number)
76314759981796441565…96291510501593000879
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
7.631 × 10⁹³(94-digit number)
76314759981796441565…96291510501593000879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.526 × 10⁹⁴(95-digit number)
15262951996359288313…92583021003186001759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.052 × 10⁹⁴(95-digit number)
30525903992718576626…85166042006372003519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.105 × 10⁹⁴(95-digit number)
61051807985437153252…70332084012744007039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.221 × 10⁹⁵(96-digit number)
12210361597087430650…40664168025488014079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.442 × 10⁹⁵(96-digit number)
24420723194174861300…81328336050976028159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.884 × 10⁹⁵(96-digit number)
48841446388349722601…62656672101952056319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.768 × 10⁹⁵(96-digit number)
97682892776699445203…25313344203904112639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.953 × 10⁹⁶(97-digit number)
19536578555339889040…50626688407808225279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.907 × 10⁹⁶(97-digit number)
39073157110679778081…01253376815616450559
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,857,922 XPM·at block #6,826,720 · 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