Block #773,223

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/17/2014, 9:16:15 PM · Difficulty 10.9822 · 6,035,848 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a55145fba526df905a7aada1ef0282eb7667287cfccacd12a7c1d43dfd058936

Height

#773,223

Difficulty

10.982155

Transactions

6

Size

1.31 KB

Version

2

Bits

0afb6e84

Nonce

705,107,306

Timestamp

10/17/2014, 9:16:15 PM

Confirmations

6,035,848

Merkle Root

297ce5805b136d965ef97d38ab7615b1a3f65db8eafedee82f4972bbd3e62814
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.

2.647 × 10⁹⁷(98-digit number)
26476701342563366137…17561879897883709439
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
2.647 × 10⁹⁷(98-digit number)
26476701342563366137…17561879897883709439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.295 × 10⁹⁷(98-digit number)
52953402685126732275…35123759795767418879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.059 × 10⁹⁸(99-digit number)
10590680537025346455…70247519591534837759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.118 × 10⁹⁸(99-digit number)
21181361074050692910…40495039183069675519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.236 × 10⁹⁸(99-digit number)
42362722148101385820…80990078366139351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.472 × 10⁹⁸(99-digit number)
84725444296202771640…61980156732278702079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.694 × 10⁹⁹(100-digit number)
16945088859240554328…23960313464557404159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.389 × 10⁹⁹(100-digit number)
33890177718481108656…47920626929114808319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.778 × 10⁹⁹(100-digit number)
67780355436962217312…95841253858229616639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.355 × 10¹⁰⁰(101-digit number)
13556071087392443462…91682507716459233279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.711 × 10¹⁰⁰(101-digit number)
27112142174784886925…83365015432918466559
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,716,628 XPM·at block #6,809,070 · 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