Block #672,069

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2014, 4:54:58 PM · Difficulty 10.9645 · 6,159,439 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
33a2600bf3022f554dab1eef1a6292a58b52253555942327f575a4002f6d7e37

Height

#672,069

Difficulty

10.964461

Transactions

3

Size

920 B

Version

2

Bits

0af6e6ec

Nonce

219,301,833

Timestamp

8/10/2014, 4:54:58 PM

Confirmations

6,159,439

Merkle Root

8e84dbfa4db4acadbb1371d69b46317d62c644dc6519804bcb2d0cca5c3167f1
Transactions (3)
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.138 × 10⁹⁵(96-digit number)
11386628459174520056…17338920894508302959
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.138 × 10⁹⁵(96-digit number)
11386628459174520056…17338920894508302959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.277 × 10⁹⁵(96-digit number)
22773256918349040113…34677841789016605919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.554 × 10⁹⁵(96-digit number)
45546513836698080227…69355683578033211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.109 × 10⁹⁵(96-digit number)
91093027673396160455…38711367156066423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.821 × 10⁹⁶(97-digit number)
18218605534679232091…77422734312132847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.643 × 10⁹⁶(97-digit number)
36437211069358464182…54845468624265694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.287 × 10⁹⁶(97-digit number)
72874422138716928364…09690937248531389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.457 × 10⁹⁷(98-digit number)
14574884427743385672…19381874497062778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.914 × 10⁹⁷(98-digit number)
29149768855486771345…38763748994125557759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.829 × 10⁹⁷(98-digit number)
58299537710973542691…77527497988251115519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.165 × 10⁹⁸(99-digit number)
11659907542194708538…55054995976502231039
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,896,153 XPM·at block #6,831,507 · 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