Block #732,274

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/20/2014, 10:07:41 PM · Difficulty 10.9714 · 6,077,945 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
defec6c5dbc2de6c000ed9c284ace943060e429ebe7d007788ca9f9454fb2ed0

Height

#732,274

Difficulty

10.971360

Transactions

4

Size

1.11 KB

Version

2

Bits

0af8ab05

Nonce

76,339,711

Timestamp

9/20/2014, 10:07:41 PM

Confirmations

6,077,945

Merkle Root

f2eef1b72ea9b259ea1c5bb2c8357bfa0e3a6a99ddfe1a676f5301c73917e53e
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.336 × 10⁹⁵(96-digit number)
13360656781623770173…41442125429120712601
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.336 × 10⁹⁵(96-digit number)
13360656781623770173…41442125429120712601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.672 × 10⁹⁵(96-digit number)
26721313563247540347…82884250858241425201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.344 × 10⁹⁵(96-digit number)
53442627126495080694…65768501716482850401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.068 × 10⁹⁶(97-digit number)
10688525425299016138…31537003432965700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.137 × 10⁹⁶(97-digit number)
21377050850598032277…63074006865931401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.275 × 10⁹⁶(97-digit number)
42754101701196064555…26148013731862803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.550 × 10⁹⁶(97-digit number)
85508203402392129110…52296027463725606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.710 × 10⁹⁷(98-digit number)
17101640680478425822…04592054927451212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.420 × 10⁹⁷(98-digit number)
34203281360956851644…09184109854902425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.840 × 10⁹⁷(98-digit number)
68406562721913703288…18368219709804851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.368 × 10⁹⁸(99-digit number)
13681312544382740657…36736439419609702401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,725,827 XPM·at block #6,810,218 · 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