Block #954,763

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/27/2015, 8:30:53 PM · Difficulty 10.8917 · 5,861,506 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
90bc28efc45bf6d898fe4014f8465373e6ed08ea0c23eee9be1271997ac22f3f

Height

#954,763

Difficulty

10.891664

Transactions

7

Size

3.19 KB

Version

2

Bits

0ae44411

Nonce

741,030,666

Timestamp

2/27/2015, 8:30:53 PM

Confirmations

5,861,506

Merkle Root

2ac19f298298c66804badfe0e10b7158affba2cf1a296e7f6c5a2741914579d0
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.134 × 10⁹⁵(96-digit number)
21340429831366975385…06027922227294863219
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.134 × 10⁹⁵(96-digit number)
21340429831366975385…06027922227294863219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.268 × 10⁹⁵(96-digit number)
42680859662733950770…12055844454589726439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.536 × 10⁹⁵(96-digit number)
85361719325467901540…24111688909179452879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.707 × 10⁹⁶(97-digit number)
17072343865093580308…48223377818358905759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.414 × 10⁹⁶(97-digit number)
34144687730187160616…96446755636717811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.828 × 10⁹⁶(97-digit number)
68289375460374321232…92893511273435623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.365 × 10⁹⁷(98-digit number)
13657875092074864246…85787022546871246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.731 × 10⁹⁷(98-digit number)
27315750184149728492…71574045093742492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.463 × 10⁹⁷(98-digit number)
54631500368299456985…43148090187484984319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.092 × 10⁹⁸(99-digit number)
10926300073659891397…86296180374969968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.185 × 10⁹⁸(99-digit number)
21852600147319782794…72592360749939937279
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,774,266 XPM·at block #6,816,268 · 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