Block #681,569

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/17/2014, 2:53:35 PM · Difficulty 10.9614 · 6,129,506 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cdeffcb8a61028c9bc07308790e7cd824201adcd2668977995f5334115fc7037

Height

#681,569

Difficulty

10.961394

Transactions

2

Size

433 B

Version

2

Bits

0af61de3

Nonce

844,558,316

Timestamp

8/17/2014, 2:53:35 PM

Confirmations

6,129,506

Merkle Root

c74f33f61b6420d75e80680a8d41d5e758c4abbecae2ffbd54ed51db39c24527
Transactions (2)
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.

9.317 × 10⁹⁶(97-digit number)
93178267463549410351…42979383442705853439
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
9.317 × 10⁹⁶(97-digit number)
93178267463549410351…42979383442705853439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.863 × 10⁹⁷(98-digit number)
18635653492709882070…85958766885411706879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.727 × 10⁹⁷(98-digit number)
37271306985419764140…71917533770823413759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.454 × 10⁹⁷(98-digit number)
74542613970839528280…43835067541646827519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.490 × 10⁹⁸(99-digit number)
14908522794167905656…87670135083293655039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.981 × 10⁹⁸(99-digit number)
29817045588335811312…75340270166587310079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.963 × 10⁹⁸(99-digit number)
59634091176671622624…50680540333174620159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.192 × 10⁹⁹(100-digit number)
11926818235334324524…01361080666349240319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.385 × 10⁹⁹(100-digit number)
23853636470668649049…02722161332698480639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.770 × 10⁹⁹(100-digit number)
47707272941337298099…05444322665396961279
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,732,705 XPM·at block #6,811,074 · 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