Block #278,889

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 3:56:46 AM · Difficulty 9.9702 · 6,534,943 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
abf11fe52a0a0513c375c3534db3f45588817e7f1c1afef842cde0f7eff607c7

Height

#278,889

Difficulty

9.970174

Transactions

5

Size

1.51 KB

Version

2

Bits

09f85d51

Nonce

44,737

Timestamp

11/28/2013, 3:56:46 AM

Confirmations

6,534,943

Merkle Root

c432d8163c63c7fb1611afb1a3383205f00b35e9cd2e5a66e33112b7b18f1f8a
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.441 × 10⁹⁶(97-digit number)
14414408907850079936…91246496741739060159
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.441 × 10⁹⁶(97-digit number)
14414408907850079936…91246496741739060159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.882 × 10⁹⁶(97-digit number)
28828817815700159873…82492993483478120319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.765 × 10⁹⁶(97-digit number)
57657635631400319747…64985986966956240639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.153 × 10⁹⁷(98-digit number)
11531527126280063949…29971973933912481279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.306 × 10⁹⁷(98-digit number)
23063054252560127899…59943947867824962559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.612 × 10⁹⁷(98-digit number)
46126108505120255798…19887895735649925119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.225 × 10⁹⁷(98-digit number)
92252217010240511596…39775791471299850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.845 × 10⁹⁸(99-digit number)
18450443402048102319…79551582942599700479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.690 × 10⁹⁸(99-digit number)
36900886804096204638…59103165885199400959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.380 × 10⁹⁸(99-digit number)
73801773608192409277…18206331770398801919
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,754,725 XPM·at block #6,813,831 · 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