Block #277,073

1CCLength 10ā˜…ā˜…ā˜†ā˜†ā˜†

Cunningham Chain of the First Kind Ā· Discovered 11/27/2013, 10:45:59 AM Ā· Difficulty 9.9651 Ā· 6,549,890 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
902fe5a13b1d098f335debc669628c9e9561688f8ea1734e29bfd6096d4014ec

Height

#277,073

Difficulty

9.965068

Transactions

1

Size

1.11 KB

Version

2

Bits

09f70eb2

Nonce

23,982

Timestamp

11/27/2013, 10:45:59 AM

Confirmations

6,549,890

Mined by

Merkle Root

857b5337d50ffa03537e8e12fd3f38431667b3b1b498726a3a0235054ad94888
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.

5.879 Ɨ 10⁹⁓(95-digit number)
58794376846139243874…82515449954390602779
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
5.879 Ɨ 10⁹⁓(95-digit number)
58794376846139243874…82515449954390602779
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
2
2^1 Ɨ origin āˆ’ 1
1.175 Ɨ 10⁹⁵(96-digit number)
11758875369227848774…65030899908781205559
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
3
2^2 Ɨ origin āˆ’ 1
2.351 Ɨ 10⁹⁵(96-digit number)
23517750738455697549…30061799817562411119
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
4
2^3 Ɨ origin āˆ’ 1
4.703 Ɨ 10⁹⁵(96-digit number)
47035501476911395099…60123599635124822239
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
5
2^4 Ɨ origin āˆ’ 1
9.407 Ɨ 10⁹⁵(96-digit number)
94071002953822790199…20247199270249644479
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
6
2^5 Ɨ origin āˆ’ 1
1.881 Ɨ 10⁹⁶(97-digit number)
18814200590764558039…40494398540499288959
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
7
2^6 Ɨ origin āˆ’ 1
3.762 Ɨ 10⁹⁶(97-digit number)
37628401181529116079…80988797080998577919
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
8
2^7 Ɨ origin āˆ’ 1
7.525 Ɨ 10⁹⁶(97-digit number)
75256802363058232159…61977594161997155839
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
9
2^8 Ɨ origin āˆ’ 1
1.505 Ɨ 10⁹⁷(98-digit number)
15051360472611646431…23955188323994311679
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
10
2^9 Ɨ origin āˆ’ 1
3.010 Ɨ 10⁹⁷(98-digit number)
30102720945223292863…47910376647988623359
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,859,881 XPMĀ·at block #6,826,962 Ā· 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