Block #277,032

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 10:24:41 AM · Difficulty 9.9649 · 6,532,511 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76f621b7334349f2d9d31ef197912561ead3fd54357ef9d0dc4088f4c0cf9247

Height

#277,032

Difficulty

9.964930

Transactions

1

Size

1.11 KB

Version

2

Bits

09f705a3

Nonce

7,427

Timestamp

11/27/2013, 10:24:41 AM

Confirmations

6,532,511

Merkle Root

7155c2a754686d6d4eac34a05fea61983b7d0f9052aa9e22a447cef8e58ca960
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.121 × 10⁹⁶(97-digit number)
11210781732206454765…36487731127358571521
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.121 × 10⁹⁶(97-digit number)
11210781732206454765…36487731127358571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.242 × 10⁹⁶(97-digit number)
22421563464412909531…72975462254717143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.484 × 10⁹⁶(97-digit number)
44843126928825819062…45950924509434286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.968 × 10⁹⁶(97-digit number)
89686253857651638124…91901849018868572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.793 × 10⁹⁷(98-digit number)
17937250771530327624…83803698037737144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.587 × 10⁹⁷(98-digit number)
35874501543060655249…67607396075474288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.174 × 10⁹⁷(98-digit number)
71749003086121310499…35214792150948577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.434 × 10⁹⁸(99-digit number)
14349800617224262099…70429584301897154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.869 × 10⁹⁸(99-digit number)
28699601234448524199…40859168603794309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.739 × 10⁹⁸(99-digit number)
57399202468897048399…81718337207588618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.147 × 10⁹⁹(100-digit number)
11479840493779409679…63436674415177236481
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,720,416 XPM·at block #6,809,542 · 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