Block #721,165

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/14/2014, 9:12:31 PM · Difficulty 10.9533 · 6,095,615 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9bbe38e5402142ad077f95cb7129a849070569e5283ca2f2d3ffca7448c80f2b

Height

#721,165

Difficulty

10.953320

Transactions

4

Size

884 B

Version

2

Bits

0af40cc4

Nonce

1,216,589,337

Timestamp

9/14/2014, 9:12:31 PM

Confirmations

6,095,615

Merkle Root

d5b31afa7fb5bdf76367df70850f1fe562af664aee270aa4a6b80f5eace2fc12
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.

7.336 × 10⁹⁴(95-digit number)
73363674684361974609…82590189483741270599
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
7.336 × 10⁹⁴(95-digit number)
73363674684361974609…82590189483741270599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.467 × 10⁹⁵(96-digit number)
14672734936872394921…65180378967482541199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.934 × 10⁹⁵(96-digit number)
29345469873744789843…30360757934965082399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.869 × 10⁹⁵(96-digit number)
58690939747489579687…60721515869930164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.173 × 10⁹⁶(97-digit number)
11738187949497915937…21443031739860329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.347 × 10⁹⁶(97-digit number)
23476375898995831874…42886063479720659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.695 × 10⁹⁶(97-digit number)
46952751797991663749…85772126959441318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.390 × 10⁹⁶(97-digit number)
93905503595983327499…71544253918882636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.878 × 10⁹⁷(98-digit number)
18781100719196665499…43088507837765273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.756 × 10⁹⁷(98-digit number)
37562201438393330999…86177015675530547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.512 × 10⁹⁷(98-digit number)
75124402876786661999…72354031351061094399
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,778,275 XPM·at block #6,816,779 · 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