Block #676,907

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/14/2014, 1:16:50 AM · Difficulty 10.9647 · 6,139,769 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8e4b198e790d8372e9b7c40abbc4c925ee3d1ce56045bb0b2e2f1e5084f07342

Height

#676,907

Difficulty

10.964708

Transactions

1

Size

243 B

Version

2

Bits

0af6f71b

Nonce

937,454,177

Timestamp

8/14/2014, 1:16:50 AM

Confirmations

6,139,769

Merkle Root

d8bc6e8702434d52ec4b67cd3b0fce5b8fe986c33f1423684d1e9bbb505c55aa
Transactions (1)
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.

4.549 × 10⁹⁷(98-digit number)
45493820947737521991…36105842443661803519
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
4.549 × 10⁹⁷(98-digit number)
45493820947737521991…36105842443661803519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.098 × 10⁹⁷(98-digit number)
90987641895475043983…72211684887323607039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.819 × 10⁹⁸(99-digit number)
18197528379095008796…44423369774647214079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.639 × 10⁹⁸(99-digit number)
36395056758190017593…88846739549294428159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.279 × 10⁹⁸(99-digit number)
72790113516380035186…77693479098588856319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.455 × 10⁹⁹(100-digit number)
14558022703276007037…55386958197177712639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.911 × 10⁹⁹(100-digit number)
29116045406552014074…10773916394355425279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.823 × 10⁹⁹(100-digit number)
58232090813104028149…21547832788710850559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.164 × 10¹⁰⁰(101-digit number)
11646418162620805629…43095665577421701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.329 × 10¹⁰⁰(101-digit number)
23292836325241611259…86191331154843402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.658 × 10¹⁰⁰(101-digit number)
46585672650483222519…72382662309686804479
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,777,527 XPM·at block #6,816,675 · 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