Block #665,793

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/6/2014, 5:06:22 PM · Difficulty 10.9603 · 6,160,641 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
77a5f4c7d8b056d8de7f5abbd7f8fdd01609b0a0651e9371bb090ad988414b52

Height

#665,793

Difficulty

10.960314

Transactions

3

Size

912 B

Version

2

Bits

0af5d727

Nonce

152,409,858

Timestamp

8/6/2014, 5:06:22 PM

Confirmations

6,160,641

Merkle Root

fd18b6dd25b8c1ce990e1593602c17074214b63866604aa7ede6555fdbb12026
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.240 × 10⁹⁴(95-digit number)
12407540578695169890…99300913199782066559
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.240 × 10⁹⁴(95-digit number)
12407540578695169890…99300913199782066559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.481 × 10⁹⁴(95-digit number)
24815081157390339780…98601826399564133119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.963 × 10⁹⁴(95-digit number)
49630162314780679560…97203652799128266239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.926 × 10⁹⁴(95-digit number)
99260324629561359120…94407305598256532479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.985 × 10⁹⁵(96-digit number)
19852064925912271824…88814611196513064959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.970 × 10⁹⁵(96-digit number)
39704129851824543648…77629222393026129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.940 × 10⁹⁵(96-digit number)
79408259703649087296…55258444786052259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.588 × 10⁹⁶(97-digit number)
15881651940729817459…10516889572104519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.176 × 10⁹⁶(97-digit number)
31763303881459634918…21033779144209039359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.352 × 10⁹⁶(97-digit number)
63526607762919269837…42067558288418078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.270 × 10⁹⁷(98-digit number)
12705321552583853967…84135116576836157439
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,855,608 XPM·at block #6,826,433 · 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