Chuk Yuen South (constituency)

Chuk Yuen South is one of the 25 constituencies in the Wong Tai Sin District in Hong Kong. The constituency returns one district councillor to the Wong Tai Sin District Council, with an election every four years.

Chuk Yuen South
Elected Constituency
for the Wong Tai Sin District Council
Boundary of Chuk Yuen South in Wong Tai Sin District
DistrictWong Tai Sin
Legislative Council constituencyKowloon East
Population15,466 (2019)[1]
Electorate9,300 (2019)[2]
Current constituency
Created1991
Number of membersOne
Member(s)Hui Kam-shing (ADPL)
Chuk Yuen South
Traditional Chinese竹園南

The constituency has an estimated population of 15,103.[3]

Councillors represented

ElectionMemberParty
1991 Ng Ngok-shing Independent
1994 Hui Kam-shing ADPL

Election results

2010s

Wong Tai Sin District Council Election, 2019: Chuk Yuen South
Party Candidate Votes % ±
ADPL Hui Kam-shing 3,838 59.84
FTU Lee Kin-chung 2,576 40.16
Majority 1,262 19.68
Turnout 6,442 69.33
ADPL hold Swing
gollark: Specifically, 22 bytes for the private key and 21 for the public key on ccecc.py and 25 and 32 on the actual ingame one.
gollark: <@!206233133228490752> Sorry to bother you, but keypairs generated by `ccecc.py` and the ECC library in use in potatOS appear to have different-length private and public keys, which is a problem.EDIT: okay, apparently it's because I've been accidentally using a *different* ECC thing from SMT or something, and it has these parameters instead:```---- Elliptic Curve Arithmetic---- About the Curve Itself-- Field Size: 192 bits-- Field Modulus (p): 65533 * 2^176 + 3-- Equation: x^2 + y^2 = 1 + 108 * x^2 * y^2-- Parameters: Edwards Curve with c = 1, and d = 108-- Curve Order (n): 4 * 1569203598118192102418711808268118358122924911136798015831-- Cofactor (h): 4-- Generator Order (q): 1569203598118192102418711808268118358122924911136798015831---- About the Curve's Security-- Current best attack security: 94.822 bits (Pollard's Rho)-- Rho Security: log2(0.884 * sqrt(q)) = 94.822-- Transfer Security? Yes: p ~= q; k > 20-- Field Discriminant Security? Yes: t = 67602300638727286331433024168; s = 2^2; |D| = 5134296629560551493299993292204775496868940529592107064435 > 2^100-- Rigidity? A little, the parameters are somewhat small.-- XZ/YZ Ladder Security? No: Single coordinate ladders are insecure, so they can't be used.-- Small Subgroup Security? Yes: Secret keys are calculated modulo 4q.-- Invalid Curve Security? Yes: Any point to be multiplied is checked beforehand.-- Invalid Curve Twist Security? No: The curve is not protected against single coordinate ladder attacks, so don't use them.-- Completeness? Yes: The curve is an Edwards Curve with non-square d and square a, so the curve is complete.-- Indistinguishability? No: The curve does not support indistinguishability maps.```so I might just have to ship *two* versions to keep compatibility with old signatures.
gollark: > 2. precompilation to lua bytecode and compressionThis was considered, but the furthest I went was having some programs compressed on disk.
gollark: > 1. multiple layers of sandboxing (a "system" layer that implements a few things, a "features" layer that implements most of potatOS's inter-sandboxing API and some features, a "process manager" layer which has inter-process separation and ways for processes to communicate, and a "BIOS" layer that implements features like PotatoBIOS)Seems impractical, although it probably *could* fix a lot of problems
gollark: There's a list.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.