Block #593,485

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/18/2014, 6:02:53 PM · Difficulty 10.9405 · 6,214,622 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9b263ee21829210b23c58291f6a6d8d84bd02660ecf00dde841bbdc72a0bc7f2

Height

#593,485

Difficulty

10.940482

Transactions

6

Size

1.89 KB

Version

2

Bits

0af0c374

Nonce

806,277,235

Timestamp

6/18/2014, 6:02:53 PM

Confirmations

6,214,622

Merkle Root

46ddfb7a262b81aed8bb88e0ff4905c7ad7bd8c01b9c788fb2207739b01fed17
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.768 × 10⁹⁹(100-digit number)
17680600572549961478…85972273482996889599
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.768 × 10⁹⁹(100-digit number)
17680600572549961478…85972273482996889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.536 × 10⁹⁹(100-digit number)
35361201145099922957…71944546965993779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.072 × 10⁹⁹(100-digit number)
70722402290199845915…43889093931987558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.414 × 10¹⁰⁰(101-digit number)
14144480458039969183…87778187863975116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.828 × 10¹⁰⁰(101-digit number)
28288960916079938366…75556375727950233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.657 × 10¹⁰⁰(101-digit number)
56577921832159876732…51112751455900467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.131 × 10¹⁰¹(102-digit number)
11315584366431975346…02225502911800934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.263 × 10¹⁰¹(102-digit number)
22631168732863950692…04451005823601868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.526 × 10¹⁰¹(102-digit number)
45262337465727901385…08902011647203737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.052 × 10¹⁰¹(102-digit number)
90524674931455802771…17804023294407475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.810 × 10¹⁰²(103-digit number)
18104934986291160554…35608046588814950399
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,708,903 XPM·at block #6,808,106 · 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.

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